Abstract
We describe the implementation of a Storage Manager (SM) for the Hypernode model, a new data model whose aim is to integrate object-oriented and deductive databases. The single data structure of this model is the hypernode, a directed graph whose nodes may themselves be directed graphs. The components of the SM manipulate these graphs in a persistent store. The main effort of the first prototype of the SM has been to develop a modular and extensible system which can be used as a reliable and stable core for future versions. In particular, the SM caters for object-identity and referential sharing between hypernodes, large and dynamic hypernodes, clustering strategies on secondary storage, and retrieval operations which utilise indexing techniques. The main contribution of the SM is the single graph data structure which permeates throughout all the levels of the implementation; in this way efficiency can be achieved within all the components of the SM as a result of optimising this data structure, and also interfacing between the components of the SM is simple and uniform.
Preview
Unable to display preview. Download preview PDF.
References
M. M. Astrhan et al, “System R: Relational Approach to Database Management”, ACM Transaction on Database Systems, 1(2), pp 97–137, 1976.
M. P. Atkinson, K. J. Chisholm and W. P. Cockshott, “CMS — A Chunk Management System”, Software — Practice and Experience, 13, pp 273–285, 1983.
M. P. Atkinson, P. J. Bailey, K. J. Chisholm and W. P. Cockshott, “An Approach to Persistent Programming”, The Computer Journal, 26(4), pp 360–365, 1983.
F. Bancilhon, T. Briggs, S. Khoshafian and P. Valduriez, “FAD, a Powerful and Simple Database Language”, Proc. 13th VLDB, Brighton, pp 97–105, 1987.
R. Bayer and K. Unterauer, “Prefix B-Trees”, ACM Transactions on Database Systems, 2(1), pp 11–26, 1977.
M. J. Carey, D. J. DeWitt, J. E. Richardson and E. J. Shekita, “Object and File Management in the EXODUS Extensible Database System”, Proc. 12th VLDB, Kyoto, pp 91–100, 1986.
M. P. Consens and A. O. Mendelzon, “Graphlog: A Visual Formalism for Real Life Recursion”, Proc. of ACM Symposium on Principles of Database Systems, Nashville, Tennessee, pp 404–416, 1990.
A. Deshpande, D. Van Gucht, “An Implementation for Nested Relational Databases”, Proc. 14th VLDB, Los Angeles, pp 76–87, 1988.
G. Gardarin and P. Valduriez, “Relational Database and Knowledge Bases”, Addison-Wesley, 1989.
N. Gray, “Notes On Data Base Operating Systems”, Operating Systems: An Advanced Course, Springer-Verlag, 1978.
M. Gyssens, J. Paredaens and D. V. Van Gucht, “A Graph-Oriented Object Model for Database End-User Interfaces”, Proc. of the ACM SIGMOD, Atlantic City, pp 24–33, 1990.
D. Harel, “On Visual Formalism”, Communications of the ACM, 31(5), pp 514–530, 1988.
M. F. Hornick and S. B. Zdonik, “A Shared, Segmented Memory System for an Object-Oriented Database”, ACM Transaction on Office Information Systems, 5(1), pp 70–95, 1987.
S. E. Hudson and R. King, “CACTIS: A Self-Adaptive, Concurrent Implementation of an Object-Oriented Database Management System”, ACM Transaction on Database Systems, 14(3), pp 291–321, 1989.
T. Kaehler, “Virtual Memory for an Object-Oriented Language”, BYTE, pp 378–387, 1981.
W. Kim, N. Ballou, H.-T. Chou, J. F. Garza, D. Woelk and J. Banerjee, “Integrating an Object-Oriented Programming System with a Database System”, Proc. OOPSLA 88, pp 142–152, 1988.
W. Kim, J. F. Garza, N. Ballou and D. Woelk, “Architecture of the ORION Next-Generation Database System”, IEEE Transactions on Knowledge and Data Engineering, 2(1), pp 109–124, 1990.
S. N. Khoshafian and G. P. Copeland, “Object Identity”, Proc. OOPSLA 86, pp 406–416, 1986.
S. N. Khoshafian, M. J. Franklin and M. J. Carey, “Storage Management for Persistent Complex Objects”, Information Systems, 15(3), pp 303–320, 1990.
K. Kuspert, P.Dadam and J. Gunauer, “Cooperative Object Buffer Management in the Advanced Information Management Prototype”, Proc. 13th VLDB, Brighton, pp 483–492, 1987.
M. Levene and A. Poulovassilis, “The Hypernode Model and its Associated Query Language”, Proc. 5th Jerusalem Conference on Information Technology, 1990, pp 520–530.
M. Levene and A. Poulovassilis, “An object-oriented data model formalised through hypergraphs”, Data and Knowledge Engineering, 6(3), pp 205–224.
J. Nielsen, “Hypertext and Hypermedia”, Academic Press, 1989.
A. Poulovassilis and M.Levene, “A nested-graph model for the representation and manipulation of complex objects”, Research Note RN/90/86, Dept. of Computer Science, University College London, December 1990.
H.-J. Schek, H.-B. Paul, M.H. Scholl and G. Weikum, “The DASDBS project: Objectives, Experiences, and Future Prospects”, IEEE Transaction on Knowledge and Data Engineering, 2(1), pp 25–43, 1990.
M. Stonebraker, “Operating System Support for Database Management”, Communications of the ACM, 24(7), pp 412–418, 1981.
B. Stroustrup, “The C++ Programming Language”, Addison-Wesley, 1986.
F. W. Tompa, “A Data Model for Flexible Hypertext Database Systems”, ACM Transactions on Information Systems, 7(1), pp 85–100, 1989.
J. D. Ullman, “Principles of Database and Knowledge-Base Systems”, Computer Science Press, 1988.
J. D. Ullman, “A Comparison of Deductive and Object-Oriented Dtabases”, Proc. 2nd DOOD, Munich, pp 263–277, 1991.
P. Valduriez, S. Khoshafian and G. Copeland, “Implementation Techniques of Complex Objects”, Proc. 12th VLDB, pp 101–109.
F. Velez, G. Bernard and V.Darnis, “The O2 Object Manager: An Overview”, Proc. 15th VLDB, Amsterdam, pp 357–366, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tuv, E., Poulovassilis, A., Levene, M. (1992). A Storage manager for the Hypernode model. In: Gray, P.M.D., Lucas, R.J. (eds) Advanced Database Systems. BNCOD 1992. Lecture Notes in Computer Science, vol 618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55693-1_32
Download citation
DOI: https://doi.org/10.1007/3-540-55693-1_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55693-0
Online ISBN: 978-3-540-47272-8
eBook Packages: Springer Book Archive