Consistent query answers from virtually integrated XML data

TL;DR: In this paper, the notion of consistent answer to a global query in the context of the local-as-view approach to data integration is characterized and a methodology for generating query plans for retrieving consistent answers to global queries is introduced.

TL;DR: This paper extends FDs to be satisfied in an XML document by comparing subtrees in a specified context of an XML tree by tackling the problem of repairing the inconsistency with respect to F in the most concise merged format of T.

TL;DR: It is shown that, in practice, it is beyond reach to find the optimum repairs; this problem is already NP-complete for a setting with a fixed DTD, a fixed set of functional dependencies, and equal weights for all of the nodes in the XML document.

TL;DR: This paper proposes an approach, called SC2QA, which utilizes XML conditional functional dependency (XCSD) to compute consistent answers for queries posted to arbitrary XML data to improve information quality.

TL;DR: The state of the art on the problem of answering queries using views is surveyed, the algorithms proposed to solve it are described, and the disparate works into a coherent framework are synthesized.

TL;DR: The formal basis of information-integration techniques, which are closely related to containment algorithms for conjunctive queries and/or Datalog programs, are reviewed.

TL;DR: The problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints is considered and its soundness and completeness are proved.

TL;DR: In this article, the authors consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints and present a method for computing consistent answers.