Abstract
Although P2P systems are widely used for sharing resources and retrieving information among numerous users, one of the fundamental challenges faced by P2P systems is to construct an overlay network, which can efficiently process complex queries on high-dimensional data. In this paper, we propose a Semantic Cluster Based Overlay structure (SCBO), in which peers are clustered into semantic clusters according to their data semantic information, and then these clusters are formed into a semantic overlay network. And an efficient KNN query processing algorithm is proposed for high-dimensional data objects based on SCBO structure. Experiments on real and synthetic data set demonstrate that SCBO and the proposed KNN query algorithms have well performance and scalability.
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
Liu, B., Lee, W.-C., Lee, D.L.: Suppporting complex multi-dimensional queries in p2p systems. In: Proc. of ICDCS, pp. 155–164 (2005)
Li, M., Lee, W.-C., Sivasubramaniam, A.: Semantic Small World: An Overlay Network for Peer-to-Peer Search. In: Proc. of ICNP, pp. 238–248 (2004)
Li, M., Lee, W.-C., Sivasubramaniam, A., Zhao, J.: Supporting K nearest neighbors query on high-dimensional data in P2P systems. In: Proc. of Front. Comput. Sci. China, pp. 234–247 (2008)
Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proc. of SIGCOMM, pp. 175–185 (2003)
Jagadish, H.V., Ooi, B.C., Vu, Q.H., Zhang, R., Zhou, A.: Vbi-tree: A peer-to-peer framework for supporting multi-dimensional indexing. In: Proc. of ICDE, pp. 34–43 (2006)
Ganesan, P., Bawa, M., Garcia-Molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: Proc. of VLDB, pp. 444–455 (2004)
Chen, H., Jin, H., Wang, J., Chen, L., Liu, Y., Ni, L.: Efficient Multi-keyword Search over P2P Web. In: Proc. of WWW, pp. 989–997 (2008)
Crainiceanu, A., Linga, P., Machanavajjhala, A., Gehrke, J., Shanmugasundaram, J.: P-Ring: An Efficient and Robust P2P Range Index Structure. In: Proc. Of SIGMOD, pp. 223–234 (2007)
Cha, G.-H., Zhu, X., Petkovic, D., Chung, C.-W.: An Efficient Indexing Method for Nearest Neighbor Searches in High-Dimensional Image Databases. In: Proc. of TMM, pp. 76–87 (2002)
Tang, Y., Zhou, S., Xu, J.: LigHT: A Query-Efficient yet Low-Maintenance Indexing Scheme over DHTs. In: Proc. of TKDE, pp. 59–75 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Qiao, B., Ding, L., Wang, X., Wei, Y. (2012). An Efficient KNN Query Processing Approach on High-Dimensional Data Objects in P2P Systems. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol 124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25781-0_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-25781-0_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25780-3
Online ISBN: 978-3-642-25781-0
eBook Packages: EngineeringEngineering (R0)