data structures - Understanding Fusion Trees? -
i stumbled across wikipedia page them:
and read class notes pdfs linked @ bottom, gets hand-wavy data structure , goes lot of detail sketch(x)
function. think part of confusion papers trying general, , specific example visualize.
is data structure appropriate storing data based on arbitrary 32 or 64 bit integer keys? how differ b-tree? there 1 section says it's b-tree branching factor b = (lg n)^(1/5)
. populated tree 32 bit keys, b 2. become binary tree? data structure intended use longer bit-strings keys?
my googling didn't turn terribly useful, welcome links on topic. passing curiosity, haven't been willing pay pdfs @ portal.acm.org
yet.
i've read (just quick pass) seminal paper , seems interesting. answers of questions in first page.
you may download paper here
hth!
Comments
Post a Comment