Abstract
Balancing query-load in structured overlays is an important and mostly unattended problem, apart from heuristics to deal with hot-spots. We determine the optimal caching strategy - how many caches (dependent on relative frequency of queries) to reduce search latency and where to place these caches? Our query-adaptive replication scheme provides first-order balancing of query-load. We also elaborate the limitations of first-order balancing (ignored by all existing heuristics) though it should have been obvious given the experiences of the P2P community with storage-load balancing.This work lays the ground for our ongoing work on load-aware routing in structured overlays as a mechanism complementing caching to achieve query-load balancing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Datta, A., Nejdl, W., Aberer, K. (2007). Optimal Caching for First-Order Query Load-Balancing in Decentralized Index Structures. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, JH., Ouksel, A.M. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P DBISP2P 2006 2005. Lecture Notes in Computer Science, vol 4125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71661-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-71661-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71660-0
Online ISBN: 978-3-540-71661-7
eBook Packages: Computer ScienceComputer Science (R0)