Abstract
This paper presents ROOST, an object oriented data model for relational databases. ROOST defines objects as multi-level hierarchical aggregations of base relations, views, and/or other objects. It is a new, rather conservative approach, that is substantially different than those that follow the object oriented programming language approach. ROOST was designed to be easily portable to existing relational database systems. An object is structured as a hierarchical aggregation of subcomponents. Subcomponents are tables which are the media of relational databases, or other objects. The model includes languages for creating, manipulating, updating, and browsing objects. The proposed object model has been implemented on top of a relational database system.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This research was sponsored partially by the National Science Foundation under Grant IRI-8719458 and the University of Maryland Institutes for Advanced Computer Studies.
Preview
Unable to display preview. Download preview PDF.
6. References
Derrett, N., Fishman, D., Kent, W., Lyngbaek, P., Ryan, T., “An Object-Oriented Approach to Data Management,” 1986 IEEE, pp. 330–335.
Jacobs, B., “Applied Database Logic,” Vol. 1, Prentice-Hall, Inc., 1985.
Ketabchi, M., Berzins, V., “Modeling and Managing CAD Databases,” IEEE Computer Magazine, Jan. 1986.
Kristensen, B., Madsen, O., Moeller-Pedersen, B., Nygaard, K., “A Survey of BETA Programming Language,” Norwegian Computing Center, Oslo, Norway, 1981.
Litwin, W. et al. "MSQL: A Multidatabase Language," INRIA Res. Rep. 695, (June 1987).
Lyngbaek, P., “Atomic vs. Molecular Objects in Iris,” Hewlett-Packard Laboratories, Palo Alto, California, STL-86-08, May 1986.
Stonebraker, M., "Implementation of Integrity Constraints and Views by Query Modification," Proc. ACM-SIGMOD, June 1975, pp. 65–78.
Roussopoulos, N., "View Indexing in Relational Databases," ACM Transactions on Database Systems, Vol. 7, No. 2, pp. 258–290, June 1982.
Roussopoulos, N., "The Logical Access Path Schema of a Database," IEEE Transactions on Software Engineering, Vol. SE-8, No. 6, pp. 563–573, November 1982.
Roussopoulos, N., "Engineering Information Systems," Proc. of ACM SIGMOD, Washington, May 1986.
Roussopoulos, N., "Principles and Techniques in the Design of ADMS±," IEEE, Computer Magazine, Vol.19, No. 12, December 1986, pp. 19–25.
Roussopoulos, N., "The Incremental Access Method of View Cache: Concept and Cost Analysis," Dept. of Computer Science, Univ. of Maryland, March 1987.
Roussopoulos, N., "Overview of ADMS: A High Performance Database Management System," Invited Paper, Fall Joint Computer Conference, Dallas, Texas, October 25–29, 1987.
Rowe, L.A., "A Shared Object Hierarchy," in The POSTGRES Papers, M. Stonebraker and L. Rowe (Eds.), Memorandum UCB/ERL M86/85, Electronics Research Laboratory, University of California, Berkeley, June 1987.
Sellis, T. "Multiple Query Optimization,"” ACM Trans. on Database Syst. Vol. 13, No 1, March 1988, pp. 23–52.
Wiederhold, G., “ Views, Objects, and Databases,” IEEE Computer, Vol. 19:12, December 1986, pp. 37–44.
Wirth, N., “Programming in Modula-2,” Springer-Verlag, Berlin, 1983.
Woelk, D., Kim, W., Luther, W., “An Object-Oriented Approach to Multimedia Databases,” Proceedings of SIGMOD 86, May 1986, pp. 311–325.
The Xerox Learning Research Group, “The Smalltalk-80 System,” BYTE, Aug. 1981, pp. 36–48.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roussopoulos, N., Kim, H.S. (1989). ROOST. In: Litwin, W., Schek, HJ. (eds) Foundations of Data Organization and Algorithms. FODO 1989. Lecture Notes in Computer Science, vol 367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51295-0_145
Download citation
DOI: https://doi.org/10.1007/3-540-51295-0_145
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51295-0
Online ISBN: 978-3-540-46186-9
eBook Packages: Springer Book Archive