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

March 19, 2026 Β· Grace Period Β· πŸ› DBKDA 2026, The Eighteenth International Conference on Advances in Databases, Knowledge, and Data Applications

⏳ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Jey Puget Gil, Emmanuel Coquery, John Samuel, Gilles Gesquière arXiv ID 2603.18654 Category cs.DB: Databases Citations 0 Venue DBKDA 2026, The Eighteenth International Conference on Advances in Databases, Knowledge, and Data Applications
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Databases

R.I.P. πŸ‘» Ghosted

Datasheets for Datasets

Timnit Gebru, Jamie Morgenstern, ... (+5 more)

cs.DB πŸ› CACM πŸ“š 2.6K cites 8 years ago