« the corrupt banking system | main | my beautiful lady waz'up? »
February 16, 2015
fractal tree
in fractal tree indexes, internal (non-leaf) nodes can have a variable number of child nodes within some pre-defined range. when data is inserted or removed from a node, its number of child nodes changes. in order to maintain the pre-defined range, internal nodes may be joined or split. each internal node of a b-tree will contain a number of keys that is one less than its branching factor. the keys act as separation values which divide its subtrees. keys in subtrees are stored in search tree order, that is, all keys in a subtree are between the two bracketing values. in this regard, they are just like b-trees.
plugin : html5 canvas painting fractals
posted by fuyubi @ 5:55 AM
Trackback
trackback url for this entry
http://aprilsnow.ciao.jp/mt/mt-tb.cgi/143