Database Paper Browser

Back to papers

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)

Paper ID
1150
Venue
PODS
Year
1998
Pagerank
4.1945683e-05
Overall Rank
12,727 | 11.47%
DOI
-

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.00065762967
95 Maintaining Views Incrementally 1993 SIGMOD 0.00050896659
481 Incremental Maintenance of Views with Duplicates 1995 SIGMOD 0.00022167223
Previous Page 1 / 1 Next

Semantically Similar Papers