JP2776226B2 - Multi-table data handling equipment - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a multi-table data handling apparatus for handling tabular data.

[0002]

2. Description of the Related Art In a conventional tabular data handling apparatus called a spreadsheet tool, the contents of a specific storage location are designated using a vertical row number and a horizontal column number. For example, as shown in the conventional table example 201 of FIG. 2, the columns are c1, c2, c3,... And the rows are r1, r2, r.
If the numbers are given as 3,...
As in 2, search is made for the element with column number c1 and row number r1. In this case, the numerical value 7 is searched. Such a method using the row designation and the column designation number requires a correspondence table between the number and the meaning prepared separately when trying to know the meaning of the retrieval sentence of the table contents embedded in the program. Such programs are difficult to understand and have low program productivity.

[0003]

The conventional apparatus has the drawbacks that it is difficult to search for the contents and it is difficult to grasp the contents. Such contents are also provided with a multi-stage search key as shown in a multi-stage table example 301 in FIG. 3, and as in a value search sentence example 302, a vertical key is (Europe / Northern Sweden) and a horizontal key is (first city name). Is easier to understand as an expression on a program.

[0004]

According to the present invention, there is provided a multi-level table data handling apparatus, comprising: a data area securing unit for securing a table data storage area in a data area; An item information generation unit that secures a storage area for table search tree information and generates and stores a search tree, and an item search unit that converts a search tree and an arbitrary search key into a table row number or column number When,
A data retrieval unit that reads a table element from a pointer to table data and a row number and a column number of the table, and a data change unit that rewrites a table element from a pointer to the table data, a row number, a column number, and a value of the table. It is characterized by having.

[0005]

DESCRIPTION OF THE PREFERRED EMBODIMENTS A multi-stage table handling apparatus is shown in FIG.
1 is a device for handling a table in which a search key is multi-staged, and has a mechanism for generating a search key for a multi-stage table and a mechanism for interpreting the multi-stage table key as compared with a conventional device. By using this apparatus, it is possible to use a table expression that is easy to understand, and the productivity of the programmer is improved.

Next, an embodiment of the present invention will be described with reference to the drawings.

FIG. 1 is a functional block diagram of an embodiment of a multi-table data processing apparatus according to the present invention.

In the multi-stage table data handling apparatus of the present invention connected to the central processing unit 1, a table data storage area such as the table data storage area 10 is secured and secured in the data area by inputting a table size designation. A data area securing unit 3 that returns a pointer to the table data that has been set, a search tree storage area such as the search tree storage area 11 in the data area with the table size designation as input, and the table search information is stored. An item information generation unit 4 that generates a search tree as an input, saves the search tree in a storage area of the search tree, and returns a pointer to the search tree.
With the table generation request as input, table size information is extracted from the table generation request and given to the data area securing unit 3 to generate a pointer to table data, and column search information is extracted from the table generation request. Then, a pointer to a column search tree is provided to the item information generation unit 4, and row search information is extracted from the table generation request, and is provided to the item information generation unit 4 to generate a pointer to the row search tree. A generation control unit 2 that collects the three generated pointers into a table structure and returns them to a user as a table structure pointer; a search tree 11 generated by the item information generation unit 4; An item search unit 7 for converting a table into a row number or a column number based on a key;
A data search unit 6 for reading a specific element of a table from a table data pointer, a row number, and a column number; a table structure pointer, a column search key, and a row search key as inputs, and a table data pointer and a column search from the table structure pointer The tree and the row search tree are taken out, the column number is calculated from the column search key and the column search tree using the item search unit 7, and the line number is calculated from the row search key and the row search tree using the item search unit 7. And a search control unit 5 for reading table elements from the table data pointer, column number and row number using the data search unit 6, and data for rewriting table elements from the table data pointer, row number, column number and value. The change unit 9 extracts the table data pointer, the column search tree, and the row search tree from the table structure pointer by inputting the table structure pointer, the column search key, the row search key, and the value. A column number is calculated from a column search key and a column search tree by using a unit 7, a row number is calculated from a row search key and a row search tree by using the item search unit 7, and a table is calculated by using the data change unit 9. A rewrite control unit 8 for rewriting table elements based on a data pointer, a column number, a row number, and a value. The item information generation unit 5 and the item search unit 7 are added to a conventional table data handling device. It is characterized by the following.

FIG. 4 is a diagram showing the structure of data created by the generation control unit 2. As shown in FIG. The table structure 401 generated by the generation control unit 2 includes table data 402 allocated by the data area allocation unit 3 and column information 403 of a search tree related to a column of a table generated by the item information generation unit 4. And a row information tree 404 of a search tree for the table row generated by the item information generating unit 4. A pointer to the table structure is returned to the user through the central processing unit 1.

