A basis for deductive database systems. II
Journal of Logic Programming
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Integrity constraint checking in stratified databases
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Minimizing function-free recursive inference rules
Journal of the ACM (JACM)
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Foundations of semantic query optimization for deductive databases
Foundations of deductive databases and logic programming
A theorem-proving approach to database integrity
Foundations of deductive databases and logic programming
Metainterpreters for expert system construction
Journal of Logic Programming
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A path finding method for constraint checking in deductive databases
Data & Knowledge Engineering
Logic-based approach to semantic query optimization
ACM Transactions on Database Systems (TODS)
How to control unfolding when specializing interpreters
New Generation Computing
Logic programming and databases
Logic programming and databases
Integrity checking methods in deductive databases: a comparative evaluation
BNCOD 7 Proceedings of the seventh British national conference on Databases
Towards an algebraic theory of recursion
Journal of the ACM (JACM)
The impact of logic programming on databases
Communications of the ACM
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Equivalence of datalog queries is undecidable
Journal of Logic Programming
Deduction systems based on resolution
Handbook of logic in artificial intelligence and logic programming (vol. 1)
Automatic generation of production rules for integrity maintenance
ACM Transactions on Database Systems (TODS)
A slick procedure for integrity checking in deductive databases
Proceedings of the eleventh international conference on Logic programming
A new method for integrity constraint checking in deductive databases
Data & Knowledge Engineering
Efficient checking of temporal integrity constraints using bounded history encoding
ACM Transactions on Database Systems (TODS)
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Integrity constraints: semantics and applications
Logics for databases and information systems
Materialized views: techniques, implementations, and applications
Materialized views: techniques, implementations, and applications
Three types of redundancy in integrity checking: an optimal solution
Data & Knowledge Engineering
Integrity checking for multiple updates
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incremental maintenance of recursive views using relational calculus/SQL
ACM SIGMOD Record
An axiomatic basis for computer programming
Communications of the ACM
On XML integrity constraints in the presence of DTDs
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exploiting constraint-like data characterizations in query optimization
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Implementation of integrity constraints and views by query modification
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Logic, Programming, and PROLOG
Logic, Programming, and PROLOG
A Discipline of Programming
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Fast methods for testing quantified relational calculus assertions
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Thémis: a database programming language handling integrity constraints
The VLDB Journal — The International Journal on Very Large Data Bases - Persistent object systems
Static Management of Integrity in Object-Oriented Databases: Design and Implementation
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
An Effective Method for Integrity Constraint Simplification
Proceedings of the Fourth International Conference on Data Engineering
Decidable Containment of Recursive Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Incremental Validation of XML Documents
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Containment of Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Integrity Checking in Deductive Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Temporal Integrity Constraints with Indeterminacy
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Practical Applications of Triggers and Constraints: Success and Lingering Issues (10-Year Award)
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Deriving Production Rules for Constraint Maintainance
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Further Improvements on Integrity Constraint Checking for Stratifiable Deductive Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
A Survey of Current Methods for Integrity Constraint Maintenance and View Updating
ER '99 Proceedings of the Workshops on Evolution and Change in Data Management, Reverse Engineering in Information Systems, and the World Wide Web and Conceptual Modeling
Soft stratification for magic set based query evaluation in deductive databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Translating advanced integrity checking technology to SQL
Database integrity
The essence of computation: complexity, analysis, transformation
The essence of computation: complexity, analysis, transformation
Homeomorphic embedding for online termination of symbolic methods
The essence of computation
Advances in Database Technology - EDBT 2004
Advances in Database Technology - EDBT 2004
On the decidability of containment of recursive datalog queries - preliminary report
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hi-index | 0.00 |
Without proper simplification techniques, database integrity checking can be prohibitively time consuming. Several methods have been developed for producing simplified incremental checks for each update but none until now of sufficient quality and generality for providing a true practical impact, and the present paper is an attempt to fill this gap. On the theoretical side, a general characterization is introduced of the problem of simplification of integrity constraints and a natural definition is given of what it means for a simplification procedure to be ideal. We prove that ideality of simplification is strictly related to query containment; in fact, an ideal simplification pro-cedure can only exist in database languages for which query containment is decidable. However, simplifications that do not qualify as ideal may also be relevant for practical purposes. We present a concrete approach based on transformation operators that apply to integrity constraints written in a rich DATALOG-like language with negation. The resulting procedure produces, at design-time, simplified constraints for parametric transaction patterns, which can then be instantiated and checked for consistency at run-time. These tests take place before the execution of the update, so that only consistency-preserving updates are eventually given to the database. The extension to more expressive languages and the application of the framework to other contexts, such as data integration and concurrent database systems, are also discussed. Our experiments show that the simplifications obtained with our method may give rise to much better performance than with previous methods and that further improvements are achieved by checking consistency before executing the update.