Hash Trees Versus B-Trees

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1984 English Publisher:Oxford University Press (OUP)Journal:The Computer Journal, volume 27, pages 218-224 (issn: 0010-4620, eissn: 1460-2067,

Copyright policy )

Authors: David A. Bell; S. Misbah Deen;

doi: 10.1093/comjnl/27.3.218

Hash Trees Versus B-Trees

- Summary
- Subjects
- Metrics

Abstract

Summary: 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 comparison with the B-trees method is presented.

Related Organizations

University of Aberdeen
United Kingdom

Keywords

external hashing, Data structures, Information storage and retrieval of data, file organization, hash trees, B-trees, indexing

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average