Patent ID: 9697243
Date: 2017-07-04
CPC Classifications: G06F

Claim:
1. A node searching method based on a query performed by a processor, the method comprising: setting a current time value as a traversing time value; searching, based on the query, descendent nodes of a root node to perform a traversing from the root node to at least one leaf node among the descendent nodes according to a tree index data structure for organizing data in a database system; determining at a currently-being-investigated node whether a preset traversing condition is satisfied by comparing an update time value of the currently-being-investigated node among the descendent nodes, which indicates a time when a change to the currently-being-investigated node is made, with the traversing time value; traversing to a descendent node of the currently-being-investigated node when the preset traversing condition is satisfied; and terminating the traversing from the root node to the at least one leaf node at the at least one leaf node where no descendent node exists, wherein if the update time value of the currently-being-investigated node is later than the traversing time value, the preset traversing condition is not satisfied and a re-traversing from at least one parent node is performed, the at least one parent node being at least one level higher than the currently-being-investigated node in view of hierarch in the tree index data structure, and wherein the re-traversing from the at least one parent node is performed and traverses back to the currently-being-investigated node, a preset traversing condition of the re-traversed currently-being-investigated node is satisfied without comparing an update time value with a traversing time value at the re-traversed currently-being-investigated node.