Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 10th international conference on World Wide Web
Approximation algorithms
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
A cost-based model and effective heuristic for repairing constraints by value modification
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Improving data quality: consistency and accuracy
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Information preserving XML schema embedding
ACM Transactions on Database Systems (TODS)
Dependencies revisited for improving data quality
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On approximating optimum repairs for functional dependency violations
Proceedings of the 12th International Conference on Database Theory
Sampling the repairs of functional dependency violations under hard constraints
Proceedings of the VLDB Endowment
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Querying and repairing inconsistent XML data
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Repairing XML functional dependency violations
Information Sciences: an International Journal
| Hi-index | 0.00 |
We study the problem of repairing XML functional dependency violations by making the smallest value modifications in terms of repair cost. Our cost model assigns a weight to each leaf node in the XML document, and the cost of a repair is measured by the total weight of the modified nodes. We show that it is beyond reach in practice to find 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 the nodes in the XML document. To this end we provide an efficient two-step heuristic method to repair XML functional dependency violations. First, the initial violations are captured and fixed by leveraging the conflict hypergraph. Second, the remaining conflicts are resolved by modifying the violating nodes and their related nodes called determinants, in a way that guarantees no new violations. The experimental results demonstrate that our algorithm scales well and is effective in improving data quality.