Compact Hash Tables Using Bidirectional Linear Probing

@article{Clerry1984CompactHT,
  title={Compact Hash Tables Using Bidirectional Linear Probing},
  author={Clerry},
  journal={IEEE Transactions on Computers},
  year={1984},
  volume={C-33},
  pages={828-834}
}
  • Clerry
  • Published 1984
  • Computer Science
  • IEEE Transactions on Computers
  • An algorithm is developed which reduces the memory requirements of hash tables. [...] Key Method The algorithm is based on bidirectional linear probing. Search and insertion times are shown by simulation to be similar to those for ordinary bidirectional linear probing.Expand Abstract

    Figures, Tables, and Topics from this paper.

    A Concurrent Bidirectional Linear Probing Algorithm Towards a Concurrent Compact Hash Table
    • 4
    • PDF
    Space Efficient Hash Tables with Worst Case Constant Access Time
    • 113
    • PDF
    Cache-, hash-, and space-efficient bloom filters
    • 144
    • Highly Influenced
    • PDF
    Reducing the space requirement of suffix trees
    • 307
    • PDF
    Bonsai: A compact representation of trees
    • 50
    • PDF
    Don't Thrash: How to Cache Your Hash on Flash
    • 118
    • PDF
    Fast, All-Purpose State Storage
    • 4
    • Highly Influenced
    • PDF
    Separate Chaining Meets Compact Hashing
    • 1
    • PDF
    Reducing the space requirement of suffix trees
    • 127
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES
    Universal Classes of Hash Functions
    • 2,430
    Hash Table Methods
    • 130
    Ordered Hash Tables
    • 80
    • PDF
    Comment on Brent's scatter storage algorithm
    • 8
    • PDF
    COMPACT HASH TABLES
    • 3
    Thinking with the teachable machine
    • 38
    • PDF