Share This Author
A cost-based model and effective heuristic for repairing constraints by value modification
It is proved that finding minimal-cost repairs in this model is NP-complete in the size of the database, and an approach to heuristic repair-construction based on equivalence classes of attribute values is introduced.
Keys for XML
We discuss the definition of keys for XML documents, payingparticular attention to the concept of a relative key, which is commonly used in hierarchically structured documents and scientific…
Conditional Functional Dependencies for Data Cleaning
- P. Bohannon, W. Fan, Floris Geerts, X. Jia, Anastasios Kementsietsidis
- Computer ScienceIEEE 23rd International Conference on Data…
- 15 April 2007
This work develops techniques for detecting CFD violations in SQL as well as novel techniques for checking multiple constraints in a single query, and experimentally evaluates the performance of the CFD-based methods for inconsistency detection.
Secure XML querying with security views
This work is the first to study a flexible, DTD-based access-control model for XML and its implications on the XML query-execution engine and is among the first efforts for query rewriting and optimization in the presence of general DTDs for a rich a class of XPath queries.
Improving Data Quality: Consistency and Accuracy
This paper proposes two algorithms: one for automatically computing a repair D' that satisfies a given set of CFDs, and the other for incrementally finding a repair in response to updates to a clean database.
XPath satisfiability in the presence of DTDs
A finer analysis of the problem for particular classes of DTDs is given, exploring the impact of various DTD constructs, identifying tractable cases, as well as providing the complexity in the query size alone.
Reasoning about Keys for XML
Conditional functional dependencies for capturing data inconsistencies
This work proposes a class of integrity constraints for relational databases, referred to as conditional functional dependencies (CFDs), and provides an inference system analogous to Armstrong's axioms for FDs, and shows that the implication problem is coNP-complete for CFDs in contrast to the linear-time complexity for their traditional counterpart.
Structural properties of XPath fragments
Structural properties of each of the main sublanguages of navigational XPath (W3c Recommendation) commonly used in practice are studied, providing sound and complete axiom systems and normal forms for several of these fragments.
Reasoning about Record Matching Rules
A class of matching dependencies (MDs) for specifying the semantics of data in unreliable relations is introduced, defined in terms of similarity metrics and a dynamic semantics, and a mechanism for inferring MDs is proposed, a departure from traditional implication analysis.