ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 6 Issue 4, Dec. 1981

Consequences of assuming a universal relation
W. Kent
Pages: 539-556
DOI: 10.1145/319628.319630
Although central to the current direction of dependency theory, the assumption of a universal relation is incompatible with some aspects of relational database theory and practice. Furthermore, the universal relation is itself ill defined in...

Update semantics of relational views
F. Bancilhon, N. Spyratos
Pages: 557-575
DOI: 10.1145/319628.319634
A database view is a portion of the data structured in a way suitable to a specific application. Updates on views must be translated into updates on the underlying database. This paper studies the translation process in the relational...

An object-oriented approach to database system implementation
A. James Baroody, Jr., David J. DeWitt
Pages: 576-601
DOI: 10.1145/319628.319645
This paper examines object-oriented programming as an implementation technique for database systems. The object-oriented approach encapsulates the representations of database entities and relationships with the procedures that manipulate them....

Query processing in a system for distributed databases (SDD-1)
Philip A. Bernstein, Nathan Goodman, Eugene Wong, Christopher L. Reeve, James B. Rothnie, Jr.
Pages: 602-625
DOI: 10.1145/319628.319650
This paper describes the techniques used to optimize relational queries in the SDD-1 distributed database system. Queries are submitted to SDD-1 in a high-level procedural language called Datalanguage. Optimization begins by translating each...

Human factors comparison of a procedural and a nonprocedural query language
Charles Welty, David W. Stemple
Pages: 626-649
DOI: 10.1145/319628.319656
Two experiments testing the ability of subjects to write queries in two different query languages were run. The two languages, SQL and TABLET, differ primarily in their procedurality; both languages use the relational data model, and their...

Efficient locking for concurrent operations on B-trees
Philip L. Lehman, s. Bing Yao
Pages: 650-670
DOI: 10.1145/319628.319663
The B-tree and its variants have been found to be highly useful (both theoretically and in practice) for storing large amounts of information, especially on secondary storage devices. We examine the problem of overcoming the inherent difficulty...

Analysis of index-sequential files with overflow chaining
Per-Åke Larson
Pages: 671-680
DOI: 10.1145/319628.319665
The gradual performance deterioration caused by deletions from and insertions into an index-sequential file after loading is analyzed. The model developed assumes that overflow records are handled by chaining. Formulas for computing the expected...