| 摘要 |
PROBLEM TO BE SOLVED: To increase a speed of data search based on a chained hash method. SOLUTION: This data structure has a hash table 11, a chained index 12, and an actual data file 13. In the hash table 11, a pointer hp to the chained index 12 is held at an address indicated by a partial bit string serving as a part of bit strings constituting a hash value for a search key, and the rest of the bit strings constituting the hash value for the search key are held as an upper hash value uh in a record IR of the chained index pointed by the pointer hp. COPYRIGHT: (C)2006,JPO&NCIPI
|
