Complete rewriting system for tree-database queries

Develop a complete rewriting system for optimizing traversal queries and analytic queries in the tree-database model.

Background

The paper presents traversal-query rewriting based on algebraic identities such as distribution of composition over pairing, and analytic-query rewriting based on the composition rule for associative aggregate operations. These examples demonstrate optimization possibilities but do not constitute a complete rewriting framework.

The authors explicitly state that additional work is needed to develop a complete system capable of optimizing the evaluation of both traversal and analytic queries.

References

However, more work is needed in order to develop a complete rewriting system for optimizing the evaluation of traversal and analytic queries.

— Tree Databases  (2609.03538 - Spyratos, 3 Sep 2026) in Section 8, “Concluding remarks and perspectives,” research line “Query rewriting”