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) de ned with respect to arity-bounded auxiliary relations.

• Type: Conference
• Year: 1999
• Where: DBPL
• Authors: Leonid Libkin, Limsoon Wong
• Keywords: Database, DBPL 1999, Deterministic Transitive Closure, Order Query, SQL-like Language