JPH08314951A - Structure display method for relational data base and relational data base system - Google Patents

Abstract

PURPOSE: To display the structure of a relational data base in a form which is easy to understand. CONSTITUTION: The relational data base is separated into plural data bases for groups without having mutual relations (a). The tables of the separated data bases are rearranged so that the backflow of the relation becomes less (b), and they are divided into layers along the order of the relation (c). The tables of the respective layers are arranged by rearranging the crossing of arrows showing the relation between the tables so that it becomes less (d). Fields in the tables are arranged by rearranging the arrows showing the relation between the fields so that it becomes less (e).

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a relational database, and more particularly to a technique for displaying the structure of a relational database so that a user can easily understand the structure.

[0002]

2. Description of the Related Art A relational database is composed of a plurality of tables each having one or a plurality of fields. In the relational database, a plurality of fields belonging to different tables are associated with each other.

A technique for displaying the structure of such a relational database is described by John L. Viescas:
The technology described in "Windows version Microsoft Access 1.1 Official Guide: pp.492-494, ASCII (1994.7)" is known.

In this technique, a relational database is used.
The table structure is displayed on the same screen as a table showing the field names of each table in a list format. And for the related fields, these fields
A line segment connecting the field names is displayed on the screen together with a table showing the table.

In the technique of displaying the structure of such a relational database by a graphic, the user can
It is extremely meaningful for understanding the structure of a conditional database when constructing it.

[0006]

However, the above-mentioned Joh
n L. Viescas: Windows Version Microsoft Acccess
1.1 Official Guide: pp.492-494, ASCII (19
The structure display of the relational database by the technique described in "94.7)" was not satisfactory from the viewpoint of displaying the structure of the relational database so that the user could easily understand it.

This is because, in the case where the structure of the relational database is complicated, in order to understand the structure of the relational database, an outline of the structure is grasped, and thereafter, if necessary. However, it is preferable to be able to grasp the detailed structure thereof, but such a point is not taken into consideration in the technique described above.

Further, in the above-mentioned technique, when the structure of the relational database is complicated, the line segments connecting the field names of the related fields may cross each other. It is difficult to understand the structure of the relational database immediately from the display because of the complicated movement.

Therefore, an object of the present invention is to display the structure of a relational database that is easier for users to understand.

[0010]

[Means for Solving the Problems] To achieve the above object,
The present invention relates to, for example, a relay including a plurality of tables each having a field capable of having a relationship with another field.
A method of displaying the structure of an optional database,
The relation between the fields belonging to each table is analyzed, and the relation between the fields belonging to each analyzed table is analyzed.
Each relational database table according to
A table name that analyzes the relationship between the tables and identifies the table, a display that shows the relationship between the analyzed tables in a recognizable manner, and a table name that identifies each table Fee
A field name for identifying a field and a display recognizing the structure of the relationship between the analyzed tables and the relation between the fields belonging to each analyzed table.
Provided is a method for displaying the structure of a relational database, which is characterized by selectively displaying types.

[0011]

For example, according to the above-described method of selectively displaying two types of display, the user first recognizes the table name specifying the table and recognizes the relationship between the analyzed tables. The structure of the relational database is grasped comprehensively by the possible display, and then the detailed structure of the relational database, the field name, the structure of the relation between the analyzed tables and the structure are analyzed. The relation between the fields belonging to each table can be recognized in a hierarchical manner by the recognizable display.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 shows the RDB ( R elatio) according to this embodiment.
nal D ata B ase: shows an example of information networks utilizing a relational database).

The illustrated information network is a server machine 1.
0, the client machine 40, LAN (L ocal A rea N etw
ork: CSS to components of local area network) 30 (C lient S erver S ystem: a client-server system).

The server machine 10 is, for example, a workstation or a personal computer. Similarly, the client machine 40 is also a workstation or a personal computer, but many personal computers are used because the system can be constructed inexpensively and many users are accustomed to using it (the user operates the client machine). It is used.

The LAN 30 is composed of, for example, Ethernet or the like, and the server machine 10 and the client machine 40 communicate with each other via this. This communication is OSI (O pe
n S ystems I nterconnection: performed in compliance with the Open Systems Interconnection) 7 layer model (server machine, both the client machine, a so-called physical layer, a communication protocol layer, an application layer).

In such a configuration, the server machine 20
Holds a relational database 20.
Further, the server machine 20 accesses the relational database 20 in response to the request of the relational database program executed on the plurality of client machines 40, and the result is accessed on the client machines 40. Return to the relational database program. That is, the relational database program executed on each client machine 40 can be accessed in the same manner as when the relational database is directly accessed. That is, the plurality of client machines 40 can share the relational database 20.

Next, FIG. 2 shows a hardware configuration example of the server machine 10 and the client machine 40.

[0019] As shown, the server machine 10, the client machine 40 together, CPU (C entral P rocessing U ni
t: central processing unit) 50, main memory 60, hard disk 70, flexible disk 80, printer 90, keyboard 100, mouse 110, display 120,
It is composed of a LAN board 130 and a bus 140.

The CPU 50 is, for example, 64 bits or 3
It is a 2-bit microprocessor. The main memory 60, a communication protocol software, OS (O perating S yst
em: basic software), middle software, AP to operate on (A pplication P rogram: application program), and data is loaded from the hard disk 70 or the like. The hard disk 70 stores the programs and data described above.

The flexible disk 80 is used for providing the above-mentioned programs and data from the outside and outputting the programs and data to the outside.

The printer 90 is used to execute printing in accordance with a request from an AP installed on the server machine 10 or the client machine 40, and to make a hard copy of a screen.

The keyboard 100, mouse 110, and display 120 are all input / output devices with the user.

In particular, in the client machine 40, the relational database program on the main memory 60 is stored in C
By executing the PU 50, various windows, which will be described later, are displayed on the display 120 on the client machine 40. The user uses the mouse 110 or the keyboard 1.
By inputting from 00, various works can be interactively executed by operating the window.

The LAN board 130 is used to perform communication between the server machine 10 and the client machine 40 via the LAN 30.

Here, the relationship between the programs executed on the client machine 40 is shown in FIG.

[0027] As shown, various application programs _{(A pplication P rogram: AP 1} ~AP n) is run on the message (arrow in the figure) driven on top of an operating system 150 (including the windowing system) To be done.

The above-mentioned relational database program is AP ₁ hatched in the figure. A
P ₁ is composed of a main function 170 that handles the above-mentioned message (acquisition and delivery of the message), a parent window function 180 and a child window function 190 that are driven by the message delivered from here to execute various processes (configuration). Depending on the case, a grandchild window function or the like may be provided, but it is omitted here).

The parent window function 180 and each child window function 190 correspond to one window displayed on the client machine 40. Parent window function 1
80, each child window function 190 controls the display of the corresponding window, and also generates a message according to the user's operation performed on the displayed window. Now, the messages generated by the parent window function 180 and each child window function 190 are fetched in the message queue in the operating system 150, and then sequentially fetched by the main function 170 and designated. It is delivered to the window functions 180 and 190.

FIG. 4 shows a basic processing flow of the main function 170 and the window functions 180 and 190.
The figure (a) is the processing flow of the main function 170 and the figure (b) is the window function 180, 190 (The basic processing procedure of the window function is the same regardless of the types of the parent window and the child window). .

In the main function 170, as shown in FIG. 7A, in step 10, the window class registration,
After initial settings such as creation and display, in step 20,
The process of acquiring a message from the message queue in the operating system 150 (step 30) and delivering the acquired message to the window functions 180 and 190 (step 40) is repeated.

Further, in the window functions 180 and 190, the type of the message delivered from the main function 170 is determined in step 10 and the type of message is determined in steps 20 to 40 as shown in FIG. Various processes corresponding to are performed.

In such a structure, the relational database program has a window function for controlling the main menu window as the parent window function 180. As the main child window function 190, a window function for defining the structure of the relational database, a window function for registering data in the relational database 20, and a relational database function. A window function for searching the data of the base 20 and a window function for displaying the structure of the relational database are provided. As described above, these child window functions are activated and operated by the message delivered from the main function 170.

Now, focusing on the use of the relational database 20, a data registration window function 50 for registering data in the relational database 20.
5, a window function 502 for retrieving relational database data, a structure display window function 503 for displaying the structure of the database, and a relational database 20 as shown in FIG. Such a system is built. The data registration window function displays, for example, a data registration window and registers data in the database main body according to an operation in the window. Similarly, the data search window function is
For example, a data search window is displayed, and data satisfying the conditions specified by the user is searched from the database main body and displayed according to the operation in the window. Then, the structure display window function displays a structure display window and displays the structure of the database main body in the window.

In the present embodiment, as will be described later, the tabular display window function 50 is used as the structure display window function.
5 and 2 of the graphic format display window function 506
There are different types. In addition, tabular display window function 5
05 and graphic format display window function 506
Uses the table 504 for its processing.

FIG. 6A shows a screen displayed on the client machine 50 immediately after the power of the client machine 40 is turned on. On the screen 200, the OS 150 displays the database software icon 210. ing. In this state, when the user double-clicks the icon 210 with the mouse, the main function 170
Is started, and the parent window function 180 is started by the main function 170. As a result, the display of the icon 210 double-clicked changes to the display of the main menu window 220 corresponding to the parent window function 180 ((b) in the figure).

In FIG. 7B, the user operates the menu bar in the main menu window 220,
When the submenu "Open" of the main menu "File" is selected, the parent window function 10 displays the dialog box 230 as shown in FIG. , Ask the user to specify which database to open.
When the user designates the target database from the database list displayed in the dialog box 230 with the mouse / keyboard, the parent window function 10 displays the dialog box 230 as shown in FIG. Is closed, a predetermined message is sent, and a child window function 190 for accepting access to the database is activated.

This child window function 190 displays the child window 240. The client area of this window displays the interface for accessing the previously specified database.

The user performs the necessary work through this interface. For example, when it is instructed to open a specific table in the database using this interface, the child window 250 is opened and details of each field of the specified table are displayed, as shown in FIG. You can refer to the configuration, data registered in each field, and so on. Similarly, according to the work performed through this interface, the window function for defining the structure of the relational database described above and the data for registering the data in the relational database are registered. A child window of a window function or a window function for retrieving relational database data is opened, and the relational database structure can be defined, data can be registered, and data can be retrieved.

Similarly, when the user requests an inquiry about the database structure via this interface, the table display window function 505, which is one of the structure display window functions described above, is activated. This tabular display window function 505 displays the child window 260 and displays the structure of the specified database in the tabular format in its client area.

The user can grasp the general structure of the database by this.

When the user wants to refer to more detailed contents, he double-clicks the target table on the window 260 with the mouse.

Then, the tabular display window function 5
05 ends and the window 260 is not displayed, and the graphic format display window function 506, which is one of the structure display window functions described above, is activated.
This graphic display window function displays the child window 270 and, in its client area, the detailed structure of the database, including the previously specified tables, in graphic form.

The user can grasp the field structure of each table, the relation between the fields, etc. by referring to this.

