Materializing Knowledge Bases via Trigger Graphs
Efthymia Tsamoura, David Carral, Enrico Malizia, Jacopo Urbani

TL;DR
This paper introduces Trigger Graphs to optimize the chase algorithm for materializing large knowledge bases, significantly reducing redundant computations and improving efficiency in real-world applications.
Contribution
It presents the concept of Trigger Graphs, algorithms for their computation, and an implementation that enhances the efficiency of KB materialization processes.
Findings
TGs can significantly reduce computation time in KB materialization.
The implemented engine can materialize 17 billion facts in under 40 minutes.
TGs outperform traditional chase algorithms in efficiency on real-world KBs.
Abstract
The chase is a well-established family of algorithms used to materialize Knowledge Bases (KBs), like Knowledge Graphs (KGs), to tackle important tasks like query answering under dependencies or data cleaning. A general problem of chase algorithms is that they might perform redundant computations. To counter this problem, we introduce the notion of Trigger Graphs (TGs), which guide the execution of the rules avoiding redundant computations. We present the results of an extensive theoretical and empirical study that seeks to answer when and how TGs can be computed and what are the benefits of TGs when applied over real-world KBs. Our results include introducing algorithms that compute (minimal) TGs. We implemented our approach in a new engine, and our experiments show that it can be significantly more efficient than the chase enabling us to materialize KBs with 17B facts in less than 40…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
