ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 9 Issue 4, Dec. 1984

A database cache for high performance and fast restart in database systems
Klaus Elhardt, Rudolf Bayer
Pages: 503-525
DOI: 10.1145/1994.1995
Performance in database systems is strongly influenced by buffer management and transaction recovery methods. This paper presents the principles of the database cache, which replaces the traditional buffer. In comparison to buffer management,...

Performance analysis of recovery techniques
Andreas Reuter
Pages: 526-559
DOI: 10.1145/1994.1996
Various logging and recovery techniques for centralized transaction-oriented database systems under performance aspects are described and discussed. The classification of functional principles that has been developed in a companion paper is used...

Principles of database buffer management
Wolfgang Effelsberg, Theo Haerder
Pages: 560-595
DOI: 10.1145/1994.2022
This paper discusses the implementation of a database buffer manager as a component of a DBMS. The interface between calling components of higher system layers and the buffer manager is described; the principal differences between virtual memory...

An algorithm for concurrency control and recovery in replicated distributed databases
Philip A. Bernstein, Nathan Goodman
Pages: 596-615
DOI: 10.1145/1994.2207
In a one-copy distributed database, each data item is stored at exactly one site. In a replicated database, some data items may be stored at multiple sites. The main motivation is improved reliability: by storing important data at multiple...

Analysis of new variants of coalesced hashing
Wen-Chin Chen, Jeffrey Scott Vitter
Pages: 616-645
DOI: 10.1145/1994.2205
The coalesced hashing method has been shown to be very fast for dynamic information storage and retrieval. This paper analyzes in a uniform way the performance of coalesced hashing and its variants, thus settling some open questions in the...

Organization of clustered files for consecutive retrieval
J S. Deogun, V V. Raghavan, T K.W. Tsou
Pages: 646-671
DOI: 10.1145/1994.2208
This paper studies the problem of storing single-level and multilevel clustered files. Necessary and sufficient conditions for a single-level clustered file to have the consecutive retrieval property (CRP) are developed. A linear time algorithm...

The statistical security of a statistical database
J. F. Traub, Y. Yemini, H. Woźniakowski
Pages: 672-679
DOI: 10.1145/1994.383392
This note proposes a statistical perturbation scheme to protect a statistical database against compromise. The proposed scheme can handle the security of numerical as well as nonnumerical sensitive fields. Furthermore, knowledge of some records...

Vertical partitioning algorithms for database design
Shamkant Navathe, Stefano Ceri, Gio Wiederhold, Jinglie Dou
Pages: 680-710
DOI: 10.1145/1994.2209
This paper addresses the vertical partitioning of a set of logical records or a relation into fragments. The rationale behind vertical partitioning is to produce fragments, groups of attribute columns, that “closely match” the...