When the user requests the tabular display of the database structure by using the database window 240 of FIG. 5D, the tabular display section arranges the database structure, and the result is shown in FIG. 7A. The structure diagram is displayed in a table format in the display window 260.

Further, when the target table is designated on the window 260, the graphic format display unit arranges the detailed structure of the database including the table, and the result is shown in the structure diagram of FIG. 7 (b). A graphic format is displayed in the graphic format display window 270.

Now, the relation (relationship) in the relational database 20 according to this embodiment will be described.

Relational database according to the present embodiment
In the field 20, between one certain table and another certain table, only one field can have a relation. That is, table A
If there is a relation between the field a of the table A and the field b of the table B, other than that between the field of the table A and the field of the table B. There can be no relation.

There are two types of relations between fields, one-to-one relations and one-to-many relations.

Each of the table A and the table B has a field aa (main key), and each record of the table A is associated with each record and the field of the table B. In the case where there is a one-to-one correspondence with respect to the value of the field aa (main key), the field aa of the table A and the field aa of the table B have a one-to-one relation. However, here, if the values of the field aa (main key) are the same, the fields are
The two records correspond to the value of the field aa (main key). Each record in a table has a unique value as the value of the field of the main key. Conversely, the value of the field of the main key uniquely identifies the record within one table.

For example, a table having a field "employee code", a field "employee name", and a field "telephone number" is divided into field "employee code". Fee
Considering the case where a table A consisting of a field "employee name" and a table B consisting of a field "employee code" and a field "phone number" are created, this table A Since each record of table B corresponds to the field "employee code" on a one-to-one basis, table A's field "employee code" and table B's field "Employee code" has a one-to-one relation.

In this embodiment, the field of a certain table A and the field of another table B are one-to-one.
Table A and table B correspond to one-to-one correspondence.

Next, when the table A has the field aa (main key) and the table B has the field aa as an external key other than the main key, the table A Field a
It is said that a and the field aa of the table B correspond one-to-many. For example, the field "part" is the main key, the table "part list" having the field "location" etc. as the other fields, and the field "employee number" is the main key. Owned, other fields "employee name", "
If there is a table "employee list" that has a department "," the field "part" of the table "part list" and the table "table"
The field "part" of the employee list corresponds to one to many.
Because there is always one record in the table "part list" which has the value "accounting" as the field "part",
This is because there can be a plurality of records in the table "employee list" having the value "accounting" as the field "section". In this example, the field "part" of the table "part list" is one-to-many one side, and the field of the table "employee list" is one side.
Rud "part" is multi-sided.

Here, in this embodiment, the field on one side is called to precede the field on many sides. On the contrary,
The multi-sided field is called following the one-sided field.

Further, when the field of a certain table A and the field of another certain table B are in a one-to-many correspondence, the table A and the table B are in one pair. We call it multi-purpose. And, in the above-mentioned one-to-many correspondence, it is said that the table having the one-sided field precedes the table having the many-sided field. The table that it has is said to follow the table that has the field on the one side.

Further, each of the above-mentioned one-to-one corresponding fields is a field which precedes the other field and a field which follows the other field. . Similarly, each of the above-described one-to-one correspondence tables is a table that precedes the other table and a table that follows the other table. Further, in the following description, a field having another field and a relation is called a fixed field, and a field having no other field and a relation is called a floating field. I will call it.

Regarding the one-to-one correspondence and the one-to-many correspondence described above, by John L. Viescas mentioned above: Window
s Version Microsoft Acccess 1.1 Official Guide 4,
Detailed in "Ascii (1994.7)" etc.

Details of the table format display window function 505 and the graphic format display window function 506, which are the features of this embodiment, will be described below.

First, the structure of the table used by the tabular display window function 505 for its processing will be described in advance.

As such a table, a table /
Field attribute table 340, table management table
-A350, table order table 360, stratified table management table 370, table management table-B38
0 is set.

8 and 9 show the structure of the table / field attribute table 340.

This table is composed of two tables, a table attribute table and a field attribute table. FIG. 8 shows the structure of the table attribute table.

The table attribute table includes the management data shown in FIG. 9A, the table list shown in FIG. 9B, the preceding / successive table list shown in FIG. Field order list-A, field order list-B in FIG.
Consists of The field order list-A shown in FIG. 7D and the field order list-B shown in FIG. 8E are provided for each table constituting the relational database 20. The field order list-A in FIG.
It is provided for each of the fixed field and the floating field. The preceding / successive table list in FIG.
One is provided for each of the preceding table and the subsequent table for each table.

As the management data, the configuration shown in FIG. 11A holds the total number of a plurality of tables included in the database and the entry row No. indicating the position of the table list shown in FIG. .

The table list has the table name, the total number of preceding tables, and the
The position of the preceding / succeeding table list for the preceding table of the corresponding table is set to the entry row No., the total number of succeeding tables, and the position of the preceding / succeeding table list for the succeeding table of the corresponding table. Entry line N indicating
o., total number of fixed fields, field order list for corresponding table-entry row N indicating position of A
o., field ordered list for the corresponding table
-Entry row No. indicating B position, total number of floating fields, field order list for corresponding table
-Entry line No. indicating the position of A, display style grade value (FULL, HALF, NON), table display style,
Holds the number of floating field display fields and the table display position (horizontal, vertical).

The preceding / succeeding table list holds the table No. of the preceding / succeeding table of each table and the relation type of one-to-many or one-to-one with the configuration shown in FIG.

Further, the field order list-A has the field No. of a plurality of fixed fields or floating fields included in the corresponding table by the structure shown in FIG.

The field order list-B holds the fields No. of a plurality of fixed fields in the corresponding table with the configuration shown in FIG.

Next, FIG. 9 shows the structure of the field attribute table of the table / field attribute table 340.

This table includes the management data shown in FIG.
It is composed of the field list shown in FIG. 9B and the preceding / succeeding field list shown in FIG. The preceding / succeeding field list of FIG. 7C is provided for each of the preceding and succeeding fields for each field.

As the management data of FIG. 9A, as shown in the figure, the total number of fields existing in the database and the entry row No. indicating the position of the field list shown in FIG. .

Further, the field list has the field name, the belonging table No., the arrangement order in the table, the total number of the preceding fields, for each field, by the structure of FIG.
Preceding / preceding field of the corresponding field /
Entry line No. indicating the position of the subsequent field list,
Total number of trailing fields, trailing field of the corresponding field
Holds an entry row No. indicating the position of the leading / successive field list for the field.

In the preceding / succeeding field list, the field No. of the preceding / succeeding field of each field and the relation between this field and the field are displayed by arrows according to the structure of FIG. And whether or not to display the connection line between the arrow and Yao).

Next, FIG. 10 shows a table management table-
The structure of A350 is shown.

As shown, the table management table-A
Reference numeral 350 includes the management data shown in FIG. 9A, the database list shown in FIG. 7B, and the table order list-A shown in FIG. The table order list-A shown in FIG. 7C is provided for each database.

As the management data, as shown in FIG. 11A, the total number of databases having no relation to each other and the entry line No. showing the position of the database list-A shown in FIG. Hold.

The database list-A, as shown in FIG. 7B, is a database list for each database.
The table stores the total number of tables included in the table and the entry row No. to the table order list-A of the corresponding database.

Further, as shown in FIG. 9C, the table No. of a plurality of tables included in each database is held.

Next, FIG. 11 shows a table management table-
The structure of B is shown.

As shown in the figure, this table has the management data shown in FIG. 9A, the database list B shown in FIG. 9B, and the layer list B shown in FIG. When,
It is composed of a table order list-B shown in FIG. The layer list-B shown in FIG. 7C is provided for each database having no relation with each other. Further, the table order list-B shown in FIG. 9D is provided for each layer of each database having no relation.

As shown in FIG. 9A, as the management data, the total number of databases having no relation to each other and the entry row No. indicating the position of the database list-B are held.

The database list B is, as shown in FIG. 6B, the total number of layers constituting the database and the layer list of the corresponding database for each database having no relation with each other. The entry row No. indicating the position of B, the window size, and the size (horizontal, vertical) of the database arrangement area are held.

Further, as shown in FIG. 10C, the layer list-B is the total number of tables existing in the layer of each layer constituting the corresponding database, and the table order list-B of the corresponding layer. Entry line No. indicating position
Hold.

The table order list-B holds the table No. of each table existing in the corresponding layer of the corresponding database, as shown in FIG.

Next, FIG. 12 shows the table order table 3
The structure of 60 is shown.

As shown in the figure, this table holds the table No. in accordance with the one-dimensional arrangement order of the plurality of tables included in the database.

Next, FIG. 13 shows the structure of the stratified table management table 370.

This table is created for each database having no relation to each other. The table is composed of the management data shown in FIG. 9A, the layer list-B shown in FIG. 7B, and the table order list-C shown in FIG. The table order list-C is provided for each layer.

As shown in FIG. 9A, as the management data, the total number of a plurality of layers forming the corresponding database and the entry row No. indicating the position of the layer list-C of the corresponding database are held. To do.

Further, as shown in FIG. 10B, the layer list-C is, for each layer constituting the corresponding database, the total number of plural tables existing in the layer and the table order list for the corresponding layer. Entry line No. indicating the position of C
Hold.

Further, as shown in FIG. 9C, the table order list-B holds the table No. of each table existing in the corresponding layer.

The table format display window function 505 has been described above.
Explained the table used for the processing.

The contents of the processing performed by the tabular display window function 505 will be described below.

FIG. 14 is a table format display overall control process 330, a table creation process 3000, a database separation process 280, and a table ordering process 290, which are performed by the tables and the table format display window function 505. , Table layer classification processing 300, in-layer table ordering processing 31
0 shows the relationship between each processing of the database structure table format display 320 and the above-mentioned table processing.

Here, the tabular display overall control process 330 is performed.
Controls the execution of other processing in the procedure shown in FIG.

That is, first, the table creation processing 300
0 is started (step 5), and the table / field attribute table 340 is created. Next, in step 10, the database separation processing 280 is started to execute different database processing.
The relational data base 20 is separated into a plurality of data bases so that there is no relation between the tables belonging to the data bases. In this specification, each of the databases thus separated is referred to as a database having no relation to each other.

Then, in steps 20 to 60, for each of the databases separated in step 10, a table ordering process 290 and a table layer classification process 30 are applied to the databases (including a plurality of tables) that need to be structured.
0, the in-layer table ordering process 310 is activated to perform structuring, and the database structure table format display 320 is activated in step 70 to display the result of the structuring process in a table format.

The details of each processing will be described below.

First, the table creating process 3000 will be described.

In this processing, the relational database 20 is analyzed and the table / field attribute table 34 is analyzed.
This is a process of creating 0.

In this process, the total number of tables included in the relational database 20 is described as the management data of FIG. 8A, the table list of FIG. 8B is created, and the entry line indicating the position is written. No. Describe.

