| 摘要 |
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 ormore 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. By using the calculated addresses, joined table-formatted data is displayed. <IMAGE>
|
