CyCLaDEs: A Decentralized Cache for Triple Pattern Fragments

Pauline Folz 1, 2 Hala Skaf-Molli 1 Pascal Molli 1
1 GDD - Gestion de Données Distribuées [Nantes]
LINA - Laboratoire d'Informatique de Nantes Atlantique
Abstract : Linked Data Fragment (LDF) approach promotes a new trade-off between performance and data availability for querying Linked Data. If data providers' HTTP caches plays a crucial role in LDF performances, LDF clients are also caching data during SPARQL query processing. Unfortunately , as these clients do not collaborate, they cannot take advantage of this large decentralized cache hosted by clients. In this paper, we propose CyCLaDEs an overlay network based on LDF fragments similarity. For each LDF client, CyCLaDEs builds a neighborhood of LDF clients hosting related fragments in their cache. During query processing, neighborhood cache is checked before requesting LDF server. Experimental results show that CyCLaDEs is able to handle a significant amount of LDF query processing and provide a more specialized cache on client-side.
Document type :
Conference papers
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Pauline Folz <>
Submitted on : Tuesday, March 22, 2016 - 12:57:33 PM
Last modification on : Monday, July 16, 2018 - 11:24:04 AM
Long-term archiving on : Sunday, November 13, 2016 - 8:48:30 PM


Files produced by the author(s)


  • HAL Id : hal-01251654, version 2



Pauline Folz, Hala Skaf-Molli, Pascal Molli. CyCLaDEs: A Decentralized Cache for Triple Pattern Fragments. ESWC: Extended Semantic Web Conference, May 2016, Heraklion, Greece. ⟨hal-01251654v2⟩



Record views


Files downloads