Hi everyone,
I wrote some functionality that returns parent or parents, children and descendants using the hierarchy table.
I notice that getting the full tree starting from a node ( eg. a country ) will cause memory error, this because I actually do lots of queries calling recursively my fetchChildren method.
Is there a smart way to return all descendants from a node?
Actually the memory error was caused by a script error, so I can fetch descendants from at least from a country node.
Maybe a good solution could be to apply the preordered tree traversal algorithm to the hierarchy table..