There are several conditions that should be met for walking the index
to be faster than walking the table.
1) The most important one: index b-tree structure should be organized
in such way that one can walk directly from one leaf to another thus
traversing all leaves without touching interior page
I see the difference now...
So I take it that it's faster just to walk the table once rather than walk the
index?
Couldn't you just walk the index once? Smaller data space (quite likely),
better caching? It might be a wash or worse with the potential of having to
retreive other fields from
2 matches
Mail list logo
