Advertisement

Perspectives of Dynamic Complexity

  • Thomas Schwentick
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8071)

Abstract

Many current data processing scenarios deal with about large collections of permanently changing data. In this context, it is often outright impossible to compute the answer for a query from scratch. Rather some auxiliary data needs to be stored that helps answering queries quickly, but also requires to be maintained incrementally. This incremental maintenance scenario can be studied in various ways, e.g., from the perspective of dynamic algorithms with the goal to reduce (re-) computation time. Other options are to study the scenario from the perspective of low-level parallel computational complexity [3] or parallelizable database queries [1]. As the “lowest” complexity class AC0 (with a suitable unifomity condition) and the core of the standard database query language SQL both coincide with first-order predicate logic, one naturally arrives at the question which queries can be answered/maintained dynamically with first-order predicate logic (DynFO).

The most intensily studied query in this dynamic setting is the reachability query on graphs, arguably the “simplest recursive” query. It has been shown that it can be maintained in DynFO on undirected [3] or acyclic directed graphs [1]. However, whether it can be maintained on general directed graphs is considered the main open question of the field.

Actually, it turned out that showing that a given query can not be maintained in DynFO is a very challenging problem, for which currently no methods are available. Furthermore, even though AC0 is a small complexity class in the static setting, first-order logic is already quite powerful in the dynamic world. These two observations have recently led to the study of fragments of DynFO, e.g., by restricting or forbidding quantification, with the idea to start developing inexpressibility tools there. A surprising result found along these lines is that on strings, quantifier free predicate logic can exactly maintain the regular languages [2]. The talk will give an introduction into dynamic complexity, survey some of its most important results, and report about recent work on fragments of DynFO.

References

  1. 1.
    Dong, G., Su, J.: Incremental and decremental evaluation of transitive closure by first-order queries. Inf. Comput. 120(1), 101–106 (1995)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Gelade, W., Marquardt, M., Schwentick, T.: The dynamic complexity of formal languages. ACM Trans. Comput. Log. 13(3), 19 (2012)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Patnaik, S., Immerman, N.: Dyn-fo: A parallel, dynamic complexity class. J. Comput. Syst. Sci. 55(2), 199–209 (1997)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Thomas Schwentick
    • 1
  1. 1.Technische Universität DortmundGermany

Personalised recommendations