Recursive Hierarchy Flattening
· 4 min read
Everyone who studies data structures and algorithms would come across
tree data structure and related algorithms at some point or the other.
The tree traversal algorithms provide the ability to do bottom-up
aggregation, top-down propagation, breadth first, depth first processing
and so on. While SQL provides a standard to process recursive data using
the WITH RECURSIVE
CTE clause, doing any complex analysis on recursive
data using SQL
is like using assembly language to build a web page.
As much as SQL Frames is a fan of SQL
, this is one of the use cases
where it has to breakaway from the limitations of it.