Managing Complex Objects in an Extensible Relational DBMS.
Georges Gardarin, Jean-Pierre Cheiney, Gerald Kiernan, Dominique Pastre, Hervé Stora:
Managing Complex Objects in an Extensible Relational DBMS.
VLDB 1989: 55-65@inproceedings{DBLP:conf/vldb/GardarinCKPS89,
author = {Georges Gardarin and
Jean-Pierre Cheiney and
Gerald Kiernan and
Dominique Pastre and
Herv{\'e} Stora},
editor = {Peter M. G. Apers and
Gio Wiederhold},
title = {Managing Complex Objects in an Extensible Relational DBMS},
booktitle = {Proceedings of the Fifteenth International Conference on Very
Large Data Bases, August 22-25, 1989, Amsterdam, The Netherlands},
publisher = {Morgan Kaufmann},
year = {1989},
isbn = {1-55860-101-5},
pages = {55-65},
ee = {db/conf/vldb/GardarinCKPS89.html},
crossref = {DBLP:conf/vldb/89},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
This paper presents the management of complex objects in an extensible relational database management system.
Complex objects are built using the list constructor.
Complex object types are defined as relation domains encapsulated within methods written in LISP or C.
User-defined domains may be described using a "IS-A" hierarchy, which makes possible the inheritance of methods among domains.
The domain methods are directly used in the external data manipulation language, which is an extended version of SQL with object oriented features (i.e., structured complex objects, methods and inheritance).
When executing a query, the system selects the correct methods to apply on complex objects according to all parameter types given in method calls.
With the specific LISP interpreter embedded in the DBMS, errors in functions oncomplex objects are detected at run time.
Thus, the DBMS is protected from errors arising in user programs.
Methods can also be programmed in C code and dynamically loaded when C programsare referenced in queries.
Relations can be clustered according to the result of user-defined methods applied to basic or user-defined domains.
Graphical interface procedures are available to input and display non-standard data.
A fully running version of the system is commercially available for SUN UNIX workstations.
Copyright © 1989 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Online Paper
CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Peter M. G. Apers, Gio Wiederhold (Eds.):
Proceedings of the Fifteenth International Conference on Very Large Data Bases, August 22-25, 1989, Amsterdam, The Netherlands.
Morgan Kaufmann 1989, ISBN 1-55860-101-5
References
- [AIDA87]
- ...
- [Bancilhon86]
- François Bancilhon, Setrag Khoshafian:
A Calculus for Complex Objects.
PODS 1986: 53-60
- [Barbedette86]
- ...
- [Bentley75]
- Jon Louis Bentley:
Multidimensional Binary Search Trees Used for Associative Searching.
Commun. ACM 18(9): 509-517(1975)
- [Carey86]
- Michael J. Carey, David J. DeWitt, Daniel Frank, Goetz Graefe, M. Muralikrishna, Joel E. Richardson, Eugene J. Shekita:
The Architecture of the EXODUS Extensible DBMS.
OODBS 1986: 52-65
- [Chailloux86]
- ...
- [Cheiney88]
- Jean-Pierre Cheiney, Gerald Kiernan:
A Functional Clustering Method for Optimal Access to Complex Domains in a Relational DBMS.
ICDE 1988: 394-401
- [Codd70]
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
Commun. ACM 13(6): 377-387(1970)
- [Codd79]
- E. F. Codd:
Extending the Database Relational Model to Capture More Meaning.
ACM Trans. Database Syst. 4(4): 397-434(1979)
- [Gardarin84]
- Georges Gardarin, Patrick Valduriez, Yann Viémont:
Predicate Trees: An Approach to Optimize Relational Query Operations.
ICDE 1984: 439-444
- [Gardarin87]
- ...
- [Gardarin89]
- ...
- [Gutman84]
- Antonin Guttman:
R-Trees: A Dynamic Index Structure for Spatial Searching.
SIGMOD Conference 1984: 47-57
- [Kiernan87]
- ...
- [Maindrville88]
- Christophe de Maindreville, Eric Simon:
Modelling Non Deterministic Queries and Updates in Deductive Databases.
VLDB 1988: 395-406
- [Ong84]
- James Ong, Dennis Fogg, Michael Stonebraker:
Implementation of Data Abstraction in the Relational Database System Ingres.
SIGMOD Record 14(1): 1-14(1984)
- [Osborn86]
- Sylvia L. Osborn, T. E. Heaven:
The Design of a Relational Database System with Abstract Data Types for Domains.
ACM Trans. Database Syst. 11(3): 357-373(1986)
- [Schwarz86]
- Peter M. Schwarz, Walter Chang, Johann Christoph Freytag, Guy M. Lohman, John McPherson, C. Mohan, Hamid Pirahesh:
Extensibility in the Starburst Database System.
OODBS 1986: 85-92
- [Schek86]
- Hans-Jörg Schek, Marc H. Scholl:
The relational model with relation-valued attributes.
Inf. Syst. 11(2): 137-147(1986)
- [Stonebraker83]
- ...
- [Stonebraker86]
- Michael Stonebraker:
Inclusion of New Types in Relational Data Base Systems.
ICDE 1986: 262-269
- [Tsur84]
- Shalom Tsur, Carlo Zaniolo:
An Implementation of GEM - Supporting a Semantic Data Model on a Relational Back-End.
SIGMOD Conference 1984: 286-295
- [Valduriez84]
- Patrick Valduriez, Yann Viémont:
A Multikey Hashing Scheme Using Predicate Trees.
SIGMOD Conference 1984: 107-114
- [Valduriez86]
- Patrick Valduriez, Setrag Khoshafian, George P. Copeland:
Implementation Techniques of Complex Objects.
VLDB 1986: 101-110
- [Verso86]
- ...
- [Wilms88]
- Paul F. Wilms, Peter M. Schwarz, Hans-Jörg Schek, Laura M. Haas:
Incorporating Data Types in an Extensible Database Architecture.
JCDKB 1988: 180-192
- [Zaniolo83]
- Carlo Zaniolo:
The Database Language GEM.
SIGMOD Conference 1983: 207-218
- [Zaniolo85]
- Carlo Zaniolo:
The Representation and Deductive Retrieval of Complex Objects.
VLDB 1985: 458-469
Copyright © Mon Mar 15 03:55:51 2010
by Michael Ley (ley@uni-trier.de)
