Implementing a generalized access path structure for a relational database system
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Decomposition—a strategy for query processing
ACM Transactions on Database Systems (TODS)
Programming in an Interactive Environment: the ``Lisp'' Experience
ACM Computing Surveys (CSUR)
A generalized access path model and its application to a relational data base system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Data abstraction, views and updates in RIGEL
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
A data dictionary system with a query compiler is implemented in a symbol manipulation language, separate from the underlying database system. The query compiler (or program generator) generates COBOL programs for database access. These programs are optimized at generation time using information from the data dictionary. The implementation technique makes it possible to combine pilot implementation with production implementation of database application programs. Furthermore, an example is given of how the architecture of the system is convertible to different underlying database systems.