JPH11219308A - Data management device by hypertext - Google Patents

Abstract

PROBLEM TO BE SOLVED: To display the representative value of data in the display format of a reference data type by allowing a hypertext converting means to define the representative value of data at a hyperlink destination and insert the representative value of the data into a hypertext. SOLUTION: The representative value of data at a hyperlink destination is defined and inserted into a hypertext converting means 2 in a hypertext and the means 2 converts an execution-time internal data structure into the hypertext and preserves the converted hypertext in a hypertext storage means 13a. A data structure restoring means 3 converts the prescribed hypertext into the execution-time internal data structure and a data generating means 4 generates necessary data in a execution-time internal data. Consequently, the representative value can be displayed in the display format of a reference data type.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] The present invention relates to a runtime internal data structure (database) in an arbitrary application.
For example, regarding data management to convert to a format that can be easily modified
More specifically, the present invention relates to a hypertext-based data management device that converts an internal data structure into hypertext, and can easily perform correction and the like using a general tool prepared for hypertext.

[0002]

BACKGROUND OF THE INVENTION Hypertext is text that can have structure and references to other text. The most famous hypertext is HTML (Hypertext Markup Language). This HT
ML is a document information system WWW on the Internet.
(World Wide Web). Further, by describing the display method on the hypertext, it is possible to provide an environment in which the text can be appropriately operated using the hypertext editing apparatus in an appropriate display method.

[0003] On the other hand, in the conventional means for storing and restoring an internal data structure at the time of execution using a text file, since the data is stored in a storage format for the purpose of restoration, it is extremely difficult to operate the data by modifying the stored text.

On the other hand, Japanese Patent Application No. 9-208898, which is an earlier application (prior application), is a method for realizing easy data manipulation by utilizing the characteristics of hypertext. Data such as data modification using a general-purpose hypertext editor can be specified by specifying a complex runtime internal data structure as a reference to other texts and specifying the output method for more characteristic data or special data. Operations can be performed.

FIG. 10 to FIG. 16 are explanatory diagrams of a conventional example of the prior application. Hereinafter, description will be made with reference to FIGS. (1): Description of an example of a runtime internal data structure FIG. 10 is an explanatory diagram of a conventional example of an internal data structure at runtime. FIG. 10 shows a specific example of a runtime internal data structure to be converted to hypertext. Here, it is assumed that data a is specified as output data by a pointer to a list type. The internal data structure in FIG. 10 has the following five data types.

Integer Type The integer type is basic type data, and the type name is INT. For integer type data, the value is output as a character string.

Character string type The character string type is basic type data, and the type name is STRIN.
G. String type data outputs its length and the contents of the string.

List Type The list type is a complex data type, and the type name is LIST. The attribute names of partial data are CAR and CDR.
There is one.

Pointers to List Types Pointers to list types are reference types. NULL type This is a special basic type of data indicating the end of the list. The type name is NULL. This is a basic type of data that has no value.

(2) Description of Conventional Display Example FIG. 11 is an explanatory diagram of a conventional display example after hypertext conversion. FIG. 11A illustrates a display example of data.html,
FIG. 11B illustrates a display example of data-b.html.
(C) explains the display example of data-c.html, and FIG.
This is an explanation of the display example of data-a.html.

FIG. 11A is a screen display example of data.html, which is a text name, and is displayed as “maindata”.
Is underlined, indicating that there is a link. Therefore, if this link part is clicked with the mouse, it jumps to data-a.html (FIG. 11D) (switches the page).

In FIG. 11B, a display example of data-b.html includes a composite data start character string “begin structure”.
”, Data attribute name“ CAR ”,“ INT ”indicating integer type data which is the type name of attribute name“ CAR ”, and its integer value“ 1 ”
0 ”, attribute name“ CDR ”, attribute name“ CDR ”type name“ NULL ”,
Data "NULL" indicating that no data exists, and a composite data end character string "end structure" are displayed.

In FIG. 11C, a display example of data-c.html includes a composite data start character string “begin structure”.
", Attribute name" CAR ", type name" STRIN "of attribute name" CAR "
G ”, string length (bytes)“ 3 ”and string content“ A
BC ", data type" CDR ", attribute name" CDR ", underlined data" CDR "indicating that there is a link, and composite data end character string" end structure ". Click on the "CDR" mouse with da
Jump to ta-a.html (see FIG. 11D).

In FIG. 11D, a display example of data-a.html includes a composite data start character string “begin structure”.
”, Data type“ CAR ”, attribute name“ CAR ”, underlined data“ CAR ”indicating that there is a link, attribute name“ CDR ”, underlined data“ CDR ”indicating that there is a link ”, Composite data end character string“ end structur
"e" is displayed. Clicking the data "CAR" with the mouse jumps to data-b.html (see Fig. 11 (b)), and clicking the data "CDR" with the mouse
Jump to data-c.html (see FIG. 11C).

(3): Description of Hypertext Conversion Processing FIG. 12 is a flowchart of a conventional hypertext conversion algorithm. In FIG. 12, a hypertext conversion algorithm is a conversion process from a run-time internal data structure executed by the hypertext conversion device to hypertext. In this algorithm, various data included in the runtime internal data structure is 3
Since the processing is performed after being classified into types, the classification will be described first.

The first type is the basic data type, which is a simple data type that has no special structure, such as integers, floats, decimals, characters, strings, and the like. The second type is an embedded composite data type as a data type existing in a form nested in certain structural data. The third type is
Reference data type. This is a data type indicating the storage location of other related data. After classifying all data into these three types of data, a hypertext corresponding to the data is generated. Hereinafter, description will be made in accordance with steps S71 to S83 of FIG.

S71: When the process is started, first, the data type is checked, and the process proceeds to step S72. S72: Check the classification of the data type. As a result of this examination, the process proceeds to step S73 if the data type is the first type of basic data type, and to step S76 if the data type is the embedded data type of the second type. Moves to step S77.

S73: The details of the data type, for example, whether the data type is an integer or a character string, are checked.
Move to 4. S74: A character string conversion subroutine corresponding to the detailed data type is called, and then the process proceeds to step S75. Although this character string conversion subroutine is not shown in the figure, for example, a character string is a very simple one such as "print the character string length and its contents, for example," ABC "."

