Reactive consistency control in deductive databases
- 1 December 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 16 (4), 670-702
- https://doi.org/10.1145/115302.115298
Abstract
Classical treatment of consistency violations is to back out a database operation or transaction.In applications with large numbers of fairly complex consistency constraints thisclearly is an unsatisfactory solution. Instead, if a violation is detected the user should begiven a diagnosis of the constraints that failed, a line of reasoning on the cause that could haveled to the violation, and suggestions for a repair. The problem is particularly complicated ina deductive database system...Keywords
This publication has 29 references indexed in Scilit:
- Towards an efficient evaluation of general queries: quantifier and disjunction processing revisitedACM SIGMOD Record, 1989
- Perspectives in deductive databasesThe Journal of Logic Programming, 1988
- Integrity constraint checking in stratified databasesThe Journal of Logic Programming, 1987
- On the modes and meaning of feedback to transaction designersACM SIGMOD Record, 1987
- A basis for deductive database systemsThe Journal of Logic Programming, 1985
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumptionThe Journal of Logic Programming, 1984
- The Grid FileACM Transactions on Database Systems, 1984
- Quintary treesACM Transactions on Database Systems, 1980
- System RACM Transactions on Database Systems, 1976
- Multi-attribute retrieval with combined indexesCommunications of the ACM, 1970