In creating the table list of FIG. 8B, the table names of the tables included in the relational database 20 are sequentially added to the table names of the table of FIG. 8B. Table name for describing the table name, describing the total number of tables preceding the table in the total number of preceding tables, and describing the preceding / succeeding table list for describing the table preceding the table ( In the same figure c), the entry line No. indicating the position is created. , And describe the total number of subsequent tables in the total number of subsequent tables,
A preceding / succeeding table list (c in the figure) for describing a table following the table is created, and an entry line No. , The total number of fixed fields contained in the table is described in the total number of fixed fields, and the field order list-A (FIG. 4D) for the fixed fields is created. Entry line N that represents the position
o. , The total number of floating fields included in the table is described in the total number of floating fields, and a field order list-A (FIG. 4D) for the floating fields is created. Entry line number indicating the position Describe. As for the other fields in the table list of FIG. 8B, only that area is secured at this point.

Next, in the preparation of the preceding / successive table list of FIG. 10C, the table which precedes or follows the table corresponding to the preceding / successive table list is specified. -Description of the relation type indicating whether the relation between the table No. and the table specified by the table No. is one-to-one or one-to-many. To do.

In the creation of the field order list-A shown in FIG. 9D, the field order list-A is created.
Fixed or floating file included in the table corresponding to
Field No. that specifies the field. Describe.

At this point, the field shown in FIG.
The ordered list-B is not created.

In the table creating process 3000, the total number of fields included in the relational database 20 is described as the management data of FIG.
The field list shown in FIG. 9B is created, and the entry line No. Describe.

In the creation of the field list shown in FIG. 10B, the field name of the field is sequentially described for each field included in the relational database 20, and the field belongs. To describe the belonging table No. that specifies a table, describe the total number of preceding fields that represent the total number of fields that precede the field, and describe the table that follows the table. A preceding / succeeding field list (c in the same figure) is created, and the entry line No. indicating the position is set. , The following field total number indicating the total number of fields following the field, and the preceding / succeeding field list for describing the table following the table (see FIG. ) Is created and the entry line No. indicating the position is created. Describe.

In the field order in the table of the field list in FIG. 9B, only that area is secured at this point.

In the preparation of the preceding / succeeding field list shown in FIG. 13C, the field No. for specifying the field preceding or succeeding the corresponding field is selected.
Describe. As for the relation display enable / disable flag, only the area is secured at this point.

Although the table creating process 300 has been described above, this process need not necessarily be performed as a part of the tabular display window function 505, and may be performed prior to each process described below.

Next, details of the database separation processing 280 will be described.

In this process, the relational data base 20 is separated into a plurality of data bases so that the relational data is eliminated between the tables belonging to different data bases. That is, the relational database 20
Is separated into multiple databases that are not related to each other.

FIG. 16 shows an example of the processing.

FIG. 13A shows the database structure before the separation processing, and FIGS. 13B, 13C and 13D show the database structure after the separation processing. A rectangle represents a table (a table No. in the rectangle), and an arrow between the rectangles represents a one-to-many relation between the tables. The table located in the arrow tail is one side, and the table located in the arrow head is multi-sided.

Further, in the same figure (a), Table-1
And Table-5 are connected by a one-to-many relation, and in the figure, this one-to-one relation is represented by connecting the tables in two directions with arrows.

By the way, FIG. 10A shows three database structures having no relation to each other (FIGS. 8B and 8C).
It is an aggregate of (d)). In this separation process, the process shown in FIG. 14A is separated to obtain processes shown in FIGS.

The procedure of the separation processing is shown in FIG.

The square matrix shown in FIG. 17 (a) describes the database before the separation process shown in FIG. 16 (a). Each vertically arranged table is one side, and each horizontally arranged table is a multi-sided table. The matrix elements shown in black show relations, and the elements shown in white show no relations. For example, the black element in the 1st row and the 5th column indicates that table-1 and table-5 have a one-to-many relationship (table-1 is one side, table-5 is many side). Show. The one-to-one relation is shown by setting the one-to-many relation bidirectionally as in Table-5 and Table-6.

Such a square matrix can be created from the information in the table attribute table of FIG.

Now, this separation processing is performed by sequential processing based on the number of tables included in the database.

That is, first, the separability of a database having one table is examined. For example, whether or not Table-4 is separable is determined by determining that all the elements except the diagonal elements in the fourth row of the square matrix of FIG.
When all the elements except the diagonal elements of the column are white, it can be determined that they are separable. This judgment is made in Table-1 to Table-1.
Do this for all 0 tables. In the example of FIG. 17A, table-4 is detected as the table satisfying the above condition, and therefore this is separated. 17 (b), (c)
The separation result is shown in FIG.

Next, the separability of a database having two tables will be examined. The target is the matrix shown in FIG. 17 (b) that remains after performing the separation for one database. First, it enumerates all possible combinations in the table and examines the separability of each of the combinations. For example, Table-9 and Table-
In the determination as to whether the database composed of 10 is separable, Table-9 and Table-9 'to Table-9' are combined in the target matrix.

The synthesis method is shown in FIG. FIG.
Is the same as the matrix shown in FIG. In FIG. 18A, first, each row element of the 10th row is superimposed on the row element of the corresponding column of the 9th row to obtain row 9 ′ (FIG. 18B). The rule of superposition is that if a white element and a white element are superposed, a white element is obtained after the superposition,
Assume that all black elements are obtained except for that, and then, the tenth row is removed from the matrix (FIG. 18).
(C)).

The columns are processed in the same manner to obtain FIG.

Composition table-9 'in FIG. 17 (e).
The determination of the separability is performed in the same manner as above. As a result, FIG. 16B is separated into FIGS. 16D and 16E.

The possibility of separating a database having three or more tables is also examined in the same manner as above.

By the determination and separation processing as described above, FIG. 15A is separated into FIG. 15B, FIG. 15C and FIG.

When the separation is completed, the table management table-A350 of FIG. 10 is created according to the result.

That is, first, the management data of the same figure (a) is created, the total number of separated databases having no relation to each other is described, and the database list-A shown in the same figure (b) is created. Entry line No. indicating the position
Describe.

In the creation of the database list-A shown in FIG. 10B, the total number of tables included in the database is sequentially described for each database, and the table shown in FIG. An ordered list-A is created and an entry line No. indicating its position is described.

The table No. of a plurality of tables included in the corresponding database is described in an arbitrary order in the table order list shown in FIG.

Next, the table ordering process 290, the table layer classification process 300, and the in-layer table ordering process 310 will be described.

As shown in FIG. 15, these processes are repeated for each database.

That is, the tabular display overall control 330
Each separated database is sequentially processed (step 20), the total number of tables included in the target database is referred to in step 30, and when there are two or more, it is determined that structuring is necessary, The ordering process 290, the table layer classification process 300, and the in-layer table ordering process 310 are executed to structure the database (steps 40 to 60). When the total number of tables is one, table ordering processing 290, table layer classification processing 300,
The in-tier table ordering process 310 is not performed.

Here, the table ordering process 290,
FIG. 1 shows a processing example of structuring the database by the layer classification processing 300 of the table and the table ordering processing 310 within the layer.
It shows in 9. The target database shown in the figure is one of the databases shown in FIG. 16B, that is, the database previously separated, that is, the table management table-A.

The table ordering process 290 shown in FIG.
9 (a) is shown in FIG.
When 0, the same figure (b) is changed to the same figure (c), and in the table ordering process 310 within the layer, the same figure (c) is changed to the same figure (d).

The table ordering process 290, the table layer classification process 300, and the in-layer table ordering process 310 that perform such structuring will be described below.

First, the table ordering process 290 will be described.

By the way, as shown in FIG.
One-to-many relations between tables are represented by rectangles with arrows between the rectangles, so that the table at the arrow tail is one side and the table at the arrow head is many side. When the tables are linked by arrows in both directions, the target database is as shown in FIG.
Cycles are generally included, as indicated by the double-headed arrow connecting Table-5 and Table-6 in (a). Therefore, in the table ordering process 290, a one-dimensional arrangement order of the tables is found so that the number of arrows that cause the backflow is minimized.

This table ordering is a problem of combinatorial optimization, and the branch and bound method is applied to find the optimum solution. The branch-and-bound method is a branching operation that decomposes a difficult-to-solve problem into multiple smaller sub-problems, and the generated sub-problems that can be concluded not to give an optimal solution. It is a method that tries to solve a given problem while repeatedly using two operations, which is a limited operation that excludes from the consideration.
It aims to obtain an optimal solution in a short time by detecting unnecessary parts as soon as possible and enumerating only a very small part of the whole.

Now, for the above limited operation, it is necessary to calculate the lower bound of the generated subproblem. The lower bound is a value at which the optimal solution of a subproblem does not fall below it. Therefore, first, a method of calculating the lower bound will be described.

FIG. 20A shows the table order by table.
This is an example of a subproblem in which 1 → 8 → 2 is determined and the rest of the order is not determined.

The square matrix shown in FIG. 20A is
In accordance with the information of the table management table A350 shown in FIG. 10 and the table attribute table 340 of FIG.
Created according to the same rules as shown in (a), each vertically arranged table is one side, and each horizontally arranged table is a multi-sided table, and matrix elements shown in black are relations. The element shown with white indicates that there is no relation. The one-to-one relation is indicated by setting the one-to-many relation bidirectionally.

However, in this square matrix, according to the determined table order (table-1 → 8 → 2),
Arrange the tables vertically and horizontally.

In this case, the number of arrows that cause backflow in this subproblem means that among the three types of hatched matrix elements below the diagonal line in FIG.
It is the total number of black elements.
This is because these black elements become a relation to the previous table in the table order.

In a square matrix like this, the lower bound is the total number of black matrix elements out of the two matrix elements (solid and sparse) hatched by solid lines. It is assumed that

The reason why the matrix elements hatched with broken lines are excluded from the aggregation target is as follows.

That is, as shown in FIG. 14B, first, the matrix elements hatched with dense solid lines are:
The order of Tables 1, 8 and 2 is fixed, so it is uniquely determined. In addition, the matrix elements hatched with sparse solid lines have a fixed order of Tables 1, 8 and 2 no matter how the order of tables other than Tables 1, 8 and 2 is changed. It moves only in the direction and the result of counting is unchanged and is uniquely determined. On the other hand, the matrix elements hatched with broken lines move in and out of the hatched area depending on the order of the tables, and black elements cannot be aggregated.

For the above reason, the matrix elements hatched with broken lines are excluded from the aggregation target.

Now, the table ordering process 290 is as follows.
The table belonging to the target data base is recognized from the table management table A350 shown in FIG. 10, and the table belonging to the target data base is shown from the table attribute table shown in FIG.
As shown in FIG. 21, the tables of the target data base are ordered while recognizing the relation between the bulls.

That is, first, depending on which table is placed at the top, seven types (table-1 / 2/3
/ 5/6/7/8), the lower bound (numerical value at the lower right of each rectangle) of each is obtained by the method described above, and these are listed. Then, from these, one branch operation target is selected. The rules of choice prioritize the one that gives the best lower bound. However, if there is more than one that gives the best lower bound, the one with the deepest search depth is given priority. If the search depths are the same, priority is given to the one in the earliest order. In this case, the search depth is the number of tables whose order is determined in the branch problem.

