CyCLaDEs: A Decentralized Cache for Triple Pattern Fragments

  • Pauline FolzEmail author
  • Hala Skaf-Molli
  • Pascal Molli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9678)


The 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.


Query Processing Overlay Network Nest Loop Distribute Hash Table Data Provider 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Buil-Aranda, C., Hogan, A., Umbrich, J., Vandenbussche, P.-Y.: SPARQL web-querying infrastructure: ready for action? In: Alani, H., et al. (eds.) ISWC 2013, Part II. LNCS, vol. 8219, pp. 277–293. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  2. 2.
    Beek, W., Rietveld, L., Bazoobandi, H.R., Wielemaker, J., Schlobach, S.: LOD laundromat: a uniform way of publishing other people’s dirty data. In: Mika, P., et al. (eds.) ISWC 2014, Part I. LNCS, vol. 8796, pp. 213–228. Springer, Heidelberg (2014)Google Scholar
  3. 3.
    Bertier, M., Frey, D., Guerraoui, R., Kermarrec, A.-M., Leroy, V.: The gossple anonymous social network. In: Gupta, I., Mascolo, C. (eds.) Middleware 2010. LNCS, vol. 6452, pp. 191–211. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Bizer, C., Heath, T., Berners-Lee, T.: Linked data - the story so far. Int. J. Semant. Web Inf. Syst. 5(3), 1–22 (2009)CrossRefGoogle Scholar
  5. 5.
    Bizer, C., Schultz, A.: The Berlin SPARQL benchmark. Int. J. Semant. Web Inf. Syst. 5(2), 1–24 (2009)CrossRefGoogle Scholar
  6. 6.
    M. A. Blaze. Caching in large-scale distributed file systems. Ph.D. thesis, Princeton University, Princeton, NJ, USA (1993). UMI Order No. GAX93-11182Google Scholar
  7. 7.
    Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58–75 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Dahlin, M.D., Wang, R.Y., Anderson, T.E., Patterson, D.A.: Cooperative caching: using remote client memory to improve filesystem performance. In: 1st USENIX Conference on Operating Systems Design and Implementation (OSDI 1994), Berkeley, CA, USA (1994)Google Scholar
  9. 9.
    El Dick, M., Pacitti, E., Kemme, B.: Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN. In: Proceedings of 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT 2009, pp. 427–438. ACM, New York (2009)Google Scholar
  10. 10.
    Frey, D., Goessens, M., Kermarrec, A.-M.: Behave: behavioral cache for web content. In: Magoutis, K., Pietzuch, P. (eds.) DAIS 2014. LNCS, vol. 8460, pp. 89–103. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  11. 11.
    Hartig, O.: How caching improves efficiency and result completeness for querying linked data. In: WWW 2011 Workshop on Linked Data on the Web, Hyderabad, India, 29 March 2011Google Scholar
  12. 12.
    Iyer, S., Rowstron, A., Druschel, P.: Squirrel: a decentralized peer-to-peer web cache. In: 21st Annual Symposium on Principles of Distributed Computing (PODC 2002), pp. 213–222. ACM, New York (2002)Google Scholar
  13. 13.
    Martin, M., Unbehauen, J., Auer, S.: Improving the performance of semantic web applications with SPARQL query caching. In: Aroyo, L., Antoniou, G., Hyvönen, E., ten Teije, A., Stuckenschmidt, H., Cabral, L., Tudorache, T. (eds.) ESWC 2010, Part II. LNCS, vol. 6089, pp. 304–318. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Schmachtenberg, M., Bizer, C., Paulheim, H.: Adoption of the linked data best practices in different topical domains. In: Mika, P., et al. (eds.) ISWC 2014, Part I. LNCS, vol. 8796, pp. 245–260. Springer, Heidelberg (2014)Google Scholar
  15. 15.
    Stuckenschmidt, H.: Similarity-based query caching. In: Christiansen, H., Hacid, M.-S., Andreasen, T., Larsen, H.L. (eds.) FQAS 2004. LNCS (LNAI), vol. 3055, pp. 295–306. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    Verborgh, R., et al.: Querying datasets on the web with high availability. In: Mika, P., et al. (eds.) ISWC 2014, Part I. LNCS, vol. 8796, pp. 180–196. Springer, Heidelberg (2014)Google Scholar
  17. 17.
    Verborgh, R., Sande, M.V., Colpaert, P., Coppens, S., Mannens, E., de Walle, R.V.: Web-scale querying through linked data fragments. In: WWW Workshop on LDOW 2014 (2014)Google Scholar
  18. 18.
    Voulgaris, S., Gavidia, D., Van Steen, M.: Cyclon: inexpensive membership management for unstructured P2P overlays. J. Netw. Syst. Manag. 13(2), 197–217 (2005)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.LINANantes UniversityNantesFrance
  2. 2.Nantes Métropole - Research, Innovation and Graduate Education DepartmentNantesFrance

Personalised recommendations