Range queries in trie-structured overlays

Proceedings - Fifth IEEE International Conference on Peer-to-Peer Computing, P2P 2005

Volumn 2005, Issue , 2005, Pages 57-66

  Datta, Anwitaman ^a   Hauswirth, Manfred ^a   John, Renault ^a   Schmidt, Roman ^a   Aberer, Karl ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; QUERY LANGUAGES;

ALGORITHMIC COMPLEXITY; DISTRIBUTED QUERY PROCESSING; RANGE QUERIES; TRIE-STRUCTURED OVERLAYS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33845353826     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2005.31     Document Type: Conference Paper

References (24)

1. K. Aberer. P-Grid: A self-organizing access structure for P2P information systems. In Sixth International Conference on Cooperative Information Systems (CoopIS), 2001.
2. K. Aberer. Efficient Search in Unbalanced, Randomized Peer-To-Peer Search Trees. Technical Report IC/2002/79, Ecole Polytechnique Fédérale de Lausanne (EPFL), 2002.
3. K. Aberer. Scalable Data Access in P2P Systems Using Unbalanced Search Trees. In 4th Workshop on Distributed Data and Structures (WDAS'2002), 2002.
4. K. Aberer, P. Cudré-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt. P-Grid: A Self-organizing Structured P2P System. ACM SIGMOD Record, 32(3), 2003.
5. K. Aberer, A. Datta, M. Hauswirth, and R. Schmidt. Indexing data-oriented overlay networks. 31st International Conference on Very Large Databases (VLDB), 2005.
6. K. Aberer and M. Punceva. Efficient Search in Structured Peer-to-Peer Systems: Binary v.s. k-ary Unbalanced Tree Structures. In International Workshop On Databases, Information Systems and Peer-to-Peer Computing (DBISP2P), 2003.
7. J. Aspnes, J. Kirsch, and A. Krishnamurthy. Load balancing and locality in range-queriable data structures. In ACM PODC, 2004.
8. J. Aspnes and G. Shah. Skip graphs. In ACM-SIAM Symposium on Discrete Algorithms, Jan. 2003.
9. A. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting scalable multi-attribute range queries. SIGCOMM Computer Communication Review, 34(4):353-366, 2004.
10. B. Chun, D. Culler, T. Roscoe, A. Bavier, L. Peterson, M. Wawrzoniak, and M. Bowman. PlanetLab: An Overlay Testbed for Broad-Coverage Services. ACM SIGCOMM Computer Communication Review, 33(3), July 2003.
11. N. Daswani, H. Garcia-Molina, and B. Yang. Open Problems in Data-Sharing Peer-to-Peer Systems. In 9th International Conference on Database Theory (ICDT), 2003.
12. A. Datta, M. Hauswirth, and K. Aberer. Updates in Highly Unreliable, Replicated Peer-to-Peer Systems. In International Conference on Distributed Computing Systems (ICDCS), 2003.
13. A. Gupta, D. Agrawal, and A. E. Abbadi. Approximate Range Selection Queries in Peer-to-Peer Systems. In 1st Biennial Conference on Innovative Data Systems Research (CIDR 2003), 2003.
14. M. Harren, J. M. Hellerstein, R. Huebsch, B. T. Loo, S. Shenker, and I. Stoica. Complex Queries in DHT-based Peer-to-Peer Networks. In IPTPS, 2002.
15. C. Y. Liau, W. S. Ng, R. Panicker, S. Bressan, and K.-L. Tan. Efficient range queries and fast lookup services for scalable P2P networks. In International Workshop on Databases, Information Systems, and Peer-to-Peer Computing (DBISP2P), 2004.
16. P. Maymounkov and D. Mazieres. Kademlia: A Peer-to-peer Information System Based on the XOR Metric. In IPTPS, 2002.
17. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6), 1990.
18. S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker. Brief Announcement: Prefix Hash Tree. In ACM PODC, 2004.
19. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In ACM SIGCOMM, 2001.
20. J. Risson and T. Moors. Survey of Research towards Robust Peer-to-Peer Networks: Search Methods. Technical Report UNSW-EE-P2P-1-1, University of New South Wales, Sydney, Australia, Sep. 2004. http://www.ee.unsw.edu.au/~timm/pubs/ robust_p2p/submitted.pdf.
21. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001.
22. O. D. Sahin, A. Gupta, D. Agrawal, and A. E. Abbadi. A Peer-to-peer Framework for Caching Range Queries. In 20th International Conference on Data Engineering (ICDE), 2004.
23. M. Schlosser, M. Sintek, S. Decker, and W. Nejdl. Hypercup-hypercubes, ontologies, and efficient search on peer-to-peer networks. LNCS, 2530, 2003.
24. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In ACM SIGCOMM, 2001.