article

Range queries over skip tree graphs

Authors:

A. González-Beltrán,

P. SageAuthors Info & Claims

Computer Communications, Volume 31, Issue 2

Pages 358 - 374

https://doi.org/10.1016/j.comcom.2007.08.003

Published: 01 February 2008 Publication History

Abstract

The support for complex queries, such as range, prefix and aggregation queries, over structured peer-to-peer systems is currently an active and significant topic of research. This paper demonstrates how Skip Tree Graph, as a novel structure, presents an efficient solution to that problem area through provision of a distributed search tree functionality on decentralised and dynamic environments. Since Skip Tree Graph is based on skip trees, a concurrent approach to skip lists, it constitutes an augmentation of skip graphs that extends its functionality and allows for important performance improvements. This work presents a thorough comparison between these two related peer-to-peer overlay networks, their construction, search algorithms and properties. Being based on tree structures, skip tree graphs supports aggregation queries and multicast/broadcast operations, which cannot be directly implemented in its predecessor. The repair mechanism for healing the structure in case of failures is more efficient and harnesses the parallelism inherent in P2P networks. Particular consideration is given to the performance of different range-query schemes over the two related structures. Theoretical and experimental results conclude that Skip Tree Graphs outperform skip graphs on both exact-match and range searches.

References

[1]

I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: a scalable peer-to-peer lookup service for internet applications, in: Proceedings of the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, ACM, San Diego, CA, USA, 2001, pp. 149-160.

Digital Library

[2]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Schenker, A scalable content-addressable network, in: Proceedings of the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, ACM Press, San Diego, CA, USA, 2001, pp. 161-172.

Digital Library

[3]

A. Rowstron, P. Druschel, Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems, in: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, 2001, pp. 329-350.

Digital Library

[4]

Zhao, B.Y., Huang, L., Stribling, J., Rhea, S., Joseph, A.D. and Kubiatowicz, J.D., Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications. v22 i1. 41-53.

[5]

D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, R. Panigrahy, Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web, in: Proceedings of the Twenty-Ninth ACM Symposium on Theory of Computing (STOC), El Paso, TX, USA, 1997, pp. 654-663.

Digital Library

[6]

M. Harren, J. Hellerstein, R. Huebsch, B.T. Loo, S. Shenker, I. Stoica, Complex Queries in DHT-based Peer-to-Peer Networks, in: Proceedings of the First International Workshop on P2P Systems (IPTPS'02), Springer, 2002, pp. 242-259.

[7]

N. Daswani, H. Garcia-Molina, B. Yang, Open problems in data-sharing peer-to-peer systems, in: Proceedings of the Ninth International Conference on Database Theory, Springer, 2003, pp. 1-15.

[8]

Foster, I., Kesselman, C. and Tuecke, S., The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Journal of High Performance Computing Applications. v15 i3. 200-222.

[9]

A. Andrzejak, Z. Xu, Scalable, efficient range queries for grid information services, in: Proceedings of IEEE International Conference on Peer-to-Peer Computing, P2P 2002, pp. 33-40.

[10]

Y. Shu, B.C. Ooi, K.-L. Tan, A.Y. Zhou, Supporting multi-dimensional range queries in peer-to-peer systems, in: Proceedings of the Fifth International Conference on Peer-to-Peer Computing, 2005, pp. 173-180.

[11]

I. Abraham, J. Aspnes, J. Yuan, Skip B-Trees, in: Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS), Pisa, Italy, 2005, pp. 284-295.

[12]

A. Gupta, D. Agrawal, A.E. Abbadi, Approximate range selection queries in peer-to-peer systems, in: Proceedings of the First Biennal Conference on Innovative Data Systems Research (CIDR), 2003, pp. 141-151.

[13]

T. Pitoura, N. Ntarmos, P. Triantafillou, Replication, load balancing and efficient range query processing in DHTs, in: Proceedings of the 10th International Conference on Extending Database Technology (EDBT), LNCS, 2006, pp. 131-148.

Digital Library

[14]

A. Crainiceanu, P. Linga, J. Gehrke, J. Shanmugasundaram, Querying peer-to-peer networks using P-Trees, in: Proceedings of the Seventh International Workshop on the Web and Databases (WebDB 2004), Paris, France, 2004, pp. 25-30.

[15]

Y. Chawathe, S. Ramabhadran, S. Ratnasamy, A. LaMarca, S. Shenker, J. Hellerstein, A case study in building layered DHT applications, in: Proceedings of the ACM SIGCOMM 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2005, pp. 97-108.

[16]

K. Aberer, P-Grid: a self-organizing access structure for p2p information systems, in: Proceedings of the 6th Conference on Cooperative Information Systems (CoopIS 2001), Trento, Italy, 2001, pp. 179-194.

[17]

J. Aspnes, G. Shah, Skip Graphs, in: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, 2003, pp. 384-393.

Digital Library

[18]

N.J.A. Harvey, M.B. Jones, S. Saroiu, M. Theimer, A. Wolman, SkipNet: A Scalable Overlay Network with Practical Locality Properties, in: Proceedings of Fourth USENIX Symposium on Internet Technologies and Systems (USITS'03), Seattle, WA, USA, 2003, pp. 113-126.

[19]

H.V. Jagadish, B.C. Ooi, Q.H. Vu, BATON: A Balanced Tree Structure for Peer-to-Peer Networks, in: Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), Trondheim, Norway, 2005, pp. 661-672.

[20]

