Showing papers on "Rainbow table published in 1988"
Patent•
31 May 1988TL;DR: In this paper, the state variable of a main memory is replaced by a state variable that stores the addition of elements into the hash table entry functions to check whether another parallel process added a data element having the same hash value or not while a certain process 10 is trying to add the data elements to a hash table 30.
Abstract: PURPOSE: To control data with no lock by referring to the state variable of a main memory and replacing the state variable of the entry to a hash table. CONSTITUTION: The counter information (an additional counter) which stores the addition of elements into the hash table entry functions to check whether another parallel process added a data element having the same hash value or not while a certain process 10 is trying to add the data elements to a hash table 30. Therefore the double registration can be avoided for the same data element to the table 30. While the counter information (a search counter) which limits the table searching frequency shows the worst degree of hash table entries to be scanned in case the data elements 40 registered in the table 30 are retrieved based on the given key information. Thus it is possible to decide at a high speed the presence or absence of a specific data element registered without scanning the entire table 30. COPYRIGHT: (C)1989,JPO&Japio
2 citations