Hybrid Deterministic Random Key for Collision-Free Look-Up
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In data processing systems like RDMA, using random keys for resource addressing can lead to hash collisions, slowing down the identification process due to multiple look-up hits, and existing solutions fail to provide collision-free look-up within the constraints of the addressing protocol.
Innovation Solution
A hybrid deterministic/random key system is implemented, where a table of storage positions is maintained, and a random key value is generated and combined with a unique index to create a key that minimizes addressing errors, allowing for collision-free look-up without requiring additional fields or enlarging existing ones.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If random keys are used for resource addressing, then addressing errors are minimized, but hash collisions occur that slow down the look-up process
Solution Approach 1:
The key is segmented into two distinct parts: a deterministic index portion and a random value portion. The index portion directly maps to table positions for O(1) lookup, while the random portion maintains security and minimizes addressing errors. This segmentation resolves the contradiction by combining the speed of deterministic addressing with the reliability of random keys.
Solution Approach 2:
The patent merges deterministic indexing and random key generation into a hybrid key structure. The deterministic index ensures fast, collision-free lookup, while the random component preserves security properties. This combination achieves both fast lookups and reliable addressing without sacrificing either property.
2Speed
If a table of random keys is maintained for look-up, then resource identification is accelerated, but multiple look-up hits occur due to hash collisions
Solution Approach 1:
The key structure is segmented such that the index portion directly identifies the table position without hashing, eliminating hash collisions entirely. The random portion is stored at the identified position for verification purposes only. This segmentation ensures both fast lookups and accurate identification by removing the source of hash collisions.
Solution Approach 2:
The deterministic index acts as an intermediary between the key and the table position, replacing the need for hash functions. Instead of hashing the entire key (which causes collisions), the index directly points to the correct position, and the random portion serves as a verification intermediary to confirm the match.
3Productivity
If hybrid deterministic/random keys are implemented, then hash collisions are minimized and look-up is optimized, but key structure complexity increases
Solution Approach 1:
The hybrid key is segmented into clearly defined portions with specific functions: the index portion for direct table positioning and the random portion for security and verification. This segmentation, while increasing structural complexity, is offset by the dramatic improvement in lookup efficiency and the elimination of hash collisions, making the added complexity worthwhile.
Data Source
AI summary
A method for allocating to a resource, in a system of addressable resources, a hybrid deterministic/random key for access to a second resource, includes maintaining a table of storage positions for key values, searching the table for an available storage position, determining an index, in the table, of the available storage position, generating a random key value associated with location of the second resource, storing the random key value in the storage position, and assembling the index and the random key value into the hybrid key. The index may be most significant bits of the hybrid key, with the random key value being the least significant bits. Alternatively, the index may be least significant bits of the hybrid key, with the random key value being the most significant bits, or the bits of the index may be distributed among bits of the random key value.