CiteULike dmeister's CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Spiral Storage: Efficient Dynamic Hashing with Constant Performance Export

by: J. K. Mullin
The Computer Journal, Vol. 28, No. 3. (1 March 1985), pp. 330-334.

Citation Format

[Posts]

View FullText article


dmeister's tags for this article

foundation hashing

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

We describe and analyse a dynamic hashing method called Spiral Storage'. Dynamic hashing methods extend the power of conventional hashing methods by avoiding the need to have good initial estimates of the storage demand. The file storage space will grow or shrink with demand. Spiral Storage' is the only known dynamic hashing method which provides constant average performance while the storage space changes in proportion to the storage demand. The performance of the method with link chained overflow is investigated. Results of analysis and of simulations confirm the utility of the method. 10.1093/comjnl/28.3.330


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.