By examining the lower bounds of the enumerated seven subproblems according to the above rule, there are two that give the best lower bounds, Table-1 and Table-8. Since the search depth is the same, the one listed first is given priority, and the table-
Branch 1

Next, the table to be placed at the top is
-When deciding to 1, depending on which table to place next, there are 6 ways (table-2 / 3/5/6/7 /
8) is considered. Each is listed along with its lower bounds. Examine the lower bounds of the six sub-problems listed above and the remaining six sub-problems that did not branch before. The ones that give the best lower bounds are Table-1 → 8 and Table-8. Due to the depth priority, table-1 → 8 is branched. The same process is performed thereafter, and finally table-1 → 8 → 2 → 3 → 5 →
Get the order 6 → 7.

By the above processing, FIG. 19 (a) is ordered as shown in FIG. 19 (b). When this result is obtained, the table ordering process 290 creates the table order table 360 of FIG. 12, and the table of each table belonging to the target database is in the order according to the order obtained by the table order table 360. No. Describe.

Next, the table layer classification processing 300 will be described.

In this processing, according to the table order table 360 of FIG. 12 and the table attribute table of FIG. 8, the tables ordered by the table ordering process 290 are set for each database having no relation to each other. -Classify bulls into multiple layers. The layers are classified according to the flow of the arrow described above. That is, the first layer is the layer of the table without the inflow of arrows, the second layer is the layer with the inflow of arrows only from the table of the first layer, the third layer is the layer of the first layer and the second layer. -Classify as a layer with an inflow of arrows only from the bull.

This layer classification is performed by selecting one of the results of layer classification by two calculations of layer classification by forward calculation and layer classification by backward calculation.

FIG. 22A shows an example of stratification by forward calculation, and FIG. 22B shows an example of stratification by backward calculation.

In FIG. 17A, the matrix shown at the left end is for a database composed of the tables described in the table order table 360 according to the same rules as shown in FIG. It is created, each table arranged vertically is one side, each table arranged horizontally is a multi-sided table, matrix elements shown in black have relations, elements shown in white have no relations Is shown. The one-to-one relation is indicated by setting the one-to-many relation bidirectionally. However, the vertical and horizontal table order is changed to the table order of the table order table 360 (table-1 → 8 → 2 → 3 → 5 → 6 → 7), and
Black element on the lower left side of the diagonal element (backflow arrow)
Is replaced with a white element.

By the way, in the forward calculation, all the columns of this matrix are examined, and all the tables with no inflow of arrows (tables in which all the elements of the columns are white) are listed. As a result, tables-1 and 8 are listed as the tables belonging to the second layer.

Next, the previously listed tables-1 and 8 are removed from the matrix, and similarly to the above, all the columns of this matrix are examined, and the tables having no inflow of arrows are listed. As a result, tables-2, 3 and 5 are listed as the tables belonging to the second layer.

Similarly, Table-6 and Table-7 are listed as tables belonging to the third and fourth layers.

The above is the layer classification of the table by the forward calculation.

For the layer classification by the backward calculation, the matrix shown at the right end of FIG. 22B is also used.

This is the same matrix as shown at the left end of FIG. 22 (a).

In the backward calculation, contrary to the forward calculation, all the rows of this matrix are examined, and all the tables in which no arrows flow out (tables in which all the elements of the rows are white) are listed. As a result, Table-7 is listed as a table belonging to the final layer.

Remove Table-7 listed above from the matrix. As before, look at all the lines,
List the tables without arrow leaks. As a result, Table-6 is listed as a table belonging to the layer immediately before the final layer.

Similarly, the table belonging to the layer two layers before the final layer and the layer three layers before the final layer are
2, 3 and 5 and Tables-1 and 8 are listed.

The above is the processing of table layer classification by forward calculation and backward calculation.

When the results of the two-layer classification are obtained in this way, the number of arrows connecting the adjacent layers of the two (the black existing in the hatched portion in FIG. 22C) is obtained. Count the number of elements) and select the one with the largest number. However, in the example of FIG. 22, the result is the same.

As a result of the above processing, FIG.
If the layers can be classified as in (c), the table layer classification processing 300 creates the layer-based table management table 370 of FIG. 13.

That is, in FIG. 13, the total number of a plurality of layers forming the database to be processed is described in (a) of the layered table management table 370, and the layer list-C of the corresponding database is created. The entry row No. indicating the position is held.

In the creation of the layer list-C shown in FIG. 18B, the total number of plural tables existing in each layer is described for each layer, and the table order list-C for the corresponding layer is described.
Is created and the entry line No. indicating the position is described.

Further, in the creation of the table order list-C shown in FIG. 13C, the table No. of each table existing in the corresponding layer is described in an arbitrary order.

Further, in this process, the "relation display enable / disable flag" field of the field is set by referring to the preceding / succeeding field list (FIG. 9 (c)) of the field attribute table of FIG. I do.
That is, all files belonging to the processing target database
Of the fields, the "relation display enable / disable flag" field of the field (fixed field) having the relationship with other fields, the field having the relationship with that field, If the field belongs to an adjacent layer, it is set to ON, and if not, it is set to OFF.

The "relation display enable / disable flag" is used later as follows. That is, FIG.
As shown in (b), the graphic display function is
Finally, the detailed structure of the database is displayed as a figure in which the fields of each table are connected by an arrow representing the relation between them, but at this time, the fields of non-adjacent layers are displayed. If you also display arrows that connect the two, the diagram becomes complicated,
Instead, it hinders the user's understanding. Therefore, the graphic format display function displays only the arrow heads and the tails of the fields of non-adjacent layers according to the on / off state of the "relation display enable / disable flag, and does not connect the fields.

Next, the table ordering process 310 in the layer.
Will be described.

In this processing, as shown in FIG. 19C, each table is arranged from left to right according to the order of layers, and the table is formed by a rectangle so that the one-to-many relation between the tables is formed between the rectangles. In the layer, the vertical arrangement positions of the tables are ordered so that the number of intersections of the arrows connecting the tables is minimized when they are connected by the arrow. (C) such as Table-1 → 3 and Table-8 → 2 generally crosses).

The problem of table ordering within this layer is a problem of combinatorial optimization, as in the previous case, and the branch and bound method is applied to find the optimum solution.

First, FIG. 23 shows an outline of the lower bound calculation used in this processing.

In the same figure (a), the table order of the second layer is determined from top to bottom as table-1 → 8, and the table order of the second layer is similarly determined as table-2 → 3 → 5. , A matrix corresponding to a subproblem in which the order of the third layer onward is not determined. This matrix can be created from the layered table management table 370 of FIG. 13 and the table attribute table information of FIG.

By the way, the number of arrow crosses in this subproblem means that among the three hatched matrix elements in FIG. 10A, the black one crosses the other. It is determined whether or not the black elements are crossed, and the black elements determined to be crossed are aggregated. As the lower bound, it is determined whether or not the element that is black among the two types of solid line hatching (dense and sparse) intersects with the other, and the black that is determined to intersect. Let's assume that the elements are aggregated. The reason why the matrix elements hatched with broken lines are excluded from the aggregation target is as follows.

That is, first, the matrix elements hatched with dense solid lines are table-1, 8 and table-
Since the order of 2, 3, 5 is fixed, it does not move and crossover determination is possible. In addition, the matrix elements hatched with sparse solid lines are used for the table elements no matter how the order of the tables other than table-1, 8 and table-2, 3, 5 changes.
Since the order of -1, 8 and tables -2, 3, 5 is fixed, it is possible to move only in the horizontal or vertical direction at most, and it is possible to determine the crossover. On the other hand, the hatched portion of the broken line makes complicated movements in the horizontal and vertical directions depending on the order of the tables, and therefore cross determination is impossible.

For the above reason, the matrix elements hatched with broken lines are excluded from the totaling target.

By the way, the determination of the crossover required for determining the lower bound in this way is performed as follows. That is,
In FIG. 23A, the determination of the crossover of the matrix elements in the densely hatched area on the upper right corner (the lower left corner of the diagonal) in FIG. When there is a black element in the lower left (thick frame in the figure),
Determine to cross. If it does not exist, further check the upper right or lower left (thick frame in the figure) of the corresponding element in the hatched part of the dense solid line at the lower left of the diagonal (upper right of the diagonal), and there is a black element there. When it does, it is determined to cross, and when it does not exist, it is determined not to cross.

In addition, in FIG. 23A, the crossover judgment in the matrix element hatched by the sparse solid line on the upper right corner (lower left corner of the diagonal) in FIG. It is determined whether or not black elements are present in the upper right, lower right, upper left and lower left (thick frame in the figure) parts of the element. For example, when there is a black element in any of the upper right, upper left, lower right, and lower left (thick frame in the figure) of the black element to be cross-judged,
No matter how you order the tables, they always cross, so
Determine to cross. The same applies when any one of the parts is left and the remaining three parts all have black elements. In the same way, leave any two parts,
When all the black elements are present in the remaining two parts, any three parts are left, when the black element is present in the remaining one part, and when the black elements are not present in all the four parts. For each of the above, whether or not to always cross is determined based on a predetermined predetermined crossing determination condition, and the determination is performed according to this.

In the above determination, if it is not determined that the tables are always crossed, no matter how the tables are ordered, the corresponding elements of the hatched portion of the sparse solid line on the lower left of the diagonal (on the upper right of the diagonal) are selected. The upper right, lower right, upper left, lower left (thick frame in the figure) portions are examined, and the crossover determination is advanced depending on whether or not there is a black element. The determination method is similar to the above. However, it is optional whether or not the crossover determination is performed up to this level.
Even if the crossover determination is not performed up to this level, the structure display with less crossover than in the past can be performed by the graphic display window function described later.

While using such crossover and lower bound determination,
The in-layer table ordering process 310 searches and determines the table order by the branch and bound method.

This search process is shown in FIG. First, the second
There are two possible layer table orders (table-1 → 8, table-8 → 1). Each is listed along with the lower bounds. Since the lower bound at this time is not yet computable, set the best lower bound (zero). Examine the lower bounds of the two subproblems listed above. There are two things that give the best lower bound: Table-1 → 8 and Table-8 → 1. When there are a plurality of these, if the depth is the same, and if the depths are the same, the one listed first is given priority, so that table-1 → 8 is branched.
When you decide the table order of the second layer to be table-1 → 8,
The table order of the second layer is six ways as shown in the figure (table-2 → 3 → 5, table-2 → 5 → 3, ..., table-
5 → 3 → 2) Possible. Each is listed along with its lower bounds. Examine the lower bounds of the six subproblems listed above and the subproblems that did not branch before. The one that gives the best lower bound is Table-8 → 1, which branches off. The same process is performed thereafter, and finally Table-1 → 8 → Table-5 →
Get 2 → 3 → Table-6 → Table-7.

By the above processing, the number of intersecting arrows is minimized, and as shown in FIG. 19C, the vertical order of the tables in each layer is determined.

