Maintaining transitive closure in first order after node-set and edge-set deletions

DOI10.1016/S0020-0190(97)00066-5zbMath1337.68087MaRDI QIDQ287062

Guozhu Dong, Chaoyi Pang

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

design of algorithmstransitive closurefirst-order definabilitydatabasesincremental query evaluationincremental view maintenanceonline computationrelational query

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (5)

Unnamed Item ⋮ Dominating sets in directed graphs ⋮ Irrelevant updates and self-maintainability in transitive closure database views ⋮ Arity bounds in first-order incremental evaluation and definition of polynomial time database queries ⋮ Maintenance of datalog materialisations revisited

Cites Work

• Incremental and decremental evaluation of transitive closure by first- order queries
• Nonrecursive incremental evaluation of Datalog queries
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maintaining transitive closure in first order after node-set and edge-set deletions