Maintenance of stratified databases viewed as a belief revision system
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Incremental evaluation of rules and its relationship to parallelism
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Dyn-FO (preliminary version): a parallel, dynamic complexity class
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient incremental evaluation of queries with aggregation
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Incremental and decremental evaluation of transitive closure by first-order queries
Information and Computation
Combinatorial games in database theory
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Space-bounded FOIES (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Increment Boundedness and Nonrecursive Incremental Evaluation of Datalog Queries
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Deriving Production Rules for Incremental View Maintenance
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
First-Order Incremental Evaluation of Datalog Queries
DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages
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
Incremental recomputation in local languages
Information and Computation
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 |
After a bounded update to a database, a first-order incremental evaluation system (abbreviated foies) derives the new answer to an expensive database query by applying a first-order query on the old answer and perhaps some stored auxiliary relations. The auxiliary relations are also maintained in first order. A foies can be deterministic or nondeterministic, depending on whether its (stored) auxiliary relations are defined by deterministic or nondeterministic mappings (from databases). In this paper we study the impact of the determinism restriction on foies and we compare nondeterminism with determinism in foies. It turns out that nondeterministic foies are more powerful than the deterministic ones: deterministic foies using auxiliary relations with arity 1, and it is shown that there is a simple query which has a nondeterministic foies with binary auxiliary relations but does not have any deterministic foies with auxiliary relations of any arity. A strict arity hierarchy of deterministic foies is established for the small arities (