Technical term for "flat" tree structure

I have a table with a tree structure.

id  parent name 
---------------
1   NULL   A   
2   1      B   
3   2      C
4   2      D   
5   NULL   E
6   5      F
7   5      G 

      

My SP returns a "flat" recordset based on the node level (which I later export to excel)

level1 level2 level3 id name path
---------------------------------
A                    1  A    A
       B             2  B    A->B
              C      3  C    A->B->C
              D      4  D    A->B->D
E                    5  E    E
       F             6  F    E->F
       G             7  G    E->G

      

What could be the technical term for such a structure? (Is this the pivot?)

PS: Basically I need to know the technical term for naming this SP and what to show to end users in the UI.

+3
sql tree


source to share


No one has answered this question yet

Check out similar questions:

1256
What are the options for storing hierarchical data in a relational database?
452
What is the most efficient / elegant way to parse a flat table into wood?
438
Java tree data structure?
five
Binary tree from common tree
3
Select from two tables based on the values โ€‹โ€‹of one of the tables
1
building a hierarchy of 3 tables
1
How to match path when moving tree structure
1
Neo4j Cypher - Load tree structure from CSV
0
Build a tree structure from records
0
Creating a hierarchy (tree structure)



All Articles
Loading...
X
Show
Funny
Dev
Pics