article · ACM Transactions on Database Systems · 1985

Linear hashing with overflow-handling by linear probing

Cited by 34Open access

Abstract

Linear hashing is a file structure for dynamic files. In this paper, a new, simple method for handling overflow records in connection with linear hashing is proposed. The method is based on linear probing and does not rely on chaining. No dedicated overflow area is required. The expansion sequence of liner hashing is modified to improve the performance, which requires changes in the address computation. A new address computation algorithm and an expansion algorithm are given. The performance of the method is studied by simulation. The algorithms for the basic file operations are very simple, and the overall performance is competitive with that of other variants of linear hashing.

Cite this paper

APA 7

Larson, P.-Å. (1985). Linear hashing with overflow-handling by linear probing. ACM Transactions on Database Systems, 10(1), 75–89. https://doi.org/10.1145/3148.3324

MLA 9

Larson, Per-Åke. “Linear hashing with overflow-handling by linear probing.” ACM Transactions on Database Systems, vol. 10, no. 1, 1985, pp. 75–89, https://doi.org/10.1145/3148.3324.

Chicago

Larson, Per-Åke. 1985. “Linear hashing with overflow-handling by linear probing.” ACM Transactions on Database Systems 10 (1): 75–89. https://doi.org/10.1145/3148.3324.

Harvard

Larson, P.-Å. (1985) ‘Linear hashing with overflow-handling by linear probing’, ACM Transactions on Database Systems, 10(1), pp. 75–89. Available at: https://doi.org/10.1145/3148.3324.

BibTeX

@article{larson1985linear,
  title = {{Linear hashing with overflow-handling by linear probing}},
  author = {Larson, Per-Åke},
  journal = {ACM Transactions on Database Systems},
  volume = {10},
  number = {1},
  pages = {75--89},
  year = {1985},
  doi = {10.1145/3148.3324}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.