Warren Vail wrote:
I did one once where the key to the table was a string, and the string
contained 1 to n Node Numbers separated by a separator character.
"1"
"1.1"
"1.1.1"
"1.2"
select data from table where node between (1 and 2)
resulted in an entire limb of the tree being retrieved. Limitation
Marek Kilimajer wrote:
This should be of your interest:
http://www.evolt.org/article/Four_ways_to_work_with_hierarchical_data/17/4047/
Indeed! The "flat table model" is simple, efficient and - I think -
sufficient. Thanks!
I also found this article which explains the "fourth" method not reall
I did one once where the key to the table was a string, and the string
contained 1 to n Node Numbers separated by a separator character.
"1"
"1.1"
"1.1.1"
"1.2"
select data from table where node between (1 and 2)
resulted in an entire limb of the tree being retrieved. Limitations were
the size
This should be of your interest:
http://www.evolt.org/article/Four_ways_to_work_with_hierarchical_data/17/4047/
Mattias Thorslund wrote --- napĂsal::
Hi,
I wonder what you think are the best (or "least worst") strategies to
store and retrieve hierarchial data (such as a "threaded" discussion or
a
4 matches
Mail list logo