Name
Abstract | ||
|---|---|---|
A query is unlively if it always returns an empty answer. Debugging a database schema requires not only determining unlively queries, but also fixing them. To the best of our knowledge, the existing methods do not provide the designer with an explanation of why a query is not lively. In this paper, we propose a method for computing explanations that is independent of the particular method used to determine liveliness. It provides three levels of search: one explanation, a maximal set of non-overlapping explanations, and all explanations. The first two levels require only a linear number of calls to the underlying method. We also propose a filter to reduce the number of these calls, and experimentally compare our method with the best known method for finding unsatisfiable subsets of constraints. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1321440.1321584 | CIKM |
Keywords | Field | DocType |
unlively query,existing method,database schema,unsatisfiable subsets,particular method,known method,empty answer,non-overlapping explanation,underlying method,linear number,computing explanation | Data mining,Maximal set,Information retrieval,Computer science,Database schema,Theoretical computer science,Database,Debugging | Conference |
Citations | PageRank | References |
5 | 0.50 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillem Rull | 1 | 93 | 11.24 |
| Carles Farré | 2 | 149 | 17.00 |
| Ernest Teniente | 3 | 1151 | 221.34 |
| Toni Urpí | 4 | 306 | 81.32 |