Database Systems (TODS)


Search Issue
enter search term and/or author name


ACM Transactions on Database Systems (TODS), Volume 8 Issue 4, Dec. 1983

Multiversion concurrency control—theory and algorithms
Philip A. Bernstein, Nathan Goodman
Pages: 465-483
DOI: 10.1145/319996.319998
Concurrency control is the activity of synchronizing operations issued by concurrently executing programs on a shared database. The goal is to produce an execution that has the same effect as a serial (noninterleaved) one. In a multiversion...

Multilevel atomicity—a new correctness criterion for database concurrency control
Nancy A. Lynch
Pages: 484-502
DOI: 10.1145/319996.319999
Multilevel atomicity, a new correctness criteria for database concurrency control, is defined. It weakens the usual notion of serializability by permitting controlled interleaving among transactions. It appears to be especially...

Shadowed management of free disk pages with a linked list
Matthew S. Hecht, John D. Gabbe
Pages: 503-514
DOI: 10.1145/319996.320002
We describe and prove correct a programming technique using a linked list of pages for managing the free disk pages of a file system where shadowing is the recovery technique. Our technique requires a window of only two pages of main memory for...

EAS-E: an integrated approach to application development
A. Malhotra, H. M. Markowitz, D. P. Pazel
Pages: 515-542
DOI: 10.1145/319996.320003
EAS-E (pronounced EASY) is an experimental programming language integrated with a database management system now running on VM/370 at the IBM Thomas J. Watson Research Center. The EAS-E programming language is built around the...

On the complexity of designing optimal partial-match retrieval systems
Shlomo Moran
Pages: 543-551
DOI: 10.1145/319996.320004
We consider the problem of designing an information retrieval system on which partial match queries have to be answered. Each record in the system consists of a list of attributes, and a partial match query specifies the values...

Partial-match retrieval using hashing and descriptors
K. Ramamohanarao, James A. Thom, John W. Lloyd
Pages: 552-576
DOI: 10.1145/319996.320006
This paper studies a partial-match retrieval scheme based on hash functions and descriptors. The emphasis is placed on showing how the use of a descriptor file can improve the performance of the scheme. Records in the file are given addresses...

Correctness of query execution strategies in distributed databases
S. Ceri, G. Pelagatti
Pages: 577-607
DOI: 10.1145/319996.320009
A major requirement of a Distributed DataBase Management System (DDBMS) is to enable users to write queries as though the database were not distributed (distribution transparency). The DDBMS transforms the user's queries into execution...

A foundation of CODD's relational maybe-operations
Joachim Biskup
Pages: 608-636
DOI: 10.1145/319996.320014
Database relations which possibly contain maybe-tuples and null values of type “value at present unknown” are studied. Maybe-tuples and null values are formally interpreted by our notion of representation, which uses...

On Kent's “Consequences of assuming a universal relation” (Technical correspondance)
Jeffrey D. Ullman
Pages: 637-643
DOI: 10.1145/319996.320017

The universal relation revisited (technical correspondence)
William Kent
Pages: 644-648
DOI: 10.1145/319996.320019