Abstract
Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized, and decentralized memory structure. In this paper, a simple range-queriable distributed data structure, called RAQ, is proposed to efficiently support exact match and range queries over multi-dimensional data. In RAQ, the key space is partitioned among the network with n nodes, in which each element has links to O(log n) other elements. We will show that the look-up query for a specified key can be done via O(log n) message passing. Also, RAQ handles range-queries in at most O(log n) communication steps.
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
Aspnes, J., Kirschz, Y., Krishnamurthy, A.: Load balancing and locality in range-queriable data structures. In: Prod., PODC the twenty-third annual ACM symposium on Principles of distributed computing
Aspnes, J., Shah, G.: Skip Graphs. In: Proceedings of Symposium on Discrete Algorithms (2003)
Banaei-Kashani, F., Shahabi, C.: SWAM: Small-World Access Model. In: Proc. CIKM 2004, Thirteenth Conference on Information and Knowledge Management CIKM 2004 (November 2004)
Gnutella, http://gnutella.wego.com
Gao, J., Steenkiste, P.: An Adaptive Protocol for Efficient Support of Range Queries in DHT-based Systems. In: Proc. 12th IEEE International Conference on Network Protocols (ICNP 2004), Berlin, Germany (October 2004)
Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Proc. of Fourth USENIX Symposium on Internet Technologies and Systems (2003)
Karger, D.R., Ruhl, M.: Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. In: ACM Symposium on Parallelism in Algorithms and Architectures (June 2004)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (STOC 2000), pp. 163–170 (2000)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the buttery. In: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 183–192 (2002)
Nazerzade, H.: Making Querical Data Networks Navigable. In: Proc. ICI 2004 International Conference on Informatic (September 2004)
Ratnasamy, S., Francis, P., Handley, M., Karp, R.M.: A scalable content-addressable network. In: Proc. ACM SIGCOMM 2001, pp. 161–172 (2001)
Ratnasamy, S., Hellerstein, J., Shenker, S.: Range Queries over DHTs. Technical Report IRB-TR-03-009, Intel Research (2003)
Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Seidel, R.: Exact upper bounds for the number of faces in d-dimensional Voronoi diagrams. DIMACS Series, vol. 4. American Mathematical Society, Providence (1991)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM 2001, pp. 149–160 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nazerzadeh, H., Ghodsi, M. (2005). RAQ: A Range-Queriable Distributed Data Structure. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-30577-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24302-1
Online ISBN: 978-3-540-30577-4
eBook Packages: Computer ScienceComputer Science (R0)