Skip to main content

Optimization of queries using nested indices

  • Session 2: Data Structures
  • Conference paper
  • First Online:
Advances in Database Technology — EDBT '90 (EDBT 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 416))

Included in the following conference series:

Abstract

The notion of nested object is a basic concept of the object-oriented paradigm. It allows the value of an object attribute to be another object or a set of other objects. This means that a class consists of a set of attributes, and the values of the attributes are objects that belong to other classes; that is, the definition of a class forms a hierarchy of classes. All attributes of the nested classes are nested attributes of the root of the hierarchy. In a previous paper [Bert 89], we have introduced the notion of nested index that associates the values of a nested attribute with the objects instances of the root of the hierarchy. In that paper, we have evaluated the performance of this indexing mechanism in the case of queries containing a single predicate. In the present paper, we consider the usage of nested indices in the framework of more general queries containing several predicates.

This work was partially performed while the author was visiting the Microelectronics and Computer Technology Corporation, Austin (Texas)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bertino, E., W.Kim, Indexing Techniques for Queries on Nested Objects, to appear in IEEE Trans. on Knowledge and Data Engineering, 1989, also MCC Technical Report Number: ACT-OODS-132-89, March 1989.

    Google Scholar 

  2. Bertino, E., Optimization of Queries using Nested Indices, Technical Report (available from the author), November 1989.

    Google Scholar 

  3. Dittrich, K., Object-Oriented Database Systems: the Notion and the Issues, in Intl. Workshop on Object-Oriented Database Systems, Asilomar (Calif.), Sept. 23–26, 1986.

    Google Scholar 

  4. Kim, W., A Foundation for Object-Oriented Databases, MCC Technical Report, No. ACA-ST-248-88, Aug. 1988.

    Google Scholar 

  5. Kim, K-C., W.Kim, D. Woelk, and A. Dale, Acyclic Query Processing in Object-Oriented Databases, in Proc. Entity-Relationship Conference, Rome (Italy), November 1988.

    Google Scholar 

  6. Valduriez, P., Optimization of Complex Database Queries using Join Indices, MCC Technical Report Number: ACA-ST-265-87, August 1987.

    Google Scholar 

  7. Yao, S.B., Approximating Block Accesses in Database Organizations, ACM Commun., Vol.20, Apr. 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

François Bancilhon Constantino Thanos Dennis Tsichritzis

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertino, E. (1990). Optimization of queries using nested indices. In: Bancilhon, F., Thanos, C., Tsichritzis, D. (eds) Advances in Database Technology — EDBT '90. EDBT 1990. Lecture Notes in Computer Science, vol 416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022163

Download citation

  • DOI: https://doi.org/10.1007/BFb0022163

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52291-1

  • Online ISBN: 978-3-540-46948-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics