About the journal

• Home page
• Contact information
• Aims and scope
• Indexing information
• Editorial policies
• ComSIS consortium
• Journal boards
• Managing board

For authors

• Information for contributors
• Paper submission
• Article submission through OJS
• Copyright transfer form
• Download section

For readers

• Forthcoming articles
• Current issue
• Archive

For reviewers

• View and review submissions

News

• Journal's Facebook page
• Calls for special issues
• New issue notification

SRDF QDAG: An Efficient End-to-End RDF Data Management when Graph Exploration Meets Spatial Processing

Houssameddine Yousfi^{1, 2}, Amin Mesmoudi³, Allel Hadjali¹, Houcine Matallah² and Seif-Eddine Benkabou³

1. LIAS, ENSMA Engineering School
   1 avenue Clément Ader, 86961 Futuroscope Chasseneuil Cedex, France
   {houssameddine.yousfi, allel.hadjali}@ensma.fr
2. LRIT, Science Faculty
   University Abu Bekr Belkaid, Tlemcen, Algeria
   {houssameddine.yousfi, houcine.matallah}@univ-tlemcen.dz
3. LIAS, University of Poitiers
   15 rue de l'Hôtel Dieu 86073 POITIERS Cedex 9, France
   {amin.mesmoudi, seif.eddine.benkabou}@univ-poitiers.fr

Abstract

The popularity of RDF has led to the creation of several datasets (e.g., Yago, DBPedia) with different natures (graph, temporal, spatial). Different extensions have also been proposed for SPARQL language to provide appropriate processing. The best known is GeoSparql, that allows the integration of a set of spatial operators. In this paper, we propose new strategies to support such operators within a particular TripleStore, named RDF QDAG, that relies on graph fragmentation and exploration and guarantees a good compromise between scalability and performance. Our proposal covers the different TripleStore components (Storage, evaluation, optimization). We evaluated our proposal using spatial queries with real RDF data, and we also compared performance with the latest version of a popular commercial TripleStore. The first results demonstrate the relevance of our proposal and how to achieve an average gain of performance of 28% by choosing the right evaluation strategies to use. Based on these results, we proposed to extend the RDF QDAG optimizer to dynamically select the evaluation strategy to use depending on the query. Then, we show also that our proposal yields the best strategy for most queries.

Key words

RDF, Graph Data, Spatial Data, TripleStore, Graph exploration, Optimization

Digital Object Identifier (DOI)

https://doi.org/10.2298/CSIS230225046Y

Publication information

Volume 20, Issue 4 (September 2023)
Year of Publication: 2023
ISSN: 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

Available in PDF
Portable Document Format

How to cite

Yousfi, H., Mesmoudi, A., Hadjali, A., Matallah, H., Benkabou, S.: SRDF QDAG: An Efficient End-to-End RDF Data Management when Graph Exploration Meets Spatial Processing. Computer Science and Information Systems, Vol. 20, No. 4. (2023), https://doi.org/10.2298/CSIS230225046Y