Hash Trees Versus B-Trees
Open Access
- 1 January 1984
- journal article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 27 (3) , 218-224
- https://doi.org/10.1093/comjnl/27.3.218
Abstract
The hash trees method of external hashing is known to have advantages for certain types of primary key distribution. In this paper the value of the method as a general indexing technique—for secondary keys as well as primary keys—is assessed, and a comparison with the B-trees method is presented.Keywords
This publication has 0 references indexed in Scilit: