Insertion method in a high-dimensional index structure for content-based image retrieval

A recording medium comprising:

• a means for judging on constituent elements of a tree;
• a means for inserting an object into a root node if the tree consists of a root node, and forming a new root node if the existing root node overflows;
• a means for inserting an object if child nodes of the root node are branch nodes, and choosing the branch nodes in a sequence of one having less overlaps with near by nodes, one having same values in many dimensions, one showing less increase in a minimum bounding region size, and one disposed more adjacently to a center;
• a means for adding a mean value of a minimum bounding region if the branch node overflows, obtaining a weighted center by dividing the result value obtained by adding the center values of MBRs by the number of entries, and choosing re-insertion objects in a sequence of remote positioning from the weighted center to re-insert them into the branch nodes;
• a means for splitting the branch node if the branch node overflows with the objects, and otherwise, adjusting the minimum bounding region;
• a means for choosing a terminal node if a child node of the root node is a terminal node or if a child node of the branch node is a terminal node, then inserting an object into the terminal node, then adding an object value of a same dimension, then obtaining a weighted center by dividing the result value obtained by adding object values of the same dimensions by the number of entries, and then choosing a re-insertion objects to re-insert it into said terminal node;
• and
• a means for splitting the terminal node if the terminal node overflows, and inserting a new object into the branch node, whereby a program for activating the above means is read by a computer.