Consistent hashing with sequential indexing
US12299035B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 22, 2023 |
| Grant date | May 13, 2025 |
| Priority date | — |
| Expiry date | Dec 22, 2043 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2255
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The technology provides a consistent hashing approach that can be used with many types of hash functions. This approach, called flip hashing, enables dynamic adjustment of a hash table while satisfying balance and monotonicity requirements. Flip hashing is particularly applicable to database and load rebalancing applications due to its low computational cost and ease of implementation. As computing resources are added to a system, keys are remapped evenly across the newly added resources, e.g., by one or more load-balancing or routing servers. This enables upscaling of the system to minimize hotspot issues. The computational cost for a flip hash approach is effectively constant and regardless of the number of resources. This can provide fast response times to queries and avoid overloading of routing servers.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.