downline efficiency
Posted: Sun Dec 16, 2007 2:04 pm
I am using the modified preorder tree traversal algorhythm to maintain downlines and uplines. The effiency is great, allowing me to traverse the uplines and downlines in one query wherever they're needed throughout the application.
I'm worried about once this application starts getting a decent amount of members. When new members are inserted into downlines, the left and right boundaries of a good portion of the downline table will have to be reindexed on every insert. How can I maximize efficiency of this? Is it worthy of NOT indexing those table fields and risk slower queries throughout the application?
I'm worried about once this application starts getting a decent amount of members. When new members are inserted into downlines, the left and right boundaries of a good portion of the downline table will have to be reindexed on every insert. How can I maximize efficiency of this? Is it worthy of NOT indexing those table fields and risk slower queries throughout the application?