ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 3 Issue 3, Sept. 1978

Normalization and hierarchical dependencies in the relational data model
Claude Delobel
Pages: 201-222
DOI: 10.1145/320263.320271
The purpose of this paper is to present a new approach to the conceptual design of logical schemata for relational databases. One-to-one, one-to-many, and many-to-many relationships between the attributes of database relations are modeled by...

Sequentiality and prefetching in database systems
Alan Jay Smith
Pages: 223-247
DOI: 10.1145/320263.320276
Sequentiality of access is an inherent characteristic of many database systems. We use this observation to develop an algorithm which selectively prefetches data blocks ahead of the point of reference. The number of blocks prefetched is chosen...

Process synchronization in database systems
Gunter Schlageter
Pages: 248-271
DOI: 10.1145/320263.320279
The problem of process synchronization in database systems is analyzed in a strictly systematic way, on a rather abstract level; the abstraction is chosen such that the essential characteristics of the problem can be distinctly modeled and...

Specialized merge processor networks for combining sorted lists
Lee A. Hollaar
Pages: 272-284
DOI: 10.1145/320263.320281
In inverted file database systems, index lists consisting of pointers to items within the database are combined to form a list of items which potentially satisfy a user's query. This list merging is similar to the common data processing...

Implementing a generalized access path structure for a relational database system
Theo Haerder
Pages: 285-298
DOI: 10.1145/320263.320284
A new kind of implementation technique for access paths connecting sets of tuples qualified by attribute values is described. It combines the advantages of pointer chain and multilevel index implementation techniques. Compared to these...

On a partitioning problem
C. T. Yu, M. K. Siu, K. Lam
Pages: 299-309
DOI: 10.1145/320263.320287
This paper investigates the problem of locating a set of “boundary points” of a large number of records. Conceptually, the boundary points partition the records into subsets of roughly the same number of elements, such that the key...

On an authorization mechanism
Ronald Fagin
Pages: 310-319
DOI: 10.1145/320263.320288
Griffiths and Wade (ACM Trans. Database Syst. 1,3, (Sept. 1976), 242-255) have defined a dynamic authorization mechanism that goes beyond the traditional password approach. A database user can grant or revoke privileges (such as...