Preorder Tree Traversal implementation for heirarchical data

Hello developers and mods,

Please forgive me if this posts doesn't fit in this category. Please remove if out of topic.

I would just like to inquire if there is any plan of implementing Preorder Tree Traversal for hierarchical data? I believe this is much much faster for simultaneous lookup of categories/subcategories. Yes, adding item to a node or moving item(ie. category) can take a hit on the database due to re-ordering of indexes(left,right) it would mean faster retrieval for multiple queries. No need to use recursive function call just to get categories and subcategories hierarchy.

Just a question/suggestion.

Yes, there are plans for the near future to implement MPTT, as this will provide significant performance gains, in addition to a number of refactored product-info retrieval functions.

... stay tuned !

(See the posted Roadmap for more information on related plans)