Skip Navigation

The Computer Journal 1984 27(3):218-224; doi:10.1093/comjnl/27.3.218
© 1984 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bell, D. A.
Right arrow Articles by Deen, S. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Hash Trees Versus B-Trees

D. A. Bell1 * and S. M. Deen2 §

1 School of Computer Science, Ulster Polytechnic, Ulster, Ireland, 2 Department of Computing Science, University of Aberdeen, Aberdeen, UK

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.

Received May 1983.

* School of Computer Science, Ulster Polytechnic, UK

§ Department of Computing Science, University of Aberdeen, Aberdeen, UK


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.