Pith. sign in

REVIEW 1 cited by

MillenniumDB: A Persistent, Open-Source, Graph Database

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.01540 v1 pith:ES5QZGA2 submitted 2021-11-02 cs.DB

classification cs.DB
keywords graphmillenniumdbquerydatadatabasemodelpersistentalgorithms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Single-Source Regular Path Querying in Terms of Linear Algebra

    cs.DS 2024-12 conditional novelty 6.0 of 10

    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.

Pith tools