Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Languages that capture complexity classes
SIAM Journal on Computing
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Complexity models for incremental computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
On a monadic NP vs monadic co-NP
Information and Computation
Incremental and decremental evaluation of transitive closure by first-order queries
Information and Computation
Principles of programming with complex objects and collection types
ICDT '92 Selected papers of the fourth international conference on Database theory
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Dyn-FO: a parallel, dynamic complexity class
Journal of Computer and System Sciences - Special issue on principles of database systems
Query languages for bags and aggregate functions
Journal of Computer and System Sciences - Special issue on principles of database systems
Dynamic tree isomorphism via first-order updates to a relational database
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Locality of order-invariant first-order formulas
ACM Transactions on Computational Logic (TOCL)
Logics with aggregate operators
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Deterministic FOIES are strictly weaker
Annals of Mathematics and Artificial Intelligence
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Incremental Evaluation of Datalog Queries
ICDT '92 Proceedings of the 4th International Conference on Database Theory
On the Power of Aggregation in Relational Query Languages
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Fully dynamic biconnectivity and transitive closure
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Annals of Mathematics and Artificial Intelligence
ACM Transactions on Database Systems (TODS)
Dynamic complexity theory revisited
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Proceedings of the 15th International Conference on Database Theory
The dynamic complexity of formal languages
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We study the problem of maintaining recursively defined views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanisms. The main results of this paper are negative ones: we show that a certain property of query languages implies impossibility of such incremental maintenance The property we use is locality of queries, which is known to hold for relational calculus and various extensions, including those with grouping and aggregate constructs (essentially, plain SQL).