H.V. Jagadish, B.C. Ooig, K.-L. Tan, Q.H. Vu, R. Zhang, Speeding up search in peer-to-peer networks with a multi-way tree structure, in: Proceedings of SIGMOD 2006, Chicago, Illinois, USA, 2006, pp. 1-12.

[21]

Pugh, W., Skip Lists: A probabilistic alternative to balanced trees. Communications of the ACM. v33 i6. 668-676.

[22]

Messeguer, X., Skip Trees: an alternative data structure to Skip Lists in a concurrent approach. Informatique Théorique et Applications. v31 i3. 251-269.

[23]

A. González-Beltrán, P. Sage, P. Milligan, Skip Tree Graph: a distributed and balanced search tree for peer-to-peer networks, in: Proceedings of the IEEE International Conference on Communications, Glasgow, UK, 2007.

[24]

O.D. Sahin, A. Gupta, D. Agrawal, A.E. Abbadi, A peer-to-peer framework for caching range queries, in: International Conference on Data Engineering (ICDE), 2004, pp. 165-176.

[25]

A. Datta, M. Hauswirth, R. John, R. Schmidt, K. Aberer, Range queries in trie-structured overlays, in: Proceedings of the Fifth International Conference on Peer-to-Peer Computing, 2005, pp. 57-66.

[26]

J. Aspnes, J. Kirsch, A. Krishnamurthy, Load balancing and locality in range-queriable data structures, in: Proceedings of the 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2004), St. John's, Newfoundland, Canada, 2004, pp. 115-124.

[27]

T. Papadakis, Skip lists and probabilistic analysis of algorithms, Ph.D. thesis, University of Waterloo, 1993.

[28]

P. Linga, A. Crainiceanu, J. Gehrke, J. Shanmugasundaram, Guaranteeing correctness and availabitlity in P2P range indices, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, USA, 2005, pp. 323-334.

[29]

D. Li, J. Cao, X. Lu, K.C.C. Chan, B. Wang, J. Su, H. va Leong, A.T.S. Chan, Delay-bounded range queries in DHT-based peer-to-peer systems, in: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06), 2006, p. 64.

Cited By

Kumar APrasanna ABalkind JShriraman ATsafrir DMusuvathi MGupta RAbu-Ghazaleh N(2024)METAL: Caching Multi-level Indexes in Domain-Specific ArchitecturesProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3620665.3640402(715-729)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3620665.3640402
Miki YKaneko TBanno RShudo K(2022)An Efficient Range Search Method Utilizing Detour Routes in Skip Graph2022 IEEE 19th Annual Consumer Communications & Networking Conference (CCNC)10.1109/CCNC49033.2022.9700711(905-908)Online publication date: 8-Jan-2022
https://dl.acm.org/doi/10.1109/CCNC49033.2022.9700711
Masinde NGraffi K(2020)Peer-to-Peer-Based Social Networks: A Comprehensive SurveySN Computer Science10.1007/s42979-020-00315-81:5Online publication date: 1-Sep-2020
https://dl.acm.org/doi/10.1007/s42979-020-00315-8
Show More Cited By

Index Terms

Recommendations

Efficient Range Query Processing in Peer-to-Peer Systems

With the increasing popularity of the peer-to-peer (P2P) computing paradigm, many general range query schemes for distributed hash table (DHT)-based P2P systems have been proposed in recent years. Although those schemes can provide range query ...
Load Balancing and Range Queries in P2P Systems Using P-Ring

In peer-to-peer (P2P) systems, computers from around the globe share data and can participate in distributed computation. P2P became famous, and infamous, due to file-sharing systems like Napster. However, the scalability and robustness of these systems ...
Enabling Dynamic Querying over Distributed Hash Tables

Dynamic querying (DQ) is a search technique used in unstructured peer-to-peer (P2P) networks to minimize the number of nodes that is necessary to visit to reach the desired number of results. In this paper, we introduce the use of the DQ technique in ...

Comments

Information & Contributors

Information

Published In

cover image Computer Communications

Computer Communications Volume 31, Issue 2

February, 2008

234 pages

ISSN:0140-3664

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2007.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 February 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kumar APrasanna ABalkind JShriraman ATsafrir DMusuvathi MGupta RAbu-Ghazaleh N(2024)METAL: Caching Multi-level Indexes in Domain-Specific ArchitecturesProceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 210.1145/3620665.3640402(715-729)Online publication date: 27-Apr-2024
https://dl.acm.org/doi/10.1145/3620665.3640402
Miki YKaneko TBanno RShudo K(2022)An Efficient Range Search Method Utilizing Detour Routes in Skip Graph2022 IEEE 19th Annual Consumer Communications & Networking Conference (CCNC)10.1109/CCNC49033.2022.9700711(905-908)Online publication date: 8-Jan-2022
https://dl.acm.org/doi/10.1109/CCNC49033.2022.9700711
Masinde NGraffi K(2020)Peer-to-Peer-Based Social Networks: A Comprehensive SurveySN Computer Science10.1007/s42979-020-00315-81:5Online publication date: 1-Sep-2020
https://dl.acm.org/doi/10.1007/s42979-020-00315-8
Rostami HHabibi JLivani E(2009)Semantic partitioning of peer-to-peer search spaceComputer Communications10.1016/j.comcom.2008.11.02032:4(619-633)Online publication date: 1-Mar-2009
https://dl.acm.org/doi/10.1016/j.comcom.2008.11.020

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents