handling TreeGadgets with many entries
Posted: Tue May 27, 2003 11:04 am
Hi forum,
i have to handle a lot of data (> 50,000 entries) in a TreeGadget.
When starting my app reads the entries to be displayed from a flatfile. The entries are then to be organized in few major (few 1,000 entries each) and many minor nodes (up to 100-500 entries each).
I thought i could speed this up if i saved the entries of a tree - once constructed - as a separate text file and then reconstruct the tree from this file after restarting the app.
However, for a sample file of about 30,000 entries to be displayed it takes roughly 1.5 minutes of computing time - regardless of the method to construct the tree. Obviously, determing the entries and the level of the entries to be displayed at costs almost no time.
Now i wonder why it takes so long to just add entries to the end of a TreeGadget list. Is there a way to speed this up?? Is there a faster API function for trees???
thanx, searhin
i have to handle a lot of data (> 50,000 entries) in a TreeGadget.
When starting my app reads the entries to be displayed from a flatfile. The entries are then to be organized in few major (few 1,000 entries each) and many minor nodes (up to 100-500 entries each).
I thought i could speed this up if i saved the entries of a tree - once constructed - as a separate text file and then reconstruct the tree from this file after restarting the app.
However, for a sample file of about 30,000 entries to be displayed it takes roughly 1.5 minutes of computing time - regardless of the method to construct the tree. Obviously, determing the entries and the level of the entries to be displayed at costs almost no time.
Now i wonder why it takes so long to just add entries to the end of a TreeGadget list. Is there a way to speed this up?? Is there a faster API function for trees???
thanx, searhin