Abstract
We introduce SONAR, a structured overlay to store and retrieve objects addressed by multi-dimensional names (keys). The overlay has the shape of a multi-dimensional torus, where each node is responsible for a contiguous part of the data space. A uniform distribution of keys on the data space is not necessary, because denser areas get assigned more nodes. To nevertheless support logarithmic routing, SONAR maintains, per dimension, fingers to other nodes, that span an exponentially increasing number of nodes. Most other overlays maintain such fingers in the key-space instead and therefore require a uniform data distribution. SONAR, in contrast, avoids hashing and is therefore able to perform range queries of arbitrary shape in a logarithmic number of routing steps—independent of the number of system- and query-dimensions.
SONAR needs just one hop for updating an entry in its routing table: A longer finger is calculated by querying the node referred to by the next shorter finger for its shorter finger. This doubles the number of spanned nodes and leads to exponentially spaced fingers.
Part of this work was carried out under the SELFMAN and XtreemOS projects funded by the European Commission.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aberer, K., Onana Alima, L., Ghodsi, A., Girdzijauskas, S., Haridi, S., Hauswirth, M.: The essence of P2P: A reference architecture for overlay networks. In: P2P 2005 (2005)
Andrzejak, A., Xu, Z.: Scalable, efficient range queries for Grid information services. In: P2P 2002 (2002)
Aspnes, J., Shah, G.: Skip graphs. In: SODA (January 2003)
Banaei-Kashani, F., Shahabi, C.: SWAM: A family of access methods for similarity-search in peer-to-peer data networks. In: CIKM (November 2004)
Bentley, J.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18(9) (1975)
Bharambe, A., Agrawal, M., Seshan, S.: Mercury: Supporting scalable multi-attribute range queries. In: ACM SIGCOMM 2004 (August 2004)
Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Shenker, S., Hellerstein, J.: A Case Study in building layered DHT applications. In: SIGCOMM 2005 (August 2005)
Gaede, V., Günther, O.: Multidimensional access methods. ACM Computing Surveys, 30(2) (1998)
Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: Multi-dimensional queries in P2P systems. In: WebDB 2004 (2004)
Karger, D., Lehman, E., Leighton, T., Panigrah, R., Levine, M., Lewin, D.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: ACM Sympos. Theory of Comp. (May 1997)
Karger, D., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, Springer, Heidelberg (2005)
Oppenheimer, D., Albrecht, J., Patterson, D., Vahdat, A.: Design and implementation tradeoffs for wide-area resource discovery. In: 14th IEEE Symposium on High Performance Distributed Computing (HPDC-14) (July 2005)
Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM (June 1990)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM SIGCOMM 2001 ( August 2001)
Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: Proceedings of the USENIX Annual Technical Conference (June 2004)
Schmidt, C., Parashar, M.: Enabling flexible queries with guarantees in P2P systems. IEEE Internet Computing, 19–26 (May/June 2004)
Schütt, T., Schintke, F., Reinefeld, A.: Structured overlay without consistent hashing: Empirical results. In: GP2PC 2006 (May 2006)
Stoica, I., Morris, R., Kaashoek, M.F., Karger, D., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet application. In: ACM SIGCOMM 2001 (August 2001)
Zipf, G.: Relative frequency as a determinant of phonetic change. Harvard Studies in Classical Philiology (1929)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schütt, T., Schintke, F., Reinefeld, A. (2007). A Structured Overlay for Multi-dimensional Range Queries. In: Kermarrec, AM., Bougé, L., Priol, T. (eds) Euro-Par 2007 Parallel Processing. Euro-Par 2007. Lecture Notes in Computer Science, vol 4641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74466-5_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-74466-5_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74465-8
Online ISBN: 978-3-540-74466-5
eBook Packages: Computer ScienceComputer Science (R0)