Abstract
A major challenge for search data structures is type hierarchy indexing. In contrast to the situation in relational databases, any query in an OODB may refer either to one type or, implicitly, to a subhierarchy and therefore to a set of types. In this chapter, the specific requirements, the technical issues, and some selected data structure solutions in the context of type hierarchy queries are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
The quantifier !∃ is to be read as there exists exactly one
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Mueck, T.A., Polaschek, M.L. (1997). Type Hierarchy Indexing. In: Index Data Structures in Object-Oriented Databases. Advances in Database Systems, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6213-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6213-9_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7849-5
Online ISBN: 978-1-4615-6213-9
eBook Packages: Springer Book Archive