JPH07192012A - Multi-stage list data handling device - Google Patents

Abstract

PURPOSE:To provide a multi-stage list data handling device in which a content is easily retrieved and grasped. CONSTITUTION:The device is provided with a data area reservation section reserving a storage area of list data in a data area, an item information generating section 4 reserving a storage area of table retrieval tree information in the data area and generating and storing the retrieval tree, an item retrieval section 7 converting the retrieval tree and an optional retrieval key into a row number or a column number of a table, a data retrieval section 6 reading elements of the table based on a pointer to the table data and the row number and the column number, and a data revision section 9 rewriting elements of the table based on the pointer to the table data and the row number and the column number.

Description

Detailed Description of the Invention

[0001]

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

[0002]

2. Description of the Related Art In a conventional tabular data handling device called a spreadsheet tool, the contents of a specific storage location are specified using vertical row numbers and horizontal column numbers. For example, as shown in the conventional table example 201 of FIG. 2, columns are c1, c2, c3, ..., Rows are r1, r2, r.
If the numbers are 3, ..., Value retrieval sentence example 20
As in 2, the element with the column number c1 and the row number r1 is searched. In this case, the number 7 is searched. In such a method of using row designation and column designation numbers, a separate correspondence table of numbers and meanings is required when trying to know the meaning of a search statement of table contents embedded in a program. Such programs are difficult to understand and their productivity is low.

[0003]

However, the conventional device has a drawback that it is difficult to retrieve the contents and it is difficult to grasp the contents. As for such contents, a multi-level search key is provided as in the multi-level table example 301 in FIG. 3, and the vertical key (Europe and Northern Europe Sweden) and the horizontal key (first city name) are set as in the value search example 302. It is easier to understand the expression on the program by searching for.

[0004]

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

[0005]

EXAMPLE A multi-stage table handling device is a multi-stage table example 30 shown in FIG.
1 is a device for handling a table in which search keys have multiple stages, and is provided with a mechanism for generating a search key for a multi-stage table and a mechanism for interpreting a multi-stage table key as compared with a conventional device. By using this device, it becomes possible to use a table expression that is easy to understand, and programmer productivity 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 the multistage table data handling apparatus of the present invention.

In the multistage table data handling device 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 by inputting the table size designation. The data area reserving unit 3 for returning a pointer to the created table data, and a search tree storage area such as the search tree storage area 11 is reserved in the data area by inputting the table size designation, and the table search information is stored. An item information generation unit 4 that generates a search tree as an input, saves it in the storage area of the search tree, and returns a pointer to it.
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. To the item information generation unit 4 to generate a pointer to the column search tree, to extract the row search information from the table generation request and to the item information generation unit 4 to generate a pointer to the row search tree. , A generation control unit 2 that collects the generated three pointers as a table structure into one and returns it to the user as a table structure pointer, a search tree 11 generated by the item information generation unit 4, and an arbitrary search An item search unit 7 for converting into a row number or column number of a table based on a key,
A data search unit 6 that reads a specific element of a table from a table data pointer, a row number, and a column number, and a table data pointer and a column search from the table structure pointer by inputting a table structure pointer, a column search key, and a row search key. 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 by using the item search section 7, and the row number is calculated from the row search key and the row search tree by using the item search section 7. Then, the retrieval control unit 5 that reads the table element from the table data pointer, the column number, and the row number using the data retrieval unit 6, and the data that rewrites the table element from the table data pointer, the row number, the column number, and the value The changing unit 9 and the table structure pointer, the column search key, the row search key, and the value are input, and the table data pointer, the column search tree, and the row search tree are extracted from the table structure pointer, and the item detection is performed. A column number is calculated from the column search key and the column search tree using the section 7, a row number is calculated from the row search key and the row search tree using the item search section 7, and a table is displayed using the data changing section 9. An item information generating unit 5 and an item retrieving unit 7 are added to a conventional table data handling device, which is composed of a rewriting control unit 8 that rewrites a table element from a data pointer, a column number, a row number, and a value. It is characterized by

FIG. 4 is a diagram showing the structure of data created by the creation control unit 2. The table structure 401 generated by the generation control unit 2 is the table data 402 secured by the data area securing unit 3 and the column information 403 of the search tree regarding the columns of the table generated by the item information generating unit 4. And a row information tree 404 of a search tree relating to the rows of the table that are also generated by the item information generating unit 4, and the 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 the table structure generated by the generation control unit 2. In the data storage area example 500,
Serial numbers are assigned to rows and columns for areas of a size required for a table. In the row search tree example 501, a search key is defined for each row. First-stage information 502
Indicates that the search key in the first line is “Europe / Nordic / Sweden”. 502 to 506 define search keys for all rows of the data storage area 500. The information 508 in the first row indicates that the search key in the first column is “first city / name”. 508 to 513 define search keys for all columns of the data storage area 507.

FIG. 6 is 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 multistage 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 of row search tree using search unit 7 50
1 is compared with the row key (Europe Nordic Sweden) to calculate that it corresponds to the row number r1, and the item search unit 7 is used to compare the column search tree example 507 with the column key (first city name). It calculates that it corresponds to the number c1, uses the data search unit 6 to read the table element from the table data pointer, row number, and column number, and returns "Stockholm". By using a table having multiple search keys in this way, a program that is easy to understand can be created.

FIG. 7 shows an example of a table generation request.
Line 701 is the function name. Rows 702 to 706 define column information. The item information generation unit 4 of FIG. 1 generates search data of the tree structure shown by 502 to 506 of FIG. 5 based on this information. Rows 707 to 712 define row information. The item information generation unit 4 of FIG. 1 generates search data of the tree structure shown by 508 to 513 of 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 in 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-stage table handling device of the present invention is a device for handling a table having multi-stage search keys as shown in the multi-stage table example 301 of FIG. In comparison, a mechanism for generating a search key for a multi-stage table and a mechanism for interpreting a multi-stage table key are provided. By using this device, it is possible to use a table expression that is easy to understand as shown in FIG. 6, and programmer productivity is improved.

[Brief description of drawings]

FIG. 1 is a diagram showing an 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 device of the present invention.

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

5 is a diagram showing an example of the contents of a table structure generated by the generation control unit 2 in 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.

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

[Explanation of symbols]

 1 central processing unit 2 generation control section 3 data area securing section 4 item information generation section 5 search control section 6 data search section 7 item search section 8 rewrite control section 9 data change section 10 table data storage area 11 search tree storage area

Claims (1)

[Claims] 1. A data handling device that handles tabular data, wherein a data area securing unit that secures a storage area for table data in a data area, and a storage area for storing search tree information of a table in the data area are searched. An item information generation unit that generates and stores a tree, an item search unit that converts the search tree and any search key into a table row number or column number, a pointer to table data, and a table row number and column An apparatus for handling multi-stage table data, comprising: a data search unit that reads a table element from a number; a pointer to table data; a data changing unit that rewrites a table element based on the row number, column number, and value of the table.