Readings in Database Systems
Published 1 January 1988
Michael Stonebraker
Citations308
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Readings in Database Systems, 3rd Edition is a compilation of papers exploring DBMS applications, including relational implementation, transaction management, distributed database, parallel database, objects and databases, data analysis, and benchmarking.
Abstract
Readings in Database Systems, 3rd Edition is a compilation of papers exploring DBMS applications. Coverage spans the entire field of database, including relational implementation, transaction management, distributed database, parallel database, objects and databases, data analysis, and benchmarking.
Keywords
Computer Science
R-trees
6,543 Citations1984Antonin Guttman
A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
Access path selection in a relational database management system
2,153 Citations1979Patricia G. Selinger, M. M. Astrahan +3 more
This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins) given a user specification of desired data as a boolean expression of predicates.
Communications of the ACMMonitors
1,498 Citations1974C. A. R. Hoare
This paper develops Brinch-Hansen's concept of a monitor as a method of structuring an operating system, introduces a form of synchronization, describes a possible method of implementation in terms of semaphores and gives a suitable proof rule.
ACM Transactions on Database SystemsOn optimistic methods for concurrency control
1,439 Citations1981H. T. Kung, John T. Robinson
In this paper, two families of nonlocking concurrency controls are presented and the methods used are "optimistic" in the sense that they rely mainly on transaction backup as a control mechanism, “hoping” that conflicts between transactions will not occur.
Journal of Computer and System SciencesProbabilistic counting algorithms for data base applications
1,283 Citations1985Philippe Flajolet, G. Nigel Martin
A class of probabilistic counting algorithms with which one can estimate the number of distinct elements in a large collection of data in a single pass using only a small additional storage and only a few operations per element scanned is introduced.
ACM Computing SurveysPrinciples of transaction-oriented database recovery
1,212 Citations1983Theo Haerder, Andreas Reuter
A terminological framework is provided for describing different transactionoriented recovery schemes for database systems in a conceptual rather than an implementation-dependent way by introducing the terms materialized database, propagation strategy, and checkpoint, and a means for classifying arbitrary implementations from a unified viewpoint.
ACM Transactions on Database SystemsThe design and implementation of INGRES
884 Citations1976Michael Stonebraker, Gerald Held +2 more
The currently operational (March 1976) version of the INGRES database management system is described, giving a relational view of data, supports two high level nonprocedural data sublanguages, and runs as a collection of user processes on top of the UNIX operating system for Digital Equipment Corporation PDP 11/40, 11/45, and 11/70 computers.
ACM Transactions on Database SystemsEfficient locking for concurrent operations on B-trees
529 Citations1981Philip L. Lehman, S. Bing Yao
The B-tree and its variants have been found to be highly useful for storing large amounts of information, especially on secondary storage devices, and a single additional “link” pointer in each node allows a process to easily recover from tree modifications performed by other concurrent processes.
High Performance Transaction Systems WorkshopThe Case for Shared Nothing.
447 Citations1985Michael Stonebraker
This paper argues that shared nothing is the preferred approach to building high transaction rate multiprocessor systems.
Acta InformaticaConcurrency of operations on B-trees
405 Citations1977Raymond Bayer, Mario Schkolnick
It is concluded that B-trees can be used advantageously in a multi-user environment because the solution presented here uses simple locking protocols which can be tuned to specific requirements.
Communications of the ACMOperating system support for database management
384 Citations1981Michael Stonebraker
Several operating system services are examined with a view toward their applicability to support of database management functions.
Linear hashing: a new tool for file and table addressing
384 Citations1980Witold Litwin
ACM Transactions on Database SystemsConcurrency control performance modeling: alternatives and implications
383 Citations1987Rakesh Agrawal, Michael J. Carey +1 more
It is shown that differences in the underlying assumptions explain the seemingly contradictory performance results, and the question of how realistic the various assumptions are for actual database systems is addressed.
ACM SIGOPS Operating Systems ReviewOn the duality of operating system structures
374 Citations1979Hugh C. Lauer, Roger M. Needham
It is demonstrated that these two categories are duals of each other and that a system which is constructed according to one model has a direct counterpart in the other, and the principal conclusion is that neither model is inherently preferable.
Minds at UW (University of Wisconsin)GAMMA—a high performance dataflow database machine
367 Citations1986David J. DeWitt, Goetz Graefe +4 more
The Gamma prototype shows how parallelism can be controlled with minimal control overhead through a combination of the use of algorithms based on hashing and the pipelining of data between processes.
ACM Transactions on Database SystemsTransaction management in the R* distributed database management system
358 Citations1986C. Mohan, Bruce G. Lindsay +1 more
This paper concentrates primarily on the description of the R* commit protocols, Presumed Abort (PA) and Presumed Commit (PC), which are extensions of the well-known, two-phase (2P) commit protocol.
AlgorithmicaAn evaluation of buffer management strategies for relational database systems
354 Citations1986Hong‐Tai Chou, David J. DeWitt
A new algorithm, DBMIN, for managing the buffer pool of a relational database management system based on a new model of relational query behavior, the query locality set model (QLSM), and a performance evaluation methodology for evaluating buffer management algorithms in a multiuser environment is presented.
Granularity of locks and degrees of consistency in a shared data base
348 Citations1998Jim Gray, Raymond A. Lorie +2 more
A locking protocol which allows simultaneous locking at various granularities by different transactions is presented, based on the introduction of additional lock modes besides the conventional share mode an5 exclusive mode.
Encapsulation of parallelism in the Volcano query processing system
342 Citations1990Goetz Graefe
The reasons for not choosing the bracket model, the novel operator model, and details of Volcano's exchange operator that parallelizes all other operators are described, which makes implementation of parallel database algorithms significantly easier and more robust.
DSpace@MIT (Massachusetts Institute of Technology)NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
326 Citations1978David P. Reed
A new approach to the synchronization of accesses to shared data objects is developed, called NAMOS, which provides a useful tool for restoring a consistent state of the system after a failure resulting in irrecoverable loss of information or a user mistake resulting in an inconsistent state.
Chained declustering: a new availability strategy for multiprocessor database machines
250 Citations2002Hui-I Hsiao, David J. DeWitt
A new strategy for increasing the availability of data in multiprocessor, shared-nothing database machines is presented and is demonstrated to provide superior performance in the event of failures while maintaining a very high degree of data availability.
ACM SIGMOD RecordGrammar-like functional rules for representing query optimization alternatives
162 Citations1988Guy M. Lohman
ACM Transactions on Database SystemsRetrospection on a database system
68 Citations1980Michael Stonebraker
This paper describes the implementation history of the INGRES database system and focuses on mistakes that were made in progress rather than on eventual corrections.
Defense Technical Information Center (DTIC)A Study of Buffer Management Policies for Data Management Systems.
14 Citations1976Allen Reiter
For the application and job mix in question it turns out that anticipatory fetching does not pay, and that DS in general behaves somewhat better than LRU.