Abstract
Range query, which is defined as retrieving all the keys within a certain range over the underlying DHT, has attracted a lot of attention recently. However, little has been done to speed up range queries through caching, one of the least studied P2P problems. In this paper, we present a caching protocol that (1) has excellent parallelizability, (2) can achieve O(1) complexity for moderate range queries, and (3) balances the access load among all the DHT peers. Our experimental results shows significant gains in both range query performance and load balancing, with minimal overhead.
This research was partially funded through project P2PGRID, TIN2007-68050-C03-03, of the Ministry of Education and Science, Spain.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: SIGCOMM 2001, pp. 161–172 (2001)
Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32 (2003)
Kothari, A., Agrawal, D., Gupta, A., Suri, S.: Range addressable network: A p2p cache architecture for data ranges. In: P2P 2003 (2003)
Sahin, O.D., Gupta, A., Agrawal, D., Abbadi, A.E.: A peer-to-peer framework for caching range queries. In: ICDE 2004, pp. 165–177 (2004)
Pitoura, T., Ntarmos, N., Triantafillou, P.: Replication, load balancing and efficient range query processing in dhts. In: Grust, T., Höpfner, H., Illarramendi, A., Jablonski, S., Mesiti, M., Müller, S., Patranjan, P.-L., Sattler, K.-U., Spiliopoulou, M., Wijsen, J. (eds.) EDBT 2006. LNCS, vol. 4254, pp. 131–148. Springer, Heidelberg (2006)
Cai, M., Frank, M., Chen, J., Szekely, P.: Maan: A multi-attribute addressable network for grid information services. In: GRID 2003, pp. 184–192 (2003)
Girdzijauskas, S., Datta, A., Aberer, K.: On small world graphs in non-uniformly distributed key spaces. In: ICDEW 2005, p. 1187 (2005)
Manku, G., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: USITS 2003 (2003)
Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429. Springer, Heidelberg (2002)
Triantafillou, P., Pitoura, T.: Towards a unifying framework for complex query processing over structured peer-to-peer data networks. In: DBISP2P 2003, p. 169 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sànchez-Artigas, M., García-López, P., Skarmeta, A.G. (2008). Subrange Caching: Handling Popular Range Queries in DHTs. In: Hameurlain, A. (eds) Data Management in Grid and Peer-to-Peer Systems. Globe 2008. Lecture Notes in Computer Science, vol 5187. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85176-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-85176-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85175-2
Online ISBN: 978-3-540-85176-9
eBook Packages: Computer ScienceComputer Science (R0)