Dynamic membership for any fixed regular tree language is maintained in O(log n / log log n) per relabeling, with an exact constant-time class under a standard hardness conjecture.
http://db.ucsd.edu/wp-content/uploads/pdfs/212.pdf Incremental validation of XML documents
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Dynamic Membership for Regular Tree Languages
Dynamic membership for any fixed regular tree language is maintained in O(log n / log log n) per relabeling, with an exact constant-time class under a standard hardness conjecture.