Efficient Query Answering in DL-Lite through FOL Reformulation (Extended Abstract)

Damian Bursztyn (1, 2) , François Goasdoué (3, 2) , Ioana Manolescu (2, 1)

1 UP11 - Université Paris-Sud - Paris 11
2 OAK - Database optimizations and architectures for complex large data
3 PILGRIM - Gradedness, Imprecision, and Mediation in Database Management Systems

We propose a general query optimization framework for formalisms enjoying DL Lite 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 re-formulations, one with minimal evaluation cost when evaluated through a relational database management system. We provide two algorithms, an exhaustive and a greedy, for exploring the optimization space. This framework is applied to the lightweight description logic DL-LiteR underpinning the W3C's OWL2 QL profile, for which an experimental evaluation validates the interest and applicability of our technique.

Mots clés: DL-Lite; FOL reducibility; Query optimization

Domaines: Base de données [cs.DB]

Damian Bursztyn, François Goasdoué, Ioana Manolescu. Efficient Query Answering in DL-Lite through FOL Reformulation (Extended Abstract). 28th International Workshop on Description Logics, Jun 2015, Athens, Greece. ⟨hal-01155715⟩