Loop detection in cuckoo hashtables
Abstract:
A system includes a first storage, a second storage, and a processor. The first storage is configured to store a Cuckoo hash table which includes a plurality of locations. The second storage is configured to store a graph including a plurality of nodes. The processor coupled to the first storage and the second storage is configured to map each of the locations in the Cuckoo hash table to each of the nodes in the graph, and to determine whether a first entry to be added to a first location in the Cuckoo hash table creates a loop in the graph by executing a filter module. More particularly, the processor is to execute the filter module by detecting a presence of the loop before the first entry to occupy the first location in the Cuckoo hash table, the first location associated with a node, in the graph, occupied by a second entry.
Public/Granted literature
Information query
Patent Agency Ranking
0/0