Goal-Driven Query Answering for Existential Rules with Equality

Inspired by the magic sets for Datalog, we present a novel goal-driven approach for answering queries over terminating existential rules with equality (aka TGDs and EGDs). Our technique improves the performance of query answering by pruning the consequences that are not relevant for the query. This is challenging in our setting because equalities can potentially affect all predicates in a dataset. We address this problem by combining the existing singularization technique with two new ingredients: an algorithm for identifying the rules relevant to a query and a new magic sets algorithm. We show empirically that our technique can significantly improve the performance of query answering, and that it can mean the difference between answering a query in a few seconds or not being able to process the query at all.

[1]  Sebastian Rudolph,et al.  Walking the Complexity Lines for Generalized Guarded Existential Rules , 2011, IJCAI.

[2]  Thomas Eiter,et al.  Query Rewriting for Horn-SHIQ Plus Rules , 2012, AAAI.

[3]  Yavor Nenov,et al.  Handling Owl: sameAs via Rewriting , 2014, AAAI.

[4]  Mario Alviano,et al.  Magic-Sets for Datalog with Existential Quantifiers , 2012, Datalog.

[5]  Paolo Papotti,et al.  That's All Folks! LLUNATIC Goes Open Source , 2014, Proc. VLDB Endow..

[6]  Boris Motik,et al.  Benchmarking the Chase , 2017, PODS.

[7]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

[8]  Sebastian Rudolph,et al.  Extending Decidable Existential Rules by Joining Acyclicity and Guardedness , 2011, IJCAI.

[9]  Jean-François Baget,et al.  Combining Existential Rules and Transitivity: Next Steps , 2015, IJCAI.

[10]  Raghu Ramakrishnan,et al.  Review - Magic Sets and Other Strange Ways to Implement Logic Programs , 1999, ACM SIGMOD Digit. Rev..

[11]  Bruno Marnette,et al.  Generalized schema-mappings: from termination to tractability , 2009, PODS.

[12]  Angela Bonifati,et al.  ChaseFUN: a Data Exchange Engine for Functional Dependencies at Scale , 2017, EDBT.

[13]  Jeff Heflin,et al.  LUBM: A benchmark for OWL knowledge base systems , 2005, J. Web Semant..

[14]  Phokion G. Kolaitis,et al.  Laconic Schema Mappings: Computing the Core with SQL Queries , 2009, Proc. VLDB Endow..

[15]  Giorgio Terracina,et al.  Efficiently Computable Datalog∃ Programs , 2012, KR.

[16]  Jean-François Baget,et al.  On rules with existential variables: Walking the decidability line , 2011, Artif. Intell..

[17]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[18]  Diego Calvanese,et al.  Ontop: Answering SPARQL queries over relational databases , 2016, Semantic Web.

[19]  Michaël Thomazo,et al.  Sound, Complete, and Minimal Query Rewriting for Existential Rules , 2013, IJCAI.

[20]  Jean-François Baget,et al.  Graal: A Toolkit for Query Answering with Existential Rules , 2015, RuleML.

[21]  Andrea Calì,et al.  Query Answering under Non-guarded Rules in Datalog+/- , 2010, RR.

[22]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[23]  Georg Gottlob,et al.  Polynomial Rewritings for Linear Existential Rules , 2015, IJCAI.

[24]  Georg Gottlob,et al.  Expressiveness of guarded existential rule languages , 2014, PODS.

[25]  Yavor Nenov,et al.  Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF Systems , 2014, AAAI.

[26]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[27]  Giovambattista Ianni,et al.  Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs , 2009, LPNMR.

[28]  Mario Alviano,et al.  Dynamic Magic Sets for Programs with Monotone Recursive Aggregates , 2011, LPNMR.

[29]  Mario Alviano,et al.  Magic Sets for disjunctive Datalog programs , 2012, Artif. Intell..

[30]  Giorgio Orsi,et al.  Query Rewriting and Optimization for Ontological Databases , 2014, TODS.

[31]  Boris Motik,et al.  Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies , 2013, J. Artif. Intell. Res..

[32]  Alin Deutsch,et al.  The chase revisited , 2008, PODS.