The in-layer table ordering process 310 describes the result of such in-layer table ordering in the table management table-B 380 of FIG.

That is, referring to the table management table A350 of FIG. 10 and the layered management table 370 of FIG. 13, the management table of FIG. Describe the total number of
Create a list-B and describe an entry line No. indicating its position.

In the creation of the database list B shown in FIG. 11B, the total number of layers constituting the database is described for each database having no relation to each other, and the corresponding database is stored. Create a layer list-B and describe an entry line No. indicating its position. At this point, only the area is secured for the window size and the size (horizontal, vertical) of the database arrangement area.

Further, in creating the layer list-B shown in FIG. 11C, the total number of tables existing in each layer is described. When the table order list-B for the corresponding layer is created, the entry row No. indicating the position is held.

The table order list-B shown in FIG. 11 (d) is created sequentially when the table order in each layer of each database is obtained as described above. The table No. of each table existing in the corresponding layer is described in the table order list B in the order according to the obtained in-layer table order. Also, FIG. 11 (b)
In the window size of the database list, the maximum number of fields included in one table in the corresponding database is described as an initial value.

When the table management table B for the relational database 20 is created in this way, the database structure table format display 320 performs processing (step 70 in FIG. 5). ) In this process, the table of FIG.
Table 340 and the table management table-B 380 in FIG. 11 are referred to, and as shown in the window 260 in FIG. -The database is separated for each database that does not have an option, and the table name of the database corresponding to each separated table is displayed. Tee
In displaying the table name, one column is associated with one layer, and the table name of the layer corresponding to the column in each row is described in the table order list of the table management table-B380. Table No. Display in the order of.

From this display, the user can refer to, for example, the number of mutually independent databases, the number of tables belonging to each layer of each database, the table name, etc., and can grasp the structure of the target database in a comprehensive manner. .

The above is a description of the structure and operation of the tabular display window function of the database structure.

As described above, when the display in FIG. 7A is performed by the tabular display window function 505, a more detailed structure of the target database (fields forming each table, relations between fields, etc.). ), The user double-clicks the target table on the window 260. Then, the window 260 is closed, and the graphic display function 506 sets a graphic representing a more detailed structure of the database including the double-clicked table (database separated by the database separation processing 280) as a target database. The figure is created and the graphic format display function 50
6 child window is displayed in the client area. This is what is shown in the window 270 of FIG.

The graphic format display window function 506 will be described in detail below. First, various tables and data used in the processing of the graphic display window function 506 will be described.

Graphic format display window function 50
The table and data used in 6 are the table / field attribute table 340 shown in FIGS. 8 and 9, the table management table-B 380 shown in FIG. 11, the decision rule table 460, and the membership function defined in advance. 470.

The decision rule table 460 and the membership function 470, which have not been described yet, will be described below.

The decision rule table 4 is shown in FIGS.
The structure of 60 is shown.

This table is composed of a window size determination rule table and a table display style determination rule table.

FIG. 25 shows the structure of the window size determination rule table.

In this table, according to FIG.
The total number of a plurality of rules used for determining the window size and the entry line No. indicating the position of the rule list-A shown in FIG. 16B are held, and the rule list-A shown in FIG. Holds the type of label used in the rule antecedent part and consequent part of each rule. There is one condition (Difference-A) in the antecedent part of the rule and one (Reset) in the consequent part of the rule, and fields are provided corresponding to these conditions.

FIG. 26 is a table display style determination rule
It shows the structure of the table.

In this table, the total number of a plurality of rules used for determination and the entry line No. indicating the position of the rule list-B shown in FIG. Then, the type of label used in the rule antecedent part and consequent part of each rule is held by the rule list-B of FIG. There are two conditions (Difference-B, Visibility) in the antecedent part of the rule and one (Style) in the consequent part of the rule, and fields are provided corresponding to these conditions.

27 to 31 show the membership function 47.
The structure of the data which defines 0 is shown.

The membership function 470 is
It consists of a membership function of each label used in the size determination rule and a membership function of each label used in the table display style determination rule.

27 and 28 show the structure of data defining membership functions of various labels used in the window size determination rule.

FIG. 27 shows a data structure that defines the grade values of various labels used in the rule antecedent part, and FIG. 28 defines the grade values of various labels used in the rule antecedent part.

That is, with the configuration of FIG. 27A, the total number of possible integer values of the variable Difference-A, and the entry line N indicating the position of the grade value list-A shown in FIG.
By holding o. and holding the grade value of each label (NB, ZR, PB) for each integer value in the grade value list-A of FIG. It defines the grade value of each label used in the rule antecedent part.

Also, in FIG. 28A, the total number (= 2) of integer values (0, 1) that the variable Reset can take, and the entry line indicating the position of the grade value list-B shown in FIG. 28B. No. is held and the grade value of each label (NO, YES) is held for each integer value in the grade value list-B of FIG. It defines the grade value of each label used in the subject part.

29 to 31 show the structure of data defining membership functions of various labels used in the table display style determination rule.

29 and 30 are data defining the grade values of various labels used in the rule antecedent part, and FIG. 31 is data defining grade values of various labels used in the rule antecedent part.

That is, in FIG. 29A, the variable Differe
nce-B holds the total number of integer values that can be taken and the entry line No. indicating the position of the grade value list-C shown in FIG. By holding the grade value of each label (NB, ZR, PB) for each integer value by dividing the field for each label type, the variable Difference-
The grade value of each label of B is defined.

Also, in FIG. 30A, the variable Visibility
, The total number of small sections obtained by dividing the range of possible values by a certain size, the grade value list shown in FIG.
The entry line No. indicating the position of -D is held, and FIG.
By holding the grade values of various labels (ANY, PS, PM, PB) for each of the above small sections in the grade value list-D of
Defines the grade value of each label for ibility.

Further, in FIG. 31A, the total number (= 3) of integer values (0, 1, 2) that the variable Style can take and the position of the grade value list-E shown in FIG. 31B are shown. Entry line N
O. is retained, and various labels (NON, HALF, FU) are assigned to each of the above integer values in the grade value list-E of FIG.
By storing the grade value of (LL) in each field for each label type, the grade value of each label used in the consequent part of the rule is defined.

The table membership function used by the graphic format display window function 506 for processing has been described above.

The construction and operation of the graphic display window function 506 will be described below.

FIG. 32 shows the configuration of each processing performed by the graphic format display window function 506.

As shown, the graphical display window function 506 is: Window size determination processing 39
0, fixed field ordering process 400, fixed field setting process 410, table display style determination process 420,
The table display position determination process 430, the graphic display window function 440, and the overall control 450 for controlling the activation of these are performed.

The overall control 450 controls activation and execution of other processes. That is, when the graphic format display window function 440 is activated, as shown in FIG.
In step 10, the window size determination process 390 is activated to determine the window size, and in step 20,
The total number of tables included in the target database is determined from the table management table B380. If the total number of tables is two or more, in step 30, all tables are
If the fixed fields are ordered such that the number of crossing arrows is minimized and the total number of tables is one, step 4
If 0, the fixed field is set in the target table in which the total number of fixed fields = 0, if not changed. Then, in step 50, the table display style determination processing 420
To determine the display format of the table, and step 60
In step 70, the table display position determination processing 430 is started to determine the display position of the table, and in step 70, the database structure graphic format display unit 440 is started to display the processing result in the graphic format.

Details of each process will be described below.

First, window size determination processing 390
Will be described.

In this process, as shown in FIG.
When a table is shown as a rectangle and the field name of the field of the table is described line by line in the rectangle (in the figure, a rectangle separated by a broken line corresponds to one line), −
The standard size of the rectangle that represents the bull is determined as the window size.

This processing is performed by the window size W _max (fixed field of the table of the processing target database) previously described in the database list of the table management table B380 in FIG. 11 (b in the drawing). Whether or not the maximum value of the number) is appropriate is determined by referring to the information of the table / field attribute table 340 of FIGS. 8 and 9, and if it is appropriate, it is not reset,
If it is incorrect, reset it.

When not reset, W = W _max remains, but when reset, W = W _opt (W _opt : proper size of window appropriately given from outside).

To determine whether to reset or not, the following fuzzy rule is used according to the membership function shown in FIG.

If Difference-A = NB Then Reset = NO …………………… (1) if Difference-A = ZR Then Reset = NO …………………… (2) if Difference-A = PB Then Reset = YES ………………………… (3) Where, Difference-A: The proper size of the window,
1 Te - the difference between the maximum value of the fixed number of fields included in the table _{(= W opt -W max),} Reset: reset (NO / YES), NB: the large negative (N egative B ig), ZR : approximately zero (Z e R o), PB : positive atmospheric (P ositive B ig), nO : not reset, YES: it resets.

The meanings of the above rules (1) to (3) are as follows:
It is as follows.

Rule (1): If the difference between the proper size of the window and the maximum value of the fixed field number is negative and large, the window size is not reset.

Rule (2): If the difference between the proper size of the window and the maximum number of fixed fields is almost zero,
Do not reset window size.

Rule (3): If the difference between the proper size of the window and the maximum value of the fixed fields is positive and large, the window size is reset.

FIG. 34 shows a state of inference based on the above rule. The degree of conformity with the condition of the antecedent part of rule (1) obtained according to the grade value list-A of FIG. 27 is g ₁ . Then, as the grade value of Do not reset according to rule (1) ,. From FIG. 28, {g ₁ , 0.0} is obtained. The same applies to rules (2) and (3),
{G ₂ , 0.0} (rule 2), {0.0, g ₃ } (rule 3)
Conclude that Finally, the above three inference results are integrated by a fuzzy logical sum (max) operation. The results are shown in the lowermost row of the rightmost column in FIG. 34.

Then, a larger one of the obtained grade values of resetting and not resetting is adopted and it is determined whether or not to reset. If the grade values are the same, do not reset.

Then, when it is decided to reset the window size by the above, the table management table
-B380 database list-B (Fig. 11 (b))
Reset the "Window size" field of to the proper size for the window.

Next, the fixed field ordering process 400 is performed.
Will be described.

As described above, this processing is executed when the total number of tables included in the target database is 2 or more.

In this processing, for all the tables of the target database, the fixed fields are ordered in the order of the layers shown in the table management table B380 and the in-layer table order.

FIG. 35 shows the processing for ordering the fixed fields of Table-2 (thick frame).

FIG. 35 (b) shows the database shown in FIG. 35 (a) in which only the table having a relation with Table-2 and the relation are left, and the others are excluded from the target. ) Is the table-2
Each fixed field shows which table and relation each related field has.

As shown in (c) of the same figure, even if the layer classification and the intra-layer ordering of the table described above are performed, when the relation between fields is displayed, generally the arrows indicating the relation intersect. . Therefore, in this processing, the order of the fields is changed as shown in FIG.

In the field ordering process in this table, ordering of fixed fields is performed in the table so that the number of intersecting arrows is minimized.

The problem of field ordering in the table is a problem of combinatorial optimization, and the branch and bound method is applied to find the optimum solution.

