Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1982)
Relational databases with partially formatted records
E. Codd (1972)
Relational Completeness of Data Base SublanguagesResearch Report / RJ / IBM / San Jose, California, RJ987
M. Stonebraker, Heidi Stettner, N. Lynn, Joseph Kalash, A. Guttman (1983)
Document processing in a relational database systemACM Trans. Inf. Syst., 1
A. Chandra, D. Harel (1980)
Computable Queries for Relational Data BasesJ. Comput. Syst. Sci., 21
A. Wasserman (1979)
The data management facilities of PLAIN
I. Gargantini (1982)
An effective way to represent quadtreesCommun. ACM, 25
Joachim Schmidt (1977)
Some high-level language constructs for data of type relation
E. Codd (1970)
A Relational Model for Large Shared Data BanksCommunications of The ACM
ARGUMENT-LIST) ::= (ARGUMENT) 1 (ARGUMENT)
JOIN) ::= JOIN (RELATION) AND (RELATION) OVER (ATTRIBUrES) I JOIN (RELATION) AND (RELATION) FOR I
J. Ullman (1980)
Principles of Database Systems
R. Lorie, Wil Plouffe (1983)
Complex Objects and Their Use in Design Transactions
E. Fox (1981)
Implementing SMART for minicomputers via relational processing With abstract data types
A. Aho, J. Ullman (1979)
Universality of data retrieval languagesProceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
(1983)
Proceedings of Database Week, E~iineering Design Applications
Joachim Schmidt (1977)
Some high level language constructs for data of type relationACM Trans. Database Syst., 2
André Frank (1982)
MAPQUERY: Data base query language for retrieval of geometric data and their graphical representationProceedings of the 9th annual conference on Computer graphics and interactive techniques
M. Stonebraker, Brad Rubenstein, A. Guttman (1986)
Application of Abstract Data Types and Abstract Indices to CAD Data Bases
E. Codd (1970)
A relational model of data for large shared data banksCommun. ACM, 13
L. Rowe, Kurt Shoens (1979)
Data abstraction, views and updates in RIGEL
(1983)
Received December
J. Ong, Dennis Fogg, M. Stonebraker (1983)
Implementation of data abstraction in the relational database system INGRESSIGMOD Rec., 14
D. Chamberlin, M. Astrahan, K. Eswaran, Patricia Griffiths, R. Lorie, J. Mehl, P. Reisner, B. Wade (1976)
SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and ControlIBM J. Res. Dev., 20
Moshé Zloof (1976)
Query-by-example: operations on hierarchical data bases
(1986)
QUALiFIER))' (ASSIGNMENT-LIST) ::= (ATT-ASSIGNMENT) ) (ATT-ASSIGNMENT)
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.
ACM Transactions on Database Systems (TODS) – Association for Computing Machinery
Published: Aug 1, 1986
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.