ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 8 Issue 1, March 1983

Maximal objects and the semantics of universal relation databases
David Maier, Jeffrey D. Ullman
Pages: 1-14
DOI: 10.1145/319830.319831
The universal relation concept is intended to provide the database user with a simplified model in which he can compose queries without regard to the underlying structure of the relations in the database. Frequently, the lossless join criterion...

Operational characteristics of a harware-based pattern matcher
Roger L. Haskin, Lee A. Hollaar
Pages: 15-40
DOI: 10.1145/319830.319832
The design and operation of a new class of hardware-based pattern matchers, such as would be used in a backended database processor in a full-text or other retrieval system, is presented. This recognizer is based on a unique implementation...

Answering queries without revealing secrets
George L. Sicherman, Wiebren De Jonge, Reind P. Van de Riet
Pages: 41-59
DOI: 10.1145/319830.319833
Question-answering systems must often keep certain information secret. This can be accomplished, for example, by sometimes refusing to answer a query. Here the danger of revealing a secret by refusing to answer a query is investigated. First...

Compromising statistical databases responding to queries about means
Wiebren de Jonge
Pages: 60-80
DOI: 10.1145/319830.319834
This paper describes how to compromise a statistical database which only answers queries about arithmetic means for query sets whose cardinality falls in the range [k, N - k], for some...

Functions in databases
Marc H. Graham
Pages: 81-109
DOI: 10.1145/319830.319835
We discuss the objectives of including functional dependencies in the definition of a relational database. We find two distinct objectives. The appearance of a dependency in the definition of a database indicates that the states of the database...

Rosolving conflicts in global storage design through replication
R. H. Katz, E. Wong
Pages: 110-135
DOI: 10.1145/319830.319836
We present a conceptual framework in which a database's intra- and interrecord set access requirements are specified as a constrained assignment of abstract characteristics (“evaluated,” “indexed,”...

Bounded index exponential hashing
David B. Lomet
Pages: 136-165
DOI: 10.1145/319830.319837
Bounded index exponential hashing, a new form of extendible hashing, is described. It has the important advantages over most of the other extendible hashing variants of both (i) providing random access to any record of a file in close to one...