ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 4 Issue 1, March 1979

Implementing a relational database by means of specialzed hardware
E. Babb
Pages: 1-29
DOI: 10.1145/320064.320065
New hardware is described which allows the rapid execution of queries demanding the joining of physically stored relations. The main feature of the hardware is a special store which can rapidly remember or recall data. This data might be...

Computational problems related to the design of normal form relational schemas
Catriel Beeri, Philip A. Bernstein
Pages: 30-59
DOI: 10.1145/320064.320066
Problems related to functional dependencies and the algorithmic design of relational schemas are examined. Specifically, the following results are presented: (1) a tree model of derivations of functional dependencies from other functional...

Data abstractions for database systems
Peter C. Lockemann, Heinrich C. Mayr, Wolfgang H. Weil, Wolfgang H. Wohlleber
Pages: 60-75
DOI: 10.1145/320064.320067
Data abstractions were originally conceived as a specification tool in programming. They also appear to be useful for exploring and explaining the capabilities and shortcomings of the data definition and manipulation facilities of present-day...

The tracker: a threat to statistical database security
Dorothy E. Denning, Peter J. Denning, Mayer D. Schwartz
Pages: 76-96
DOI: 10.1145/320064.320069
The query programs of certain databases report raw statistics for query sets, which are groups of records specified implicitly by a characteristic formula. The raw statistics include query set size and sums of powers of values in the query set....

Secure databases: protection against user influence
David Dobkin, Anita K. Jones, Richard J. Lipton
Pages: 97-106
DOI: 10.1145/320064.320068
Users may be able to compromise databases by asking a series of questions and then inferring new information from the answers. The complexity of protecting a database against this technique is discussed here. ...

Limitations of record-based information models
William Kent
Pages: 107-131
DOI: 10.1145/320064.320070
Record structures are generally efficient, familiar, and easy to use for most current data processing applications. But they are not complete in their ability to represent information, nor are they fully self-describing. ...