Martin, G. N. N. (1979) Spiral storage : incrementally augmentable hash addressed storage. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)

Preview

Text WRAP_Martin_cs-rr-027.pdf - Published Version Download (1037Kb) | Preview

Request Changes to record.

Abstract

Several well known techniques for organising data so that they
may be retrieved on some key attribute divide the data space
into k equal parts and use a function that maps all possible
values of the key attribute onto the integers 0 to k-1. When
storing a data item whose key maps to n, we attempt to place
the item in or near the n+1'th part of the data space.
However, as the number of data items that we wish to store
increases, we must increase the size of our data space, modify
the mapping function to suit the new value of k, and
reorganise the items already stored in the data space.
Traditionally this has been an expensive operation, and this
has limited the use of hashing to special situations. This
paper describes a simple mapping function that minimises the
impact of reorganisation. The technique is assessed by
calculating how many parts of the data space must be examined
in order to read or insert a data item. Depending on the
detailed implementation, we find we usually need only access
the part that holds or is to hold the data item.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Hashing (Computer science), Data structures (Computer science)
Series Name:	Theory of Computation Report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	March 1979
Dates:	Date Event March 1979 ["eprint_fieldopt_dates_date_type_available" not defined]
Number:	Number 27
Number of Pages:	17
DOI:	CS-RR-027
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Reuse Statement (publisher, data, author rights):	G.N.N. Martin, Spiral Storage: Incrementally Augmentable Hash Addressed Storage, IBM Technical Disclosure Bulletin 24 (10), pp. 4946-4949 (1982)
Access rights to Published version:	Open Access (Creative Commons)
Date of first compliant deposit:	1 August 2016
Date of first compliant Open Access:	1 August 2016
Version or Related Resource:	Martin, G.N.N. (1982). Spiral storage: incrementally augmentable hash addressed storage. IBM Technical Disclosure Bulletin, 24 (10), pp. 4946-4949.

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads