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

Search strategy and selection function for an inferential relational system
Jack Minker
Pages: 1-31
DOI: 10.1145/320241.320242
An inferential relational system is one in which data in the system consists of both explicit facts and general axioms (or “views”). The general axioms are used together with the explicit facts to derive the facts that are implicit...

Optimum reorganization points for linearly growing files
William G. Tuel, Jr.
Pages: 32-40
DOI: 10.1145/320241.320244
The problem of finding optimal reorganization intervals for linearly growing files is solved. An approximate reorganization policy, independent of file lifetime, is obtained. Both the optimum and approximate policies are compared to previously...

On the estimation of the number of desired records with respect to a given query
C. T. Yu, W. S. Luk, M. K. Siu
Pages: 41-56
DOI: 10.1145/320241.320245
The importance of the estimation of the number of desired records for a given query is outlined. Two algorithms for the estimation in the “closest neighbors problem” are presented. The numbers of operations of the algorithms are...

CASDAL: CASSM's DAta Language
Stanley Y. W. Su, Ahmed Emam
Pages: 57-91
DOI: 10.1145/320241.320246
CASDAL is a high level data language designed and implemented for the database machine CASSM. The language is used for the manipulation and maintenance of a database using an unnormalized (hierarchically structured) relational data model. It...

Security in statistical databases for queries with small counts
Francis Y. Chin
Pages: 92-104
DOI: 10.1145/320241.320250
The security problem of statistical databases containing anonymous but individual records which may be evaluated by queries about sums and averages is considered. A model, more realistic than the previous ones, is proposed, in which nonexisting...