>>>Bruno Wolff III said:> The documentation gives the specific algorithms used:> The B-tree index is an implementation
ofLehman-Yao high-concurrency> B-trees. The R-tree index method implements standard R-trees using> Guttman's
quadraticsplit algorithm. The hash index is an> implementation of Litwin's linear hashing. We mention the
algorithms> used solely to indicate that all of these access methods are fully> dynamic and do not have to be
optimizedperiodically (as is the case> with, for example, static hash access methods).
I was under the impression that hash indexes were not recommended for
concurrent updates etc?
Daniel