S75: It is determined whether or not the processing for all data, that is, the processing for converting to hypertext has been completed. If the process of converting all data into hypertext has been completed, this process ends, and if not, the process returns to step S71.

S76: If the data type is the second type of embedded composite data type in step S72, a composite data output subroutine is called, and the processing of this subroutine is executed. See Figure 1 for this subroutine.
3 will be described. When the composite data output subroutine ends, the process moves to step S75.

S77: If the data type is the third type of reference data type in step S72, the hyperlink table is searched, and the process proceeds to step S78. This hyperlink table is a table in which, when a new hypertext is generated, a link to the hypertext is registered. For example, a pointer indicating at which address the hypertext data-a html generated for the data a is stored in the memory is stored corresponding to the hyperlink. This table is used for extracting a pointer indicating a memory location of data corresponding to the hyperlink using the hyperlink as a key.

S78: It is determined whether reference data has been registered. If it is determined that the reference data has been registered, the process proceeds to step S79. If the reference data has not been registered, the process proceeds to step S80.

S79: The hyperlink registered for the current hypertext is output, and step S79 is performed.
Go to 75. S80: If it is determined in step S78 that the reference data has not been registered, a new hypertext is generated, and the process proceeds to step S81.

S81: A link for the new hypertext is registered in the hyperlink table, and the process proceeds to step S82. S82: The hypertext conversion algorithm of FIG. 12 is called recursively, and when the processing of this hypertext conversion algorithm ends, the flow proceeds to step S83.

This recursive call processing is a general form of subroutine call used in C language and LISP language, and special processing is performed in the following order.

Work variables are pushed onto the stack. Secure a new work area exclusively for subroutines. Call a subroutine.

The work area dedicated to the subroutine is opened. Undo the working variables on the stack. continue processing.

By using such a recursive call, even if the same subroutine is called repeatedly in terms of algorithm, it is possible to execute processing without affecting the previous call.

S83: After the file of the newly generated hypertext (step S80) is closed, the process proceeds to step S75. (4): Description of composite data output subroutine FIG. 13 is a flowchart of a conventional composite data output subroutine. In FIG. 13, this subroutine
This is to output composite data as data composed of a collection of some partial data. Each of these partial data is given a name called an attribute name or a member name. Hereinafter, step S91 in FIG.
This will be described according to steps S96.

S91: When the processing is started, first, a composite data start character string is output, and the routine goes to Step S92. This composite data start character string is a character string that means the start of composite data.

S92: The type name of the data type of the entire composite data is output, and the routine goes to Step S93. The processing of steps S93 to S95 is repeated for each of the partial data constituting the composite data.

S93: The attribute name of the partial data is output, and the routine goes to step S94. S94: The hypertext conversion algorithm of FIG. 12 is called recursively, the output of the partial data to the hypertext is performed, and the process proceeds to step S95.

S95: It is determined whether or not all the partial data has been output. If all the partial data have been output in this determination, the process proceeds to step S96, and if not all the data has been output, the process returns to step S93.

S96: A composite data end character string as a character string signifying the end of the composite data is output, and this processing ends. (5): Description of Data Restoration Processing The algorithm of processing for reading hypertext converted into hypertext and stored in the hypertext storage device and restoring the corresponding runtime internal data structure will be described. This runtime internal data structure restoration processing is executed by the data structure restoration device and the data generation device.

FIG. 14 is a flowchart of a conventional data restoration algorithm. In FIG. 14, the data restoration algorithm is executed by the data structure restoration device.
This data structure restoration device has a hyperlink table and a type information table.

The data structure restoring device first secures a runtime data area for storing data restored as preprocessing, and sets the head thereof to a current restoration position pointer. Next, a character string is read in order from the beginning of the hypertext, and the processing of FIG. 14 is repeatedly performed on the read character string. Hereinafter, step S1 in FIG.
Description will be made in accordance with 01 to step S110.

S101: When the process is started, first, a character string is read, and the process proceeds to step S102. S102: The type of the character string is determined. In this determination, if the character string represents data of the basic data type, the flow proceeds to step S103. If the character string represents a composite data start character string, the flow proceeds to step S105, and a link to another hypertext is created. If so, the process moves to step S106.

S103: The details of the data type are checked, and the routine goes to step S104. S104: The basic data is restored, and the processing corresponding to this character string ends. S105: If it is determined in step S102 that the type of the character string is the composite data start character string, the composite data restoration subroutine described in FIG. 15 is recursively called, and after this processing is performed, The processing corresponding to the character string ends.

S106: If the type of the character string indicates a link to another hypertext in step S102, the hyperlink table is searched, and the process proceeds to step S107.

S107: It is determined whether or not the hyperlink has been registered. If it is determined that a hyperlink has been registered, the process proceeds to step S108. If the hyperlink has not been registered, the process proceeds to step S109.

S108: The pointer indicating the address of the data corresponding to the hyperlink, that is, the contents of the registered pointer are written in the runtime data area, and the processing corresponding to this character string ends.

S109: If it is determined in step S107 that the hyperlink has not been registered,
After the data generation algorithm described in (1) is recursively called and its processing is performed, the process proceeds to step S110.

S110: The pointer is written into the runtime data area, and the processing corresponding to the character string ends. The pointer written in step S110 is a pointer returned as a result of the data generation algorithm performed in step S109.

(6) Description of Composite Data Restoration Subroutine FIG. 15 is a flowchart of a conventional composite data restoration subroutine. In FIG. 15, the read start position of the hypertext and the value of the current restoration position pointer are passed as arguments to this subroutine. The composite data restoration subroutine executes a composite data restoration process based on information registered in the type information table. In the type information table, the size as the size of the data, the writing position of the data according to the attribute of the data, and the like are stored using the type name of the data as a key. Hereinafter, description will be made in accordance with steps S111 to S117 of FIG.

S111: When the process is started, first, a character string is read from the hypertext reading start position passed as an argument, a type name of the data is obtained, and the process proceeds to step S112.

S112: The type information table is searched, and the routine goes to step S113. Note that until the composite data end character string appears in accordance with the searched contents, step S11 is performed.
The processes from 3 to S117 are repeated.

S113: The attribute name of the partial data is extracted, and the routine goes to step S114. S114: It is determined whether or not the extracted attribute name is a composite data end character string. If it is determined that the character string is a composite data end character string, the process of this subroutine is terminated.

