Re: Ben Pfaff's Paper Comparing AVL, Red-Black, And Other Trees.

Multi-level Trie Hashing by D.E. Zegour.

"Ben Pfaff" <blp@xxxxxxxxxxxxxxx> a écrit dans le message de news:
87d4k29hep.fsf@xxxxxxxxxxxxxxxxxxx
cri@xxxxxxxx (Richard Harter) writes:

As a matter of curiousity is there any work on arranging trees in
blocks, with a view to improving locality. That is, the space
for nodes is allocated in blocks large enought to hold, say, the
children, grandchildren, and great-granchildren of a node. When
we traverse the tree we make one fetch of 14 nodes in one place
rather three fetches of 1 node each from different places. There
are obvious variations on the theme. My question is whether
people do this sort of thing and whether it is worth doing.

Is that different from a B-tree?
--
"Mon peu de succès près des femmes est toujours venu de les trop aimer."
--Jean-Jacques Rousseau

.