947764ef_asi_Believable_Quantifier_Laws___Intervals_via_Matrix_encoding
Finding node’s children is trivial [Nested Sets] Finding node’s children as all the descendants restricted to the next level is inefficient (e.g. consider root node) [Materialized Path] Finding node’s children as descendants on next level is inefficient
Same as AR: Finding node’s children is trivial
One more Nested Intervals vs. Adjacency List comparison | Quasi Believable Quantifier Laws
Nested Intervals via Matrix encoding