Optimizing FOL reducible query answering
Abstract
We devise a query optimization framework for formalisms enjoying FOL reducibility of query answering, for which it reduces to the evaluation of a FOL query against facts. This framework allows searching within a set of alternative equivalent FOL queries, i.e., FOL reformulations, one with minimal evaluation cost when evaluated through a relational database system. We provide two algorithms , an exhaustive and a greedy, for exploring this space of alternatives. We apply this framework to the DL-LiteR description logic underpinning the W3C's OWL2 QL profile; an experimental evaluation validates the interest and applicability of our technique.
Domains
Databases [cs.DB]
Origin : Files produced by the author(s)
Loading...