Datalog reasoning over compressed RDF knowledge bases

Pan Hu, Jacopo Urbani, Boris Motik, Ian Horrocks

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

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 possible rule applications and can use a lot of memory for storing the derived facts, which can hinder performance. We present a novel materialisation technique that compresses the RDF triples so that the rules can sometimes be applied to multiple facts at once, and the derived facts can be represented using structure sharing. Our technique can thus require less space, as well as skip certain rule applications. Our experiments show that our technique can be very effective: when the rules are relatively simple, our system is both faster and requires less memory than prominent state-of-the-art RDF systems.

Original languageEnglish
Title of host publicationCIKM 2019 - Proceedings of the 28th ACM International Conference on Information and Knowledge Management
PublisherAssociation for Computing Machinery
Pages2065-2068
Number of pages4
ISBN (Electronic)9781450369763
DOIs
Publication statusPublished - 3 Nov 2019
Event28th ACM International Conference on Information and Knowledge Management, CIKM 2019 - Beijing, China
Duration: 3 Nov 20197 Nov 2019

Publication series

NameInternational Conference on Information and Knowledge Management, Proceedings

Conference

Conference28th ACM International Conference on Information and Knowledge Management, CIKM 2019
CountryChina
CityBeijing
Period3/11/197/11/19

Fingerprint

Dive into the research topics of 'Datalog reasoning over compressed RDF knowledge bases'. Together they form a unique fingerprint.

Cite this