Abstract
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network. The SkipTree supports range queries as well as single point queries which are routed in O(log n) hops. SkipTree is fully decentralized with each node being connected to O(log n) other nodes. The memory usage for maintaining the links at each node is O(log n log log n) on average and O(log2 n) in the worst case. Load balance is also guaranteed to be within a constant factor.
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
Aberer, K.: Scalable data access in p2p systems using unbalanced search trees. In: Proceedings of Workshop on Distributed Data and Structures (WDAS 2002) (2002)
Aberer, K., Cudr-Mauroux, P., Datta, A., Despotovic, Z., Hauswirth, M., Punceva, M., Schmidt, R.: P-grid: a self-organizing structured p2p system. SIGMOD Rec. 32(3), 29–33 (2003)
Harvey, N., Jones, M., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: A scalable overlay network with practical locality properties (2003)
Kaashoek, M., Karger, D.: Koorde: A simple degree-optimal distributed hash table (2003)
Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: SPAA 2004: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 36–43. ACM Press, New York (2004)
Kroll, B., Widmayer, P.: Distributing a search tree among a growing number of processors. In: SIGMOD 1994: Proceedings of the 1994 ACM SIGMOD international conference on Management of data, pp. 265–276. ACM Press, New York (1994)
Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: PODC 2002: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pp. 233–242. ACM Press, New York (2002)
Litwin, W., Neimat, M.-A., Schneider, D.A.: Rp*: A family of order preserving scalable distributed data struc tures. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB 1994, Proceedings of 20th International Conference on Very Large Data Bases (September 1994)
Litwin, W., Neimat, M.-A., Schneider, D.A.: Lh* – a scalable, distributed data structure. ACM Trans. Database Syst. 21(4), 480–525 (1996)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: PODC 2002: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pp. 183–192. ACM Press, New York (2002)
Nazerzadeh, H., Ghodsi, M.: RAQ: A range-queriable distributed data structure (extended version). In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 269–277. Springer, Heidelberg (2005)
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)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications, pp. 149–160
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
Alaei, S., Toossi, M., Ghodsi, M. (2005). SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_31
Download citation
DOI: https://doi.org/10.1007/11602613_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)