Materializing Knowledge Bases via Trigger Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Proceedings of the VLDB Endowment (PVLDB) Year : 2021

Materializing Knowledge Bases via Trigger Graphs


The chase is a well-established family of algorithms used to materialize Knowledge Bases (KBs) for 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, called GLog, and our experiments show that it can be significantly more efficient than the chase enabling us to materialize Knowledge Graphs with 17B facts in less than 40 min using a single machine with commodity hardware.
Fichier principal
Vignette du fichier
trigger-graphs-tr.pdf (974.17 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-03344217 , version 1 (14-09-2021)



Efthymia Tsamoura, David Carral, Enrico Malizia, Jacopo Urbani. Materializing Knowledge Bases via Trigger Graphs. Proceedings of the VLDB Endowment (PVLDB), 2021, 14 (6), pp.943-956. ⟨10.14778/3447689.3447699⟩. ⟨lirmm-03344217⟩
89 View
9057 Download



Gmail Mastodon Facebook X LinkedIn More