Collaborative Cache Based on Path Scores - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Collaborative Cache Based on Path Scores

Bernd Amann
Camelia Constantin

Résumé

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.

Dates et versions

hal-01335851 , version 1 (22-06-2016)

Identifiants

Citer

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⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More