| 摘要 |
PROBLEM TO BE SOLVED: To enable addition and high-speed searching of a tuple, and efficient use of a disk space. SOLUTION: A database device 1 includes: a CVT 11 for converting each attribute value to a suffix having an extendible array, an RDT 12 having, as a key value, a registered 2-tuple representation of a coordinate pattern having a history value of a partial array, to which the element of the extendible array corresponding to the tuple belongs, and a bit pattern of each suffix of the extendible array corresponding to each attribute value of the tuple and being arranged in order of the attribute; an attribute-by-attribute history value table 21 having a registered history value representing a time sequence of the array extension of each attribute; in regard to the dimension of the array-extended attribute corresponding to the history value and an arbitrary element of the extended partial array corresponding to the above history value, a history value table 22 having a registered boundary vector including, as an element, the number of bits necessary for representing the suffix of the corresponding dimension in the extendible array on the basis of each attribute; and an attribute value table 23 in which the attribute value, corresponding to each suffix of the extendible array, and the number of entire tuples having the above attribute value are registered. COPYRIGHT: (C)2010,JPO&INPIT |
