Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data 2005
DOI: 10.1145/1066157.1066175
|View full text |Cite
|
Sign up to set email alerts
|

A cost-based model and effective heuristic for repairing constraints by value modification

Abstract: Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes that, when applied, will cause the constraints to be satisfied. While in most previous work repair cost is stated in terms of tuple insertions and deletions, we follow recent work to define a database repair as a set of value modifications. In this context, we introduce a novel cost framework that allows for the application of techniques from re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
359
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 333 publications
(364 citation statements)
references
References 17 publications
(56 reference statements)
0
359
0
Order By: Relevance
“…Second, we are developing effective algorithms for discovering cfd p s and cind p s, along the same lines as [10,18,15]. Third, we plan to extend the methods of [5,13] to repair data based on cfd p s and cind p s, instead of using cfds [13], traditional fds and inds [5], denial constraints [4,12], and aggregate constraints [16].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Second, we are developing effective algorithms for discovering cfd p s and cind p s, along the same lines as [10,18,15]. Third, we plan to extend the methods of [5,13] to repair data based on cfd p s and cind p s, instead of using cfds [13], traditional fds and inds [5], denial constraints [4,12], and aggregate constraints [16].…”
Section: Discussionmentioning
confidence: 99%
“…Methods have been developed for discovering cfds [10,18,15] and for repairing data based on either cfds [13], traditional fds and inds taken together [5], denial constraints [4,12], or aggregate constraints [16]. We defer the treatment of these topics for cfd p s and cind p s to future work.…”
Section: Related Workmentioning
confidence: 99%
“…The traditional category of methods relies on a variety of constraints including FDs [1,11], CFDs [4], Integrity Constraints [9] and Inclusion Dependencies (INCs) [1] to detect inconsistency (or conflicts) between data aroused by erroneous data, and then work on resolving all the conflicts with expecting to fix all erroneous data in this way [2,8,9]. For general textual databases, most work in this category use FD/CFDs for repairing as they are the constraints within a single relational table, while some other work uses INCs for repairing between multiple relational tables.…”
Section: Related Workmentioning
confidence: 99%
“…So far, various data repairing solutions have been developed to automatically detect and repair erroneous data in databases [12]. The main stream of rule-based solutions [2,8,9] rely on a variety of quality rules such as FD/CFDs [1,4,11] to detect violations and conflicts between data. By resolving these violations and conflicts, they expect to fix the erroneous data.…”
Section: Introductionmentioning
confidence: 99%
“…The adornments are propagated over the literals in the body of the rule (as for non-disjunctive rules), and also to the head literal R (x, y, t a ). Therefore, this rule becomes: 14 y, f a ). Now, the new adorned atoms R b f b (x, y, t a ), R b f b (x, y, f a ) also have to be processed, producing adornments on rules defining predicate R, and so on.…”
Section: Y Z) ← R(z) M(x Z Y) Where the Only Extensional Atom Ismentioning
confidence: 99%