https://arxiv.org/abs/1504.06804

close this message

Donate to arXiv

Please join the Simons Foundation and our generous member
organizations in supporting arXiv during our giving campaign
September 23-27. 100% of your contribution will fund improvements and
new initiatives to benefit arXiv's global scientific community.

DONATE

[secure site, no need to create account]

Skip to main content
Cornell University
We gratefully acknowledge support from
the Simons Foundation and member institutions.
 
arXiv.org > cs > arXiv:1504.06804
[                    ]

Help | Advanced Search

[All fields        ]
Search
arXiv
Cornell University Logo
[                    ] GO
quick links

  * Login
  * Help Pages
  * About

Computer Science > Data Structures and Algorithms

arXiv:1504.06804 (cs)
[Submitted on 26 Apr 2015 (v1), last revised 9 May 2020 (this
version, v9)]

Title:High Speed Hashing for Integers and Strings

Authors:Mikkel Thorup
Download PDF

    Abstract: These notes describe the most efficient hash functions
    currently known for hashing integers and strings. These modern
    hash functions are often an order of magnitude faster than those
    presented in standard text books. They are also simpler to
    implement, and hence a clear win in practice, but their analysis
    is harder. Some of the most practical hash functions have only
    appeared in theory papers, and some of them requires combining
    results from different theory papers. The goal here is to combine
    the information in lecture-style notes that can be used by
    theoreticians and practitioners alike, thus making these
    practical fruits of theory more widely accessible.

          Fixed a few typos from previous version. Also, changed some
Comments: notation to be more consistent with other literature.
          Please send comments/typos to me at mikkel2thorup@gmail.com
Subjects: Data Structures and Algorithms (cs.DS)
Cite as:  arXiv:1504.06804 [cs.DS]
          (or arXiv:1504.06804v9 [cs.DS] for this version)

Submission history

From: Mikkel Thorup [view email]
[v1] Sun, 26 Apr 2015 11:32:32 UTC (20 KB)
[v2] Fri, 1 May 2015 11:38:11 UTC (20 KB)
[v3] Tue, 15 Sep 2015 13:24:53 UTC (20 KB)
[v4] Fri, 27 Apr 2018 13:17:32 UTC (23 KB)
[v5] Tue, 18 Sep 2018 09:18:27 UTC (23 KB)
[v6] Wed, 17 Apr 2019 15:26:35 UTC (24 KB)
[v7] Sun, 12 May 2019 10:02:38 UTC (24 KB)
[v8] Wed, 29 Apr 2020 15:40:21 UTC (24 KB)
[v9] Sat, 9 May 2020 07:42:41 UTC (24 KB)
Full-text links:

Download:

  * PDF
  * PostScript
  * Other formats

(license)
Current browse context:
cs.DS
< prev   |   next >
new | recent | 1504
Change to browse by:
cs

References & Citations

  * NASA ADS
  * Google Scholar
  * Semantic Scholar

DBLP - CS Bibliography

listing | bibtex
Mikkel Thorup
a export bibtex citation Loading...

Bibtex formatted citation

x
[loading...          ]
Data provided by:

Bookmark

BibSonomy logo Mendeley logo Reddit logo ScienceWISE logo
(*) Bibliographic Tools

Bibliographic and Citation Tools

[ ] Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
( ) Code

Code Associated with this Article

[ ] arXiv Links to Code Toggle
arXiv Links to Code (What is Links to Code?)
( ) Related Papers

Recommenders and Search Tools

[ ] Connected Papers Toggle
Connected Papers (What is Connected Papers?)
[ ] Core recommender toggle
CORE Recommender (What is CORE?)
( ) About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and
share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have
embraced and accepted our values of openness, community, excellence,
and user data privacy. arXiv is committed to these values and only
works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community?
Learn more about arXivLabs and how to get involved.

Which authors of this paper are endorsers? | Disable MathJax (What is
MathJax?)

  * About
  * Help

  * Click here to contact arXiv Contact
  * Click here to subscribe Subscribe

  * Copyright
  * Privacy Policy

  * Web Accessibility Assistance
  * arXiv Operational Status
    Get status notifications via email or slack