Method for controlled collision of hash algorithm based on nand flash memory

Abstract

The following description provides method for controlled collision of hash algorithm based on NAND flash memory improving data process performance by applying a hash structure on an optimized data structure in a NAND flash memory, using a coalesced chaining scheme. Further, the following description provides a method for controlled collision of hash algorithm based on NAND flash memory including a) setting one bucket size and an NAND flash memory page size identical; and b) storing a record regarding a plurality of hash values in the one bucket in NAND flash memory based hash index method. Further, when using a coalesced chaining and bucket separation scheme on a coalesced chaining scheme, storage space smaller than the separation chaining scheme, fast insert, fast retrieving are all possible, thereby data processing may be improved.

Dependencies are inferred from the claim text.