On conjunctive queries containing inequalities
Journal of the ACM (JACM)
The design and analysis of algorithms
The design and analysis of algorithms
ACM Transactions on Database Systems (TODS)
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implementing (nondeterministic) parallel assignments
Information Processing Letters
Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A Discipline of Programming
Database System Implementation
Database System Implementation
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Combinatorial algorithms for feedback problems in directed graphs
Information Processing Letters
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Multi-query optimization for on-line analytical processing
Information Systems
Exploiting functional dependence in query optimization
Exploiting functional dependence in query optimization
Building the 4 Processor SB-PRAM Prototype
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Advanced Technology Track - Volume 5
Readings in Database Systems: Fourth Edition
Readings in Database Systems: Fourth Edition
Checking query containment with the CQC method
Data & Knowledge Engineering
Date on Database: Writings 2000-2006
Date on Database: Writings 2000-2006
Databases, Types and the Relational Model (3rd Edition)
Databases, Types and the Relational Model (3rd Edition)
Efficient exploitation of similar subexpressions for query processing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Conjunctive query containment and answering under description logic constraints
ACM Transactions on Computational Logic (TOCL)
Priority assignment heuristic to cohorts executing in parallel
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Optimizing complex queries with multiple relation instances
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Transition systems specified as a communication tool for e-learning
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Some algorithmic improvements for the containment problem of conjunctive queries with negation
ICDT'07 Proceedings of the 11th international conference on Database Theory
Genetic Algorithm for the Multiple-Query Optimization Problem
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
| Hi-index | 0.00 |
We investigate the problems involved in efficient implementation of multiple assignment to database tables, as suggested by Date and Darwen in their Third Manifesto proposal for future database systems [10]. We explain the connection between assignment and the INSERT, DELETE and UPDATE operations and why multiple assignments executed simultaneously are preferable to deferred constraint checking. Our contributions are twofold. Firstly, we enable the user to specify updates either in terms of the changes needed to the existing state or as the final table contents directly, with no degradation in performance. Secondly, when multiple tables are updated SQL places the responsibility on the user to order the update statements correctly. Integrity constraints must either be preserved in the unnecessary intermediate states or else deferred. Multiple assignment accepts updates across the entire database simultaneously and makes the system responsible for scheduling them correctly. We present methods for a proposed implementation that can potentially exceed the performance of SQL DBMSs by employing parallelism and multi-query optimization.