Dyn-FO: A Parallel, Dynamic Complexity Class (Preliminary Version)
Summary: Define Dyn-FO: properties maintainable under single-tuple inserts/deletes/queries by first-order updates, and show surprising upper bounds (graph connectivity, k-edge connectivity, MST, plus approximations for NP optimization) despite static FO impossibility. Introduce bounded-expansion reductions that preserve dynamic classes, separate static vs dynamic completeness (some NL/L-complete problems lose completeness), and show AGAP+ is unlikely in Dyn-FO unless P collapses into parallel linear time. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sushant Patnaik (University of Massachusetts Amherst)
- 2. Neil Immerman (University of Massachusetts Amherst)
BibTeX Citation
@inproceedings{patnaik_pods94,
address = {New York, NY, USA},
series = {{PODS} '94},
title = {{Dyn-FO: A Parallel, Dynamic Complexity Class (Preliminary Version)}},
url = {https://dl.acm.org/doi/10.1145/182591.182614},
doi = {10.1145/182591.182614},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Patnaik, Sushant and Immerman, Neil},
year = {1994}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,080 | View Maintenance Issues for the Chronicle Data Model (Extended Abstract) | 1995 | PODS | 9.2052704e-05 |
| 5,413 | Using Witness Generators to Support Bi-directional Update Between Object-Based Databases | 1995 | PODS | 6.2269846e-05 |
| 12,988 | Space-Bounded FOIES | 1995 | PODS | 5.093636e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 61 | Maintaining Views Incrementally | 1993 | SIGMOD | 0.00039026867 |
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 2 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 3 | 5,523 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS |
| 4 | 1,013 | Dynamic Programming Strikes Back | 2008 | SIGMOD |
| 5 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 6 | 13,129 | Complexity of Query Processing in Databases with OR-Objects | 1989 | PODS |
| 7 | 7,886 | Polynomial-time program transformations in deductive databases | 1990 | PODS |
| 8 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 9 | 7,052 | The Parameterized Complexity of Database Queries | 2001 | PODS |
| 10 | 12,920 | Dynamic Tree Isomorphism via First-order Updates to a Relational Database | 1998 | PODS |