Comparison of analytic restrictions with SQL HAVING

Determine how the restriction capabilities for analytic expressions in the tree-database model compare with the capabilities provided by the SQL HAVING clause, including which restrictions can be expressed or implemented in each framework.

Background

The paper describes several restriction mechanisms for analytic expressions, including restricting their grouping or measuring queries, restricting the resulting analytic function, and defining restrictions using other functions. It notes that some of these operations are not available in relational-algebra queries, although some may be expressible through SQL’s HAVING clause.

The paper explicitly identifies the comparison between the tree-database restriction mechanisms and SQL HAVING as unresolved.

References

So a relevant question here is: how the possibilities of restriction offered by our model compare with those offered by the `Having' clause of SQL? However interesting, the answer to this question lies outside the scope of the present paper.

Tree Databases  (2609.03538 - Spyratos, 3 Sep 2026) in Section 5, subsection “Analytic queries,” discussion of restrictions on analytic expressions