The Dynamic Complexity of Transitive Closure Is in DynTC°
This paper presents a fully dynamic algorithm for maintaining the transitive closure of a directed graph. All updates and queries can be computed by constant depth threshold circuits of polynomial size (TC° circuits). This places transitive closure in the dynamic complexity class DynTC°, and implies that transitive closure can be maintained in databases using updates written in a first order query language plus counting operators, while keeping the size of the database polynomial in the size of the graph.
Unable to display preview. Download preview PDF.
- 1.Barrington, Immerman, and Straubing. On uniformity within NC 1. In SCT: Annual Conference on Structure in Complexity Theory, 1988.Google Scholar
- 3.G. Dong, L. Libkin, and L. Wong. On impossibility of decremental recomputation of recursive queries in relational calculus and SQL. In International Workshop on Database Programming Languages, 1995.Google Scholar
- 5.Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 79–89, New York, May 23-26 1998. ACM Press.Google Scholar
- 8.Leonid Libkin and Limsoon Wong. Incremental recomputation of recursive queries with nested sets and aggregate functions. In Proc. of Database Programming Languages (DBPL’97), pages 222–238, Estes Park, CO, 1998. Springer-Verlag, Lecture Notes in Computer Science 1369.Google Scholar