| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To reduce a load of index management through a dynamic tree type index system. <P>SOLUTION: A multidimensional data retrieval server executes steps of: dividing a space into minimum circumscribed areas and generating a tree-structured index for data that exists in the space; for each node forming the tree structure, counting a retrieval frequency of the node; for each node, counting an updating frequency of data managed by the node or of a child node of the node; and using the counted updating frequency and retrieval frequency to calculate an updating index for a node identified on the basis of the number of data or the number of child nodes, and deterring application of division or integration processing to the identified node, on the basis of the calculated updating index. <P>COPYRIGHT: (C)2013,JPO&INPIT</p> |
