IBM Systems Journal · 1999 · 67 citations · 13 references
ComputingComputer ScienceComputer SystemsDatabasesProgramming LanguagesStorage SystemsData Storage SystemsDatabase ManagementQuery ProcessingStructured Query LanguageTransaction ManagementTransaction Processing SystemsAccess Path SelectionAd Hoc QueryingDatabase TransactionsMachine Code GenerationName BindingPath SelectionTransaction ProcessingTransactions
We have described the architecture of System R, including the Relational Data System and the Research Storage System. The RDS supports a flexible spectrum of binding times, ranging from precompilmion of “canned transactions” to on-line execution of ad hoc queries. The advantages of this approach may be summarized as follows: 1. For repetitive transactions, all the work of parsing, name binding, and access path selection is done once at precompilation time and need not be repeated. 2. Ad hoc queries are compiled on line into small machine-language routines that execute more efficiently than an interpreter. 3. Users are given a single language, SQL, for use in ad hoc queries as well as in writing PL/I and COBOL transaction programs. 4. The SQL parser, access path selection routines, and machine language code generator are used in common between query processing and precompilation of transaction programs. 5. When an index used by a transaction program is dropped, a new access path is automatically selected for the transaction without user intervention.
13
Access path selection in a relational database management system
Patricia G. Selinger, M. M. Astrahan, Donald D. Chamberlin et al. · 1979 · 2.2K citations
The notions of consistency and predicate locks in a database system
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie et al. · Communications of the ACM · 1976 · 2K citations · Full text
M. M. Astrahan, Michael W. Blasgen, Donald D. Chamberlin et al. · ACM Transactions on Database Systems · 1976 · 1K citations · Full text