S115: Relative position information indicating the position where the data of the attribute name is written in the type information table is extracted, and the routine goes to Step S116. S116: The data restoration position is calculated from the relative position, this position is set as the value of the current restoration position pointer, and the routine goes to Step S117.

S117: After the data restoration algorithm of FIG. 14 is recursively called and the processing of the data restoration algorithm ends, the process returns to step S113. (7): Description of data generation algorithm FIG. 16 is a flowchart of a conventional data generation algorithm. In FIG. 16, this algorithm is the same as FIG.
4 is a data generation algorithm of step S109, which is executed by the data generation device.

A hyperlink as a character string whose type is determined in step S102 of FIG. 14 is passed to the data generating apparatus, and the position of a pointer indicating the position of data to be restored corresponding to the hyperlink Are created as new data (data necessary for restoring the data structure) not stored in the hypertext storage device. Hereinafter, step S12 in FIG.
A description will be given according to 1 to step S128.

S121: When the process is started, first, the file specified by the passed hyperlink is opened, and the process proceeds to step S122. S122: The composite data start character string is read, and the routine goes to Step S123.

S123: The data type name is read, and the routine goes to step S124. S124: The type information table is searched, the data size is obtained, and the routine goes to Step S125.

S125: A new data storage area having the size of the data size is secured in the memory for storing the internal data structure at the time of execution, and the routine goes to Step S126. S126: The passed hyperlink and the pointer indicating the start position of the new data storage area are registered in the hyperlink table, and the process proceeds to step S127.

S127: The current read position is returned to the beginning of the hypertext, and the flow shifts to step S128. S128: The data restoration algorithm of FIG. 14 is recursively called, and when the processing of this algorithm ends, the processing by the data generation algorithm ends.

The reason why the current reading position is returned to the beginning of the hypertext in step S127 is that the processing up to step S126 is different from the actual data output of securing the data storage area and registering it in the hyperlink table. After the data restoration algorithm of FIG. 14 is called in step S128, the first character string is determined to be the composite data start character string, and the process proceeds to step S128.
This is because the processing of the composite data restoration subroutine is executed at 105 and actual data output is performed.

[0056]

The above-mentioned prior art has the following problems. : In the display format of the reference data type, it was not possible to display a representative value from which the entire contents of the data could be grasped to some extent.

External processing other than data restoration processing could not be performed at the time of data restoration. : Inadvertent data change prevention, data protection, and version control were not possible.

: Data outside of storage could not be referenced. : Could not determine the type at the time of execution. The present invention solves such a conventional problem, can display a representative value in a display format of a reference data type, can perform external processing at the time of data restoration, can prevent inadvertent data change, and The purpose of the present invention is to enable protection of data, version number management, referencing of unsaved data, and furthermore, enable type discrimination at the time of execution.

[0059]

FIG. 1 is a diagram illustrating the principle of the present invention. In FIG. 1, reference numeral 1 denotes a runtime internal data structure storage unit, 2 denotes a hypertext conversion unit, 3 denotes a data structure restoration unit, 4 denotes a data generation unit, and 13a denotes a hypertext storage unit.

The present invention is configured as follows to solve the above-mentioned conventional problems. (1): Hypertext conversion means 2 for converting an internal data structure into hypertext at the time of execution, the hypertext conversion means 2 defines a representative value of data of a hyperlink destination and defines the data in the hypertext Is inserted.

(2) Hypertext conversion means 2 for converting the internal data structure at the time of execution into hypertext, hypertext storage means 13a for storing the converted hypertext, and internal data structure of the hypertext at the time of execution A data structure restoring means 3 for converting the data structure into data, and a data generating means 4 for generating data required in the runtime internal data structure when the data structure restoring means 3 performs a restoring operation. Is necessary, the hypertext conversion means 2
Arguments required only for the external processing are output as hypertext separately from the stored data, and the data structure restoring means 3 restores the arguments at the time of data restoration.

(3) Hypertext conversion means 2 for converting the internal data structure at the time of execution into hypertext, hypertext storage means 13a for storing the converted hypertext, and the internal data structure of the hypertext at the time of execution A data structure restoring means 3 for converting the data into a data structure, and a data generating means 4 for generating data required in the runtime internal data structure when the data structure restoring means 3 performs a restoring operation. Outputs the argument required for data validity verification or the argument required for external data search as hypertext and separately from the stored data.
When the data is restored, the argument is restored. (4): Hypertext conversion means 2 for converting a runtime internal data structure into hypertext is provided. The hypertext conversion means 2 stores how some or all data types of the runtime internal data structure are stored. If it has been provided or given in advance, the hypertext conversion processing for that data type is performed without the type determination processing of the internal data structure at the time of execution.

(5): The representative value of the data at the hyperlink destination is defined in the hypertext conversion means 2 for converting the internal data structure into hypertext at the time of execution, and the representative value of the data is inserted into the hypertext. A computer-readable recording medium storing a program for executing a procedure.

(Operation) The operation based on the above configuration will be described. Hypertext conversion means 2 for converting the internal data structure at the time of execution into hypertext defines a representative value of the data at the hyperlink destination and inserts the representative value of the data into the hypertext. For this reason, the contents of the entire data can be grasped to some extent based on the representative value of the data, and it is possible to easily refer to and operate the internal structure at runtime.

When external processing other than data restoration is required, the hypertext conversion means 2 for converting the internal data structure at execution into hypertext is used. The data structure restoring means 3 which separately outputs and converts the hypertext into an internal data structure at the time of execution restores the argument at the time of data restoration. For this reason, external processing other than data restoration processing can be executed without impairing data operability on hypertext.

Further, the hypertext conversion means 2 for converting the internal data structure into hypertext at the time of execution outputs an argument necessary for data validity verification or an argument required for external data retrieval as hypertext separately from the stored data. The data structure restoring means 3 for converting the hypertext into an internal data structure at the time of execution restores the argument at the time of data restoration. Therefore, the validity of the restored data can be guaranteed without impairing the data operability on the hypertext.

The hypertext conversion means 2 for converting the internal data structure at the time of execution into hypertext is given in advance how a part or all of the data type of the internal data structure at the time of execution is stored. In this case, the hypertext conversion process for the data type is performed without the type determination process of the internal data structure at the time of execution.
Therefore, even when the type determination at the time of execution is difficult or impossible, the internal data structure at the time of execution can be efficiently stored.