An outline of the lower bound calculation method in fixed field ordering is shown in FIG.

FIG. 16A is a matrix corresponding to a subproblem in which the field to be placed at the top in table-2 is determined as field-1, and the order of the other fields is not determined. However, regarding the table 2 to be processed, the relation with other tables is also shown for each fixed field. With respect to the fixed field, the meaning of the black element and the white element is the same as that of each matrix described above. However, here, as a relation between the field A and the table B, the field A and the table are connected.
The relation with the field belonging to Bull B is used.

Such a matrix has the tables shown in FIGS.
It is created by referring to the information of the table / table attribute table and the table management table B380 in FIG.

The number of crossing arrows in this subproblem means that the black matrix element in the two types of matrix elements (solid and sparse) hatched in FIG. It is determined whether or not the existing element intersects with other elements, and the elements determined to intersect are aggregated.

Further, in FIG. 36 (a), the four solid hatched portions (R ₁ , R ₂ , R ₃ , R ₄ )
Determination method figure of crossover in R ₁ and R ₂ of (b), as shown in (c), the R ₁ and R _2, upper right or lower left (FIG black elements to be determined crossover ( When there is a black element in the (bold frame) portion of b), it intersects. Further, when it does not exist, R ₃ or R ₄ (R ₁ is R ₃
However, when there is a black element in the upper right or lower left (bold frame in FIG. 5C) of the corresponding element of R ₂ and R ₄ , the black element crosses, and when it does not exist, it does not cross.

The remaining R ₃ and R ₄ in FIG.
The method of determining the crossover in is similar to the above.

That is, in R ₃ and R ₄ , when there is a black element in the upper right or lower left portion (thick frame in FIG. 7C) of the black element to be crossed, when it is crossed and there is no black element, R _1, R ₂ (in R ₃ R ₁ is the R ₄ R ₂ are each supported) corresponding black elements in the upper right or portion (the thick frame in FIG (b)) the lower left elements are present When they cross, when they do not exist, they do not cross.

In addition, in FIG. 36A, four parts (R ′ ₁ , R ′ ₂ ,
Of the R ′ ₃ and R ′ ₄ ), the method of determining the crossover at R ′ ₁ and R ′ ₂ is shown in FIGS.

[0255] In R _'1 and R' _2, the upper right portion of the black element to be determined crossover, the lower right portion, a portion field order is not fixed among the upper left, the field order of the bottom left not determined It is determined whether or not the black element exists in both the part and the confirmed part (the thick frame in FIG. 7D).

For example, when there is a black element in the lower left portion of the black element to be cross-judged for which the field order is fixed, the table is always crossed regardless of how the table is ordered. To do.

Further, even when the black element does not exist in the above-mentioned part, when the black element exists in any of the remaining four parts, or when any one part is left and the remaining three parts remain , When all black elements are present, they are always crossed, so it is determined to cross.

Similarly, among the remaining four parts, cross judgment is performed according to a predetermined predetermined cross judgment condition for each of the case where there are two black elements, the case where there is one black element, and the case where there is no black element.

If it is not determined that the tables are always crossed no matter how the tables are ordered,
_{R '3, R' 4 (} ' the ₁ R' R ₃ is R 'in the ₂ R' ₄ is,
In the upper right of the corresponding element of (corresponding to each), both the part where the field order is fixed and the part where it is not fixed, the lower right part, the part where the field order is not fixed in the upper left, the lower left part (the same). It is determined whether or not a black element exists in the thick frame (e).

For example, when there is a black element in the part of the upper right of the black element to be cross-judged for which the field order is fixed, the table is always crossed, no matter how the table is ordered. To do.

Further, even when there is no black element in the above portion, when there is a black element in any of the remaining four portions, or when any one portion is left and the remaining three portions are When all black elements are present, they are always crossed, so it is determined to cross.

Similarly, of the remaining four parts, when there are two parts where black elements are present, when there is one black part, and when there are no black parts, a crossing judgment condition is defined so as to always cross, and according to this, judge.

[0263] in FIG. 36 (a), the even determination method of crossover in the remaining R _'3 and R' _4, is as defined above.

[0264] That is, in the R _'3 and R _4', both of the portion not fixed with the portion where the field order of the top right of the black component to be determined crossover has been determined, the lower right portion, of the upper left It is determined whether or not a black element exists in the part where the field order is not fixed and the lower left part (bold frame in FIG. 7E).

For example, when there is a black element in the part of the upper right of the black element to be cross-judged for which the field order is fixed, the table is always crossed regardless of how the table is ordered. To do.

Further, even when there is no black element in the above portion, when there is a black element in any of the remaining four portions, or when any one portion is left and the remaining three portions are When all black elements are present, they are always crossed, so it is determined to cross.

Similarly, among the remaining four parts, when there are two parts where the black element exists, when there is one black part, and when there is no black part, the judgment is made according to the predetermined crossing judgment condition.

[0268] Further, even when ordered what the table, when it is not determined always intersect, and further, 'the ₃ R' corresponding _{R '1, R' 2 (} R 1 is, R _'4 R '
₂ corresponds to each), and the upper right part, the lower right part, the upper left part of the corresponding element where the field order is not fixed, and the lower left part where the field order is not fixed It is determined whether or not a black element exists in both of the parts (thick frame in FIG. 7D).

For example, when a black element exists in the lower left portion of the black element to be cross-judged for which the field order is fixed, the table is always crossed regardless of how the table is ordered. To do.

Further, even when there is no black element in the above portion, when there is a black element in any of the remaining four portions, or when any one portion is left and the remaining three portions are When all black elements are present, they are always crossed, so it is determined to cross.

Similarly, among the remaining four portions, when there are two portions where the black element exists, when there is one black element, and when there is no black element, determination is made according to a predetermined crossing determination condition.

However, whether or not the crossover determination is performed up to this level may be arbitrary. Even if the crossing determination is not performed up to this level, it is possible to obtain a display with less crossing than the conventional display by the display by the graphic display function described later.

Next, the process of searching the field order by the branch and bound method using such crossover judgment and lower bound judgment is shown in FIG.
It becomes like 7.

First, three types (fields-1, 2, 3) can be considered depending on which of the top fields is set.
Each is listed along with its lower bounds. Examine the lower bounds of the three subproblems listed above. Two of the best lower bounds are Fields-2 and 3. If there are a plurality of depths, if the depths are the same, the one listed first has priority, so field-2 is branched. Depending on which of the following is selected when the first field is field-2,
There are two types (Field-1, Field-3). Each is listed along with its lower bounds. Examine the lower bounds of the two subproblems listed and the remaining subproblems above. The ones that give the best lower bounds are field-2 → 3 and field-3. Field-2 → 3 is selected with priority on depth. Finally, the field order of field-2 → 3 → 1 is obtained.

By the above processing, the fields shown in FIG. 35 (c) are ordered as shown in FIG. 35 (d).

In the fixed field ordering process 400, the fixed fields of the respective tables are thus ordered, and the field numbers of the fixed fields of the fixed fields are assigned according to the order. Is described in the field order list-B (FIG. 8 (e)) of the table attribute table of FIG.

Next, the fixed field setting processing 390 will be described.

As described above, this processing is executed when the total number of tables in the database is 1, and the fixed field number _F'fix of the table having no fixed field is
Set by the following.

F ′ _fix = min (W, F _total ) …………………………………… (4) where F ′ _{fix is} the fixed number of fields in the target _table , W : Window after window size determination processing 390
Size, F _total : Total number of fields in the target table (all are floating fields). If there are remaining floating fields, ie F _total −F ′ _fix > 0, then they are all floating fields.

Then, the fixed field setting process 390 is executed.
In accordance with the result of such processing, "fixed field total number", "floating field total number", fixed field, and floating field in the table list (FIG. 8B) of the table attribute table of FIG. Update the "Field Order List-Entry Row No. A to A" field for. In addition, the field numbers of the floating fields corresponding to the total number of fixed fields. From the "field order list-A (Fig. 8 (d)) for the floating field" to the "field order list-A (Fig. 8 (d)) for the fixed field".
Go to

Next, the table display style determination processing 420 will be described.

In this processing, the display style is determined for all the tables in the target database.

In the window of the graphic display shown in FIG. 7B, the field names of fixed fields are all displayed, but the field names of floating fields are non-display (NON) and half-display (HALF). , All display (FULL)
It is displayed in one of the three display formats. This processing determines the display mode of this floating field.

First, FIG. 38 shows these display formats.

FIG. 28A shows an example in which the floating field is not displayed. The left is the normal display style, and the hatched area is the fixed field. Although there is a floating field, a symbol (▼) indicating that it is not displayed is displayed at the end. Then, when this is clicked, a part of the floating field is displayed as shown on the right (and other floating fields can be referred to by scrolling). Then, at the end thereof, a symbol (▲) is displayed for an instruction when closing this. When this is clicked, it returns to the normal display style on the left.

Further, FIG. 16B shows an example of floating field half display. The left is the normal display style. Half of the floating field is displayed following the fixed field, and the other half is displayed with a symbol (▼) indicating that it is not displayed. If it is clicked, it will continue to display the remaining half floating fields as shown on the right.
Then, at the end thereof, a symbol (▲) is displayed for an instruction when closing this. When this is clicked, it returns to the normal display style on the left.

Further, FIG. 14C shows an example of full floating field display. Display all floating fields, followed by fixed fields.

In this display style determination processing, a fuzzy rule is used to determine which of the above three types of display styles is appropriate for the table having a floating field. To do. The rules used for the determination are the following five according to the data in FIG.

If Difference-B = NB and Visibility = ANY Then Style = FULL ... (5) if Difference-B = ZR and Visibility = ANY Then Style = FULL ... (6) if Difference-B = PB and Visibility = PS Then Style = NON ... (7) if Difference-B = PB and Visibility = PM Then Style = HALF ... (8) if Difference-B = PB and Visibility = PB Then Style = FULL ... (9) Where Difference-B : Difference between the total number of fields in the table and the window size (= F _total -W), Visibility: ratio of floating fields that can be displayed in the window to the whole (= min (F _float , ( _{WF
fix)) / F float),} Style: Display Style (NON / HALF / FULL), NB: Negative large (N egative B ig), ZR : almost zero (Z e R o), PS : small positive (P ositive S mall), PM: medium positive (P ositive M edium), PB : a positive large (P ositive B ig), aNY : any (aNY), nON: non-display, hALF: half display, fULL: more Is.

No floating field (F _float = 0)
The table is excluded.

The meanings of the rules (5) to (9) are as follows.

Rule (5): If the difference between the total number of fields and the window size is negative and large, all the fields are displayed regardless of the ratio of the floating fields that can be displayed in the window.

Rule (6): If the difference between the total number of fields and the window size is almost zero, regardless of the ratio of floating fields that can be displayed in the window to the whole,
Display all.

Rule (7): If the difference between the total number of fields and the window size is positive and large and the ratio of the floating fields that can be displayed in the window to the whole is positive and small, it is not displayed.

Rule (8): If the difference between the total number of fields and the window size is positive and large and the ratio of floating fields that can be displayed in the window to the total is positive and medium, the display is half.

Rule (9): If the difference between the total number of fields and the window size is positive and large, and the ratio of the floating fields that can be displayed in the window to the total is positive and large, then all are displayed.

FIG. 39 shows a state of inference according to the above rule. The degrees of conformity to the two conditions of the antecedent part of the rule (5) are obtained according to FIGS. 29 and 30, and these are defined as g ′ ₁₁ and g ′ ₁₂ .
Because two conditions are combined with "and" employs the smaller of these out (referred to as g _'1), FIG. 3
1 obtains {0.0, 0.0, g ′ ₁ } as the grade value of non-display, half-display, and full-display according to the rule (5). Rules (6) to (9) are processed in the same manner,
_{{0.0,0.0, g '2},} {g' 3, 0.0,0.0}, {0.0,
g conclude that _{'4, 0.0}, {0.0,0.0} , g' 5}.

Finally, the above five inference results are integrated by fuzzy logical sum (max) operation. The results are shown in the lowermost row of the rightmost column in FIG.

The grade value thus obtained for each display style is described in the "display style grade value" field of the table list (FIG. 8B) of the table attribute table. Then, the display format is determined based on the grade value obtained above. Select one of the three display formats with the maximum grade value. When there are a plurality of display styles having the maximum grade value, the display priority is set in the order of full display, half display, and non-display, and the display style having the highest priority is selected.

The selected display style is described in the "table display style" field of the table list (FIG. 8B) of the table attribute table.

Also, this table display style determination processing 420
Then, calculate the number of floating fields to be displayed according to the display style described in the "Table display style" field.
(When the display format is full display, the number of display fields = total number of floating fields; when half-displayed, the number of display fields = (total number of floating fields + 1) / 2; when not displayed, the number of display fields = 0). Then, the calculation result is described in the "floating field display field number" field of the table list (FIG. 8B) of the table attribute table.

Next, the table display position determination processing section 430 is executed.
Will be described.

In this processing, first, the size of the area required for arranging all the tables is set to the table management table-B.
380, referring to the table attribute table of FIG.
Calculate as follows.

Layout area horizontal size = total number of layers × horizontal size of layer ……………………………… (10) Layout area vertical size = maximum number of tables in layer × maximum vertical size of table ……………… (11) where “Lateral size of layer” in formula (10) is an appropriate lateral size per layer given from the outside, and “vertical size of table” in formula (11) is (Fixed number of fields +
Floating field number of display fields) x vertical size per field.

If an area of the size shown in FIG. 40 (a) is obtained as a result of the above, this size is used as the database list-B of the table management table-B380 (see FIG. 11).
It is described in the "placement area size" field of (b)).

Subsequently, the position when arranging each table in the above area is determined. That is, first, the area in which each layer is arranged is obtained by dividing the area of FIG. 40 (a) into the number of layers in the horizontal direction, and the area of each layer is vertically divided by the number of tables included in the layer. Areas for arranging each table are determined by dividing the area into parts (FIGS. 40 (b) and (c)), and the tables corresponding to the areas are arranged by vertically and horizontally centering on each area (FIG. 40 (d)). ) Determines the position where each table is arranged. The table corresponding to the area is a table belonging to the layer corresponding to the area, and the table shown in FIG.
The order on the table order list-B shown in (d) is the same as the vertical order of the area.

The table position determined here is described in the "table display position" field of the table list (FIG. 8B) of the table attribute table.

Finally, the database structure graphic format display 440 will be described.

This processing is carried out in the table management table B3.
80, table / field attribute table 3 in FIGS.
40, the database structure diagram of the target database shown in FIG. 7B is displayed in a graphic format.

At this point in time, various data necessary for display (display position of each table, size, fixed / floating field, inter-field relation, availability of relation display, etc.) are all stored in the tables 340, 380.

In this processing, the display of the table is arranged at the position designated by the table display position of the table list in FIG. The table display shows the table name, and the fixed field field of the table is displayed below the table name.
The field names are displayed in the order in accordance with the field order list B in FIG. 8E, and below that, the number of floating field display fields of the table in FIG. 9 is displayed. This is done by displaying the field names of the floating fields in the order according to the field order list B of FIG. 8 (e). Further, as described above, a symbol (▼) is displayed at the end if necessary.

Further, in this processing, the relation between the fields shown in the field attribute table of FIG. 9 is further connected by connecting the field names of the fields having the relation with each other. indicate. This arrow is displayed according to the one-to-one correspondence and the one-to-many correspondence as described above.

However, as described above, in the display of the relation, only the adjacent layers are indicated by complete arrows by referring to the "relation display enable / disable flag" field (FIG. 9C) of the field attribute table. Display the rest and display only the arrow head and the arrow tail.

By the above processing, the display shown in the window 270 of FIG. 7B is realized.

Since this display is a simple structural diagram in which the structure of the structure is reduced and there is little backflow or crossing of the arrows due to the processes described above, the user can easily grasp the structure of the target database, Based on this, it is possible to efficiently carry out database-related work and the like.

The above is the description of the embodiments of the present invention.

As described above, according to this embodiment,
The structure display of the database is divided into a table format and a graphic format. First, in a table format, the outline structure is grasped broadly, and then, if necessary, a graphic format display is used to grasp the detailed structure. Therefore, there is an effect that the structure of the database can be grasped step by step from the outline to the details. Further, since the arrangement order of the tables and fields in which there is little relation backflow and crossover of relations is found, it is possible to easily grasp the structure without being confused by these backflows and crossovers. In addition, since a well-balanced structural diagram (the number of display fields in each table is almost constant) is created and displayed, a comfortable operating environment that appeals to the beauty can be provided. Further, since the types of display styles of the floating field are limited to the minimum required three types of full display / half display / non-display, there is no frame-out display other than these, which is convenient.

[0318]

As described above, according to the present invention, it is possible to display the structure of the relational database that is easier for the user to understand.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of an information network. .

FIG. 2 is a block diagram showing a hardware configuration of a client machine and a server machine.

FIG. 3 is a block diagram showing a software configuration of a client machine.

FIG. 4 is a diagram showing a processing procedure of a main function and a window function.

FIG. 5 is a block diagram showing a configuration of a relational database system according to an embodiment of the present invention.

FIG. 6 is a diagram showing a display example performed by relational database software according to an embodiment of the present invention.

FIG. 7 is a diagram showing an example of a database structure display performed in an embodiment of the present invention.

FIG. 8 is a diagram showing a configuration of a table attribute table used in the embodiment of the present invention.

FIG. 9 is a diagram showing a configuration of a field attribute table used in the embodiment of the present invention.

FIG. 10 is a diagram showing a configuration of a table management table-A used in the embodiment of the present invention.

FIG. 11 is a diagram showing a configuration of a table management table-B used in the embodiment of the present invention.

FIG. 12 is a diagram showing a configuration of a table order table used in the embodiment of the present invention.

FIG. 13 is a diagram showing a configuration of a layer-based table management table used in an embodiment of the present invention.

FIG. 14 is a block diagram showing processing relationships performed by a tabular display window function according to an embodiment of the present invention.

FIG. 15 is a diagram showing a processing procedure performed in overall control of a tabular display according to an embodiment of the present invention.

FIG. 16 is a diagram showing an outline of database separation processing performed in the embodiment of the present invention.

FIG. 17 is a diagram showing a procedure of database separation processing performed in the embodiment of the present invention.

FIG. 18 is a diagram showing a procedure for synthesizing matrix elements of a plurality of tables in the database separation processing performed in the embodiment of the present invention.

FIG. 19 is a diagram showing an outline of processing of database structuring (table ordering, table layer classification, in-layer table ordering) performed in the embodiment of the present invention.

FIG. 20 is a diagram showing an outline of lower bound calculation in table ordering (applying the branch and bound method) performed in the example of the present invention.

FIG. 21 is a diagram showing a process of searching for an optimal solution in table ordering (using the branch and bound method) performed in the example of the present invention.

FIG. 22 is a diagram showing a processing procedure of table layer classification performed in the embodiment of the present invention.

FIG. 23 is a diagram showing an outline of a lower bound calculation method in the intra-layer table ordering (using the branch and bound method) performed in the example of the present invention.

FIG. 24 is a diagram showing a process of searching for an optimum solution in the intra-layer table ordering (using the branch and bound method) performed in the example of the present invention.

FIG. 25 is a diagram showing a configuration of a first decision rule table (window size decision rule table) used in an embodiment of the present invention.

FIG. 26 is a diagram showing a configuration of a second decision rule table (table display style decision rule table) used in an example of the present invention.

FIG. 27 is a diagram showing a configuration of data defining a membership function of a label used in the antecedent part of the window size determination rule used in the embodiment of the present invention.

FIG. 28 is a diagram showing a structure of data defining a membership function of a label used in a consequent part of a window size determination rule used in the embodiment of the present invention.

FIG. 29 is a diagram showing a configuration of data defining a membership function of a label used in the first antecedent part (Difference-B) of the table display style determination rule used in the example of the present invention. .

FIG. 30 is a diagram showing a configuration of data defining a membership function of a label used in the second antecedent part (Visibility) of the table display style determination rule used in the example of the present invention.

FIG. 31 is a diagram showing a structure of data defining a membership function of a label used in a consequent part of a table display style determination rule used in an example of the present invention.

FIG. 32 is a block diagram showing the relationship of each processing performed by the graphic format display window function according to the embodiment of the present invention.

FIG. 33 is a diagram showing a processing procedure performed by the overall graphic format display control according to the embodiment of the present invention.

FIG. 34 is a diagram showing a procedure for determining whether or not window size can be reset (not reset) by using a fuzzy rule in the embodiment of the present invention.

FIG. 35 is a diagram showing an outline of a fixed field ordering process performed in the example of the present invention.

FIG. 36 is a diagram showing a procedure of lower bound calculation in fixed field ordering (using a branch and bound method) performed in an example of the present invention.

FIG. 37 is a diagram showing a process of searching for an optimum solution in fixed field ordering (using a branch and bound method) performed in an example of the present invention.

FIG. 38 is a diagram showing display styles (three types of non-display / half-display / full-display) of floating fields performed in the embodiment of the present invention.

FIG. 39 shows a fuzzy display mode (non-display / half-display / full-display) of a floating field performed in the embodiment of the present invention.
It is the figure which showed the procedure which determines using a rule.

FIG. 40 is a diagram showing an outline of table display position determination performed in the embodiment of the present invention.

[Explanation of symbols]

10 ... server machine, 20 ... relational database, 30 ... LAN (L ocal A rea N etwork: Local Area Network), 40 ... client device, 5
0 ... CPU (C entral P rocessing U nit: central processing unit), 60 ... main memory, 70 ... hard disk, 80 ...
Flexible disk, 90 ... Printer, 100 ... Keyboard, 110 ... Mouse, 120 ... Display, 13
0 ... LAN (L ocal A rea N etwork) board, 140
… Bus, 150… Operating system, 160
... AP (A pplication P rogram: application program),
170 ... Main function, 180 ... Parent window function, 19
0 ... Child window function, 280 ... Database separation processing, 290 ... Table ordering processing, 300 ... Table layer classification processing, 310 ... In-layer table ordering processing, 32
0 ... Database structure table format display section, 330 ... Table format display overall control section, 340 ... Table / field attribute table, 350 ... Table management table-A, 360 ... Table order table, 370 ... Layered table management table, 380 ... Table management table-B, 390 ... Window size determination processing, 400 ... Fixed field ordering processing, 410 ... Fixed field setting processing, 420 ...
Table display style determination processing, 430 ... Table display position determination processing, 440 database structure graphic format display section, 450 ... Graphic format display overall control section, 46
0 ... Decision rule table, 470 ... Membership function, 505 ... Tabular display window function, 505 ... Graphic display window function, 3000 ... Table creation process

Claims (11)

[Claims] 1. A method for displaying the structure of a relational database including a plurality of tables having fields that can have a relation with other fields, wherein the fields belong to each table. The relations between the tables of the relational database are analyzed according to the relations between the fields belonging to the analyzed tables, and the tables are analyzed. A table name that specifies the table name that specifies the relationship between the analyzed tables, a table name that specifies each table, and a field name that specifies each field, Characteristically, two types of display are selectively performed, that is, a display in which the structure of the relationship between the analyzed tables and the relation between the fields belonging to each analyzed table are recognizable. Structure of relational database How to display. 2. A method for displaying the structure of a relational database including a plurality of tables having fields capable of having relations with other fields, each of which is provided for each relational database. A table has a plurality of databases, and there is no relation between fields of tables belonging to different databases, and fields of other tables belonging to the same database. In each of the above cases, a table having a field that does not have a relation is separated so that there is no table, and for each separated database, the table name that identifies the table that belongs to that database is displayed. A method for displaying the structure of a characteristic relational database. 3. A method for displaying the structure of a relational database according to claim 2, wherein the relation is given directionality according to a predetermined rule, and an arbitrary table and another arbitrary table are given. -The same relation as the relation between the field of the arbitrary table and the field of the other arbitrary table is given to each of the separated databases, and For each table to which it belongs, i) the group of tables having no inflowing inflow is the first layer, and the relay is only from the layer before the nth layer (however, n is an integer of 2 or more). From the 1st layer to the nth
-1) by making the group of all the tables not belonging to the -1st layer the nth layer, or ii) making the group of the tables having no leaked relation the kth layer and the nth layer. From the final layer where the relation flows out only to the layer after the layer (where n is an integer less than k) from the last layer to the n + th layer.
A table name that classifies all the tables that do not belong to one layer into multiple layers by classifying them into multiple layers, and identifies the tables that belong to the database for each separated database. Is displayed for each classified layer, a method for displaying the structure of a relational database. 4. A method for displaying the structure of a relational database according to claim 2, wherein regions corresponding to respective layers are arranged in a predetermined direction in the order of the layers, and the regions corresponding to the respective layers belong to the layer. When the tables are arranged in order in a direction perpendicular to the predetermined direction and the tables having the relation between the tables are connected by a line segment, the crossing of the line segments is reduced. , Each table is ordered for each layer, and for each separated database, the table name that identifies the table belonging to the database is specified for each separated layer.
A method for displaying the structure of a relational database, characterized by displaying the layers in an ordered order. 5. A method for displaying the structure of a relational database according to claim 3 or 4, wherein each separated database has a number equal to or greater than the maximum number of tables belonging to a layer included in the database. A row is assigned, a column is assigned to each of the layers, and a table name of each table is exclusively selected from the rows assigned to the database to which the table belongs, A method of displaying the structure of a relational database, characterized by displaying a table represented in a column assigned to a layer to which the table belongs. 6. A method of displaying a structure of a relational database including a plurality of tables having fields capable of having relations with other fields, wherein the relation has a predetermined value. Direction is given according to the rule, and between any table and any other table, there is a relay between the field of the any table and the field of any other table. Area corresponding to each table belonging to the relational database is arranged, and each field belonging to the table is arranged in the area corresponding to each arranged table. , The arrangement of the areas corresponding to the respective tables and the areas corresponding to the respective tables so that the intersection of the line segments is reduced when the fields having the relation are connected by the line segments. Determine the placement of each field in The areas corresponding to the respective tables are arranged in accordance with the arrangement of the areas corresponding to the arranged tables, and the fields for specifying the respective fields belonging to the tables are arranged in the areas corresponding to the arranged tables. -A field name is displayed according to the determined field arrangement, and a line segment corresponding to the fields having the relation and connecting the displayed field names is displayed. -How to display the structure of the optional database. 7. A method for displaying the structure of a relational database including a plurality of tables having fields capable of having relations with other fields, each of which is provided for each relational database. A table has a plurality of databases, and there is no relation between fields of tables belonging to different databases, and fields of other tables belonging to the same database. In any of the above, separation is performed so that there is no table having a field having no relation, and the relation is given directionality according to a predetermined rule, and any table and any other The same relation as the relation between the field of the arbitrary table and the field of the other arbitrary table is given between the tables, and the relevant database is provided for each separated database. To For each table to which it belongs, i) the group of the tables having no inflowing inflow is the first layer, and the relay is only from the layer before the nth layer (where n is an integer of 2 or more). From the 1st layer to the nth
-1) by making the group of all the tables not belonging to the -1st layer the nth layer, or ii) making the group of the tables having no leaked relation the kth layer and the nth layer. From the final layer where the relation flows out only to the layer after the layer (where n is an integer less than k) from the last layer to the n +
By classifying all the tables that do not belong to one layer as the nth layer, the layers are classified into a plurality of layers, and the regions corresponding to the classified layers are arranged in a predetermined direction in the order of the layers, In the corresponding area, the tape belonging to the layer
When the areas corresponding to the tables are arranged in order in the direction perpendicular to the predetermined direction and the areas corresponding to the tables having the relation between the tables are connected by a line segment, In order to reduce the number of crossovers of each layer, each table is ordered for each layer, areas corresponding to each layer are arranged in a predetermined direction in the order of the layers, and areas corresponding to each layer correspond to the tables belonging to the layer. The areas are arranged in order according to the order ordered for each of the layers in a direction perpendicular to the predetermined direction, and each field belonging to the table is set in the area corresponding to each table as the predetermined direction. They are arranged in order in the vertical direction, and the relay
In order to reduce the crossover of line segments when connecting the fields with a certain segment with line segments, the fields are ordered for each table, and the regions corresponding to each layer are layered in a predetermined direction. In the order corresponding to each layer, the areas corresponding to the tables belonging to the layer are arranged in the order corresponding to each layer in the direction perpendicular to the predetermined direction, and the areas corresponding to the respective layers are arranged in order. The field names that specify the fields belonging to the table in the area corresponding to are sequentially arranged in the direction perpendicular to the predetermined direction, in the order according to the order arranged for each table. A method for displaying the structure of a relational database, which is characterized by displaying the line segment connecting the displayed field names corresponding to the fields having the relation. 8. A method for displaying the structure of a relational database according to claim 6, wherein the field is a field having a relation with another field, and another field having a relation. Fields that have no fields and relations, and other fields and fields that do not have relations are
A method for displaying the structure of a relational database characterized by selectively displaying. 9. A method for displaying the structure of a relational database according to claim 6, wherein said field is a field having a relation with another field, and another field having a relation. The fields are classified into fields with no fields and relations, and some of the field names of fields without other fields and relations are selectively displayed. How to display the relational database structure. 10. A relational database including a plurality of tables each having a field that can have a relation with another field, and data is registered in the table field of the relational database. Means, data retrieval from the relational database, means for analyzing relations between fields belonging to each table, and relations between fields belonging to each analyzed table. The means for analyzing the relation between each table of the relational database and the table name for identifying the display device and the table can be recognized according to the The display shown in, the table name that identifies each table, and the field name that identifies each field belong to each analyzed table and the structure of the relationship between the analyzed tables. I - relay between field - Deployment and recognizable representation was displayed, and two types of display selectively and characterized by having a means for performing on said display device relay - relational database system. 11. A relational database including a plurality of tables having a field that can have a relation with another field, and data is registered in the table field of the relational database. Means, a means for retrieving data from the relational database, a display device, and each table of the relational database to a plurality of databases and tables of different databases. Make sure that there is no relation between fields and that there is no table that has no relation with any of the other fields belonging to the same database. Means for separating and giving direction to the relation according to a predetermined rule, and between any table and any other table, the field of the table is arbitrary. The same relation as the relation between the field of the above-mentioned arbitrary table and the field of the other arbitrary table, and for each separated database, each table belonging to the database is i) the inflow relation A group of tables having no layer is defined as the first layer, and the relation from only the layer before the nth layer (where n is an integer of 2 or more) flows from the first layer to the nth layer.
-1) by making the group of all the tables not belonging to the -1st layer the nth layer, or ii) making the group of the tables having no leaked relation the kth layer and the nth layer. From the final layer where the relation flows out only to the layer after the layer (where n is an integer less than k) from the last layer to the n + th layer.
By setting the group of all the tables not belonging to one layer to the nth layer, the means for classifying into a plurality of layers and the areas corresponding to each classified layer are arranged in a predetermined direction in the order of the layers, In the area corresponding to each layer, the tape belonging to the layer
When the areas corresponding to the tables are arranged in order in the direction perpendicular to the predetermined direction and the areas corresponding to the tables having the relation between the tables are connected by a line segment, In order to reduce the crossover of each table, a means for ordering each table for each layer, and for each separated database, a number of rows that is equal to or greater than the maximum number of tables belonging to the layer included in the database is assigned. A column is assigned to each layer, and the table name of each table is selected from among the rows assigned to the database to which the table belongs, in the row selected according to the order ordered for each layer. Means for displaying on the display means a table represented in a column assigned to the layer to which the table belongs; means for accepting designation of a table name on the table displayed on the display device; -Bull name belongs to the above The areas corresponding to the respective layers of the database are arranged in a predetermined direction in the order of the layers, and the areas corresponding to the respective layers are arranged in the areas corresponding to the respective layers in the direction perpendicular to the predetermined direction. Arrange in order according to the order ordered for each,
In the area corresponding to each table, the fields belonging to the table are arranged in order in a direction perpendicular to the predetermined direction,
A means for ordering the fields of the database for each table so that the crossing of the line segments is reduced when the fields having the relation are connected by the line segments. The areas corresponding to the respective layers of the separated database to which the table name belongs are arranged in a predetermined direction in the order of the layers, and the areas corresponding to the respective layers in the areas corresponding to the respective layers are the predetermined areas. Are arranged in order according to the order ordered for each of the layers in the direction perpendicular to the direction,
The field names for specifying the fields belonging to the table in the area corresponding to each table are sequentially named in the direction perpendicular to the predetermined direction and in the order ordered for each table. And a means for displaying on the display device an image showing the line segments connecting the field names corresponding to the fields having the relations in the order in which they are followed. Optional database system.