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: In distributed memory, elements in a sequence stored in various memories are input/output by a single instruction and processing and communication are unified. Between adjacent PMM, there are first packet transmission path for transmitting a packet from a first to second PMM and a second packet transmission path for transmitting a packet from a second to a first PMM. Each PMM has an information block consisting of a value list and a pointer sequence. The value list contains item values in the sequence of item value numbers corresponding to the item values belonging to particular items for expressing table-type data expressed as a sequence of records, each containing an item and an item value belonging to the item. The pointer sequence contains a pointer value for instructing the item number in the unique sequence set arrangement order. The information blocks held by respective memories constitute a global information block.

Abstract: The time required to process a subset of an array can be shortened. Table-formatted data is divided into information blocks each including a value list (VL) where the item values are arranged in order of item value number corresponding to the item value of each item and a pointer array (PV) where the pointer values each indicating an item value number are arranged in order of unique record number. A part of records is selected as a subset, and in response to the selection, an ordered set array including the record numbers of the subset is created. Each record number in the ordered set array indicates the position of one of the pointer values in the pointer array. The pointer values in the pointer array are arranged in the item value number array correspondingly to the positions where the record numbers are arrayed.

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.

Abstract: This invention provides a method and apparatus for searching for and tabulating table-format data that not only has the functions of a conventional data table but also greatly increases the speed of searching for and tabulating large amounts of data.