Further, a procedure for defining a representative value of data at a hyperlink destination and inserting the representative value of the data into the hypertext is provided to the hypertext converting means 2 for converting the internal data structure at the time of execution into hypertext. It is a computer-readable recording medium storing a program to be executed. Therefore, by installing the program of the recording medium into the computer, the contents of the entire data can be grasped to some extent by the representative value of the data, and the reference and operation of the internal structure at the time of execution can be easily realized. A data management device using hypertext can be provided.

[0069]

2 to 9 show an embodiment of the present invention. Hereinafter, embodiments of the present invention will be described with reference to the drawings. (1): Description of Device Configuration FIG. 2 is an explanatory diagram of a data management device using hypertext. In FIG. 2, the data management device based on hypertext targets a central processing unit (CPU) 11, a memory 12 on the CPU side, a hypertext storage device 13 as an external storage device such as a disk device, for example, hypertext. Hypertext display device 14, Hypertext editing device 15, as a commercially available device,
A hypertext transfer device 16 is provided.

In the memory 12 on the CPU side, a runtime internal data structure storage memory 21 for storing the runtime internal data structure of an arbitrary application together with the data, and a hypertext using the contents of the runtime internal data structure storage memory 21 are stored. Hypertext converter 2 for converting to text
2. A data structure restoring device 23 for restoring an internal data structure at the time of execution from a result of conversion into hypertext stored in the hypertext storage device 13, and data necessary for restoring the internal data structure by the data structure restoring device 23. A data-hypertext which stores a special process such as a data generating device 24 to be generated, a data output format and a method of selecting output data in a subroutine format, and gives it to the hypertext converting device 22 and the data structure restoring device 23. A conversion definition storage memory 25 is provided.

The hypertext converter 22 is a device that analyzes a runtime internal data structure to be converted and generates a hypertext corresponding to the data structure. That is, the hypertext converter 22 scans the internal data structure at the time of execution, analyzes the data, determines the output method, and outputs the internal data as hypertext. If the data of interest is intended to refer to other data, a new hypertext is generated, and a link to the hypertext is embedded in the hypertext to create a data reference relationship. Save.

The generated hypertext is stored in the hypertext storage device 13 and is displayed by the general-purpose hypertext display device 14. Also,
The hypertext editing device 15 can easily perform operations such as editing and modifying data in the stored hypertext. Furthermore, by using a general-purpose hypertext transfer device 16 to transfer hypertext as a representation of a runtime internal data structure to another system via a network such as the Internet, for example, Data structures can be shared.

The data structure restoring device 23 stores the hypertext stored in the hypertext storage device 13,
That is, it restores an internal data structure including data in an arbitrary application, reads character strings sequentially from the beginning of the hypertext stored in the hypertext storage device 13, and performs processing on the read character strings. By repeating this, the data structure is restored. When the data structure is restored, data required in the data structure is generated by the data generator 24, and the restored runtime internal data structure is stored in the runtime internal data structure storage memory 21 together with the data.

(2) Description of Hypertext Conversion of Data Representative Value The data representative value is a value by which the contents of the entire data can be grasped to some extent only by displaying the representative value. For example, by outputting a representative value as the name of a hyperlink, reference data can be confirmed without moving to another page.

FIG. 3 is an explanatory diagram of a display example using a representative value. FIG. 3 (a) illustrates a display example of reference data using no representative value, and FIG. 3 (b) shows a display example of reference data using a representative value. It is an explanation of a display example.

FIG. 3A is a display example of a display screen A and a display screen B. The display screen A includes a composite data start character string “begin structure”, a data type “USER”, and an attribute name “NAME”. , Attribute name "NAME", type name "STRING", character string length (bytes) "4", character string content "Taro", attribute name "HOBBY", underlined hyperlink "HO"
BBY "and the end character string" end structure "of the composite data.

The display screen B has a composite data start character string "begin structure", a data type "HOBBY", an attribute name "NAME", a type name "STRING" of the attribute name "NAME", and a character string length "8". "And the content of the character string" Movie Appreciation "and the composite data end character string" end structure "are displayed. In addition,
Here, only the movie viewing is displayed, but other hobbies such as photos and videos, the number of years of performing such hobbies, and the like can also be displayed.

FIG. 3A shows a case where reference data “hobby” is added to data “user” for the user. This corresponds to the conventional example of the present application. Here, the name (tag name) of the hyperlink to the reference data HOBBY on the display screen A is simply displayed as the attribute (attribute) name “HOBBY”.
Unless the character string "HOBBY" is clicked to move to another page (display screen B), the value (movie appreciation) for the attribute "HOBBY" of the runtime data structure "USER" could not be confirmed.

In FIG. 3B, the difference from FIG. 3A is that the name of the underlined hyperlink of the display screen A is not “HOBBY” but “Review Movie” which is a representative value. Therefore, the user's attributes can be confirmed without moving from the page where the user “USER” is output to another page (display screen B).

Description of Representative Value Output Means To output a representative value, a representative value output subroutine table is provided. The representative value output subroutine table is a table having a subroutine that returns a character string as a representative value using a type name as a key as a value. FIG. 4 is an explanatory diagram of the representative value output subroutine table.
In FIG. 4, the representative value output subroutine table includes:
The model name and subroutine are provided. In this example, “HOBBY” is registered as the model name, and “output attribute NAME” is registered as the subroutine.

Description of Hypertext Conversion Process for Outputting Representative Value In addition to the conventional hypertext conversion process (FIG. 12), a process of searching a representative value output subroutine table when outputting a hyperlink is added. is there. When a representative value output subroutine is found by this search, the representative value output subroutine is called using the reference data as an argument, and a hyperlink is output together with a return value (return value) as a processing result. Subsequent processing is the same as the conventional processing (FIG. 12).

FIG. 5 is a flowchart of the hypertext conversion algorithm. Hereinafter, steps S1 to S1 in FIG.
A description will be given according to step S17. S1: When the processing is started, the hypertext converter 22 first checks the data type, and proceeds to step S2.

S2: The hypertext converter 22
Examine the data type classification. As a result of this examination, the process proceeds to step S3 if the data type is the first type of basic data type, and to step S6 if the data type is the embedded data type of the second type. Is Step S
Move to 7.

