2016/05/07 by Adrian Onet, Onet, Adrian
Computer Science · Decision Sciences · #Advanced Database Systems and Queries #Computational Complexity (cs.CC) #Data Quality and Management #Databases (cs.DB) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Semantic Web and Ontologies #cs.CC #cs.DB #cs.LO
paper · pdf · doi:10.48550/arxiv.1605.02210
arxiv created 2016/05/07 · openalex publication_date 2016/05/07 · arxiv updated 2016/05/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Data Exchange is an old problem that was firstly studied from a theoretical point of view only in 2003. Since then many approaches were considered when it came to the language describing the relationship between the source and the target schema. These approaches focus on what it makes a target instance a "good" solution for data-exchange. In this paper we propose the inference-based semantics that solves many certain-answer anomalies existing in current data-exchange semantics. To this we introduce a new mapping language between the source and the target schema based on annotated bidirectional dependencies (abd) and, consequently define the semantics for this new language. It is shown that the ABD-semantics can properly represent the inference-based semantics, for any source-to-target mappings. We discovered three dichotomy results under the new semantics for solution-existence, solution-check and UCQ evaluation problems. These results rely on two factors describing the annotation used in the mappings (density and cardinality). Finally we also investigate the certain-answers evaluation problem under ABD-semantics and discover many tractable classes for non-UCQ queries even for a subclass of CQ with negation.