Database Systems (TODS)


Search Issue
enter search term and/or author name


ACM Transactions on Database Systems (TODS), Volume 9 Issue 1, March 1984

Designing a Portable Natural Language Database Query System
S. Jerrold Kaplan
Pages: 1-19
DOI: 10.1145/348.318584
One barrier to the acceptance of natural language database query systems is the substantial installation effort required for each new database. Much of this effort involves the encoding of semantic knowledge for the domain of discourse,...

Practical data-swapping: the first steps
Steven P. Reiss
Pages: 20-37
DOI: 10.1145/348.349
The problem of statistical database confidentiality in releasing microdata is addressed through the use of approximate data-swapping. Here, a portion of the microdata is replaced with a database that has been selected with approximately the same...

The Grid File: An Adaptable, Symmetric Multikey File Structure
J. Nievergelt, Hans Hinterberger, Kenneth C. Sevcik
Pages: 38-71
DOI: 10.1145/348.318586
Traditional file structures that provide multikey access to records, for example, inverted files, are extensions of file structures originally designed for single-key access. They manifest various deficiencies in particular for multikey access...

A Database Management System for the Federal Courts
Jack R. Buchanan, Richard D. Fennell, Hanan Samet
Pages: 72-88
DOI: 10.1145/348.318587
A judicial systems laboratory has been established and several large-scale information management systems projects have been undertaken within the Federal Judicial Center in Washington, D.C. The newness of the court application area, together...

On Concurrency Control by Multiple Versions
Christos H. Papadimitriou, Paris C. Kanellakis
Pages: 89-99
DOI: 10.1145/348.318588
We examine the problem of concurrency control when the database management system supports multiple versions of the data. We characterize the limit of the parallelism achievable by the multiversion approach and demonstrate the resulting...

Response Time Analysis of Multiprocessor Computers for Database Support
Roger K. Shultz, Roy J. Zingg
Pages: 100-132
DOI: 10.1145/348.318589
Comparison of three multiprocessor computer architectures for database support is made possible through evaluation of response time expressions. These expressions are derived by parameterizing algorithms performed by each machine to execute a...

Join and Semijoin Algorithms for a Multiprocessor Database Machine
Patrick Valduriez, Georges Gardarin
Pages: 133-161
DOI: 10.1145/348.318590
This paper presents and analyzes algorithms for computing joins and semijoins of relations in a multiprocessor database machine. First, a model of the multiprocessor architecture is described, incorporating parameters defining I/O, CPU, and...