S3: The hypertext converter 22
Check the details of the data type, for example, whether it is an integer or a character string, and then go to step S4. S4: The hypertext converter 22 calls a character string conversion subroutine corresponding to the detailed data type, and then proceeds to step S5.

S5: The hypertext converter 22
It is determined whether or not the processing for all data, that is, the conversion processing to the hypertext has been completed. If the process of converting all data into hypertext has been completed, the process is terminated; otherwise, the process returns to step S1.

S6: The hypertext converter 22
If the data type is the second type of embedded composite data type in step S2, a composite data output subroutine is called, and the processing of this subroutine is executed. This subroutine has been described with reference to FIG. When the composite data output subroutine ends, the process moves to step S5.

S7: The hypertext converter 22
If the data type is the third type of reference data type in step S2, the hyperlink table is searched,
Move to step S8. This hyperlink table is
This is a table in which, when a new hypertext is generated, a link to the hypertext is registered.

S8: The hypertext converter 22
It is determined whether reference data is registered. If it is determined that the reference data is registered, the process proceeds to step S9, and if not, the process proceeds to step S14.

S9: The hypertext converter 22
The representative value output subroutine table is searched, and step S
Move to 10. S10: The hypertext converter 22 determines whether the reference data is registered in the representative value output subroutine table. If the reference data is registered in the representative value output subroutine table in this determination, step S
Move to 11 and if not registered, step S1
Move to 3.

S11: Hypertext converter 22
Calls the representative value output subroutine, and executes step S1.
Move to 2. S12: The hypertext converter 22 outputs a hyperlink using the representative value, and proceeds to step S5.

S13: Hypertext converter 22
Outputs the hyperlink registered together with the model name if it is not registered in the representative value output subroutine table in step S10, and proceeds to step S5.

S14: Hypertext converter 22
If it is determined in step S8 that the reference data is not registered, a new hypertext is generated, and the process proceeds to step S15.

S15: Hypertext converter 22
Registers a link to the new hypertext in the hyperlink table, and proceeds to step S16. S16: The hypertext conversion device 22 recursively calls the hypertext conversion algorithm of FIG. 5, and when the processing of the hypertext conversion algorithm ends, the process proceeds to step S17.

This recursive call processing is a general form of subroutine call used in the C language or LISP language. By using a recursive call, even if the same subroutine is called repeatedly in an algorithm. The processing can be executed without affecting the previous call.

S17: Hypertext converter 22
Is the newly generated hypertext (step S1)
After the file of 4) is closed, the process proceeds to step S5. (3): Description of external processing at the time of data restoration External processing at the time of data restoration is special processing required when restoring runtime data from hypertext, in addition to restoring the internal data structure at execution. As an example, there is a registration process to an external database. Conventionally, only the runtime data structure is converted to hypertext as data to be converted to hypertext, but other temporary data (for example, initialization of a database, expansion processing, etc.) is converted to hypertext and output to another page. In addition, external processing (special processing) other than the data restoration processing can be executed without impairing the operability of the internal data structure at the time of execution.

Description of Means for Implementing External Processing Call at the Time of Data Restoration In order to implement external processing at the time of data restoration, an external processing subroutine table at the time of data restoration is provided. The data restoration external processing subroutine table is a table in which the external processing number is used as a key and the external processing argument storage subroutine and the external processing calling subroutine are used as values. Output the external processing number when performing hypertext conversion and the arguments required for external processing when restoring data on a separate page,
This is realized by restoring these at the time of restoring the runtime internal data structure from the hypertext.

Description of an example of external processing at the time of data restoration As an example, an example is shown in which, when the user data “USER” is restored, the initialization processing of the external database is executed using the value of the attribute “NAME”. When the runtime data "USER" is converted into hypertext, the value of the attribute "NAME" is output to another file using underlined "Extern" which is a hyperlink. To output the hypertext, the hypertext conversion algorithm (see FIG. 5) can be applied as it is.

At the time of restoration, a database initialization subroutine is registered in advance in the data restoration external processing subroutine table. Next, a normal runtime data restoration algorithm (see FIG. 14) is executed. If the attribute name "Extern" is found by this, from the hyperlink destination, using the hypertext restoration algorithm,
The arguments "external processing subroutine number at data restoration" and "N
AME "is restored, the data restoration external processing subroutine table is searched, and the corresponding data restoration external processing subroutine is called.

FIG. 6 is a flowchart of the external processing algorithm at the time of restoration. Hereinafter, description will be made in accordance with steps S21 to S31 of FIG. S21: When the data structure restoring apparatus starts the processing,
First, read the character string from the hypertext reading start position passed as an argument, get the type name of the data,
Move to step S22.

S22: The data structure restoring device searches the type information table, and proceeds to step S23. Note that the processing of steps S23 to S31 is repeated until a composite data end character string appears according to the searched contents.

S23: The data structure restoring device extracts the attribute name of the partial data, and proceeds to step S24. S24: The data structure restoration device determines whether or not the extracted attribute name is a composite data end character string. If it is determined that the character string is a composite data end character string, the process of this subroutine is terminated. If the character string is not a composite data end character string, the process proceeds to step S25.

S25: The data structure restoration device determines whether or not the character string of the extracted attribute name is “Extern”. If the character string extracted in this determination is "Extern", the process proceeds to step S26, and if not, the process proceeds to step S29.

S26: The data structure restoring device recursively calls the data restoring algorithm of FIG. 14, and the arguments "data restoration external processing subroutine number" and "NAME"
After the processing of the data restoration algorithm for restoring the data is completed, the process proceeds to step S27.

S27: The data structure restoration device searches the data processing external processing subroutine table at the time of data restoration, and proceeds to step S28. S28: The data structure restoration device calls the data restoration external processing subroutine with the restored data as an argument, and after this subroutine ends, returns to step S23.

S29: If the character string is not "Extern" in step S25, the data structure restoring device extracts relative position information indicating the position where the data of the attribute name is written in the type information table, and proceeds to step S30.

S30: The data structure restoration device calculates the data restoration position from the relative position, sets this position as the value of the current restoration position pointer, and proceeds to step S31.
Move on to

S31: The data structure restoring device recursively calls the data restoring algorithm of FIG. 14 and returns to step S23 after the processing of the data restoring algorithm ends.

