BATON: A balanced tree structure for peer-to-peer networks

VLDB 2005 - Proceedings of 31st International Conference on Very Large Data Bases

Volumn 2, Issue , 2005, Pages 661-672

  Jagadish, H V ^a,b   Ooi, Beng Chin ^b   Vu, Quang Hieu ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COSTS; DATA STRUCTURES; FAULT TOLERANT COMPUTER SYSTEMS;

BALANCED TREE STRUCTURE; PEER-TO-PEER NETWORKS; ROUTING TABLES;

TREES (MATHEMATICS);

EID: 33745630382     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. K. Aberer. P-Grid: A self-organizing access structure for p2p information systems. In Proceedings of the 6th International Conference on Cooperative Information Systems, 2001.
2. J. Aspnes and G. Shah. Skip graphs. In Proceeding of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 384-393, 2003.
3. A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram. Querying peer-to-peer networks using P-Trees. In WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases, pages 25-30, 2004.
4. P. Ganesan, M. Bawa, and H. Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In Proceedings of the 30th VLDB Conference, 2004.
5. A. Gupta, D. Agrawal, and A. El Abbadi. Approximate range selection queries in peer-to-peer systems. In Proceedings of the First Biennial Conference on Innovative Data Systems Research, 2003.
6. N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. In USENIX Symposium on Internet Technologies and Systems, 2003.
7. D. Karger, F. Kaashoek, I. Stoica, R. Morris, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160, 2001.
8. D. E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley Professional, 1998.
9. M. L. Lee, M. Kitsuregawa, B. C. Ooi, K.-L. Tan, and A. Mondal. Towards self-tuning data placement in parallel database systems. In Proceedings of the 2000 ACM SIGMOD International Conference on the Management of Data, pages 225-236, 2000.
10. T. J. Lehman and M. J. Carey. A study of index structures for main memory database management systems. In Proceedings of the 12th VLDB Conference, pages 294-303, 1986.
11. C. Y. Liau, W. S. Ng, Y. Shu, K.-L. Tan, and S. Bressan. Efficient range queries and fast lookup services for scalable p2p networks. In Proceedings of 2nd International Workshop On Databases, Information Systems and Peer-to-Peer Computing, pages 78-92, 2004.
12. W. Litwin, M.-A. Neimat, and D. A. Schneider. Rp*: A family of order preserving scalable distributed data structures. In Proceedings of the 20th VLDB Conference, 1994.
13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable contentaddressable network. In Proceedings of the 2001 ACM Annual Conference of the Special Interest Group on Data Communication, pages 161-172, 2001.
14. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference of Distributed Systems Platforms, pages 329-350, 2001.
15. O. D. Sahin, A. Gupta, D. Agrawal, and A. El Abbadi. A peer-to-peer framework for caching range queries. In Proceedings of the 20th International Conference on Data Engineering, 2004.
16. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report CSD-01-1141, Univ. California, Berkeley, CA, Apr. 2001.