Static analysis in datalog extensions
Journal of the ACM (JACM)
How to Tackle Schema Validation by View Updating
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Checking query containment with the CQC method
Data & Knowledge Engineering
SVT: schema validation tool for microsoft SQL-server
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
SVTe: a tool to validate database schemas giving explanations
Proceedings of the 1st international workshop on Testing database systems
Providing Explanations for Database Schema Validation
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
MVT: a schema mapping validation tool
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Verification-driven slicing of UML/OCL models
Proceedings of the IEEE/ACM international conference on Automated software engineering
| Hi-index | 0.00 |
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.