Hi list. We're about to implement an application, which will use a tree structure as the main taxonomy. Instead of implementing the algorithm ourself, we are considering using the tree from ezc. We are keen on using a modified preorder (nested set), but looking through the table at http://ezcomponents.org/docs/tutorials/Tree I had a few questions. When the phrase "Simple operation" is used, I suppose that it means that it's "cheap" to execute -- Not that the implementation is simple? Also, does "simple" mean that it's a constant cost or what happens, when the size of the tree scales? I'm sure, an in-depth answer gets rather complex, but some indication of how each operation scales, would be most informative. For example, I'm not entirely sure, what the implications of using LIKE on large datasets is? I suppose, that in theory, LIKE should be able to perform reasonably well, since the match is anchored, but I'm not sure how well MySql (We use MySql) works.
Thanks -- troels -- Components mailing list [email protected] http://lists.ez.no/mailman/listinfo/components
