QuaQue: Design and SQL Implementation of Condensed Algebra for Concurrent Versioning of Knowledge Graphs
This addresses the problem of managing concurrent versions in knowledge graphs for database and semantic web researchers, though it appears incremental as it builds on existing relational and versioning techniques.
The paper tackled the challenge of efficiently querying versioned knowledge graphs by introducing QuaQue, a system that translates SPARQL queries into SQL using a condensed algebra with bitstrings, resulting in performance benefits demonstrated in benchmarks against native RDF triple stores.
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.