arXiv CS
open access
MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One
We present \emph{multitable} and its Rust reference implementation: a stable hash table both materially faster at equal physical memory and more flexible than the SwissTable in its Rust's hashbrown implementation. As an arithmetic mean over 84 configurations it delivers $\mathbf{2.1\times}$ hashbrow
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One#1144200
- Long-tail hashing#1043938
- NIST SP 800-133r2: Recommendation for Cryptographic Key Generation#2884
- FAUST – XXVII. The circumbinary disc and the outflow of the L 1551 IRS 5 binary system#311936
- Miniaturization and Optimization of NMR Shimsets Allow Efficient Field Shimming-Dataset#206563
Record · ID 1136775
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive