CyCLaDEs: A Decentralized Cache for Linked Data FragmentsReport as inadecuate

CyCLaDEs: A Decentralized Cache for Linked Data Fragments - Download this document for free, or read online. Document in PDF available to download.

1 GDD - Gestion de Données Distribuées Nantes LINA - Laboratoire d-Informatique de Nantes Atlantique 2 NANTES METROPOLE

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.

Keywords : Linked Data Fragment SPARQL query processing Decentralized cache Similarity overlay network

Author: Pauline Folz - Hala Skaf-Molli - Pascal Molli -



Related documents