Range queries over skip tree graphs

Computer Communications

Volumn 31, Issue 2, 2008, Pages 358-374

  Gonzalez Beltran A ^a   Milligan, P ^a   Sage, P ^a  

^a QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

Aggregation queries; Concurrency; Distributed search tree; Range queries; Structured peer to peer networks

Indexed keywords

ALGORITHMS; DECISION TREES; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; LARGE SCALE SYSTEMS; TABU SEARCH;

AGGREGATION QUERIES; DISTRIBUTED SEARCH TREES; RANGE QUERIES; STRUCTURED PEER-TO-PEER NETWORKS;

QUEUEING NETWORKS;

EID: 38149092614     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2007.08.003     Document Type: Article

References (29)

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.
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.
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.
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 22 1 (2004) 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.
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 15 3 (2001) 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.
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.
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 33 6 (1990) 668-676
22. Messeguer X. Skip Trees: an alternative data structure to Skip Lists in a concurrent approach. Informatique Théorique et Applications 31 3 (1997) 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.