LARPQ evaluates two-way regular path queries by expressing the simultaneous traversal of graph and query automaton as Boolean linear algebra, with a correctness proof and a mixed but often favorable performance evaluation.
MillenniumDB: A Persistent, Open-Source, Graph Database
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this systems paper, we present MillenniumDB: a novel graph database engine that is modular, persistent, and open source. MillenniumDB is based on a graph data model, which we call domain graphs, that provides a simple abstraction upon which a variety of popular graph models can be supported. The engine itself is founded on a combination of tried and tested techniques from relational data management, state-of-the-art algorithms for worst-case-optimal joins, as well as graph-specific algorithms for evaluating path queries. In this paper, we present the main design principles underlying MillenniumDB, describing the abstract graph model and query semantics supported, the concrete data model and query syntax implemented, as well as the storage, indexing, query planning and query evaluation techniques used. We evaluate MillenniumDB over real-world data and queries from the Wikidata knowledge graph, where we find that it outperforms other popular persistent graph database engines (including both enterprise and open source alternatives) that support similar query features.
citation-role summary
citation-polarity summary
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Single-Source Regular Path Querying in Terms of Linear Algebra
LARPQ evaluates two-way regular path queries by expressing the simultaneous traversal of graph and query automaton as Boolean linear algebra, with a correctness proof and a mixed but often favorable performance evaluation.