"H. Peter Anvin" wrote:
> Hans Reiser wrote:
> > To explain what hpa says:
> > hashing destroys correlations in access (locality of reference), B-trees can
> > preserve it, RAM is less sensitive to correlations in access than disk is, thus
> > there is less motivation for balanced trees for in RAM accesses. The more you
> > employ technologies like RAMBUS (somewhat) and NUMA (much more so), the more
> > motivation to use trees.
> With "trees" here read "B-trees, or other trees with high fanout."
> In-RAM structures usually use low-fanout trees.
hpa is right, slip trees are not effective for secondary memory storage, but are
considered excellent for local RAM only applications.
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to email@example.com
Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Wed Jun 07 2000 - 21:00:12 EST