Ontology-based query answering (OBQA), without any doubt, represents one of the fundamental reasoning services in Semantic Web applications. Specifically, OBQA is the task of evaluating a (conjunctive) query over a knowledge base (KB) consisting of an extensional dataset paired with an ontology. A number of effective practical approaches proposed in the literature rewrite the query and the ontology into an equivalent Datalog program. In case of very large datasets, however, classical approaches for evaluating such programs tend to be memory consuming, and may even slow down the computation. In this paper, we explain how to compute a memory-saving evaluation plan consisting of an optimal indexing schema for the dataset together with a suitable body-ordering for each Datalog rule. To evaluate the quality of our approach, we compare our plans with the classical approach used by DLV over widely used ontological benchmarks. The results confirm the memory usage can be significantly reduced without paying any cost in efficiency.

Memory-Saving Evaluation Plans for Datalog

Costabile R.;Fiorentino A.;Perri S.;Zangari J.
2019

Abstract

Ontology-based query answering (OBQA), without any doubt, represents one of the fundamental reasoning services in Semantic Web applications. Specifically, OBQA is the task of evaluating a (conjunctive) query over a knowledge base (KB) consisting of an extensional dataset paired with an ontology. A number of effective practical approaches proposed in the literature rewrite the query and the ontology into an equivalent Datalog program. In case of very large datasets, however, classical approaches for evaluating such programs tend to be memory consuming, and may even slow down the computation. In this paper, we explain how to compute a memory-saving evaluation plan consisting of an optimal indexing schema for the dataset together with a suitable body-ordering for each Datalog rule. To evaluate the quality of our approach, we compare our plans with the classical approach used by DLV over widely used ontological benchmarks. The results confirm the memory usage can be significantly reduced without paying any cost in efficiency.
978-3-030-19569-4
978-3-030-19570-0
Data indexing
Datalog
Ontologies
Query answering
Query-plan
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/311900
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact