MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
LICS, pp. 769-778, 2018.
We investigate efficient enumeration of answers to MSO-definable queries over trees which are subject to local updates. We exhibit an algorithm that uses an O(n) preprocessing phase and enumerates answers with O(log(n)) delay between them. When the tree is updated, the algorithm can avoid repeating expensive preprocessing and restart the ...More
Full Text (Upload PDF)
PPT (Upload PPT)