https://github.com/nazarii-piontko/rendezvous-hashes-calculation-benchmark

Study of optimized hash combining methods for rendezvous hashing, demonstrating performance improvement while maintaining distribution quality
https://github.com/nazarii-piontko/rendezvous-hashes-calculation-benchmark

benchmark murmurhash rendezvous-hashing

Last synced: about 15 hours ago
JSON representation

Study of optimized hash combining methods for rendezvous hashing, demonstrating performance improvement while maintaining distribution quality

• Host: GitHub
• URL: https://github.com/nazarii-piontko/rendezvous-hashes-calculation-benchmark
• Owner: nazarii-piontko
• License: mit
• Created: 2024-12-29T16:14:29.000Z (17 days ago)
• Default Branch: main
• Last Pushed: 2024-12-29T16:46:45.000Z (17 days ago)
• Last Synced: 2024-12-29T17:32:23.501Z (17 days ago)
• Topics: benchmark, murmurhash, rendezvous-hashing
• Language: Jupyter Notebook
• Homepage: https://www.npiontko.pro/2024/12/23/computation-efficient-rendezvous-hashing
• Size: 59.6 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Hashes Calculation Benchmark for Rendezvous Hashing

This repository contains a benchmarking study comparing different hash combining methods for rendezvous hashing. The code evaluates various approaches to optimize the performance of hash calcualtion for rendezvous hashing while maintaining good distribution properties.

## Overview

The main notebook (`main.ipynb`) implements and tests several hash combining strategies:

- Simple multiplication

- Jenkins hash combination 

- FNV-1a inspired combination

- And more (commented out in code)

The implementation focuses on 32-bit MurmurHash as the base hashing function while exploring different ways to efficiently combine server and key hashes.

## Key Features

- Comprehensive benchmarking of different hash combining methods

- Analysis of key distribution properties

- Statistical evaluation

- Visualization of distribution results

## Usage

1. Clone the repository

2. Install dependencies

3. Run the Jupyter notebook to see benchmarks and analysis

## Learn More

The full analysis and discussion of results is available in the accompanying article: [Rendezvous Hashing: The Path to Faster Hashes Calculation](https://www.npiontko.pro/2024/12/23/computation-efficient-rendezvous-hashing)

## License

[MIT License](LICENSE)