| 摘要 |
PROBLEM TO BE SOLVED: To easily determine the number of hits during range searching. SOLUTION: A start key order calculating part 13 traces an intermediate mode based on a start key, stores corresponding number management information, determines the order of a record when a leaf node is reached, and horizontally searches for the leaf node. When the record including the start key is reached, the number of records up to that record during the horizontal search is calculated and added to the order of the record when the leaf node is reached, so as to determine the order (Nstart) of the record including the start key. An end key order calculating part 13 similarly calculates the order (Nend) of a record including an end key. A record number calculating part 15 calculates the total number of records contained in a search range, based on the Nstart output of the start key order calculating part 13 and the Nend output of the end key order calculating part 14. COPYRIGHT: (C)2004,JPO
|
