Faster Go maps with Swiss Tables

NewsBot · 27 February 2025 05:17

A new Go blog post/announcement has been posted!

<div class="Article" data-slug="/blog/swisstable">

<h1 class="small"><a href="/blog/">The Go Blog</a></h1>


<h1>Faster Go maps with Swiss Tables</h1>
  
  <p class="author">
  Michael Pratt<br>
  26 February 2025
  </p>
  
  <p>The hash table is a central data structure in computer science, and it provides the implementation for the map type in many languages, including Go.</p>
The concept of a hash table was first described by Hans Peter Luhn in 1953 in an internal IBM memo that suggested speeding up search by placing items into “buckets” and using a linked list for overflow when buckets already contain an item. Today we would call this a Hash table - Wikipedia