[Paper Review] Dynamic Conjunctive Queries

Thomas Zeume, Thomas Schwentick|arXiv (Cornell University)|Jan 1, 2014

Advanced Database Systems and Queries12 citations

TL;DR

This paper investigates dynamic conjunctive queries (DCQs) in the dynamic complexity framework, showing that extensions with negation and quantification capture powerful query classes. It establishes that DCQ with negation captures all first-order definable queries, and identifies a hierarchy of fragments under standard and Δ-semantics, with DynCQ ¬ subsuming DynQF and DynProp, while the exact separation between core fragments remains open.

ABSTRACT

The article investigates classes of queries maintainable by conjunctive queries (CQs) and their extensions and restrictions in the dynamic complexity framework of Patnaik and Immerman. Starting from the basic language of quantifier-free conjunctions of positive atoms, it studies the impact of additional operators and features - such as union, atomic negation and quantification - on the dynamic expressiveness, for the standard semantics as well as for Delta-semantics. Although many different combinations of these features are possible, they basically yield five important fragments for the standard semantics, characterized by the addition of (1) arbitrary quantification and atomic negation, (2) existential quantification and atomic negation, (3) existential quantification, (4) atomic negation (but no quantification), and by (5) no addition to the basic language at all. While fragments (3), (4) and (5) can be separated, it remains open whether fragments (1), (2) and (3) are actually different. The fragments arising from Delta-semantics are also subsumed by the standard fragments (1), (2) and (4). The main fragments of DynFO that had been studied in previous work, DynQF and DynProp, characterized by quantifier-free update programs with or without auxiliary functions, respectively, also fit into this hierarchy: DynProp coincides with fragment (4) and DynQF is strictly above fragment (4) and within fragment (3). As a further result, all (statically) FO-definable queries are captured by fragment (2) and a complete characterization of these queries in terms of non-recursive dynamic programs with existential update formulas with one existential quantifier is given.

Motivation & Objective

• To understand the relative expressiveness of dynamic conjunctive query extensions with negation, disjunction, and quantification in the dynamic complexity framework.
• To determine whether larger static query classes, such as first-order logic, can be captured by dynamic query classes with restricted syntax.
• To clarify the relationship between standard semantics and Δ-semantics in dynamic query maintenance.
• To investigate the separation and collapse of fragments within dynamic conjunctive query classes.
• To characterize the dynamic expressiveness of first-order logic using non-recursive dynamic ∃¹FO programs.

Proposed method

• The authors analyze dynamic query maintenance using the Patnaik-Immerman framework, where auxiliary relations are updated via first-order formulas after each database modification.
• They define dynamic conjunctive query fragments by extending quantifier-free conjunctive queries with operators like union, atomic negation, and existential/universal quantification.
• A key technique involves constructing first-order formulas that simulate sequences of insertions and deletions to maintain auxiliary relations, using induction over the number of modifications.
• The paper uses a 'guess and verify' approach in the final formula to simulate the effect of m insertions and deletions on a graph, enabling the capture of queries like reachability.
• It establishes connections between absolute semantics and Δ-semantics by proving that certain fragments under Δ-semantics are subsumed by standard semantics fragments.
• The authors prove that dynamic conjunctive queries with negation (DynCQ¬) capture all first-order definable queries, using a non-recursive dynamic ∃¹FO program construction.

Experimental results

Research questions

• RQ1 Can dynamic conjunctive queries extended with negation and quantification express all first-order definable queries?
• RQ2 How do different combinations of operators—such as union, negation, and quantification—affect the expressiveness of dynamic query classes?
• RQ3 Are the fragments DynCQ, DynCQ¬, and DynFO strictly separated, or do they collapse in the dynamic setting?
• RQ4 What is the relationship between standard semantics and Δ-semantics in the context of dynamic conjunctive queries?
• RQ5 Can the dynamic complexity framework capture static first-order logic using only non-recursive dynamic programs?

Key findings

• Dynamic conjunctive queries with negation (DynCQ¬) capture all first-order definable queries, providing a complete dynamic characterization of FO.
• The fragment DynCQ¬ subsumes both DynQF and DynProp, with DynQF strictly containing DynProp, confirming a hierarchy in dynamic expressiveness.
• Fragments defined by existential quantification and atomic negation (DynCQ¬) are strictly more expressive than those with only existential quantification or only negation.
• The paper establishes that under Δ-semantics, the expressive power of dynamic conjunctive query fragments is subsumed by their standard semantics counterparts.
• Despite the expressive power of DynCQ¬, the translation of a first-order query with k quantifiers into a dynamic program results in a program of arity at least k, indicating potential performance overhead.
• The paper leaves open whether fragments DynCQ, DynCQ¬, and DynFO are actually distinct, as no separation results are known for these classes.