Name
Abstract | ||
|---|---|---|
The chase procedure, an algorithm proposed 25+ years ago to fi x con- straint violations in database instances, has been success fully applied in a variety of contexts, such as query optimization and data exchange. Its practicability, how- ever, is limited by the fact that - for an arbitrary set of cons traints - it might not terminate; even worse, chase termination is an undecidable problem in general. In response, the database community has proposed sufficient re strictions on top of the constraints that guarantee chase termination on any database instance. In this paper, we propose a sufficient termination condition, calle d inductive restriction, which strictly generalizes previous conditions, but can be checked as efficiently. |
Year | Venue | Keywords |
|---|---|---|
2009 | AMW | data exchange,query optimization |
Field | DocType | Citations |
Query optimization,Data mining,Data exchange,Computer science,Theoretical computer science,Chase,Undecidable problem | Conference | 0 |
PageRank | References | Authors |
0.34 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Meier | 1 | 58 | 10.74 |
| Michael Schmidt | 2 | 104 | 11.66 |
| Georg Lausen | 3 | 3687 | 526.29 |