Concepts for a database system compiler
- 1 March 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 184-192
- https://doi.org/10.1145/308386.308435
Abstract
We propose a very simple formalism based on parameterized types and a rule-based algebra to explain the storage structures and algorithms of database management systems. Implementations of DBMSs are expressed as equations If all functions referenced in the equations have been implemented the software for a DBMS can be synthesized in minutes at little cost, in contrast to current methods where man-years of effort and hundreds of thousands of dollars are required. Our research aims to develop a DBMS counterpart to today's compiler-complier technologiesKeywords
This publication has 22 references indexed in Scilit:
- On the reusability of query optimization algorithmsInformation Sciences, 1989
- Join indicesACM Transactions on Database Systems, 1987
- Bit transposition for very large scientific and statistical databasesAlgorithmica, 1986
- Modeling the storage architectures of commercial database systemsACM Transactions on Database Systems, 1985
- Optimization of distributed tree queriesJournal of Computer and System Sciences, 1984
- Distributed query processingACM Computing Surveys, 1984
- Query processing in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1981
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- The design and implementation of INGRESACM Transactions on Database Systems, 1976
- System RACM Transactions on Database Systems, 1976