Arity bounds in first-order incremental evaluation and definition of polynomial time database queries

Journal of Computer and System Sciences

Volumn 57, Issue 3, 1998, Pages 289-308

  Dong, Guozhu ^a   Jianwen, Su ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARITY BOUNDS; EHRENFEUCHT-FRAISSE GAMES; FIRST-ORDER INCREMENTAL EVALUATION SYSTEM;

COMPUTATIONAL COMPLEXITY; GAME THEORY; GRAPH THEORY;

QUERY LANGUAGES;

EID: 0032291533     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1565     Document Type: Article

References (32)

1. M. Ajtai and R. Fagin, Reachability is harder for directed than for undirected finite graphs, J. Symbolic Logic 55 (1990), 113-150.
2. S. Abiteboul, R. Hull, and V. Vianu, †Foundations of Databases,† Addison-Wesley, Reading, MA, 1995.
3. K. R. Apt and J.-M. Pugin, Maintenance of stratified databases viewed as a belief revision system, in "Proceedings, ACM Symposium on Principles of Databases systems," pp. 136-145, 1987.
4. A. L. Buchsbaum and M. C. Carlisle, Determining uniconnectivity in directed graphs, Inform. Process. Lett. 48 (1993), 9-12.
5. J. A. Blakeley, P.-A. Larson, and F. W. Tompa, Efficiency updating materialized views, in "Proceedings, ACM SIGMOD International Conference on Management of Data," pp. 61-71, 1986.
6. J. Cai, Lower bounds for constant-depth circuits in the presence of help bits, Inform. Process. Lett. 36 (1990), 79-83.
7. A. K. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982), 99-128.
8. G. Dong and R. Kotagiri, Incrementally evaluating constrained transitive closure by conjunctive querie, in "International Conference on Deductive and Object-Oriented Databases," 1997.
9. G. Dong, L. Libkin, and L. Wong, On impossibility of decremental recomputation of recursive queries in relational calculus and SQL, in "Proceedings, International Workshop on Database Programming Languages," 1997.
10. G. Dong and C. Pang, Maintaining transitive closure in first-order after node-set and edge-set deletions, Inform. Process. Lett. 62 (1997), 193-199.
11. G. Dong and J. Su, First-order incremental evaluation of datalog queries (extended abstract), in "Proceedings, 4th International Workshop on Database Programming Languages," 1993.
12. G. Dong and J. Su, Increment boundedness and nonrecursive incremental evaluation of datalog queries (extended abstract), in "Database Theory - ICDT'95" (G. Gottlob and M. Y. Vardi, Eds.), Lecture Notes in Computer Science, Vol. 893, pp. 397-410, Springer-Verlag, Berlin/New York, 1995.
13. G. Dong and J. Su, Incremental and decremental evaluation of transitive closure by first-order queries, Inform. Comput. 120 (1995), 101-106.
14. G. Dong and J. Su, Deterministic foies are strictly weaker, Ann. Math. Artificial Intelligence 19 (1997).
15. G. Dong, J. Su, and R. Topor, Nonrecursive incremental evaluation of datalog queries, Ann. Math. Artificial Intelligence 14 (1995), 187-223; Also appeared as Uni Melbourne CS TR 93/3, March 1993.
16. G. Dong and R. Topor, Incremental evaluation of datalog queries, in "Proceedings, International Conference on Database Theory," pp. 282-296, Berlin, Germany, 1992.
17. 1 arity hierarchies, Bull. European Assoc. Theoret. Comput. Sci. 61 (1997).
18. G. Dong and L. Zhang, Separating auxiliary arity hierarchy of first-order incremental evaluation using (3 + 1)-ary input relations, Technical report, 97/13, 8 pages, Computer Science Department, University of Melbourne, 1997.
19. A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961).
20. R. Fagin, Monadic generalized spectra, Z. Math. Logik Grund. Math. 21 (1975), 89-96.
21. R. Fraïssé, Sur les classifications des systèmes de relations, Publ. Sci. Univ. Alger, I 1 (1954).
22. R. Fagin, L. J. Stockmeyer, and M. Y. Vardi, On monadic NP vs monadic co-NP, Inform. Comput. 120 (1995), 78-93.
23. T. Griffin and L. Libkin, Incremental maintenance of views with duplicates, in "Proceedings, ACM SIGMOD International Conference on Management of Data," 1995.
24. A. Gupta, I. S. Mumick, and V. S. Subrahmanian, Maintaining views incrementally, in "Proceedings, ACM SIGMOD International Conference on Management of Data," pp. 157-166, 1993.
25. S. Grumbach and J. Su, Finitely representable databases, in "Proceedings, ACM Symposium on Principles of Database Systems," 1994.
26. R. Hull, Relative information capacity of simple relational schemata, SIAM J. Comput. 15 (1986), 856-886.
27. P. G. Kolaitis, A tutorial on combinatorial games in database theory, in "Proceedings, ACM Symposium on Principles of Database Systems," 1995.
28. V. Küchenhoff, On the efficient computation of the difference between consecutive database states, in "Proceedings, Second International Conference on Deductive Object-Oriented Databases" (C. Delobel, M. Kifer, and Y. Masunaga, Eds.), Lecture Notes in Computer Science, Vol. 566, pp. 478-502, Springer-Verlag, Berlin/New York, 1991.
29. P. B. Miltersen, S. Subramanian, J. S. Vitter, and R. Tamassia, Complexity models for incremental computation, Theor. Comput. Sci. 130 (1994), 203-236.
30. S. Patnaik and N. Immerman, Dyn-FO: A parallel dynamic complexity class, in "Proceedings, ACM Symposium on Principles of Database Systems," pp. 210-221, 1994.
31. R. Ramakrishnan, K. A. Ross, D. Srivastava, and S. Sudarshan, Efficient incremental evaluation of queries with aggregation, in "International Logic Programming Symposium," 1994.
32. O. Wolfson, H. M. Dewan, S. J. Stolfo, and Y. Yemini, Incremental evaluation of rules and its relationship to parallelism, in "Proceedings, ACM SIGMOD International Conference on Management of Data," pp. 78-87, 1991.