| 摘要 |
PROBLEM TO BE SOLVED: To speed up retrieval of a character string and to speed up Japanese character string comparison. SOLUTION: A character string which includes AND, OR and parentheses is decomposed according to its sentence structure to generate a retrieval tree first. Then nodes corresponding to the character string are generated, and the character string is decomposed by (ORa(|)) into a child 1 ((design|infomration) &management) and a child 2 (production & improvement), which are registered in the nodes as nodes of the children. At this point, the (OR) in the parenthesis is ignored. The nodes gf the children 1 and 2 are decomposed by (AND(&)) into a node list and children 3 and 4, which are registered in the nodes of the children as a node list. At this time, when there is a character string which can be decomposed by (OR), it is regarded as a new node and decomposed again (recursively processed) by (OR) to generate children 5 and 6.
|
