| 摘要 |
<p>The present invention relates to a character string retrieval technology, where one bit corresponds to several character cells, and n bit correspond to all character cells, that is, dividing all character cells into n groups, and marking n bits of data in which each bit equal to 0 with W, so as to mark character cell information making up of character string If one character cell P<SUB>1</SUB> of character string S belongs to n-th group, n-th bit corresponding to W is marked with 1,similarly, W is marked with other character cells P<SUB>2</SUB> ,P<SUB>3</SUB> ,P<SUB>4</SUB> of S, so as to W provided with information of S is referenced to as "bit value" after mark is completed as for all character cells, this way is referenced to as 1 mark. According to rule of logic algebra, n bits of data in which each bit equal to 0 mark character cell information making up of character cells, where the n bits of data in which each bit equal to 1 is marked with W. If one character cell P of S belongs to n-th group, n-th bit corresponding to data W is marked with 0,this way is referenced to as 0 mark. It is possible to determine that S<SUB>b</SUB> does not contain all character cells of retrieval key word S<SUB>b</SUB>, that S<SUB>b</SUB> contains all character cells of retrieval key word S<SUB>b</SUB>, that S<SUB>b</SUB> maybe contain all character cells of retrieval keyword S<SUB>b</SUB>, through comparing "bit value" W<SUB>a</SUB>, W</p> |