(4): Description of data validity verification processing Data validity verification processing refers to the execution-time internal data structure restored due to careless change of the hypertext by the user or inconsistency with external data. This is a special process to check the validity of data at the time of restoration in order to guarantee that the contents have not been destroyed.

Conventionally (see FIG. 14), only the hypertext stored in the hypertext storage device 13 is restored, but in this embodiment, a subroutine for checking the validity is called at the time of restoration. This guarantees the validity of the stored data. This subroutine means that, for example, if there are two males and three females as data, and a total of five, this relationship (2 + 3 = 5) also holds when data is restored from hypertext. inspect. In addition, when a defect in the stored data is found during the validity check, by displaying the hypertext where the defect was found and its position,
Incorrect data can be easily corrected.

Description of Means for Implementing Data Validity Verification Processing Means for implementing data validity verification processing use the data restoration external processing described in (3) above. A data validity verification process is registered as an external process at the time of data restoration, and if a defect is found as a result of the verification, the currently restored hypertext and its position are displayed. by this,
Data validity verification processing can be realized.

FIG. 7 is a flowchart of the validity verification processing algorithm. Hereinafter, description will be made in accordance with steps S41 to S50 of FIG. S41: When the data structure restoring apparatus starts processing,
First, read the character string from the hypertext reading start position passed as an argument, get the type name of the data,
Move to step S42.

S42: The data structure restoring device searches the type information table, and proceeds to step S43. Note that the processes of steps S43 to S50 are repeated until a complex data end character string appears according to the searched content.

S43: The data structure restoring device extracts the attribute name of the partial data, and proceeds to step S44. S44: The data structure restoration device determines whether or not the extracted attribute name is a composite data end character string. If it is determined that the character string is a composite data end character string, the process of this subroutine is terminated. If the character string is not a composite data end character string, the process proceeds to step S45.

S45: The data structure restoration device determines whether or not the character string of the extracted attribute name is “Extern”. If the character string extracted in this determination is "Extern", the flow proceeds to step S46, and if not, the flow proceeds to step S48.

S46: The data structure restoring device recursively calls the data restoring algorithm of FIG. 14, and after the processing of this data restoring algorithm is completed, the process proceeds to step S4.
Move to 7.

S47: The data structure restoring device calls the validity check subroutine using the restored data as an argument, and after this subroutine is completed, step S43 is performed.
Return to

S48: If the character string is not "Extern" in step S45, the data structure restoring device extracts relative position information indicating the position where the data of the attribute name is written in the type information table, and proceeds to step S49.

S49: The data structure restoration device calculates the data restoration position from the relative position, sets this position as the value of the current restoration position pointer, and proceeds to step S50.
Move on to

S50: The data structure restoring device recursively calls the data restoring algorithm of FIG. 14, and returns to step S43 after the processing of the data restoring algorithm ends.

(5): Description of external data search and generation processing External data search is a special processing for restoring data that is not stored as hypertext. For example, it is used when storing only a part of data and restoring it.

In the prior art (see FIG. 14), only the hypertext stored in the hypertext storage device 13 is restored, and when the internal data structure at the time of execution is stored, all the data referred to by those data are stored. Had to save the data. In this embodiment, in order to restore data that is not stored as hypertext,
Temporary data is stored when the run-time data is converted into hypertext, temporary data is restored when the data is restored, and processing for searching for and generating restored data from the temporary data is added.

Description of Means for Implementing External Data Retrieval and Generation Processing The means for implementing external data retrieval and generation processing uses the data restoration external processing described in (3) above. As data restoration external processing, external data search and generation processing are registered, and the result of the restoration processing is stored in the internal structure at execution as restoration data.

The external data search will be described using the reference type "HOBBY" shown in FIG. 3 as an example. When storing the attribute "HOBBY" of the data type "USER", the NAME of the data type "HOBBY" is stored in advance as temporary data. Further, as the data restoration external process, a process of returning data matching the temporary data from the data of the reference data type “HOBBY” generated in advance is registered in the data restoration external process subroutine table.

As a result, the hobby “watching a movie” for USER “Taro” can be searched, and the data can be restored to the attribute “HOBBY”. FIG. 8 is a flowchart of the external data search algorithm. Hereinafter, description will be made in accordance with steps S51 to S60 of FIG.

S51: When the process is started, the data structure restoring device first reads a character string from the hypertext reading start position passed as an argument, obtains the type name of the data, and proceeds to step S52.

S52: The data structure restoring device searches the type information table, and proceeds to step S53. Note that the processes of steps S53 to S60 are repeated until the complex data end character string appears according to the searched content.

S53: The data structure restoring device extracts the attribute name of the partial data, and proceeds to step S54. S54: The data structure restoring device determines whether or not the extracted attribute name is a composite data end character string. If it is determined that the character string is a composite data end character string, the process of this subroutine is terminated. If the character string is not a composite data end character string, the process proceeds to step S55.

S55: The data structure restoration device determines whether or not the character string of the extracted attribute name is “Extern”. If the character string extracted in this determination is “Extern”, the process proceeds to step S56, and if not, the process proceeds to step S58.

S56: The data structure restoring device recursively calls the data restoring algorithm of FIG. 14, and after the process of restoring this data (argument) is completed, step S5 is performed.
Move to 7.

S57: The data structure restoring device searches the external processing subroutine table at the time of data restoring and calls the external data inspection subroutine with the restored data as an argument.
Return to 53.

S58: If the character string is not "Extern" in step S55, the data structure restoring device extracts relative position information indicating the position where the data of the attribute name is written in the type information table, and proceeds to step S59.

S59: The data structure restoration device calculates the data restoration position from the relative position, sets this position as the value of the current restoration position pointer, and proceeds to step S60.
Move on to

S60: The data structure restoring device recursively calls the data restoring algorithm of FIG. 14 and returns to step S53 after the processing of the data restoring algorithm ends.

(6): Description of Security and Protection Functions for Stored Data Generally, it is very difficult to provide a data security mechanism and a protection mechanism for each data unit. A database or the like has a data confidentiality maintenance mechanism and a protection mechanism according to each realization, and has no versatility. In addition, in the case where a simple runtime data structure is output as a file, which is conventionally performed, confidentiality and protection of the entire data can be performed. No protection can be provided.

