Abstract: Concatenated join tables are converted into a tree structure at a high speed. First, table-formatted data is divided into one or more information blocks consisting of a value list containing item values in the sequence of the item value numbers corresponding to item values belonging to particular items and a pointer sequence containing pointer values for indicating the item value numbers in the sequence of the unique record number. Next, table-formatted data whose items are to be made common are selected, value lists of a predetermined item are made equivalent, and join is executed. Join is repeated between necessary table-formatted data. Next, among the concatenated table data, one which is to be a root is selected. According to the table-formatted data concatenation, depth of the table-formatted data is decided. According to the table-formatted data concatenation and depth, a value indicating a record is arranged on a tree description table describing the tree.

Abstract: It is possible to realize high-speed data processing between processing modules with a small communication amount when performing information processing of a large amount of data employing the parallel computer architecture. Each of the processing modules transmits a first list as a list of values stored in the memory of the local processing module to another processing module in the information processing system and receives at least one second list as a list of values transmitted from the another processing module to the local processing module so as to compare the values in the second list with the values in the first list. When the values in the second list coincide with the values in the first list, counters corresponding to the values in the first list which have coincided are incremented by one.

Abstract: It is possible to express a tree-type data structure so as to effectively trace the relationship between data in the tree-type data structure (for example, parent-child, ancestor, descendant, brothers, generations). In the tree-type data structure, for each of non root nodes which are the nodes excluding the root node, their parent nodes are correlated so that the parent-child relationship between the nodes is expressed by using “child->parent” relationship. Accordingly, by specifying a child node, it is possible to promptly specify the only one parent node corresponding to the child node.

Abstract: A data compiling method for conversion into the form of an information block containing a value list in which table format data expressed as an array of records including items and item values contained in the items are so arranged that the item values are arranged in a predetermined order without any redundancy, and a position designation array including position designation numbers designating the item values in the value list and related to the record numbers. Adjoining partial intermediate blocks (811-0, 811-1) which include an item value array having item values related to the record numbers, an order designation array (VLP) for designating the positions of the item values in the item value array, and a position designating array (PV) for designating elements in the order designation array are merged to create a new partial intermediate block (812-0), and the operation of merging the partial intermediate blocks is repeated till the blocks are merged into one.

Abstract: A computer system provides distributed memory computer architecture achieving extremely high speed parallel processing, and includes: a CPU modules, a plurality of memory modules, each module having a processor and RAM core, and a plurality of sets of buses making connections between the CPU and the memory modules and/or connections among memory modules, so the various memory modules operate on an instruction given by the CPU. A series of data having a stipulated relationship is given a space ID and each memory module manages a table containing at least the space ID, the logical address of the portion of the series of data managed, the size of the portion and the size of the series of data, and, the processor of each memory module determines if the portion of the series of data managed is involved in a received instruction and performs processing on data stored in the RAM core.

Abstract: A plurality of table-formatted data is joined by dividing each table-formatted data into one or more information blocks consisting of a value list containing item values in the order of item value numbers corresponding to item values belonging to a particular item and a pointer array containing pointer values specifying item value numbers in the order of uniquely-defined record number. When joining a plurality of table formats, equivalent items between the table-formatted data are found and value lists contained in the information block concerning the equivalent items are compared and the two value lists are made equivalent, then data of one of the table formats is sorted according to a key item and using the array obtained in this process, calculation is performed to obtain addresses indicating storage positions of record numbers of table-formatted data and other table-formatted data. Using the calculated addresses, joined table-formatted data is displayed.

Abstract: Concatenated join tables are converted into a tree structure at a high speed. First, table-formatted data is divided into one or more information blocks consisting of a value list containing item values in the sequence of the item value numbers corresponding to item values belonging to particular items and a pointer sequence containing pointer values for indicating the item value numbers in the sequence of the unique record number. Next, table-formatted data whose items are to be made common are selected, value lists of a predetermined item are made equivalent, and join is executed. Join is repeated between necessary table-formatted data. Next, among the concatenated table data, one which is to be a root is selected. According to the table-formatted data concatenation, depth of the table-formatted data is decided. According to the table-formatted data concatenation and depth, a value indicating a record is arranged on a tree description table describing the tree.

Abstract: A method to perform the insertion, deletion and updating of data in table-format data quickly and appropriately. A CPU 12 accepts a record number as a subscript, generates a subscript conversion array for giving an offset value corresponding to the range of the subscript in question, identifies the insertion position which indicates the position of the field value to be inserted, and, in the subscript conversion array, gives an offset value that defines the range of the corresponding subscript and also identifies the end of the array, and in the subscript conversion array, gives an offset value that increments the corresponding range of subscripts and also decrements the accepted subscript, and places the field value to be inserted at the stipulated end position, such that an offset value according to the range of subscripts within the subscript conversion array is given as the subscript.

Abstract: A plurality of table-formatted data can be joined at a high speed without requiring use of a large capacity of memory. Each table-formatted data is divided into one or more information blocks consisting of a value list containing item values in the order of item value numbers corresponding to the item values belonging to a particular item and a pointer array containing pointer values specifying the item value numbers in the order of uniquely-defined record number. When joining a plurality of table formats, equivalent items between the table-formatted data are found and the value lists contained in the information block concerning the equivalent items are compared and the two value lists are made equivalent. After this, data of one of the table formats is sorted according to a key item and by using the array obtained in this process, calculation is performed to obtain addresses indicating storage positions of record numbers of the table-formatted data and the other table-formatted data.

Abstract: The object of this invention is to perform the sorting, compiling and joining of data at extremely high speeds. This is achieved by a distributed memory type information processing system comprising: a CPU module, a plurality of memory modules, each of which having a processor and RAM core, and a plurality of sets of buses that make connections between the CPU and memory modules and/or connections among memory modules, where the processors of the various memory modules execute the processing of arrays managed by the one or more memory modules based on instructions given by the CPU to the processors of the various memory modules.

Abstract: A structure for table-format data with a small data size whereby a plurality of tables of table-format data can be joined as desired, a method of concatenating table-format data, and a method for displaying concatenated table-format data. In this method, each table of table-format data is constructed in a manner such that each table is divided into one or more information blocks consisting of: a value list in which the field values are stored in the order of a field value number corresponding to the field value belonging to a specified field, and a pointer array in which pointer values for pointing to said field value numbers are stored in a unique record order.