On the Power of Incremental Evaluation in SQL-Like Languages

We consider IES(SQL), the incremental evaluation system over an SQL-like language with grouping, arithmetics, and aggregation. We show that every second order query is in IES(SQL) and that there are PSPACE-complete queries in IES(SQL). We further show that every PSPACE query is in IES(SQL) augmented with a deterministic transitive closure operator. Lastly, we consider ordered databases and provide a complete analysis of a hierarchy on IES(SQL) defined with respect to arity-bounded auxiliary relations.

[1]  Ronald Fagin,et al.  On monadic NP vs. monadic co-NP , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[2]  Lauri Hella,et al.  Logics with aggregate operators , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[3]  V. S. Subrahmanian,et al.  Maintaining views incrementally , 1993, SIGMOD Conference.

[4]  Jianwen Su,et al.  Maintaining Transitive Closure of Graphs in SQL , 1999 .

[5]  Limsoon Wong,et al.  Local properties of query languages , 1997, Theor. Comput. Sci..

[6]  Neil Immerman,et al.  Dyn-FO: A Parallel, Dynamic Complexity Class , 1997, J. Comput. Syst. Sci..

[7]  Limsoon Wong,et al.  Query Languages for Bags and Aggregate Functions , 1997, J. Comput. Syst. Sci..

[8]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[9]  Limsoon Wong,et al.  Principles of Programming with Complex Objects and Collection Types , 1995, Theor. Comput. Sci..

[10]  Serge Abiteboul,et al.  Computing with First-Order Logic , 1995, J. Comput. Syst. Sci..

[11]  Inderpal Singh Mumick,et al.  The Stanford Data Warehousing Project , 1995 .

[12]  Kousha Etessami,et al.  Dynamic tree isomorphism via first-order updates to a relational database , 1998, PODS '98.

[13]  Limsoon Wong,et al.  On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL , 1995, DBPL.

[14]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[15]  Thomas A. Schultz.  ADEPT — The advanced database environment for planning and tracking , 1998, Bell Labs Technical Journal.

[16]  Jianwen Su,et al.  Arity Bounds in First-Order Incremental Evaluation and Definition of Polynomial Time Database Queries , 1998, J. Comput. Syst. Sci..

[17]  H. Gaifman.  On Local and Non-Local Properties , 1982 .

[18]  Leonid Libkin,et al.  On counting logics and local properties , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[19]  Surajit Chaudhuri,et al.  Maintenance of Materialized Views: Problems, Techniques, and Applications. , 1995 .

[20]  Limsoon Wong,et al.  Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions , 1997, DBPL.

[21]  Lauri Hella,et al.  Notions of Locality and Their Logical Characterizations over Finite Models , 1999, J. Symb. Log..