QuaQue: Design and SQL Implementation of Condensed Algebra for Concurrent Versioning of Knowledge Graphs

Read full text Summarise with VIRAT
Authors: Jey Puget Gil, Emmanuel Coquery, John Samuel, Gilles Gesquière
Cited by: 0
References: 37

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The management of versioned knowledge graphs presents significant challenges, particularly in querying data across multiple versions efficiently. This paper introduces QuaQue, a key component of the ConVer-G system, which addresses this challenge by translating SPARQL (SPARQL Protocol and RDF Query Language) queries into SQL (Structured Query Language). QuaQue leverages a novel condensed algebra to operate on a relational model where versioning information is compactly stored using bitstrings. This approach allows for efficient querying of concurrent versions of knowledge graphs within a standard relational database system. We present the key concepts of our condensed algebra, detail the translation process from SPARQL algebra to SQL, and provide a comparative benchmark against a native RDF (Resource Description Framework) triple store, demonstrating the viability and performance benefits of our approach.

Fields of Study & Subjects

Semantic Web and Ontologies Advanced Database Systems and Queries Graph Theory and Algorithms

Publication details

Journal / source
arXiv (Cornell University)
Volume
18
Pages
11
Publication date
19 March 2026
Language
EN
Document type
Preprint