On the other hand, in the embodiment of the present invention, the confidentiality and protection functions provided by the general-purpose text storage device are used for the run-time data structure converted into the hypertext, so that each data unit can be used. Security and protection functions can be realized.

The reference data type "HOBB" shown in FIG.
The security maintenance and protection function will be described using "Y" as an example.
If the data type "USER" and the data type "HOBBY" are converted into hypertext, the file provided by the operating system is saved, and the runtime internal data structure for the data type "HOBBY" is to be protected, the data type "HOBBY" Hypertext (Figure 3)
In the example of (a), the access right may be limited so that only “movie watching”) is not shown to other users.

As a result, when restoring the attribute “HOBBY” of the data type “USER”, an error will occur even if the file at the hyperlink destination is opened, and the runtime data stored therein will be referred to. Never. Furthermore, even if the user tries to edit with a hypertext editor or the like, the editing cannot be performed.

When restoring data via the network using the hypertext transfer device 16, WWW
It can be realized by using a general-purpose network security and protection function such as

FIG. 9 is a flowchart of an algorithm for maintaining and protecting the security of stored data. Hereinafter, FIG.
Steps S61 to S70 will be described. S61: When the processing is started, the data generation device 24
First, it is determined whether the file of the hyperlink destination of the hypertext storage device 13 can be opened. If the file can be opened by this determination, the process proceeds to step S62, and if the file cannot be opened by the security and protection mechanism of the file, the process proceeds to step S70.

S62: The data generator 24 opens the file specified by the passed hyperlink, and proceeds to step S63. S63: The data generating device 24 reads the composite data start character string, and proceeds to step S64.

S64: The data generator 24 reads the data type name, and proceeds to step S65. S65: The data generation device 24 searches the type information table to obtain the data size, and proceeds to step S66.

S66: The data generator 24 secures a new data storage area having the size of the data size in the internal data structure storage memory at the time of execution, and proceeds to step S67.

S67: The data generator 24 registers the passed hyperlink and the pointer indicating the start position of the new data storage area in the hyperlink table, and proceeds to step S68.

S68: The data generator 24 returns the current reading position to the beginning of the hypertext, and proceeds to step S69. S69: The data generation device 24 recursively calls the data restoration algorithm of FIG. 14, and ends the processing by the data generation algorithm when the processing of this algorithm ends.

S70: If the file cannot be opened in step S61, the data generating device 24 stops the data restoring process and ends this process. Step S
The reason why the current reading position is returned to the beginning of the hypertext at 68 is that the processing up to step S67 is different from the actual data output of securing the data storage area and registering it in the hyperlink table. 14
After the data restoration algorithm is called in step S69, the first character string is determined to be the composite data start character string, and the processing of the composite data restoration subroutine is executed in step S105 so that actual data output is performed. To do that.

(7): Description of Version Number Management Function for Stored Data The version number management function for data means what kind of data is changed when an internal data structure changes at the time of execution of an application. This function records what data has been changed from data, and provides data at a certain point in time in response to a request. This is one of the most important functions provided by a general database.

In general, it is very difficult to provide a version number management mechanism for each data unit. Databases, etc., have version management mechanisms according to individual implementations, and have no versatility. In the conventional method of outputting a simple runtime data structure as a file, the version number management of the entire data can be performed, but the version number management for each stored data unit can be performed. I can't do that.

On the other hand, in the embodiment of the present invention, a version number management function provided by a general-purpose text storage device is used for a runtime data structure converted into a hypertext, so that individual data units can be used. A version management function can be realized.

The reference data type “HO shown in FIG.
The version number management function will be described using “BBY” as an example. Data type "USER" and data type "HOBB"
"Y" is converted into hypertext and stored as a first version in a general-purpose document management tool. Next, the attribute “HOBBY” of the data type “USER” is changed, and the HOB
It is assumed that BY (hobby) “watching a movie” has been changed to “reading”. Here, the data type “USER” and the data type “HOBBY” are converted into hypertext again and stored as a second version in a general-purpose document management tool.

When the application needs an initial runtime data structure, the document management tool sends the first
Retrieve and restore the hypertext version. When the changed data becomes necessary, the second version of the hypertext is extracted and restored. Further, the data type "U
For SER ", the first edition, data type" HOBBY "
By retrieving the second version, restoration between different versions is possible. By the means as described above, it is possible to realize the version number management function for each data unit.

(8): Description of Prior Discrimination of Data Type In the related art (FIG. 12), the internal data structure at the time of execution is converted into a hypertext by performing the type discrimination at the time of execution. In this method, when the runtime type discrimination takes a very long time, it is difficult to efficiently store the data. On the other hand, most of current programming languages declare a data structure at the time of execution in advance and use a data structure at the time of execution.

For example, in C ++, one of the most widely used programming languages, the runtime internal data structure is defined by a declaration called a "class". In programming languages that declare such runtime internal data structures in advance,
Since the data type of data referred to by certain data is uniquely specified, type determination at the time of execution can be performed in advance, and its correctness is guaranteed by a compiler that generates execution code. By utilizing this characteristic, the type of the algorithm used in the related art (FIG. 12) is determined in advance, and the internal data structure at the time of execution is converted into hypertext without performing the type determination at the time of execution. Can be.

In the hypertext conversion algorithm used in the related art (FIG. 12), most of the branching is performed by determining the data type of the runtime data. The only exception is whether or not it is registered in the hyperlink table. Therefore, what kind of movement is performed when the hypertext conversion algorithm is applied to a certain data type is determined only by the data type and whether or not the data type is registered in the hyperlink table. Therefore, by examining in advance the processing when converting hypertext to a certain data type and registering it in the hypertext conversion definition table, it is possible to convert hypertext without performing type determination at runtime. It becomes possible.

• Reference data type "USER" shown in FIG.
As an example, a description will be given of the hypertext conversion based on the prior determination of the data type. Complex data type "USER"
Is declared as a C ++ language class as follows:

[0155] The meaning is as follows.

: The class name is USER. : STRING type attribute has NAME. : Has the attribute Hobby of the reference data HOBBY type (“ ^* ” indicates a reference).

When this composite data type USER is converted to hypertext, the USER type has attribute value “NAME” and “Hobby” types, and since the respective data types are known in advance, the following processing is performed. Only the subroutine to be executed: output the start string of composite data (begin structur
e).

