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 1, March 1981

On the design of relational database schemata
Carlo Zaniolo, Miachel A. Meklanoff
Pages: 1-47
DOI: 10.1145/319540.319542
The purpose of this paper is to present a new approach to the conceptual design of relational databases based on the complete relatability conditions (CRCs). It is shown that current database design methodology based upon the...

Hierarchical schemata for relational databases
Y. Edmund Lien
Pages: 48-69
DOI: 10.1145/319540.319546
Most database design methods for the relational model produce a flat database, that is, a family of relations with no explicit interrelational connections. The user of a flat database is likely to be unaware of certain interrelational semantics....

Support for repetitive transactions and ad hoc queries in System R
D. D. Chamberlin, M. M. Astrahan, W. F. King, R. A. Lorie, J. W. Mehl, T. G. Price, M. Schkolnick, P. Griffiths Selinger, D. R. Slutz, B. W. Wade, R. A. Yost
Pages: 70-94
DOI: 10.1145/319540.319550
System R supports a high-level relational user language called SQL which may be used by ad hoc users at terminals or as an embedded data sublanguage in PL/I or COBOL. Host-language programs with embedded SQL statements are processed by the...

Security of statistical databases: multidimensional transformation
Jan Schlörer
Pages: 95-112
DOI: 10.1145/319540.319555
The concept of multidimensional transformation of statistical databases is described. A given set of statistical output may be compatible with more than one statistical database. A transformed database D' is a database which (1)...

Statistical database design
Francis Y. Chin, Gultekin Ozsoyoglu
Pages: 113-139
DOI: 10.1145/319540.319558
The security problem of a statistical database is to limit the use of the database so that no sequence of statistical queries is sufficient to deduce confidential or private information. In this paper it is suggested that the problem be...

The functional data model and the data languages DAPLEX
David W. Shipman
Pages: 140-173
DOI: 10.1145/319540.319561
DAPLEX is a database language which incorporates: a formulation of data in terms of entities; a functional representation for both actual and virtual data relationships; a...

Time- and space-optimality in B-trees
Arnold L. Rosenberg, Lawrence Snyder
Pages: 174-193
DOI: 10.1145/319540.319565
A B-tree is compact if it is minimal in number of nodes, hence has optimal space utilization, among equally capacious B-trees of the same order. The space utilization of compact B-trees is analyzed and compared with that of...

New file organization based on dynamic hashing
Michel Scholl
Pages: 194-211
DOI: 10.1145/319540.319564
New file organizations based on hashing and suitable for data whose volume may vary rapidly recently appeared in the literature. In the three schemes which have been independently proposed, rehashing is avoided, storage space is dynamically...