Abstract
This paper presents a fully dynamic algorithm for maintaining the transitive closure of a binary relation. All updates and queries can be computed by constant depth threshold circuits of polynomial size (TC 0 circuits). This places dynamic transitive closure in the dynamic complexity class DynTC 0, and implies that transitive closure can be maintained in database systems that include first-order update queries and aggregation operators, using a database with size polynomial in the size of the relation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
