Deterministic FOIES are strictly weaker

Annals of Mathematics and Artificial Intelligence

Volumn 19, Issue 1-2, 1997, Pages 127-146

  Dong, Guozhu ^a   Su, Jianwen ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031500174     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018951521198     Document Type: Article

References (26)

1. S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, 1995).
2. K.R. Apt and J.-M. Pugin, Maintenance of stratified databases viewed as a belief revision system, in: Proc. ACM Symp. on Principles of Database Systems (1987) pp. 136-145.
3. A.V. Aho and J.D. Ullman, Universality of data retrieval languages, in: Proc. ACM Symp. on Principles of Programming Languages (1979) pp. 110-120.
4. A.K. Chandra and D. Harel, Computable queries for relational data bases, J.C.S.S. 21 (1980) 156-178.
5. AAAS Workshop on Advances in Data management for the Scientist and Engineer, in: Proceedings of the NSF Scientific Database Projects, Boston, MA (February 1993).
6. S. Ceri and J. Widom, Deriving production rules for incremental view maintenance, in: Proc. Int. Conf. Very Large Databases (1991).
7. G. Dong and R. Kotagiri, Incrementally evaluating constrained transitive closure by conjunctive queries, Technical Report 94/11, Computer Science, University of Melbourne (1994). Revised July 1995.
8. G. Dong, L. Libkin and L. Wong, On impossibility of decremental recomputation of recursive queries in relational calculus and SQL, in: Proc. Int. Workshop on Database Programming Languages (1995).
9. G. Dong and C. Pang, First-order maintenance of transitive closure over acyclic node and edge updates, Technical Report 95/5, Computer Science, University of Melbourne (1995).
10. G. Dong and J. Su, First-order incremental evaluation of DATALOG queries (extended abstract), in: Proc. 4th Int. Workshop on Database Programming Languages (1993).
11. G. Dong and J. Su, Increment boundedness and nonrecursive incremental evaluation of DATALOG queries (extended abstract), in: Database Theory - ICDT '95, eds. G. Gottlob and M.Y. Vardi (Springer-Verlag, 1995) pp. 397-410.
12. G. Dong and J. Su, Incremental and decremental evaluation of transitive closure by first-order queries, Information & Computation 120 (1995) 101-106.
13. G. Dong and J. Su, Space-bounded FOIES, invited to the J.C.S.S. Special Issue on PODS'95; an extended abstract appears in Proc. ACM Symp. on Principles of Database Systems (1995) pp. 139-150.
14. G. Dong, J. Su and R. Topor, Nonrecursive incremental evaluation of DATALOG queries, Ann. of Math, and AI 14 (1995) 187-223.
15. G. Dong and R. Topor, Incremental evaluation of DATALOG queries, in: Proc. Int'l Conference on Database Theory (1992) pp. 282-296.
16. 1 arity hierarchies, TR 96/27, Computer Science, University of Melbourne (July 1996).
17. A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961).
18. R. Fraïssé, Sur les classifications des systèmes de relations, Publ. Sci. Univ. Alger. I(1) (1954) 35-182.
19. T. Griffin and L. Libkin, Incremental maintenance of views with duplicates, in: Proc. ACM SIGMOD Int. Conf. on Management of Data (1995).
20. A. Gupta, I.S. Mumick and V.S. Subrahmanian, Maintaining views incrementally, in: Proc. ACM SIGMOD Int. Conf. on Management of Data (1993) pp. 157-166.
21. P.G. Kolaitis, A tutorial on combinatorial games in database theory, in: Proc. ACM Symp. on Principles of Database Systems (1995).
22. V. Küchenhoff, On the efficient computation of the difference between consecutive database states, in: Proc. 2nd Int. Conf. on Deductive Object-Oriented Databases, eds. C. Delobel, M. Kifer and Y. Masunaga (Springer-Verlag, 1991) pp. 478-502.
23. S. Patnaik and N. Immerman, Dyn-FO: a parallel dynamic complexity class, in: Proc. ACM Symp. on Principles of Database Systems (1994) pp. 210-221.
24. X. Qian and G. Wiederhold, Incremental recomputation of active relational expressions, IEEE Trans. on Knowledge and Data Eng. 3 (1991) 337-341.
25. R. Ramakrishnan, K.A. Ross, D. Srivastava and S. Sudarshan, Efficient incremental evaluation of queries with aggregation, in: Int. Logic Programming Symp. (1994).
26. O. Wolfson, H.M. Dewan, S.J. Stolfo and Y. Yemini, Incremental evaluation of rules and its relationship to parallelism, in: Proc. ACM SIGMOD Int. Conf. on Management of Data (1991) pp. 78-87.