CliqueSquare in action: Flat plans for massively parallel RDF queries

Benjamin Djahandideh, François Goasdoué, Zoi Kaoudi, Ioana Manolescu, Jorge Arnulfo Quiane Ruiz, Stamatis Zampetakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

RDF is an increasingly popular data model for many practical applications, leading to large volumes of RDF data; efficient RDF data management methods are crucial to allow applications to scale. We propose to demonstrate CliqueSquare, an RDF data management system built on top of a MapReduce-like infrastructure. The main technical novelty of CliqueSquare resides in its logical query optimization algorithm, guaranteed to find a logical plan as flat as possible for a given query, meaning: a plan having the smallest possible number of join operators on top of each other. CliqueSquare's ability to build flat plans allows it to take advantage of a parallel processing framework in order to shorten response times. We demonstrate loading and querying the data, with a particular focus on query optimization, and on the performance benefits of CliqueSquare's flat plans.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
PublisherIEEE Computer Society
Pages1432-1435
Number of pages4
Volume2015-May
ISBN (Print)9781479979639
DOIs
Publication statusPublished - 26 May 2015
Event2015 31st IEEE International Conference on Data Engineering, ICDE 2015 - Seoul, Korea, Republic of
Duration: 13 Apr 201517 Apr 2015

Other

Other2015 31st IEEE International Conference on Data Engineering, ICDE 2015
CountryKorea, Republic of
CitySeoul
Period13/4/1517/4/15

Fingerprint

Information management
Data structures
Processing

ASJC Scopus subject areas

  • Information Systems
  • Signal Processing
  • Software

Cite this

Djahandideh, B., Goasdoué, F., Kaoudi, Z., Manolescu, I., Quiane Ruiz, J. A., & Zampetakis, S. (2015). CliqueSquare in action: Flat plans for massively parallel RDF queries. In Proceedings - International Conference on Data Engineering (Vol. 2015-May, pp. 1432-1435). [7113394] IEEE Computer Society. https://doi.org/10.1109/ICDE.2015.7113394

CliqueSquare in action : Flat plans for massively parallel RDF queries. / Djahandideh, Benjamin; Goasdoué, François; Kaoudi, Zoi; Manolescu, Ioana; Quiane Ruiz, Jorge Arnulfo; Zampetakis, Stamatis.

Proceedings - International Conference on Data Engineering. Vol. 2015-May IEEE Computer Society, 2015. p. 1432-1435 7113394.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Djahandideh, B, Goasdoué, F, Kaoudi, Z, Manolescu, I, Quiane Ruiz, JA & Zampetakis, S 2015, CliqueSquare in action: Flat plans for massively parallel RDF queries. in Proceedings - International Conference on Data Engineering. vol. 2015-May, 7113394, IEEE Computer Society, pp. 1432-1435, 2015 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, Korea, Republic of, 13/4/15. https://doi.org/10.1109/ICDE.2015.7113394
Djahandideh B, Goasdoué F, Kaoudi Z, Manolescu I, Quiane Ruiz JA, Zampetakis S. CliqueSquare in action: Flat plans for massively parallel RDF queries. In Proceedings - International Conference on Data Engineering. Vol. 2015-May. IEEE Computer Society. 2015. p. 1432-1435. 7113394 https://doi.org/10.1109/ICDE.2015.7113394
Djahandideh, Benjamin ; Goasdoué, François ; Kaoudi, Zoi ; Manolescu, Ioana ; Quiane Ruiz, Jorge Arnulfo ; Zampetakis, Stamatis. / CliqueSquare in action : Flat plans for massively parallel RDF queries. Proceedings - International Conference on Data Engineering. Vol. 2015-May IEEE Computer Society, 2015. pp. 1432-1435
@inproceedings{2f80e2a5982d4e7c8c3cfcf0e86edc0d,
title = "CliqueSquare in action: Flat plans for massively parallel RDF queries",
abstract = "RDF is an increasingly popular data model for many practical applications, leading to large volumes of RDF data; efficient RDF data management methods are crucial to allow applications to scale. We propose to demonstrate CliqueSquare, an RDF data management system built on top of a MapReduce-like infrastructure. The main technical novelty of CliqueSquare resides in its logical query optimization algorithm, guaranteed to find a logical plan as flat as possible for a given query, meaning: a plan having the smallest possible number of join operators on top of each other. CliqueSquare's ability to build flat plans allows it to take advantage of a parallel processing framework in order to shorten response times. We demonstrate loading and querying the data, with a particular focus on query optimization, and on the performance benefits of CliqueSquare's flat plans.",
author = "Benjamin Djahandideh and Fran{\cc}ois Goasdou{\'e} and Zoi Kaoudi and Ioana Manolescu and {Quiane Ruiz}, {Jorge Arnulfo} and Stamatis Zampetakis",
year = "2015",
month = "5",
day = "26",
doi = "10.1109/ICDE.2015.7113394",
language = "English",
isbn = "9781479979639",
volume = "2015-May",
pages = "1432--1435",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - CliqueSquare in action

T2 - Flat plans for massively parallel RDF queries

AU - Djahandideh, Benjamin

AU - Goasdoué, François

AU - Kaoudi, Zoi

AU - Manolescu, Ioana

AU - Quiane Ruiz, Jorge Arnulfo

AU - Zampetakis, Stamatis

PY - 2015/5/26

Y1 - 2015/5/26

N2 - RDF is an increasingly popular data model for many practical applications, leading to large volumes of RDF data; efficient RDF data management methods are crucial to allow applications to scale. We propose to demonstrate CliqueSquare, an RDF data management system built on top of a MapReduce-like infrastructure. The main technical novelty of CliqueSquare resides in its logical query optimization algorithm, guaranteed to find a logical plan as flat as possible for a given query, meaning: a plan having the smallest possible number of join operators on top of each other. CliqueSquare's ability to build flat plans allows it to take advantage of a parallel processing framework in order to shorten response times. We demonstrate loading and querying the data, with a particular focus on query optimization, and on the performance benefits of CliqueSquare's flat plans.

AB - RDF is an increasingly popular data model for many practical applications, leading to large volumes of RDF data; efficient RDF data management methods are crucial to allow applications to scale. We propose to demonstrate CliqueSquare, an RDF data management system built on top of a MapReduce-like infrastructure. The main technical novelty of CliqueSquare resides in its logical query optimization algorithm, guaranteed to find a logical plan as flat as possible for a given query, meaning: a plan having the smallest possible number of join operators on top of each other. CliqueSquare's ability to build flat plans allows it to take advantage of a parallel processing framework in order to shorten response times. We demonstrate loading and querying the data, with a particular focus on query optimization, and on the performance benefits of CliqueSquare's flat plans.

UR - http://www.scopus.com/inward/record.url?scp=84940888134&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940888134&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2015.7113394

DO - 10.1109/ICDE.2015.7113394

M3 - Conference contribution

AN - SCOPUS:84940888134

SN - 9781479979639

VL - 2015-May

SP - 1432

EP - 1435

BT - Proceedings - International Conference on Data Engineering

PB - IEEE Computer Society

ER -