Abstract
Content-Addressable Networks (CAN) are able to manage huge sets of (key,value)-pairs and cope with very high workloads. They follow the peer-to-peer (P2P) paradigm in order to build scalable, distributed data structures on top of the Internet. CAN are designed to drive Internet-scale applications like distributed search engines, multimedia retrieval systems and more. In these scenarios, the nearest-neighbor (NN) query model is very natural: the user specifies a query key, and the engine responds with the set of query results closest to the key. Implementing NN queries in CAN is challenging. As with any P2P system, global knowledge about the peers responsible for parts of the query result is not available, and the communication overhead is the most critical factor. In this paper, we present our approach to realize efficient NN queries in CAN. We evaluate our NN query processing scheme by experiments with a CAN implementation in a setting derived from web applications. The results of our experiments with 10.000 peers are positive: even large result sets with a precision of 75% can be obtained by invoking less than 1.6 peers on average. In addition, our NN protocol is suitable for prefetching in settings with sequences of consecutive queries for similar keys.
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
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content- Addressable Network. In: Proceedings of the ACM SIGCOMM 2001 Conference. ACM Press, New York (2001)
Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex queries in DHT-based peer-to-peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002)
Buchmann, E., Böhm, K.: How to Run Experiments with Large Peer-to-Peer Data Structures. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium, Santa Fe, USA (2004)
Tauscher, L., Greenberg, S.: How people revisit web pages: empirical findings and implications for the design of history systems. International Journal of Human-Computer Studies (1997)
Litwin, W., Neimat, M.A., Schneider, D.A.: LH* - Linear Hashing for Distributed Files. In: Buneman, P., Jajodia, S. (eds.) Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C. ACM Press, New York (1993)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer- To-Peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM 2001 Conference (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (2001)
Indyk, P., Motwani, R., Raghavan, P., Vempala, S.: Locality-Preserving Hashing in Multidimensional Spaces. In: Proceedings of the Twenty-Ninth Annual ACMSymposium on Theory of Computing, El Paso, Texas (1997)
Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the VLDB 1999. Morgan Kaufmann, San Francisco (1999)
Sattler, K.U., Rösch, P., Buchmann, E., Böhm, K.: A Physical Query Algebra for DHTbased P2P Systems. In: Proceedings of the 6thWorkshop on Distributed Data and Structures, Lausanne, Switzerland (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Buchmann, E., Böhm, K. (2005). Efficient Evaluation of Nearest-Neighbor Queries in Content-Addressable Networks. In: Hemmje, M., Niederée, C., Risse, T. (eds) From Integrated Publication and Information Systems to Information and Knowledge Environments. Lecture Notes in Computer Science, vol 3379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31842-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-31842-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24551-3
Online ISBN: 978-3-540-31842-2
eBook Packages: Computer ScienceComputer Science (R0)