Skip to main content
SpringerLink
Log in
Book cover

International Conference on Database and Expert Systems Applications

DEXA 2001: Database and Expert Systems Applications pp 340–349Cite as

The SH-tree: A Super Hybrid Index Structure for Multidimensional Data

  • Conference paper
  • First Online:

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

Abstract

Nowadays feature vector based similarity search is increasingly emerging in database systems. Consequently, many multidimensional data index techniques have been widely introduced to database researcher community. These index techniques are categorized into two main classes: SP (space partitioning)/KD-tree-based and DP (data partitioning)/R-tree-based. Recently, a hybrid index structure has been proposed. It combines both SP/KDtree-based and DP/R-tree-based techniques to form a new, more efficient index structure. However, weaknesses are still existing in techniques above. In this paper, we introduce a novel and flexible index structure for multidimensional data, the SH-tree (Super Hybrid tree). Theoretical analyses show that the SHtree is a good combination of both techniques with respect to both presentation and search algorithms. It overcomes the shortcomings and makes use of their positive aspects to facilitate efficient similarity searches.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Gaede, O. Günther. Multidimensional Access Methods. ACM Computing Surveys, Vol. 30,No. 2, June 1998.

    Google Scholar 

  2. K. Chakrabarti, S. Mehrotra. The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces. Proc. of 15th International Conference on Data Engineering 1999. IEEE Computer Society.

    Google Scholar 

  3. King-Ip Lin, H.V. Jagadish, C. Faloutsos. The TV-Tree: An Index Structure for High-Dimensional Data. VLDB Journal, Vol. 3,No. 1, January 1994.

    Google Scholar 

  4. N. Katayama, S. Satoh. The SR-Tree: An Index Structure for High Dimensional Nearest Neighbor Queries. Proc. of the ACM SIGMOD International Conference on Management of Data, 1997.

    Google Scholar 

  5. D.A. White, R. Jain. Similarity Indexing with the SS-Tree. Proc. of the 20th International Conference on Data Engineering, 1996. IEEE Computer Society.

    Google Scholar 

  6. J.T. Robinson. The k-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes. Proc. of ACM SIGMOD International Conference on Management of Data, 1981.

    Google Scholar 

  7. D.B. Lomet, B. Salzberg. The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. ACM Trans. on Database Systems, Vol. 15,No. 4, Dec. 1990.

    Google Scholar 

  8. A. Henrich, H.W. Six, P. Widmayer. The LSD Tree: Spatial Access to Multidimensional Point and Nonpoint Objects. Proc. of 15th VLDB, August 1989.

    Google Scholar 

  9. A. Henrich. The LSD/sup h/-tree: An Access Structure for Feature Vectors. Proc. of 14th International Conference on Data Engineering, 1998. IEEE Computer Society.

    Google Scholar 

  10. J. Nievergelt, H. Hinterberger, K.C. Sevcik. The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. on Database Systems Vol. 9,No. 1, March 1984.

    Google Scholar 

  11. M. Freeston. The BANG file: A new kind of grid file. Proc. of the ACM SIGMOD Annual Conference on Management of Data, 1987.

    Google Scholar 

  12. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. Proc. of ACM SIGMOD Conference, 1984.

    Google Scholar 

  13. T.K. Sellis, N. Roussopoulos, C. Faloutsos. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. Proc. of 13th VLDB,September 1987.

    Google Scholar 

  14. N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Conference 1990.

    Google Scholar 

  15. S. Berchtold, D.A. Keim, H.P. Kriegel. The X-tree: An Index Structure for High-Dimensional Data. Proc. of 22nd VLDB, September 1996.

    Google Scholar 

  16. S. Berchtold, C. Böhm, H.P. Kriegel. The Pyramid Technique: Towards Breaking the Curse of Dimensionality. Proc. of ACM SIGMOD International Conference on Management of Data, June 1998.

    Google Scholar 

  17. J. Küng, J. Palkoska. An Incremental Hypercube Approach for Finding Best Matches for Vague Queries. Proc. of the 10th International Workshop on Database and Expert Systems Applications, DEXA 99. IEEE Computer Society.

    Google Scholar 

  18. R. Bayer. The Universal B-Tree for Multidimensional Indexing. Technical Report TUMI9637, November 1996. (http://mistral.informatik.tu-muenchen.de/results/publications/)

  19. K. Chakrabarti, S. Mehrotra. High Dimensional Feature Indexing Using Hybrid Tree. Technical Report, Department of Computer Science, University of Illinois at Urbana Champaign. (http://www-db.ics.uci.edu/pages/publications/1998/TR-MARS-98-14.ps)

  20. P. Ciaccia, M. Patella, P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. Proc. of VLDB 1997.

    Google Scholar 

  21. D. Greene. An implementation and performance analysis of spatial data access methods. Proc. of 5th International Conference on Data Engineering 1989. IEEE Computer Society.

    Google Scholar 

  22. A. Henrich. A hybrid split strategy for k-d-tree based access structures. Proc. of the fourth ACM workshop on Advances on Advances in geographic information systems, 1997.

    Google Scholar 

  23. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD, Proc. of Annual Meeting, June 1984.

    Google Scholar 

  24. N. Beckmann, H.P. Kriegel, R. Schneider, B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. Proc. of ACM SIGMOD International Conference on Management of Data, 1990.

    Google Scholar 

  25. R. Kurniawati, J.S. Jin, J.A. Shepherd. The SS+-tree: An Improved Index Structure for Similarity Searches in a High-Dimensional Feature Space. SPIE Storage and Retrieval for Image and Video Databases V, San Jose, CA, 1997.

    Google Scholar 

  26. N. Roussopoulos, S. Kelley, F. Vincent. Nearest neighbor queries. Proc. of ACM SIGMOD International Conference on Management of Data, 1995.

    Google Scholar 

  27. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, Z. Protopapas. Fast Nearest Neighbor Search in Medical Image Databases. Proc. of VLDB 1996.

    Google Scholar 

  28. B.C. Ooi, K.J. McDonell, R. Sacks-Davis. Spatial kd-Tree: A Data Structure for Geographic Databases. Proc. of COMPSAC 87, Tokyo, Japan.

    Google Scholar 

  29. S. Brin. Near Neighbor Search in Large Metric Spaces. Proc. VLDB 1995.

    Google Scholar 

  30. FAW Institute, Johannes Kepler University Linz. VASIS-Vague Searches in Information Systems. (http://www.faw.at/cgi-pub/e_showprojekt.pl?projektnr=10)

  31. D.T. Khanh, J. Küng, R. Wagner. The SH-tree: A Super Hybrid Index Structure for Multidimensional Data. Technical Report, VASIS Project. (http://www.faw.uni-linz.ac.at)

  32. C. Faloutsos, M. Ranganathan, Y. Manolopoulos. Fast subsequence matching in time-series databases. ACM SIGMOD International Conference on Management of Data, 1994.

    Google Scholar 

  33. Thomas Seidl, Hans-Peter Kriegel: “Efficient User-Adaptable Similarity Search in Large Multimedia Databases”. VLDB 1997.

    Google Scholar 

  34. S. Berchtold, H.P. Kriegel. S3: Similarity Search in CAD Database Systems. Proc. of ACM SIGMOD International Conference on Management of Data, 1997.

    Google Scholar 

  35. T. Bozkaya, M. Ozsoyoglu. Indexing Large Metric Spaces for Similarity Search Queries. ACM Transactions on Database Systems. Vol. 24,No. 3, September 1999.

    Google Scholar 

  36. A. Henrich. Improving the performance of multi-dimensional access structures based on kd-trees. Proc. of the 12nd International Conference on Data Engineering, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Applied Knowledge Processing (FAW), University of Linz, Austria

    Tran Khanh Dang, Josef Küng & Roland Wagner

Authors
  1. Tran Khanh Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Josef Küng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roland Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Klagenfurt, IFI -IWAS Universitaetsstr. 65, 9020, Klagenfurt, Austria

    Heinrich C. Mayr

  2. Faculty of Electrical Engineering, Czech Technical University, Technicka 2, 166 27, Prague 6, Czech Republic

    Jiri Lazansky

  3. School of Computer and Information Science, University of South Australia, Mawson Lakes Campus, Mawson Lakes, SA, 5095

    Gerald Quirchmayr

  4. Department of Information Systems, Technical University of Munich, Orleanstr. 34, 81667, Munich, Germany

    Pavel Vogel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khanh Dang, T., Küng, J., Wagner, R. (2001). The SH-tree: A Super Hybrid Index Structure for Multidimensional Data. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-44759-8_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42527-4

  • Online ISBN: 978-3-540-44759-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation