Skip to main content

A New High-Dimensional Index Structure Using a Cell-Based Filtering Technique

  • Conference paper
  • First Online:
Current Issues in Databases and Information Systems (ADBIS 2000, DASFAA 2000)

Abstract

In general, multimedia database applications require to support similarity search for content-based retrieval on multimedia data, i.e., image, animation, video, and audio. Since the similarity of two multimedia objects is measured as the distance between their feature vectors, the similarity search corresponds to a search for the nearest neighbors in the feature vector space. In this paper, we propose a new high-dimensional indexing scheme using a cell-based filtering technique which supports the nearest neighbor search efficiently. Our Cell-Based Filtering (CBF) scheme divides a high-dimensional feature vector space into cells, like VA-file. However, in order to make a better effect on filtering, our CBF scheme performs additional filtering based on a distance between an object feature vector and the center of a cell including it, in addition to filtering based on cell signatures before accessing a data file. From our experiment using high-dimensional feature vectors, we show that our CBF scheme achieves better performance on the nearest neighbor search than its competitors, such as VA-File and X-tree.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Robinson J.T., “The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes”, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 10–18, 1981.

    Google Scholar 

  2. Henrich, A., “The LSDh-tree: An Access Structure for Feature Vectors”, Proc. 14th Int. Conf. on Data Engineering, Orlando, 1998

    Google Scholar 

  3. D.A. White and R. Jain, “Similarity Indexing: Algorithms and Performance”, InProc. Of the SPIE: Storage and Retrieval for Image and Video Databases IV, Vol. 2670, pp. 62–75, 1996.

    Google Scholar 

  4. D. A. White and R. Jain, “Similarity Indexing with the SS-tree’, In Proc. 12th Intl. Conf. On Data Engineering, New Orleans, pp. 516–523, 1996.

    Google Scholar 

  5. Katayama N., Satoh S., “The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries”, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 369–380, 1997.

    Google Scholar 

  6. Berchtold S., Bohm C, Kriegel H.-P., “The Pyramid-Tree: Indexing Beyond the Curse of Dimensionality”, Proc. ACM SIGMODE Int. Conf. on Management of Data, Seattle, 1998

    Google Scholar 

  7. H.I. Lin, H. Jagadish, and C. Faloutsos, “The TV-tree: An Index Structure for High Dimensional Data”, VLDB Journal, Vol. 3, pp. 517–542, 1995.

    Article  Google Scholar 

  8. S. Berchtold, D. A. Keim, H-P. Kriegel, “The X-tree: An Index Structure for High-Dimensional Data, Proceedings of the 22nd VLDB Conference, pp. 28–39, 1996.

    Google Scholar 

  9. Roger Weber, Hans-Jorg Schek, Stephen Blott: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. VLDB 1998: 194–205

    Google Scholar 

  10. Roger Weber, Stephen Blott, “ An Approximation-Based Data Structure for Similarity Search”, Technical report Nr. 24, ESPRIT project HERMES (no. 9141), October 1997.

    Google Scholar 

  11. Roussopoulos N., Kelley S., Vincent F., “Nearest Neighbor Queries”, Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 71–79, 1995.

    Google Scholar 

  12. Faloutsos. C. “Design of a Signature File Method that Accounts for Non-Uniform Occurrence and Query Frequencies”, ACM SIGMOD, 165–170, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Han, S.G., Chang, J.W. (2000). A New High-Dimensional Index Structure Using a Cell-Based Filtering Technique. In: Štuller, J., Pokorný, J., Thalheim, B., Masunaga, Y. (eds) Current Issues in Databases and Information Systems. ADBIS DASFAA 2000 2000. Lecture Notes in Computer Science, vol 1884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44472-6_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44472-6_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67977-6

  • Online ISBN: 978-3-540-44472-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics