CliqueSquare in Action: Flat Plans for Massively Parallel RDF Queries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

CliqueSquare in Action: Flat Plans for Massively Parallel RDF Queries

Résumé

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.
Fichier principal
Vignette du fichier
main.pdf (629.21 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01108710 , version 1 (23-01-2015)

Identifiants

  • HAL Id : hal-01108710 , version 1

Citer

Benjamin Djahandideh, François Goasdoué, Zoi Kaoudi, Ioana Manolescu, Jorge-Arnulfo Quiané-Ruiz, et al.. CliqueSquare in Action: Flat Plans for Massively Parallel RDF Queries. International Conference on Data Engineering, Apr 2015, Seoul, South Korea. ⟨hal-01108710⟩
446 Consultations
366 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More