Advertisement

BIT Numerical Mathematics

, Volume 15, Issue 3, pp 328–330 | Cite as

Hashing matrix subscripts

  • L. V. Atkinson
Scientific Notes

Abstract

In a recent paper [5] de Villiers and Wilson discuss hashing functions in connection with chained hash storage of sparse matrices. This short communication expands upon some points raised in the cited paper and gives a brief comparison of the storage requirements of open and chained hash tables in this context.

Key words

scatter storage open hash table chained hash table hash function sparse matrices 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. V. Atkinson,Hash code storage of sparse matrices, in preparation.Google Scholar
  2. 2.
    L. V. Atkinson and A. J. Cornah,Full period quadratic hashing, Int. Jour. of Comp. Math. Vol. 4, No. 2 (1974), 177–189.Google Scholar
  3. 3.
    J. R. Bell,The quadratic quotient method, Comm. of the ACM. Vol. 13, No. 2 (Feb. 1970), 107–109.CrossRefGoogle Scholar
  4. 4.
    J. R. Bell and C. H. Kaman,The linear quotient hash code, Comm. of the ACM. Vol. 13, No. 11 (Nov. 1970), 675–677.CrossRefGoogle Scholar
  5. 5.
    E. v. d. S. de Villiers and L. B. Wilson,Hashing the subscripts of a sparse matrix, BIT Vol. 14, No. 3 (1974), 347–358.Google Scholar

Copyright information

© BIT Foundations 1975

Authors and Affiliations

  • L. V. Atkinson
    • 1
  1. 1.Dept. of Applied Mathematics and Computing ScienceThe University of SheffieldSheffieldEngland

Personalised recommendations