Figure 4.1
Diagram of a binary tree showing nodes labeled X with subscripts, starting from X sub 0 at the root and branching symmetrically into multiple child nodes down to the leaf level.
An example of an H2 tree. The root node contains the range query over the entire domain. It’s left child node contains the range query over the first half of the domain while it’s right node contains the range query over the second half of the domain. The leaf nodes contain queries over single counts.
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal