Advertisement

Hybrid Structures

  • Yannis Manolopoulos
  • Alexandros Nanopoulos
  • Eleni Tousidou
Part of the Advances in Database Systems book series (ADBS, volume 27)

Abstract

Object-oriented and multimedia databases that are entangled with the manipulation of multi-valued attributes and complex objects in general, tend to raise problems that involve particular properties and needs, such as the constrained domain of set-valued attributes in contrast to the nonconstrained one of text-databases, and the superset, perfect match and subset queries that are frequently asked. The focus of this chapter is on the advantages that could arise from the creation of a hybrid structure handling set-valued attributes in the form of signatures, based on the structures of hashing and the S-tree.

Keywords

Hash Table Hybrid Structure Disk Access Partition Block Query Signature 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Bertino, B. Catania, L. Chiesa. “Definition and Analysis of Index Organizations for Object-Oriented Database Systems”. Information Systems, Vol.23, No.2, pp.65–108, 1998.MATHCrossRefGoogle Scholar
  2. [2]
    P. Bozanis, C. Makris, A. Tsakalidis. “Parametric Weighted Filter: an Efficient Dynamic Manipulation of Signature Files”. The Computer Journal, Vol.38, No.6, pp.478–488, 1995.Google Scholar
  3. [3]
    E. Bertino, B.C. Ooi, R. Sacks-Davis, K.L. Tan, J. Zobel, B. Shidlovsky, B. Catania. “Indexing Techniques for Advanced Database Systems”. Kluwer Academic Publishers, 1997.Google Scholar
  4. [4]
    S. Christodoulakis, C. Faloutsos. “Signature Files: an Access Method for Documents and its Analytical Performance Evaluation”. ACM Transactions on Office Information Systems, Vol.2, No.4, pp.267–288, 1984.CrossRefGoogle Scholar
  5. [5]
    P. Ciaccia, P. Tiberio, P. Zezula. “Declustering of Key-Based Partitioned Signature Files”. ACM Transactions on Database Systems, Vol.21, No.3, pp.295–338, 1996.CrossRefGoogle Scholar
  6. [6]
    U. Deppisch. “S-tree: a Dynamic Balanced Signature Index for Office Retrieval”. Proceedings 9th ACM International Conference on Information Retrieval (SI-GIR’86), pp.77–87, Pisa, Italy, 1986.Google Scholar
  7. [7]
    Y. Ishikawa, H. Kitagawa, N. Ohbo. “Evaluation of Signature Files as Set Access Facilities in OODBs”. Proceedings ACM International Conference on Management of Data (SIGMOD’93), pp.247–256, Washington, DC, 1993.Google Scholar
  8. [8]
    A. Kemper, G. Moerkotte. “Access Support Relations: an Indexing Method for Object Bases”. Information Systems, Vol.17, No.2, pp.117–146, 1992.MATHCrossRefGoogle Scholar
  9. [9]
    D.L. Lee, C.W. Leng. “Partitioned Signature Files: Design Issues and Performance Evaluation”. ACM Transactions on Office Information Systems, Vol.7, No.2, pp.158–180, 1989.CrossRefGoogle Scholar
  10. [10]
    D.L. Lee, C.W. Leng. “A Partitioned Signature File Structure for Multiattribute and Text Retrieval”. Proceedings 6th IEEE International Conference on Data Engineering (ICDE’90), pp.389–397, Los Angeles, CA, 1990.Google Scholar
  11. [11]
    W. Litwin. “Linear Hashing: a New Tool for Files and Table Addressing”. Proceedings 6th International Conference on Very Large Data Bases (VLDB’80), pp.212–223, Montreal, Canada, 1980.Google Scholar
  12. [12]
    T.A. Mueck, M.L. Polaschek. “Index Data Structures in Object-Oriented Databases”. Kluwer Academic Publishers, 1997.Google Scholar
  13. [13]
    E. Tousidou, P. Bozanis, Y. Manolopoulos. “Signature-based Structures for Objects with Set-valued Attributes”. Information Systems, Vol. 27, No. 2, pp.93–121, 2002.MATHCrossRefGoogle Scholar
  14. [14]
    E. Tousidou, A. Nanopoulos, Y. Manolopoulos. “Improved Methods for Signature Tree Construction”. The Computer Journal Vol.43, No.4, pp.301–314, 2000.MATHCrossRefGoogle Scholar
  15. [15]
    Z. Xie, J. Han. “Join Index Hierarchies for Supporting Efficient Navigation in Object-oriented Databases”. Proceedings 20th International Conference on Very Large Data Bases (VLDB’94), pp.522–533, Santiago, Chile, 1994.Google Scholar
  16. [16]
    P. Zezula, F. Rabitti, P. Tiberio. “Dynamic Partitioning of Signature Files”. ACM Transactions on Information Systems, Vol.9, No.4, pp.336–369, 1991.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Yannis Manolopoulos
    • 1
  • Alexandros Nanopoulos
    • 1
  • Eleni Tousidou
    • 1
  1. 1.Aristotle University of ThessalonikiGreece

Personalised recommendations