Fixed Length Data Search Device, Method for Searching Fixed Length Data, Computer Program, and Computer Readable Recording Medium
First Claim
1. A fixed length data search device, comprising:
- a hash operation means for operating and outputting a hash value of an inputted fixed length datum, a data table memory consisting of N numbers of memory banks, where N is an integer greater than or equal to 2, the data table memory capable of storing a data table holding a large number of fixed length data, a pointer table memory for storing a memory pointer table having a memory address at which each fixed length datum is stored with said hash value as an index, and a comparison means for simultaneously comparing a plurality of fixed length data stored at the same memory address in said N numbers of memory banks, the comparison means for outputting results of the comparison.
1 Assignment
0 Petitions
Accused Products
Abstract
The inventive device comprises a hash operation means 11 for operating and outputting a hash value of inputted fixed length data, a data table memory 14 consisting of N numbers of memory banks, where N is an integer that is more than and equal to 2, the data table memory 14 for storing a data table holding a large number of fixed length data, a pointer table memory 13 for storing a memory pointer table holding a memory address at which each fixed length datum is stored with said hash value as an index, and a comparison means 15 for simultaneously comparing a plurality of fixed length data stored at the same memory address in said N numbers of memory banks with a single fixed length datum inputted to said hash operation means, the comparison means 15 for outputting results of the comparison.
-
Citations
18 Claims
-
1. A fixed length data search device, comprising:
-
a hash operation means for operating and outputting a hash value of an inputted fixed length datum, a data table memory consisting of N numbers of memory banks, where N is an integer greater than or equal to 2, the data table memory capable of storing a data table holding a large number of fixed length data, a pointer table memory for storing a memory pointer table having a memory address at which each fixed length datum is stored with said hash value as an index, and a comparison means for simultaneously comparing a plurality of fixed length data stored at the same memory address in said N numbers of memory banks, the comparison means for outputting results of the comparison. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A fixed length data search device, comprising:
-
a hash operation means, said hash operation means using two types of hash functions to determine a first and second hash values of an inputted fixed length datum;
a data table memory consisting of N numbers of memory banks, where N is an integer that is greater than or equal to 2, the data table memory for storing a data table holding a large number of fixed length data a pointer table memory for storing a first memory pointer table, said pointer table memory having a memory address at which each fixed length datum is stored, wherein said first hash value is an index, and a second memory pointer table holding the memory address at which each fixed length datum is stored, said second hash value as an index; and
a comparison means for simultaneously comparing a plurality of fixed length data stored at the same memory address in said N numbers of memory banks, the comparison means for outputting results of the comparison. - View Dependent Claims (8, 9, 10, 11, 12, 13)
-
-
14. A method of searching fixed length data, comprising the steps of:
-
performing hash operation said hash operation outputting a hash value of inputted fixed length data;
referring to a memory pointer table holding a memory address at which each fixed length datum is stored with said hash value as an index;
reading N numbers of fixed length data stored at an address pointed to by a pointer in said memory pointer table from a data table stored in a data table memory consisting of N numbers of memory banks, where N is an integer that is greater than or equal to 2, the data table capable of storing a large number of fixed length data, and simultaneously comparing said read N numbers of fixed length data with said inputted single fixed length datum, and outputting results of the comparison. - View Dependent Claims (15, 16, 17, 18)
-
Specification