Horton Tables: Fast Hash Tables for In-Memory Data-Intensive Computing

@inproceedings{Breslow2016HortonTF,
  title={Horton Tables: Fast Hash Tables for In-Memory Data-Intensive Computing},
  author={Alex D. Breslow and Dong Ping Zhang and Joseph L. Greathouse and Nuwan Jayasena and Dean M. Tullsen},
  booktitle={USENIX Annual Technical Conference},
  year={2016}
}
Hash tables are important data structures that lie at the heart of important applications such as key-value stores and relational databases. Typically bucketized cuckoo hash tables (BCHTs) are used because they provide highthroughput lookups and load factors that exceed 95%. Unfortunately, this performance comes at the cost of reduced memory access efficiency. Positive lookups (key is in the table) and negative lookups (where it is not) on average access 1.5 and 2.0 buckets, respectively, which… CONTINUE READING
9 Citations
66 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 66 references

The FNV Non- Cryptographic Hash Algorithm. http://tools.ietf.org/ html/draft-eastlake-fnv-03

  • G. FOWLER, L. CURT NOLL
  • 2015
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…