A vision for management of complex models
ACM SIGMOD Record
Materialized views in multidimensional databases
Multidimensional databases
Efficient Incremental Validation of XML Documents
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Optimizing recursive queries in SQL
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL
ACM Transactions on Database Systems (TODS)
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
A magic approach to optimizing incremental relational expressions
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
A flexible framework for multisensor data fusion using data stream management technologies
Proceedings of the 2009 EDBT/ICDT Workshops
Finite differencing of logical formulas for static analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Finite differencing of logical formulas for static analysis
ESOP'03 Proceedings of the 12th European conference on Programming
Refinement-based verification for possibly-cyclic lists
Program analysis and compilation, theory and practice
ACM Transactions on Database Systems (TODS)
A relaxed approach to integrity and inconsistency in databases
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Efficient integrity checking for databases with recursive views
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Efficient integrity checking over XML documents
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Effectively-Propositional reasoning about reachability in linked data structures
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Efficient tracking of moving objects using a relational database
Information Systems
Hi-index | 0.00 |
Views are a central component of both traditional database systems and new applications such as data warehouses. Very often the desired views (e.g. the transitive closure) cannot be defined in the standard language of the underlying database system. Fortunately, it is often possible to incrementally maintain these views using the standard language. For example, transitive closure of acyclic graphs, and of undirected graphs, can be maintained in relational calculus after both single edge insertions and deletions. Many such results have been published in the theoretical database community. The purpose of this survey is to make these useful results known to the wider database research and development community.There are many interesting issues involved in the maintenance of recursive views. A maintenance algorithm may be applicable to just one view, or to a class of views specified by a view definition language such as Datalog. The maintenance algorithm can be specified in a maintenance language of different expressiveness, such as the conjunctive queries, the relational calculus or SQL. Ideally, this maintenance language should be less expensive than the view definition language. The maintenance algorithm may allow updates of different kinds, such as just single tuple insertions, just single tuple deletions, special set-based insertions and/or deletions, or combinations thereof. The view maintenance algorithms may also need to maintain auxiliary relations to help maintain the views of interest. It is of interest to know the minimal arity necessary for these auxiliary relations and whether the auxiliary relations are deterministic. While many results are known about these issues for several settings, many further challenging research problems still remain to be solved.