Abstract
K-nearest neighbor (KNN) search in high dimensional space is essential for database applications, especially multimedia database applications, because images and audio clips are always modeled as high dimensional vectors. However, performance of existing indexing methods degrades dramatically as the dimensionality increases. In this paper, we propose a novel polar coordinate based indexing method, called iPoc, for efficient KNN search in high dimensional space. First, data space is initially partitioned into hypersphere regions, and then each hypersphere is further refined into hypersectors via hyperspherical surface clustering. After that, a series of local polar coordinate systems can be derived from hypersectors, taking advantage of the geometric characters of hypersectors. During search processing, iPoc can effectively prune query-unrelated data points by estimating the lower and upper bounds in both radial coordinate and angle coordinate. Furthermore, we design a key mapping scheme to merge keys measured by independent local polar coordinates into the global polar coordinates. Finally, the global polar coordinates are indexed by a traditional 2-dimensional spatial index, e.g., R-tree. Extensive experiments on real audio datasets and synthetic datasets confirm the effectiveness and efficiency of our proposal and prove that iPoc is more efficient than the existing high dimensional KNN search methods.
The work is supported by the National Natural Science Foundation of China (No. 60803016), the National Basic Research Program of China (No. 2007CB310802) and the National High Technology Research and Development Program of China (No. 2008AA042301).
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
Bentley, J.L.: Multidimensional binary search trees in database applications. IEEE Trans. Software Eng. 5(4), 333–340 (1979)
Weber, R., Schek, H., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, pp. 194–205 (1998)
Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: ACM SIGMOD, pp. 563–576 (2009)
Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM 51(1), 117–122 (2008)
Shen, H., Ooi, B., Zhou, X.: Towards effective indexing for very large video sequence database. In: ACM SIGMOD, p. 741 (2005)
Cui, B., Ooi, B.C., Su, J., Tan, K.L.: Contorting high dimensional data for efficient main memory processing. In: ACM SIGMOD, pp. 479–490 (2003)
Cha, G., Zhu, X., Petkovic, D., Chung, C.: An efficient indexing method for nearest neighbor searches in high-dimensional image databases. IEEE Transactions on Multimedia 4(1), 76–87 (2002)
Berchtold, S., Böhm, C., Kriegal, H.: The pyramid-technique: towards breaking the curse of dimensionality. In: ACM SIGMOD, pp. 142–153 (1998)
Apaydin, T., Ferhatosmanoglu, H.: Access structures for angular similarity queries. IEEE Transactions on Knowledge and Data Engineering, 1512–1525 (2006)
Jagadish, H., Ooi, B., Tan, K., Yu, C., Zhang, R.: idistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS) 30(2), 397 (2005)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: ACM SIGMOD, pp. 47–57 (1984)
Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: ACM SIGMOD, pp. 301–312 (2003)
Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459–468 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Z., Wang, C., Zou, P., Zheng, W., Wang, J. (2010). iPoc: A Polar Coordinate Based Indexing Method for Nearest Neighbor Search in High Dimensional Space. In: Chen, L., Tang, C., Yang, J., Gao, Y. (eds) Web-Age Information Management. WAIM 2010. Lecture Notes in Computer Science, vol 6184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14246-8_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-14246-8_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14245-1
Online ISBN: 978-3-642-14246-8
eBook Packages: Computer ScienceComputer Science (R0)