The design of a relational database system with abstract data types for domains
- 1 August 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 11 (3) , 357-373
- https://doi.org/10.1145/6314.6461
Abstract
An extension to the relational model is described in which domains can he arbitrarily defined as abstract data types. Operations on these data types include primitive operations, aggregates, and transformations. It is shown that these operations make the query language complete in the sense of Chandra and Harel. The system has been designed in such a way that new data types and their operations can be defined with a minimal amount of interaction with the database management system.Keywords
This publication has 13 references indexed in Scilit:
- Implementation of data abstraction in the relational database system INGRESACM SIGMOD Record, 1983
- Document processing in a relational database systemACM Transactions on Information Systems, 1983
- An effective way to represent quadtreesCommunications of the ACM, 1982
- MAPQUERYACM SIGGRAPH Computer Graphics, 1982
- Implementing SMART for minicomputers via relational processing With abstract data typesACM SIGSMALL Newsletter, 1981
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- Some high level language constructs for data of type relationACM Transactions on Database Systems, 1977
- Query-by-examplePublished by Association for Computing Machinery (ACM) ,1976
- A relational model of data for large shared data banksCommunications of the ACM, 1970