Jump to content

  • Log In with Google      Sign In   
  • Create Account


#ActualShannon Barber

Posted 18 December 2012 - 09:30 PM

That's the start of a "b-tree". You still have a root-node, it's just an array instead of one node.
If you make all your nodes arrays then it's a b-tree.
For many applications b-trees are a superior design. They offer the recursive power of trees and the cache-coherency of arrays.

#5Shannon Barber

Posted 18 December 2012 - 09:30 PM

That's called a "b-tree". You still have a root-node, it's just an array instead of one node.
For many applications b-trees are a superior design. They offer the recursive power of trees and the cache-coherency of arrays.

#4Shannon Barber

Posted 18 December 2012 - 09:29 PM

That's just called a "b-tree". You still have a root-node, it's just an array instead of one node.
For many applications b-trees are a superior design. They offer the recursive power of trees and the cache-coherency of arrays.

#3Shannon Barber

Posted 18 December 2012 - 09:28 PM

That's just called a "b-tree". You still have a root-node, it's just an array instead of one node.
For many applications b-trees are a superior design. They offer the recursive power of trees and the cache-coherency of arrays.

#2Shannon Barber

Posted 18 December 2012 - 09:28 PM

That's just called a "b-tree". You still have a root-node, it's just an array instead of one node.
For many applications b-trees are a superior design. They offer the power of trees and the cache-coherency of arrays.

#1Shannon Barber

Posted 18 December 2012 - 09:27 PM

That's just called a "b-tree". You still have a root-node, it's just an array instead of one node.

PARTNERS