Tree should provide the tree management functionality (building and traversing), you'll simply need to write the code to build your tree. If your records are in the thousands and not tens or hundrends of thousands, you should be fine from a memory perspective, although the only way to really know is to try.
Alternately, since it sounds like you're dealing with referential integrity issues, you might consider the non-Perl solution of turning off the integrity constraints before you load and just have at it. If you load anything incorrectly, you won't be able to turn the constraints back on. Since you're copying this from an other data source, which I'm assuming is integral, this should work fine. It's an inelegant solution, but it should be pretty easy.
In reply to Re: Perl modules or standard tools for searching hierachical data
by agianni
in thread Perl modules or standard tools for searching hierachical data
by SlackBladder
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |