Maintaining transitive closure in first order after node-set and edge-set deletions
- 28 May 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 62 (4) , 193-199
- https://doi.org/10.1016/s0020-0190(97)00066-5
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Incremental and Decremental Evaluation of Transitive Closure by First-Order QueriesInformation and Computation, 1995
- Nonrecursive incremental evaluation of Datalog queriesAnnals of Mathematics and Artificial Intelligence, 1995
- Incremental recomputation of active relational expressionsIEEE Transactions on Knowledge and Data Engineering, 1991