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
- 1. Kousha Etessami (AT&T)
BibTeX Citation
@inproceedings{etessami_pods98,
address = {New York, NY, USA},
series = {{PODS} '98},
title = {{Dynamic Tree Isomorphism via First-order Updates to a Relational Database}},
url = {https://dl.acm.org/doi/10.1145/275487.275514},
doi = {10.1145/275487.275514},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Etessami, Kousha},
year = {1998}
}
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 |
|---|---|---|---|---|
| 39 | Efficiently Updating Materialized Views | 1986 | SIGMOD | 0.00047309646 |
| 61 | Maintaining Views Incrementally | 1993 | SIGMOD | 0.00039026867 |
| 375 | Incremental Maintenance of Views with Duplicates | 1995 | SIGMOD | 0.00019681204 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,622 | Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data | 2012 | VLDB |
| 2 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 3 | 8,301 | The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract) | 1986 | PODS |
| 4 | 8,141 | First-Order Query Evaluation with Cardinality Conditions | 2018 | PODS |
| 5 | 636 | Answering Conjunctive Queries under Updates | 2017 | PODS |
| 6 | 1,467 | The Complexity of Evaluating Relational Queries | 1983 | PODS |
| 7 | 13,596 | Enumerating Answers to First-Order Queries over Databases of Low Degree | 2014 | PODS |
| 8 | 3,136 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS |
| 9 | 6,732 | Insert-Only versus Insert-Delete in Dynamic Query Evaluation | 2024 | PODS |
| 10 | 5,106 | Dyn-FO: A Parallel, Dynamic Complexity Class (Preliminary Version) | 1994 | PODS |