Skip-webs: Efficient distributed data structures for multi-dimensional data sets

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 69-76

  Arge, Lars ^a   Eppstein, David ^b   Goodrich, Michael T ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b Irvine   (United States)

Author keywords

Distributed data structures; Octrees; Peer to peer networks; Quadtrees; Skip lists; Trapezoidal maps; Tries

Indexed keywords

GRAPH THEORY; MAPS;

DISTRIBUTED DATA STRUCTURES; OCTREES; QUADTREES; SKIP LISTS;

DATA STRUCTURES;

EID: 32344450351     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073827     Document Type: Conference Paper

References (21)

1. A. Anagnostopoulos, M. T. Goodrich, and R. Tamassia. Persistent authenticated dictionaries and their applications. In Proc. Information Security Conference (ISC 2001), volume 2200 of LNCS, pages 379-393. Springer-Verlag, 2001.
2. J. Aspnes, J. Kirsch, and A. Krishnamurthy. Load balancing and locality in range-queriable data structures. In Proceedings of the Symposium on Principles of Distributed Computing (PODC), 2004.
3. J. Aspnes and G. Shah. Skip graphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 384-393, 2003.
4. B. Awerbuch and C. Scheideler. Peer-to-peer systems for prefix search. In Proceedings of the Symposium on Principles of Distributed Computing (PODC), 2003.
5. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. J. Comput. Syst. Sci., 38:86-124, 1989.
6. D. Eppstein, M. T. Goodrich, and J. Z. Sun. The skip quadtree: A simple dynamic data structure for multidimensional data. In 21st ACM Symp. on Computational Geometry (SCG), 2005.
7. P. Ganesan and G. S. Manku. Optimal routing in Chord. In 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 169-178, 2004.
8. M. T. Goodrich, R. Tamassia, N. Triandopoulos, and R. Cohen. Authenticated data structures for graph and geometric searching. In Proc. RSA Conference-Cryptographers' Track, pages 295-313. Springer, LNCS 2612, 2003.
9. N. Harvey and J. Munro. Deterministic SkipNet. In Twenty Second ACM Symp. on Priciples of Distributed Computing (PODC), pages 152-153, 2003.
10. 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 Symp. on Internet Technologies and Systems, Lecture Notes in Computer Science, 2003.
11. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal distributed hash table. In 2nd Int. Workshop on Peer-to-Peer Systems, 2003.
12. G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. In 4th USENIX Symp. on Internet Technologies and Systems, 2003.
13. G. S. Manku, M. Naor, and U. Wieder, Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pages 54-63, 2004.
14. M. Naor and U. Wieder. Know thy neighbor's neighbor: Better routing in skip-graphs and small worlds. In 3rd Int. Workshop on Peer-to-Peer Systems, 2004.
15. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
16. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329-??, 2001.
17. A. I. T. Rowstron, A.-M. Kermarrec, M. Castro, and P. Druschel. SCRIBE: The design of a large-scale event notification infrastructure. In Networked Group Communication, pages 30-43, 2001.
18. I. Stoica, R. Morris, D. Karger, F. Kaashoek, 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.
19. Y. Xie, D. O'Hallaron, and M. K. Reiter. A secure distributed search system, In Proceedings of the 11th IEEE Int. Symp. on High Performance Distributed Computing (HPDC), pages 321-332, 2002.
20. K. C. Zatloukal and N. J. A. Harvey. Family trees: An ordered dictionary with optimal congestion, locality, degree, and search time. In 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 301-310, 2004.
21. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, Apr. 2001.