CliqueSquare is a system for storing and querying large RDF graphs relying on Hadoop’s distributed file system (HDFS) and Hadoop’s MapReduce open-source implementation. CliqueSquare is equipped with a unique optimization algorithm capable of generating highly parallelizable flat query plans relying on n-ary equality joins. In addition, it provides a novel partitioning and storage scheme that permits first-level joins to be evaluated locally using efficient map-only joins.
People
- Benjamin Djahandideh
- François Goasdoué
- Zoi Kaoudi
- Ioana Manolescu
- Jorge-Arnulfo Quiané-Ruiz
- Stamatis Zampetakis
Download
CliqueSquare is available on SourceForge. It is free for all non-commercial use.
https://sourceforge.net/projects/cliquesquare/
Publications
- CliqueSquare: Flat Plans for Massively Parallel RDF Queries
François Goasdoué, Zoi Kaoudi, Ioana Manolescu, Jorge-Arnulfo Quiané-Ruiz, Stamatis Zampetakis
In ICDE 2015 - CliqueSquare: Flat Plans for Massively Parallel RDF Queries
François Goasdoué, Zoi Kaoudi, Ioana Manolescu, Jorge-Arnulfo Quiané-Ruiz, Stamatis Zampetakis
INRIA technical report no. 8612, 2014 - CliqueSquare in Action: Flat Plans for Massively Parallel RDF Queries
Benjamin Djahandideh, François Goasdoué, Zoi Kaoudi, Ioana Manolescu, Jorge-Arnulfo Quiané-Ruiz, Stamatis Zampetakis
Demo at ICDE 2015
- How to deal with Cliques at Work
Benjamin Djahandideh, François Goasdoué, Zoi Kaoudi, Ioana Manolescu, Jorge-Arnulfo Quiané-Ruiz, Stamatis Zampetakis
Demo at BDA 2014 - CliqueSquare: efficient Hadoop-based RDF query processing
François Goasdoué, Zoi Kaoudi, Ioana Manolescu, Jorge-Arnulfo Quiané-Ruiz, Stamatis Zampetakis
In BDA 2013
