www.www.zaachi.com »  My Blog

Modified Preorder Tree Traversal Algorithm #3

Publish: 18.1.2009 11:45:09

Modified preorder tree traversal is one of the meanings, how to save tree structure in relational database. In this third part we will finish moving of bundles and more we will create very simple method to renumber of embranchments.




Modified Preorder Tree Traversal Algoritm #2

Publish: 18.1.2009 11:45:16

Modified preorder tree traversal is one of the meanings, how to save tree structure in relational database. We will show in this article, how we can erase or move embranchments from created tree.




Modified Preorder Tree Traversal Algoritmus #1

Publish: 18.1.2009 11:45:20

Modified Preorder Tree Traversal is one of the methods, how to save tree structure of dates in relational databases. Methods, how to save tree structure is of course plenty, but not all are so efficient. We can use for example various recursive methods, which are mostly in the bigger size of trees very slow because of for gaining of the whole tree will be needed minimally as many SQL queries as many levels of branches is. Next chance is use container, which is faster then recursion, but also in the bigger size of tree we will rain down many SQL queries on database.




 

 

 

TOPLIST.cz
rss coments img img img