Check the data type (USER). : Outputs the attribute name “NAME”. : Call directly the character string conversion subroutine (step S74 in FIG. 12) corresponding to STRING.

Outputs the attribute name “Hobby”. : Call step S77 in FIG. By calling the above subroutine, it is possible to obtain the same hypertext output as in the case where the runtime data type discrimination (step S72 in FIG. 12) is performed.

(9): Description of installation of program Hypertext conversion device 22, data structure restoration device 2
3. The data generation device 24 and the like can be actually configured by a program, executed by the main control unit (CPU), and stored in the main storage (memory). These programs are processed by a general data processing device (computer) such as a personal computer and a workstation. These computers are configured by hardware such as a main control unit, a main memory, a file device such as a hard disk, a display device, and an input device such as a keyboard.

The program of the present invention is installed on this computer. In this installation, these programs are stored in a portable recording medium such as a floppy disk, a magneto-optical disk, or the like, and a storage device provided in a computer is accessed via a drive device for accessing the storage medium, or Via a network such as a LAN,
It is installed in a file device provided in the computer. Then, program steps necessary for processing are read out from the file device to the main memory, and are executed by the main control unit.

[0162]

As described above, the present invention has the following effects. (1): Hypertext conversion means for converting an internal data structure into hypertext at the time of execution. In order to define a representative value of data at a hyperlink destination and insert the representative value of the data into the hypertext, data From the representative value, the contents of the entire data can be grasped to some extent, and it is possible to easily refer to and operate the internal structure at the time of execution.

(2): When external processing other than data restoration is required, a hypertext conversion means for converting an internal data structure into hypertext at the time of execution. Arguments required only for the external processing are stored as hypertext. Data structure restoring means for outputting the hypertext to an internal data structure at the time of execution, and restoring the argument at the time of data restoration, without impairing data operability on the hypertext, other than data restoration processing. External processing can be performed.

(3): Hypertext conversion means for converting the internal data structure into hypertext at the time of execution.
A data structure restoring means for outputting separately from the stored data and converting the hypertext into an internal data structure at the time of execution. In order to restore the argument at the time of data restoration or an argument necessary for external data retrieval, data operation on the hypertext is performed. The validity of the restored data can be guaranteed without impairing the performance.

(4): A hypertext conversion means for converting the internal data structure at the time of execution into hypertext, wherein a part or all of the data type of the internal data structure at the time of execution is given in advance and stored. In this case, the hypertext conversion processing for the data type is performed without the type determination processing of the runtime internal data structure, so that the runtime internal data structure can be efficiently used even when the type determination at runtime is difficult or impossible. Can be stored.

(5): A procedure for defining a representative value of data at a hyperlink destination and inserting the representative value of the data into the hypertext in hypertext conversion means for converting an internal data structure into hypertext at the time of execution. In order to make a computer-readable recording medium storing a program for executing the program, by installing the program of this recording medium into a computer, the contents of the entire data can be grasped to some extent by a representative value of the data, It is possible to provide a data management device based on hypertext that can easily refer to and operate the internal structure at the time of execution.

[Brief description of the drawings]

FIG. 1 is a diagram illustrating the principle of the present invention.

FIG. 2 is an explanatory diagram of a data management device using hypertext according to the embodiment.

FIG. 3 is an explanatory diagram of a display example based on a representative value in the embodiment.

FIG. 4 is an explanatory diagram of a representative value output subroutine table in the embodiment.

FIG. 5 is a flowchart of a hypertext conversion algorithm according to the embodiment.

FIG. 6 is a flowchart of a restoration external processing algorithm in the embodiment.

FIG. 7 is a flowchart of a validity verification processing algorithm according to the embodiment.

FIG. 8 is a flowchart of an external data search algorithm according to the embodiment.

FIG. 9 is a flowchart of a security and protection mechanism algorithm for stored data in the embodiment.

FIG. 10 is an explanatory diagram of a conventional example of a runtime internal data structure.

FIG. 11 is an explanatory diagram of a display example after conventional hypertext conversion.

FIG. 12 is a flowchart of a conventional hypertext conversion algorithm.

FIG. 13 is a flowchart of a conventional composite data output subroutine.

FIG. 14 is a flowchart of a conventional data restoration algorithm.

FIG. 15 is a flowchart of a conventional composite data restoration subroutine.

FIG. 16 is a flowchart of a conventional data generation algorithm.

[Explanation of symbols]

 1 execution internal data structure storage means 2 hypertext conversion means 3 data structure restoration means 4 data generation means 13a hypertext storage means

──────────────────────────────────────────────────続 き Continued on the front page (51) Int.Cl. ⁶ Identification code FIG06F 15/419 320

Claims (5)

[Claims] 1. Hypertext conversion means for converting an internal data structure at run time into hypertext, wherein the hypertext conversion means defines a representative value of data at a hyperlink destination and defines the representative value of the data in the hypertext. A data management device using hypertext, wherein a representative value is inserted. 2. Hypertext conversion means for converting a runtime internal data structure into hypertext, hypertext storage means for storing the converted hypertext, and data for converting the hypertext into a runtime internal data structure. A structure restoring means, and a data generating means for generating data required in the runtime internal data structure during a restoring operation of the data structure restoring means, wherein an external process other than data restoring is required. Hypertext conversion means outputs arguments required only for the external processing as hypertext separately from the stored data, and the data structure restoration means restores the arguments at the time of data restoration. Management device. 3. Hypertext conversion means for converting a runtime internal data structure into hypertext, hypertext storage means for storing the converted hypertext, and data for converting the hypertext into a runtime internal data structure. Structure restoring means; and data generating means for generating data required in the runtime internal data structure at the time of restoring operation of the data structure restoring means. The hypertext converting means is required for data validity verification. And a parameter required for external data retrieval is output as hypertext separately from the stored data. The data structure restoring means restores the argument at the time of data restoration. 4. A hypertext conversion means for converting a runtime internal data structure into hypertext, wherein the hypertext conversion means stores how or some data types of the runtime internal data structure are stored. A hypertext conversion process for the data type when the data type is given in advance without performing the type determination process of the internal data structure at the time of execution. 5. A procedure for defining a representative value of data at a hyperlink destination and inserting a representative value of the data into the hypertext, in a hypertext converting means for converting an internal data structure into hypertext at the time of execution. A computer-readable recording medium storing a program for causing a computer to execute the program.