Dynamic Tree Isomorphism via First-order Updates to a Relational Database
Summary: Demonstrates that tree isomorphism can be maintained under updates using first-order (Dyn-FO) update rules over a relational database. Gives the first explicit graph problem in Dyn-FO not definable in FO+TC+COUNT, builds maintainable arithmetic and links Dyn-FO to dynamic constant-parallel time. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 55 | Efficiently Updating Materialized Views | 1986 | SIGMOD | 0.00065687017 |
| 97 | Maintaining Views Incrementally | 1993 | SIGMOD | 0.00050863077 |
| 482 | Incremental Maintenance of Views with Duplicates | 1995 | SIGMOD | 0.00022145976 |
Previous
Page 1 / 1
Next