FIG. 5 shows an example of the contents of a table structure generated by the generation control unit 2. In the example 500 of the data storage area,
Rows and columns are numbered sequentially for areas of the required size as a table. In the example 501 of the row search tree, a search key is defined for each row. First stage information 502
Indicates that the search key on the first line is “Europe / Northern Europe / Sweden”. The search keys 502 to 506 define search keys for all rows in the data storage area 500. The first row of information 508 indicates that the search key in the first column is “first city / name”. Search keys for all columns of the data storage area 507 are defined by 508 to 513.

FIG. 6 shows a display example 601 of information when a table is generated according to the data definition example described in FIG.
When the syntax example 602 of the value search is given to the multi-level table data handling device of the present invention, the search control unit 5 decomposes the <table structure pointer> into table data, a column search tree, and a row search tree, and Example 50 of row search tree using search unit 7
1 is compared with the row key (Europe, Nordic Sweden) to calculate that it corresponds to the row number r1, and the column search tree 507 and the column key (first city name) are calculated using the item search section 7
Calculates that it corresponds to the row number c1, and reads the table element from the table data pointer, the row number and the column number using the data search unit 6, and returns "Stockholm". By using a table having multiple search keys as described above, an easy-to-understand program can be created.
Next, a wide range of data is read using FIG.
The processing in the case will be described. Traditional tabular data
For handling equipment, the vertical row number and horizontal column number
The content of a specific storage location is specified using the number. example
For example, read / write specification for one element, read / write for one line
Designation, reading / writing designation for one column, reading for rectangle
There is a writing specification. In the table shown in FIG.
If you want to read all the information of "city", search key "
“C1” as a column number for “1 city-name”
Search using the search section and enter the search key "1st city-annual budget"
Search for "c3" as the corresponding column number using the item search section
And the conventional equipment of the conventional tabular data handling device
The maximum row number r5 is obtained by using the function. last
And (r1, c1) as an element of the upper left corner, and (c3, r5)
Data retrieval for rectangle readout for rectangles with a lower right corner
The processing can be performed at high speed by using the unit.

FIG. 7 shows an example of a table generation request.
Line 701 is a function name. Rows 702 to 706 define column information. The item information generation unit 4 in FIG. 1 generates search data having a tree structure indicated by 502 to 506 in FIG. 5 based on this information. Lines 707 to 712 define line information. The item information generation unit 4 in FIG. 1 generates search data having a tree structure indicated by 508 to 513 in FIG. 5 based on this information. The data area securing unit 3 in FIG. 1 counts the number of rows and the number of columns given by the table generation request, and secures a table data area of that size. In the case of this example, a table data area of 5 rows and 6 columns is secured.

[0013]

As described above, the multi-column table handling device of the present invention is a device for handling a table in which a retrieval key has multiple columns as shown in a multi-column table example 301 in FIG. In comparison, a mechanism for generating a search key for a multi-table table and a mechanism for interpreting the multi-table key are provided. By using this apparatus, it is possible to use an easily understandable table expression as shown in FIG. 6, and the productivity of the programmer is improved. At this time, the features of the conventional tabular data handling device
The book is designed so as not to interfere with the reading and writing speed
The device is structured and handles traditional tabular data
Almost the same performance as the device can be obtained.

[Brief description of the drawings]

FIG. 1 is a diagram showing one embodiment of the present invention.

FIG. 2 is a diagram showing an example of a table handled by a conventional device.

FIG. 3 is a diagram showing an example of a table handled by the multi-stage table handling apparatus of the present invention.

FIG. 4 is a diagram showing a configuration of data created by a generation control unit 2 in FIG. 1;

FIG. 5 is a view showing an example of the contents of a table structure generated by a generation control unit 2 of FIG. 1;

FIG. 6 is a diagram showing a display example of information when a table is generated according to the data definition example described in FIG. 5;

FIG. 7 is a diagram showing an example of a table generation request.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Central processing unit 2 Generation control part 3 Data area reservation part 4 Item information generation part 5 Search control part 6 Data search part 7 Item search part 8 Rewrite control part 9 Data change part 10 Table data storage area 11 Search tree storage area

Claims (1)

(57) [Claims] 1. A data handling apparatus for handling tabular data, comprising: a data area securing unit for securing a table data storage area in a data area; and a table search tree information storage area in a data area for securing and searching. An item information generation unit that generates and stores a tree, an item search unit that converts a search tree and an arbitrary search key into a table row number or column number, a pointer to table data, a table row number and a column An apparatus for handling multi-level table data, comprising: a data retrieval unit that reads table elements from numbers; and a data change unit that rewrites table elements from table data pointers, table row numbers, column numbers, and values.