Now showing items 1-2 of 2
Query Processing under GLAV Mappings for Relational and Graph Databases
Schema mappings establish a correspondence between data stored in two databases, called source and target respectively. Query processing under schema mappings has been investigated extensively in the two cases where each ...
Data complexity of query answering in description logics
In this paper we study data complexity of answering conjunctive queries over Description Logic (DL) knowledge bases constituted by an ABox and a TBox. In particular, we are interested in characterizing the FOL-rewritability ...