skip to main content
10.1145/1073814.1073827acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article

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

Published: 17 July 2005 Publication History

Abstract

We present a framework for designing efficient distributed data structures for multi-dimensional data. Our structures, which we call skip-webs, extend and improve previous randomized distributed data structures, including skipnets and skip graphs. Our framework applies to a general class of data querying scenarios, which include linear (one-dimensional) data, such as sorted sets, as well as multi-dimensional data, such as d-dimensional octrees and digital tries of character strings defined over a fixed alphabet.We show how to perform a query over such a set of n items spread among n hosts using O(log n/log log n) messages for one-dimensional data, or O(log n) messages for fixed-dimensional data, while using only O(log n) space per host. We also show how to make such structures dynamic so as to allow for insertions and deletions in O(log n) messages for quadtrees, octrees, and digital tries, and O(log n/log log n) messages for one-dimensional data. Finally, we show how to apply a blocking strategy to skip-webs to further improve message complexity for one-dimensional data when hosts can store more data.

References

[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.

Cited By

View all
  • (2020)Peer-to-Peer-Based Social Networks: A Comprehensive SurveySN Computer Science10.1007/s42979-020-00315-81:5Online publication date: 11-Sep-2020
  • (2018)Developing a Holistic Understanding of Systems and Algorithms through Research PapersProceedings of the 2017 ITiCSE Conference on Working Group Reports10.1145/3174781.3174786(86-104)Online publication date: 30-Jan-2018
  • (2017)Write-Optimized Skip ListsProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3034786.3056117(69-78)Online publication date: 9-May-2017
  • Show More Cited By

Index Terms

  1. Skip-webs: efficient distributed data structures for multi-dimensional data sets

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
    July 2005
    364 pages
    ISBN:1581139942
    DOI:10.1145/1073814
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 17 July 2005

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. distributed data structures
    2. octrees
    3. peer-to-peer networks
    4. quadtrees
    5. skip lists
    6. trapezoidal maps
    7. tries

    Qualifiers

    • Article

    Conference

    PODC05

    Acceptance Rates

    Overall Acceptance Rate 740 of 2,477 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2020)Peer-to-Peer-Based Social Networks: A Comprehensive SurveySN Computer Science10.1007/s42979-020-00315-81:5Online publication date: 11-Sep-2020
    • (2018)Developing a Holistic Understanding of Systems and Algorithms through Research PapersProceedings of the 2017 ITiCSE Conference on Working Group Reports10.1145/3174781.3174786(86-104)Online publication date: 30-Jan-2018
    • (2017)Write-Optimized Skip ListsProceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3034786.3056117(69-78)Online publication date: 9-May-2017
    • (2016)Anti-Persistence on Persistent StorageProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/2902251.2902276(289-302)Online publication date: 15-Jun-2016
    • (2015)$$D^2$$D2-TreeAlgorithmica10.1007/s00453-014-9878-472:3(860-883)Online publication date: 1-Jul-2015
    • (2014)A scalable distributed skip list for range queriesProceedings of the 23rd international symposium on High-performance parallel and distributed computing10.1145/2600212.2600712(315-318)Online publication date: 23-Jun-2014
    • (2012)Authenticated and persistent skip graphProceedings of the International Conference on Advances in Computing, Communications and Informatics10.1145/2345396.2345423(155-160)Online publication date: 3-Aug-2012
    • (2011)Efficient range query processing over DHTs based on the balanced Kautz treeConcurrency and Computation: Practice & Experience10.1002/cpe.165523:8(796-814)Online publication date: 1-Jun-2011
    • (2010)On the search path length of random binary skip graphsProceedings of the Meeting on Algorithm Engineering & Expermiments10.5555/2790381.2790382(1-8)Online publication date: 16-Jan-2010
    • (2010)Survey on hierarchical routing schemes in “flat” distributed hash tablesPeer-to-Peer Networking and Applications10.1007/s12083-010-0093-z4:4(346-375)Online publication date: 5-Oct-2010
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media