Abstract
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can exceed the time required for performing a linear scan on the entire dataset. To alleviate this dimensionality curse, indexing schemes such as locality sensitive hashing (LSH) and M-trees were proposed to perform approximate searches. In this paper, we propose a hypersphere indexer, named Hydex, to perform such searches. Hydex partitions the data space using concentric hyperspheres. By exploiting geometric properties, Hydex can perform effective pruning. Our empirical study shows that Hydex enjoys three advantages over competing schemes for achieving the same level of search accuracy. First, Hydex requires fewer seek operations. Second, Hydex can maintain sequential disk accesses most of the time. And third, it requires fewer distance computations.
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.
References
Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. In: Proceedings of the 5th SODA, pp. 573–582 (1994)
Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbour searching in fixed dimensions. JACMÂ 45(6) (1998)
Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R * tree: An efficient and robust access method for points and rectangles. In: ACM SIGMOD Intl. Conf. on Mgmt. of Data, pp. 322–331 (1990)
Berchtold, S., Keim, D., Kriegel, H.: The X-tree: An index structure for high-dimensional data. In: 22nd Conference on Very Large Databases, pp. 28–39 (1996)
Bozkaya, T., Ozsoyoglu, M.: Indexing large metric spaces for similarity search queries. ACM Trans. on Database Systems 24(3), 361–404 (1999)
Brin, S.: Near neighbor search in large metric spaces. The VLDB Journal (1995)
Buhler, J.: Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics 17, 419–428 (2001)
Ciaccia, P., Patella, M.: Pac nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In: Proceedings of International Conference on Data Engineering, pp. 244–255 (2000)
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proc. 23rd Int. Conf. on Very Large Databases, pp. 426–435 (1997)
Clarkson, K.: An algorithm for approximate closest-point queries. In: Proceedings of the 10th SCG, pp. 160–164 (1994)
Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. The VLDB Journal, 518–529 (1999)
Katayama, N., Satoh, S.: The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: ACM SIGMOD Int. Conf. on Mgmt. of Data, pp. 369–380 (1997)
Li, C., Chang, E., Garcia-Molina, H., Wilderhold, G.: Clindex: Approximate similarity queries in high-dimensional spaces. IEEE Transactions on Knowledge and Data Engineering (TKDE) 14(4), 792–808 (2002)
Lin, K.-I., Jagadish, H.V., Faloutsos, C.: The TV-tree: An index structure for high-dimensional data. VLDB Journal: Very Large Data Bases 3(4), 517–542 (1994)
Manjunath, B.S.: Airphoto dataset, http://vision.ece.ucsb.edu/download.html
Navarro, G.: Searching in metric spaces by spatial approximation. In: SPIRE/CRIWG, pp. 141–148 (1999)
Patella, M.: M-tree website, http://www-db.deis.unibo.it/Mtree/download.html
Qamra, A., Meng, Y., Chang, E.Y.: Enhanced perceptual distance functions and indexing for image replica recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI)Â 27 (2005)
Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. 24th Int. Conf. Very Large Data Bases, VLDB, pp. 194–205, 24–27 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Panda, N., Chang, E.Y., Qamra, A. (2006). Hypersphere Indexer. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_63
Download citation
DOI: https://doi.org/10.1007/11827405_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37871-6
Online ISBN: 978-3-540-37872-3
eBook Packages: Computer ScienceComputer Science (R0)