Patent
Efficient hash table key storage
Reads0
Chats0
TLDR
In this article, a system and method for compressing keys of key-data item pairs for storage in a hash table to reduce power and/or area requirements of the memory used to implement the hash table is presented.Abstract:
The present disclosure is directed to a system and method for compressing keys of key-data item pairs for storage in a hash table to reduce power and/or area requirements of the memory used to implement the hash table. The system and method of the present disclosure use the hash function to compress a key of a key-data item pair. More specifically, the system and method of the present disclosure effectively remove information from the key that can be predicted using in the hash value of the key to generate a compressed key. Information in the key that is not predictable using the hash value of the key can be included in the compressed key to allow for recovery of the key.read more
References
More filters
Patent
System and method for improving internet communication by using intermediate nodes
Derry Shribman,Ofer Vilenski +1 more
TL;DR: In this article, a method for fetching a content from a web server to a client device, using tunnel devices serving as intermediate devices, is described, where the requested content is partitioned into slices and the client device sends a request for the slices to the available tunnel devices.
Patent
Method and system for hash table based routing via table and prefix aggregation
TL;DR: In this paper, a method and system for hash table based routing via table and prefix aggregation are provided. But, it is not clear how to combine prefix aggregation into a single hash table, where each hash table comprises one or more encoded bits to uniquely identify said prefixes.
Patent
Method and System for a Hardware-Efficient Universal Hash Function
Nick Horgan,Daniel Rosenband +1 more
TL;DR: In this paper, the first hash function was performed on a received input key or a bit sequence derived from the received key to generate a hashed input key, selecting a plurality of input key portions from the hashed key, accessing, a respective permutation table for each of the input key portion from a group of permutation tables, and combining at least the generated permuted key portions to form a hash value.
Patent
Method and system for hash table based routing via a prefix transformation
TL;DR: In this paper, a hash table based routing via prefix transformation is proposed, which allows translating one or more network addresses as a coefficient set of a polynomial, and routing data in a network based on a quotient and a remainder derived from the coefficient set.