SkipTree: A Scalable range-queryable distributed data structure for multidimensional data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 298-307

  Alaei, Saeed ^a   Toossi, Mohammad ^a   Ghodsi, Mohammad ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; DECENTRALIZED CONTROL; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; STORAGE ALLOCATION (COMPUTER); TELECOMMUNICATION LINKS; TREES (MATHEMATICS);

CONSTANT FACTOR; MULTIDIMENSIONAL DATA; NODES; PEER-TO-PEER NETWORK;

DATA STRUCTURES;

EID: 33744961395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_31     Document Type: Conference Paper

References (13)

1. K. Aberer. Scalable data access in p2p systems using unbalanced search trees. In Proceedings of Workshop on Distributed Data and Structures(WDAS-2002), 2002.
2. K. Aberer, P. Cudr-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt. P-grid: a self-organizing structured p2p system. SIGMOD Rec., 32(3):29-33, 2003.
3. N. HARVEY, M. JONES, S. SAROIU, M. THEIMER, and A. WOLMAN. Skipnet: A scalable overlay network with practical locality properties, 2003.
4. M. Kaashoek and D. Karger. Koorde: A simple degree-optimal distributed hash table, 2003.
5. D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 36-43. ACM Press, 2004.
6. B. Kroll and P. Widmayer. Distributing a search tree among a growing number of processors. In SIGMOD '94: Proceedings of the 1994 ACM SIGMOD international conference on Management of data, pages 265-276. ACM Press, 1994.
7. D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the evolution of peer-to-peer systems. In PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 233-242. ACM Press, 2002.
8. W. Litwin, M.-A. Neimat, and D. A. Schneider. Rp*: A family of order preserving scalable distributed data struc tures. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, sep 1994.
9. W. Litwin, M.-A. Neimat, and D. A. Schneider. Lh* - a scalable, distributed data structure. ACM Trans. Database Syst., 21(4):480-525, 1996.
10. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: a scalable and dynamic emulation of the butterfly. In PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 183-192. ACM Press, 2002.
11. H. Nazerzadeh and M. Ghodsi. RAQ: A range-queriable distributed data structure (extended version). In Proceeding of Sofsem 2005, 31st Annual Conference on Current Trends in Theory and Practice of Informatics, LNCS 3381, pp. 264-272, February 2005.
12. A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware 2001: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, pages 329-350. Springer-Verlag, 2001.
13. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications, pages 149-160.