Collaborative Cache Based on Path Scores

Bernd Amann 1 Camelia Constantin 1
1 BD - Bases de Données
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Large-scale distributed data integration systems have to deal with important query processing costs which are essentially due to the high communication overload between data peers. Caching techniques can drastically reduce processing and communication cost. We propose a new distributed caching strategy that reduces redundant caching decisions of individual peers. We estimate cache redundancy by a distributed algorithm without additional messages. Our simulation experiments show that considering redundancy scores can drastically reduce distributed query execution costs.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01335851
Contributor : Lip6 Publications <>
Submitted on : Wednesday, June 22, 2016 - 2:09:47 PM
Last modification on : Friday, March 22, 2019 - 1:39:04 AM

Links full text

Identifiers

Citation

Bernd Amann, Camelia Constantin. Collaborative Cache Based on Path Scores. 8th International Conference on Web Information Systems Engineering (WISE 2007), Dec 2007, Nancy, France. pp.87-98, ⟨10.1007/978-3-540-76993-4_8⟩. ⟨hal-01335851⟩

Share

Metrics

Record views

56