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 3, Sept. 1981

Database description with SDM: a semantic database model
Michael Hammer, Dennis Mc Leod
Pages: 351-386
DOI: 10.1145/319587.319588
SDM is a high-level semantics-based database description and structuring formalism (database model) for databases. This database model is designed to capture more of the meaning of an application environment than is possible with contemporary...

A normal form for relational databases that is based on domains and keys
Ronald Fagin
Pages: 387-415
DOI: 10.1145/319587.319592
A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also, formal definitions of insertion anomaly and deletion anomaly are presented. It is shown that a schema is in DK/NF if and only if it has no...

Associative hardware and software techniques for integrity control
Y. C. Hong, Stanley Y. W. Su
Pages: 416-440
DOI: 10.1145/319587.319594
This paper presents the integrity control mechanism of the associative processing system, CASSM. The mechanism takes advantage of the associative techniques, such as content and context addressing, tagging and marking data, parallel processing,...

Frame memory: a storage architecture to support rapid design and implementation of efficient databases
Salvatore T. March, Dennis G. Severance, Michael Wilens
Pages: 441-463
DOI: 10.1145/319587.319598
Frame memory is a virtual view of secondary storage that can be implemented with reasonable overhead to support database record storage and accessing requirements. Frame memory is designed so that its operating characteristics can be easily...

High-level programming features for improving the efficiency of a relational database system
Reind P. Van de Riet, Martin L. Kersten, Wiebren de Jonge, Anthony I. Wasserman
Pages: 464-485
DOI: 10.1145/319587.319604
This paper discusses some high-level language programming constructs that can be used to manipulate the relations of a relational database system efficiently. Three different constructs are described: (1) tuple identifiers that directly...

Dense multiway trees
K. Culik, II, Th. Ottmann, D. Wood
Pages: 486-512
DOI: 10.1145/319587.319612
B-trees of order m are a “balanced” class of m-ary trees, which have applications in the areas of file organization. In fact, they have been the only choice when balanced multiway trees are required....

Analysis of a heuristic for full trie minimization
Douglas Comer
Pages: 513-537
DOI: 10.1145/319587.319618
A trie is a distributed-key search tree in which records from a file correspond to leaves in the tree. Retrieval consists of following a path from one root to a leaf, where the choice of edge at each node is determined by attribute values of the...