Brushwood: Distributed trees in peer-to-peer systems

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

Volumn 3640 LNCS, Issue , 2005, Pages 47-57

  Zhang, Chi ^a   Krishnamurthy, Arvind ^b   Wang, Randolph Y ^a  

^a PRINCETON UNIVERSITY   (United States)

^b YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; LARGE SCALE SYSTEMS; TREES (MATHEMATICS); VIRTUAL REALITY;

DISTRIBUTED TREES; P2P ENVIRONMENTS; PEER-TO-PEER SYSTEMS; QUERY PROCESSING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646040986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558989_5     Document Type: Conference Paper

References (20)

1. A. Andrzejak and Z. Xu. Scalable, efficient range queries for grid information services. In Second IEEE International Conference on Peer-to-Peer Computing, 2002.
2. J. Aspnes, J. Kirsch, and A. Krishnamurthy. Load balancking and locality in range-queriable data structures. In Proc. of PODC, 2004.
3. J. Aspnes and G. Shah. Skip Graphs. In Proceedings of Symposium on Discrete Algorithms, 2003.
4. B. Awerbuch and C. Scheideler. Peer-to-peer systems for Prefix Search. In PODC, 2003.
5. J. L. Benlley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9), 1975.
6. A. R. Bharambe, M Agrawal, and S. Seshan. Mercury: Supporting scalable multi-attribute range queries. In SIGCOMM, 2004.
7. D. Ellard, J. Ledlie, P. Malkani, and M. Seltzer. Passive NFS tracing email and research workloads. In USENIX Conference on File and Storage Technologies, 2003.
8. M. Harren, J. Hellerstein, R. Huebsch, B. Loo, S. Shenker, and I. Sloica. Complex queries in dht-based peer-to-peer networks. In Proceedings of IPTPS02, 2002.
9. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. SkipNet: A Scalable Overlay Network with Practical Locality Properties. In USITS, 2003.
10. T. Johnson and P. Krishna. Lazy updates for distributed search structures. In Proceedings of ACM SIGMOD, 1993.
11. D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In IPTPS, 2004.
12. P. Keleher, B. Bhattacharjee, and B. Silaghi. Are virtualized overlay networks too much of a good thing. In Proc. of IPTPS, 2002.
13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of ACM SIGCOMM, 2001.
14. S. Ratnasamy, J. Hellerslein, and S. Shenker. Range Queries over DHTs. Technical Report IRB-TR-03-009, Intel Research, 2003.
15. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In ICDCS, 2002.
16. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCOMM, 2001.
17. C. Tang, Z. Xu, and S. Dwarkadas. Peer-to-peer information retrieval using self-organizing semanlic overlay networks. In Proceedings of SIGCOMM, 2003.
18. R. van Renesse and K. P. Birman. Scalable management and data mining using astrolabe. In IPTPS, 2002.
19. C. Zhang, A. Krishnamurthy, and R. Y. Wang. Skipindex: Towards a scalable peer-to-peer index service for high dimensional data. Technical Report TR-703-04, Princeton Univ. CS, 2004, http://www.cs.princeton.edu/~chizhang/ skipindex.pdf.
20. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 2004.