6 citations · 11 across the 4 of their papers we have counts for
5 papers · 1 filter
Datalog Reasoning over Compressed RDF Knowledge Bases
Pan Hu, Jacopo Urbani, Boris Motik +1
Materialisation is often used in RDF systems as a preprocessing step to derive all facts implied by given RDF triples and rules. Although widely used, materialisation considers all…
Datalog Materialisation in Distributed RDF Stores with Dynamic Data Exchange
Temitope Ajileye, Boris Motik, Ian Horrocks
Several centralised RDF systems support datalog reasoning by precomputing and storing all logically implied triples using the wellknown seminaive algorithm. Large RDF datasets ofte…
Estimating the Cardinality of Conjunctive Queries over RDF Data Using Graph Summarisation
Giorgio Stefanoni, Boris Motik, Egor V. Kostylev
Estimating the cardinality (i.e., the number of answers) of conjunctive queries is particularly difficult in RDF systems: queries over RDF data are navigational and thus tend to in…
Optimised Maintenance of Datalog Materialisations
Pan Hu, Boris Motik, Ian Horrocks
To efficiently answer queries, datalog systems often materialise all consequences of a datalog program, so the materialisation must be updated whenever the input facts change. Seve…
Combining Rewriting and Incremental Materialisation Maintenance for Datalog Programs with Equality
Boris Motik, Yavor Nenov, Robert Piro +1
Materialisation precomputes all consequences of a set of facts and a datalog program so that queries can be evaluated directly (i.e., independently from the program). Rewriting opt…