Skip graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 384-393

  Aspnes, James ^a   Shah, Gauri ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEM RECOVERY; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION RETRIEVAL; INTERNET; QUERY LANGUAGES;

BALANCED TREE; DISTRIBUTED DATA STRUCTURES; HASH TABLE; PEER TO PEER NETWORKS; SKIP GRAPHS;

DATA STRUCTURES;

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

References (31)

1. Yonatan Aumann and Michael A. Bender. Fault tolerant data structures. In Thirty-Seventh Annual Symposium on Foundations of Computer Science, Burlington, VT, USA, October 1996.
2. James Aspnes, Zoë Diamadi, and Gauri Shah. Fault-tolerant routing in peer-to-peer systems. In Twenty-First ACM Symposium on Principles of Distributed Computing, pages 223-232, Monterey, MA, USA, July 2002.
3. Miguel Castro, Peter Druschel, Y. Charlie Hu, and Anthony Rowstron. Exploiting network proximity in peer-to-peer overlay networks. In International Workshop on Future Directions in Distributed Computing, Bertinoro, Italy, June 2002. [Longer version submitted for publication].
4. Mayur Datar. Butterflies and peer-to-peer networks. In Proceedings of the 10th European Symposium on Algorithms, Rome, Italy, September 2002.
5. L. Devroye. A limit theory for random skip lists. The Annals of Applied Probability, 2(3):597-609, 1992.
6. Rene de la Briandais. File searching using variable length keys. In Western Joint Computer Conference, volume 15, pages 295-298, Montvale, NJ, USA, 1959. AFIPS Press.
7. FREENET. http://www.freenet.sourceforge.net.
8. Edward Fredkin. Trie memory. Communications of the ACM, 3(9):490-499, September 1960.
9. Amos Fiat and Jared Saia. Censorship resistant peer-to-peer content addressable networks. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, January 2002.
10. J. Gabarró and X. Messeguer. A unified approach to concurrent and parallel algorithms on balanced data structures. In XVII International Conference of the Chilean Computer Society, 1997.
11. J. Gabarró, C. Martínez, and X. Messeguer. Parallel update and search in skip lists. In 13th International Conference of the Chilean Computer Society, 1993.
12. J. Gabarró, C. Martínez, and X. Messeguer. A top-down design of a parallel dictionary using skip lists. Theoretical Computer Science, 158(1-2):1-33, May 1996.
13. GNUTELLA. http://gnutella.wego.com.
14. Matthew Harren, Joseph M. Hellerstein, Ryan Huebsch, Boon Thau Loo, Scott Shenker, and Ion Stoica. Complex queries in DHT-based peer-to-peer networks. In 1st International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, USA, March 2002.
15. Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, and Ben Y. Zhao. Distributed object location in a dynamic network. In Fourteenth ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, Manitoba, Canada, August 2002.
16. Anthony D. Joseph, John Kubiatowicz, and Ben Y. Zhao. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, University of California, Berkeley, Apr 2001.
17. P. Kirschenhofer, C. Martínez, and H. Prodinger. Analysis of an optimized search algorithm for skip lists. Theoretical Computer Science, 144(1-2):119-220, 26 June 1995.
18. Donald E. Knuth. The Art of Computer Programming: Sorting and Searching, Addison-Wesley Publishing Company Inc., Reading, Massachusetts, 1973.
19. P. Kirschenhofer and H. Prodinger. The path length of random skip lists. Acta Informatica, 31(8):775-792, 1994.
20. David Karger and Matthias Ruhl. Finding nearest neighbors in growth-restricted metrics. In Thirty-Fourth ACM Symposium on Theory of Computing, pages 741-750, Montreal, Canada, May 2002.
21. Dahlia Malkhi, Moni Naor, and David Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Twenty-First ACM Symposium on Principles of Distributed Computing, pages 183-192, Monterey, CA, USA, July 2002.
22. J. Ian Munro and Patricio V. Poblete. Fault tolerance and storage reduction in binary search trees. Information and Control, 62(2/3):210-218, August 1984.
23. NAPSTER. Formerly, http://www.napster.com.
24. T. Papadakis, J.I. Munro, and P.V. Poblete. Analysis of the expected search cost in skip lists. In J. R. Gilbert and R. G. Karlsson, editors SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, volume 447 of Lecture Notes in Computer Science, pages 160-172, Bergen, Norway, 11-14 July 1990. Springer.
25. C. Plaxton, R. Rajaram, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 1997.
26. William Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668-676, June 1990.
27. Antony Rowstron and Peter Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, November 2001.
28. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proceedings of the ACM SIGCOMM, pages 161-170, 2001.
29. Bujor Silaghi, Bobby Bhattacharje, and Pete Keleher. Query routing in the terradir distributed directory. In SPIE ITCOM 2002, August 2002.
30. Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishna. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM 2001, pages 149-160, 2001.
31. Ben Y. Zhao, Anthony D. Joseph, and John D. Kubiatowicz. Locality-aware mechanisms for large-scale networks. In Workshop on Future Directions in Distributed Computing, Bertinoro, Italy, June 2002.