| 摘要 |
PROBLEM TO BE SOLVED: To perform efficient retrieval with respect to various kinds of multidimensional tuples. SOLUTION: In an information accumulation retrieval method, a retrieval key is indexed from a tuple that is a unit of information of an accumulation retrieval target, and a retrieval tree is constructed. When an entry B is inserted into an existing entry A already included by an operation target node, when an existing entry having a smallest "penalty when inserting an entry X into an existing entry already included by the operation target node" is selected in the operation target node, when a slave node or the entry X comprising a tuple identifier and a key is inserted into a node of an index in construction of the index, penalty is defined as a value indicating increment of a value corresponding to probability that the entry A is retrieved, when the entry A prior to an entry B is inserted and the entry A after the insertion, when the entry B is inserted into the existing entry A already included by the operation target node. COPYRIGHT: (C)2011,JPO&INPIT
|
