JP2964831B2 - Structural data processing device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a structural data processing apparatus for processing structural data having a tree structure.

[0002]

2. Description of the Related Art As one method of expressing structural data having a tree structure, components are arranged in a depth-first order, and structural position information of the components is represented by a numerical sequence. . As a generally well-known method, there is known a method of expressing the same depth, that is, a sibling relationship by a numerical value, and providing this numerical value for each depth and expressing the numerical value in the form of a numerical sequence. Each numerical value in the numerical value sequence represents a rank at each depth. In this expression method, the position information of a component having a large depth has a large number of numerical values in a numerical value sequence. A specific example is ISO8613 ODA (Open
n Document Architecture).

FIG. 11 is an explanatory diagram of a conventional structure data expressing method. FIG. 11B shows an example of tree-structured data, in which the components of the tree structure are indicated by “O”. In this tree structure, below the root level components are:
There are three child-level components, two grandchild-level components below the leftmost component of the child level, and three grandchild-level components below the rightmost component of the child level. Component is present. As a method of expressing such tree-structured data, for example, FIG.
It can be represented by sequential data as shown in FIG. In this example, data enclosed by "[" and "]" in the sequential data represents a component.
First "/" in data enclosed in "[" and "]"
Numerical strings separated by are positional information on the structure, and the next “@” represents attribute information such as an identifier attached to a component in the structural data. The last string is the name of the component, which may or may not be present. The data representing this component may be fixed-length data or variable-length data.

[0004] In a numerical sequence, which is structural positional information, each numerical value represents positional information for each depth. At this time, the numerical sequence represents the depth from the root in order from the front. For example, the first number indicates the depth of the root, and the second number indicates the depth of the child at the root. That is, the number of numerical values in the numerical sequence represents the depth. Here, it is assumed that the order starts from number 0. Also, each numerical value in this numerical sequence represents the order of the sibling constituent elements. In this way, the position on the structure is determined from the position information. For example, in the sequential data shown in FIG. 11A, the numerical value sequence “0/2/1” indicating the position information of “[0/2/1 @ grandchild 1]” is the 0th configuration of the root level. This represents that the component "grandchild 1" is located at a lower layer of the element "root 0", that is, a lower layer of the second component "child 2" of the child level, that is, at the first position of the grandchild level. .

[0005] In this way, by treating the tree-structured data shown in FIG. 11 (B) as apparently sequential data as shown in FIG. 11 (A), the tree-structured data can be directly handled. It is possible to use external devices that are not available. For example, as described in Japanese Patent Application Laid-Open No. 4-84342, it is possible to store tree-structured data using a normal data management system that cannot handle tree-structured data.

FIG. 10 is a block diagram of a conventional structured data processing apparatus. In the figure, 1 is a structural data processing device, 2 is data input means, 3 is structural data processing means, 4 is editing means, 5 is search means, 6 is display means, 7 is input means, 8 is data output means, 10 Is an external device. The structural data processing device 1 includes a data input unit 2, a structural data processing unit 3, a display unit 6, an input unit 7, and a data output unit 8. The sequential data as shown in FIG. 11A is transferred to an external device 1 such as a data storage device or a data transfer device.
0 is input as structural data, processed as tree-structured data as shown in FIG.
It is output as sequential data as shown in FIG. In this way, by inputting / outputting apparently sequential data, an external device which cannot directly handle structural data can be used.

The data input means 2 receives the sequential data as shown in FIG. 11A from the external device 10 and converts the data into a tree structure data as shown in FIG. Output to 3. Similarly, the data output means 8 transmits data from the structural data processing means 3 to FIG.
Input the structure data as shown in FIG.
Is converted to sequential data as shown in FIG.

The structural data processing means 3 includes an editing means 4,
It has a search means 5, other processing means for structural data, etc., and also displays information on the display means 6 and processes input data from the input means 7.

The operation of the structural data processing apparatus 1 can be roughly divided into three. It involves data entry, processing,
Output. Next, these three operations will be described in order.

The data input operation is performed by, for example, inputting the structural elements of the structural data arranged in the depth-first order as sequential data from an external device 10 that cannot directly handle the structural data, such as a data transfer device or a data storage device. Input to means 2. The position in the structure is uniquely determined from the position information in the data represented by the variable-length numerical string, and the structure data is converted from the input data, for example, the data after “＠” in FIG. Generate a component and incorporate the component into a location in the previous structure data.

Data processing is performed by using any means incorporated in the structural data group 3 other than input / output.
Edit, print, etc. Special processing can be realized by adding means as appropriate for the purpose. For example,
Editing is performed by selecting target data displayed on the display means 6 with the input means 7 and moving, deleting, copying, etc., using the editing means 4.
Performed by Editing includes a structure operation on the structure data and a content operation on the contents of the structure data. A structure editing means is appropriately prepared for editing the structure, and a content editing means is appropriately prepared for editing the contents of the constituent elements. For example, to search for a component in a structure, a search unit 5 is required.

In the data output operation, structural data such as a data transfer device or a data storage device is output as sequential data to an external device 10 that cannot be handled as it is.
That is, the data output unit 8 first converts the position information in the data into a variable-length numerical sequence and adds it to the constituent elements. Then, the components of the structure data are converted into sequential data which can be output in the order of depth priority, and the external device 10
Output to

The procedure for outputting components in depth-first order is generally known. First, the position information of the component that is the root of the tree structure is set as a numerical sequence of 0s.
After the root position information and the attribute information are output, if there is a child, the child position information is created and output. If there are more children, repeat recursively. Since the position information of the child is one deeper than the previous component, a numerical value of 0 is first added to the position information. When there are a plurality of children, the last numerical value added is increased, and numerical values are sequentially allocated from 0.
For example, the child of the component “0/2” is “0/2/0”
It is "0/2/1".

In the case where variable length data depending on the structural depth of the component accompanied by the position information as described above is used,
Data of the number of numerical values or data for indicating a break of a numerical string is required. Further, there is a disadvantage that the data amount increases depending on the structural depth. This disadvantage is a problem with all data processing, such as transfer, comparison, and storage. Generally, compared to processing inside the device,
Data transfer with the outside takes processing time. Further, the processing time of the data transfer is almost proportional to the data amount. Therefore, if the amount of data to be transferred is large, it takes a long time to transfer. Also, when the data amount is large, a large amount of memory is required. Then, the amount of information that can be processed at one time decreases. Further, since the data amount is larger than the information amount, much information cannot be stored in the data storage device. There are various problems, such as the need to prepare an expensive and large-capacity data storage device for storing data.

Here, the data amount will be considered with a simple example. For example, let us consider expressing the structure of a binary tree having a depth of 10 with the root at a depth of 0. For convenience, one numerical value is 1 byte, and the end is 1 byte. The data amount necessary for the root position information is at most 2 bytes including the end. End,
That is, the position information of the component having a depth of 10 has a numerical value of 1
It becomes one, and 12 bytes are required including the end. Since the number of structural elements at the end is 2 ¹⁰ = 1024 = 1 kilo, the capacity required for all the structural elements at the end is 12
Byte x 1 kilobyte = 12 kilobytes. Similarly, when the positional information required for components at other depths is summed up, a binary tree with a depth of 10 requires 22 kilobytes to represent the structure of 2 kilo components.

Similarly, a binary tree having a depth of 20 requires 42 megabytes to express the structure of 2 mega components. The position information of all the constituent elements can be omitted because the leading numerical value is 0. Still, a 10-deep binary tree requires 20 kilobytes and a 20-deep binary tree requires 40 megabytes.

Actually, if one numerical value is expressed by one byte, only 255 siblings can be expressed. This is a great limitation when handling large volumes of data in the same format, such as a hierarchical database. Number 1
If each is 2 bytes, a binary tree having a depth of 10 requires 40 kilobytes, and a binary tree having a depth of 20 requires 80 megabytes.

In recent data compression techniques, the data compression ratio is about half to a maximum of about one tenth. Even with this data compression technique, a binary tree with a depth of 10
A binary tree with a depth of 20 kilobytes would require 8 megabytes. In addition, when such a data compression / decompression device is incorporated, there is also a problem that the cost is increased as a whole system.

[0019]

SUMMARY OF THE INVENTION The present invention has been made in view of the above situation, and has a structure data processing apparatus capable of reducing the amount of sequential data used when performing input / output with an external device. The purpose is to provide.

[0020]

According to a first aspect of the present invention, in a structure data processing apparatus for processing a structure data having a tree structure, a structural element serving as a node of the structure data is structured. A data input unit that has depth information as numerical data, and receives sequential data arranged in a depth-first order and converts the data into a tree-structured data; and a data input unit that converts the sequential data input during the conversion. The present invention is characterized in that it has a structure position determining means for searching for a parent component of the component based on a numerical value indicated by structural depth information of the component and determining a structure position.

Further, in the second aspect of the present invention,
In a structural data processing apparatus for processing structural data having a tree structure, components are traced in a depth-first order based on the tree structure data, and each of the components has numerical depth information as structural position information. And data output means for generating sequential data and outputting the sequential data.

[0022]

According to the present invention, in claim 1, the input sequential data is arranged in a depth-first order, and the position information is a root of a tree structure, that is, a head in a depth-first order. Has depth information as numerical data. When the data is converted into tree-structured data by the data input unit, the structure position determining unit searches for the parent component of the component based on the numerical value indicated by the structural depth information of the input sequential data. Then, the structure position of the tree structure is determined. At this time, as for the positions of the components having the same depth, the structural position can be determined from the arrangement order of the components for each depth.

Further, according to the present invention, the data output means obtains structure depth information from the tree structure data,
Based on this, the components are traced in the order of depth priority, and for each component, sequential data having numerical depth information as structural position information is created and output.

Thus, the sequential data used for input / output with the external device only needs to have numerical depth information, so that the data amount at the time of transfer and storage can be reduced.

[0025]

FIG. 1 is a block diagram showing an embodiment of a structural data processing apparatus according to the present invention. In the figure, the same parts as those in FIG. 9 is a structural position determining means. The data input means 2 is arranged in a depth-first order, and receives sequential data having structural depth information. Based on the depth information obtained from the input sequential data and the information on the depth of the structure being generated, the position on the structure is determined using the structure position determining means 9 to generate the tree structure data. . The data output means 8 generates and outputs sequential data having structural depth information and arranged in a depth-first order from the tree-structured structural data.

FIG. 2 is an explanatory diagram of an example of a structure data expressing method used in the present invention. FIG. 2A shows sequential data, and FIG. 2B shows an example of tree-structured data. The tree structure is the same as in FIG. In FIG. 2, the depth information is represented by numerical values. Here, for convenience, it is treated as a numerical value that increases as the depth increases. However, there is no need to do so, as long as the data can compare depths. Further, for example, the rate of increase of the value with respect to the depth, the expression form of the value such as a data type such as a character string or an array, or the like may be any. In the sequential data shown in FIG. 2A, data enclosed by "[" and "]" represents a component, and the first numerical value of data enclosed by "[" and "]" is a depth. Information, and the next “@” represents attribute information of the component. The last string is the name of the component, which may or may not be present.

In the example shown in FIG. 2, as depth information, a numerical value 0 is used for a root level, a numerical value 1 is used for a child level, and a numerical value 2 is used for a grandchild level. When the root element is arranged in the depth-first order, it is arranged first and is composed of depth information “0”, attribute information “＠”, and name “root”. Also, when arranging in the depth-first order, elements having the same depth are arranged so as to appear in a certain order. For example, if it appears from the element at the leftmost position, the element at the leftmost position at the child level is arranged next to the element at the root. Next, elements, if any, from the grandchild level are ordered. In the example shown in FIG. 2, two grandchild-level elements below the leftmost element of the child level are arranged. When there is no element after the grandchild level, the element of the next child level, that is, the element of the middle child level in FIG. 2B is arranged. Further, among the elements shown in FIG. 2B, the elements to which the child-level name “child 2” is attached are arranged, and the grandchild-level elements follow.

The data input means 2 shown in FIG.
2 (B), the sequential data having the structure as shown in FIG.
Is converted into tree-structured data as shown in FIG. The data output means 8 traces the tree-structured data as shown in FIG. 2B in the order of depth priority, and outputs sequential data as shown in FIG. 2A. Here, the output position information is only the depth information.

The extent to which the amount of data is actually reduced by using such sequential data will be examined using the above-described binary tree example. In the sequential data used in the present invention, only depth information is provided as structural position information for each component. In the above example of a binary tree, even if the depth information requires 4 bytes as numerical data, a binary tree having a depth of 10 requires only 8 kilobytes and a binary tree having a depth of 20 requires 16 megabytes. Actually, one byte is sufficient for the depth information, so that a binary tree having a depth of 10 requires 2 kilobytes and a binary tree having a depth of 20 requires 2 megabytes. Compared to conventional sequential data, the depth is 10
In the binary tree, the data amount is 1/20, and when the depth is 20, the data amount is 1/40. Considering that the conventional structure data processing device requires 4 kilobytes for a binary tree with a depth of 10 and 8 megabytes for a binary tree with a depth of 20 even with the recent data compression technology, It can be seen that the method of the present invention is superior in terms of data capacity and processing cost as compared with a conventional device incorporating a data compression device. Of course, it is possible to incorporate the data compression / decompression device into the structural data processing device or the external device of the present invention. In that case, it is clear that the data capacity is further improved and the data transfer can be performed at high speed.

Returning to FIG. 1, the structural data processing means 3 performs processing of the structural data. The structural data processing means 3 includes means necessary for processing, such as an editing means 4 and a search means 5. For example, if the structural data is a structured document, it may be configured to have an assigning means in order to realize automatic assignment. Thus, there may be a plurality of means necessary for processing the structural data. There is no particular limitation on the number or configuration of means required for processing the structural data. Similarly, a conventional data input unit or data output unit may be provided to use the conventional data.

Generally, in a structured document represented by ODA, components (logical objects) are arranged in a depth-first order (logical order). Therefore, the structural data processing means 3
In the case where structural data to be processed is defined as document data of a structured document represented by ODA by adding means necessary for editing / processing / printing / displaying the structured document to the structured data processing apparatus of the present invention, 1 can be used as a structured document processing device. Further, when the target data is set as the structural data of the geometrical figure, a geometrical figure processing means for processing the geometrical figure data having three-dimensional coordinates and a three-dimensional data display means are added to the structural data processing means 3. The data processing device 1 can be used as a CAD system.

The structural position determining means 9 determines the structural position using not only the depth information attached to the components but also the order of the components. In this order, the components do not need to be physically arranged, and the input order does not need to be the depth priority order. However, in this case, it is necessary to be able to compare the depth of the components with the depth of the components by some means. For example, a configuration may be adopted in which data representing the order when the components are arranged in a depth-first order may be provided, or index information in a depth-first order may be separately created. If the components having the depth information are not arranged in the order of the depth priority, all the data are input, and then rearranged in the order of the depth priority, and the rearranged data is used as the input data of the data input unit. . In the following description, it is assumed that the data input order is the depth priority order, and that the depth information is included as incidental information of the components.

The operation of one embodiment of the structural data processing apparatus of the present invention will be described. In the structural data processing process, a user's instruction is received by the input unit 7, and a process desired by the user is performed by the editing unit 4, the search unit 5, the printing unit (not shown), and the like. Processing other than data input / output processing such as structural data processing is performed by structured document processing or CAD
Since it is processing of general structure data represented by
I omit it here.

FIG. 3 is a flowchart for explaining an example of the data input process, and FIG. 4 is a flowchart for explaining a part of the process of searching for a parent. The data input processing is started when the user specifies the data input processing by the input means 7 or when the input data is sent from the outside. Structural data is generated while inputting sequential data in a depth-first order.

In S21 of FIG. 3, an initialization process is performed. In this step, first, preprocessing necessary for data input processing is performed, and data input is prepared. Then, one component, which is the root of the tree structure, is input and assigned to a variable PARENT. The variable PARENT is a candidate for a structural parent of a component input next, and represents a component having the deepest structural position. In fact, it is the last component incorporated into the structure.

In S22, the existence of the component is confirmed. When there are no more components of the sequential data, post-processing is performed, and the data input process ends. If it still exists, the input of components and the assembling process of the structure after S23 are performed.

In S23, the input processing of the component is performed. In the input processing, data from the start to the end of the next component is input from data in which the components are arranged in the depth priority order, and the component is reproduced. For example, in the example shown in FIG. 2, “[] to“] ”of the sequential data in FIG. 2A is input as one component,
Using the depth information and the attribute information “＠”, a component corresponding to “○” shown in FIG. 2B is generated.

In S24, the structure position determining means 9 performs processing for searching for a parent. The component assigned to the variable PARENT is a candidate for the parent of the component input in S23. Whether the user is a parent is determined by using the input depth information of the component. The determination method is the variable PAR
It is sufficient to check whether the depth of the component of ENT is smaller than the depth of the input component. In S26 of FIG.
This determination is made. If the depth of the component of the variable PARENT is smaller, the component of the variable PARENT becomes the parent. If the depth of the component of the variable PARENT is the same as or deeper than the input component, the parent of the component currently substituted for the variable PARENT is set as a new parent candidate in step S27.
ENT, and a new variable PARE is set in S28.
After confirming the existence of the component assigned to NT, S26
Repeat the operation from.

In step S25, components are inserted. That is, for the parent found in S24,
Connect the input component to the tree structure as the last child. The input component is substituted for the variable PARENT, and is set as a parent candidate of the next component. With the above processing, the input processing for one component is completed.
Returning to S22, the process for the next component is repeated until there is no component to be input.

FIG. 5 is an explanatory diagram of a method of determining a structural position. In the figure, “*” indicates a component that has already been determined, “◎” indicates a component that can be a parent candidate among components that have already been determined, and “○” indicates a component that has been determined. This shows the position that can be a candidate for the input component. This figure illustrates S24 of FIG. 3, that is, the method of determining the parent position shown in FIG. When entering in depth-first order,
The parent component is always input first, and the structural position is determined. The component input last in the figure is substituted for the variable PARENT. The components already entered are structured from the root.

Now, assuming that the depth of the component of the variable PARENT is N, the depth of the input component can be a depth from 1 to N + 1. In the drawing, “◎” is a candidate for the parent, and “な る” is a candidate for the position of the input component. At this time, using the depth information, it is checked from the constituent elements of the variable PARENT which is a candidate for the parent whether or not the parent is the parent in descending order. Then, the variable PARENT when the depth of the component of the variable PARENT becomes shallower than the depth of the input component may be set as the parent. If parents are found,
What is necessary is just to insert the input component into the tree structure as a child of the parent. Thus, the position of the component can be determined. If the depth of the input component is not between 1 and N + 1, an error occurs.

FIG. 6 is a flowchart for explaining another example of the data input process, and FIG. 7 is a flowchart for explaining a part of the process of searching for a parent in another example. In this example, an index of a component using the depth as a key is prepared for the component input last for each depth. The position can be determined directly by referring to the index based on the input depth information of the component. In the case of this example, it is not necessary to perform comparison while changing parents in order, so that the processing speed can be improved. In FIGS. 6 and 7, an array INDEX [] is prepared, and the last component for each depth is stored. However, it is necessary to prepare an index area for the maximum depth.

In S31 of FIG. 6, an initialization process is performed. In this step, in addition to the initialization processing performed in S21 of FIG. 3, a root is substituted for the depth 0 of the array INDEX []. In S32, the existence of the component is confirmed, and in S33
In, the components are input.

In S34, a process of searching for a parent is performed by the structure position determining means. In S36 of FIG. 7, the depth of the newly input component is the component of the variable PARENT, that is, the depth of the last input component + 1.
Inspect not to exceed. Usually it cannot be exceeded. The parent of the input component is the array INDEX [input component depth-1]. That is, the parent component can be immediately identified from the input component depth information. In S37, it refers to the array INDEX [depth of input component -1] and substitutes it for variable PARENT. In S38, it is confirmed that the parent exists, and the processing for searching for the parent is ended.

In S35, the input component is inserted into the tree structure, and the variable PARENT and the array IND are inserted.
The component just input is substituted for EX [depth of input component]. With the above processing, the processing for one component is completed. It returns to S32 and repeats until there is no component.

FIG. 8 is a flowchart for explaining an example of the data output process, and FIG. 9 is a flowchart for explaining a portion of the component output process. The data output process is started when the user specifies the data output process by the input unit 7 or when the structural data processing process ends.

At S41, an initialization process is performed. In this step, while setting the variable DEPTH to 0,
Remove roots. Then, in S42, output processing of the component is performed.

In S43 of FIG. 9, the data of the component of the tree structure as shown in FIG. 2B is converted into the data of the component of sequential data as shown in FIG. 2A. Then, in S44, the content of the variable DEPTH, that is, the configuration depth information is added to the data of the component and output.

In the processing of S45 to S48, processing relating to the child component of the component output in S44 is performed.
In S45, the presence of a child is confirmed. If the child does not exist, the output processing of the child at this level ends. If there is a child, in step S46, the variable D
Add 1 to EPTH. Then, in S47, the output process of the component, that is, the process shown in FIG. 9 is recursively called, and the output process for the component of one child is performed. At this time, the output process of the component is recursively called and output for the component of the grandchild and the components below the grandchild. When there is no longer a grandchild component, the process returns from the recursively called component output process.
In, by subtracting 1 from the variable DEPTH, returning to the parent level, and repeating the processing of S45 to S48,
Output processing is performed for all child components.

Finally, when the output processing of the component of the child of the root ends, the processing of S42 ends. Finally, post-processing is performed, and the data output processing ends.

A specific example of one embodiment of the structural data processing apparatus of the present invention will be described. Generally, the structural data processing device of the present invention can be realized by a computer (computer system).

The data input means 2 includes an input device of a computer, software for controlling the device, inputting data, generating structural data, and a CP for executing the software.
U. Sequential data input from a data input device connected to the outside of the computer
Convert to structural data components. Structural data processing means 3 assembling the created constituent elements as structural data
Output to

The data output means 8 includes a data output device of a computer, software for controlling the device and outputting structural data components, and a CPU for executing the software.
Can be configured. The component is converted into data that can be output to the outside of the computer, and the data output device is controlled to output sequential data.

When data is input to the data input means 2,
As the external device 10 that receives the data output by the data output unit 8, for example, a data communication device can be an external device, and a device connected to the communication device can exchange information with input / output. Similarly, when a data storage device such as a magnetic disk device is an external device, data can be stored and stored. The number of external devices is not limited to one,
It is possible to connect more than one device at a time. In this case, each device may be configured to have a common data input unit 2 and a plurality of data output units 8, or may be configured to include a plurality of data input units 2 and a plurality of data output units 8. Also, the input and output need not be connected to the same external device, and an external device for inputting data to the data input means 2;
An external device that receives data from the data output unit 8 may be different. For example, an input-only data communication device,
It is also possible to connect an output-only data communication device, perform a fixed-form data processing by the structural data processing means 3, and configure a structural data automatic fixed-form processing device that automatically performs the fixed-form processing.

The structural position determining means 9 includes software for operating the components and a CPU for executing the software.
Can be composed of Alternatively, it can be configured by hardware. The depth information is acquired from the component, and compared with the depth of the parent candidate component, to specify the structural position of the component.

The input means 7 can be constituted by an input device such as a keyboard, a pointing device such as a mouse or a touch panel, and gives an instruction of a user to the system. The display means 6 can be constituted by a display device such as a CRT and a liquid crystal. Further, a sound generation device such as a speaker may be included.

For example, a structured document editing device can be configured using the structured data processing device of the present invention.
At this time, the structural data to be processed is a structured document. As the external device, a data storage device such as a magnetic disk device or a communication device can be used. The structure data processing means 3 may include a document printing means and a document content editing means, and may be constituted by software for controlling them, an automatic layout processing program, and the like.

An editing menu or command displayed on the display means 6 is input from the input means 7. When the save command is executed, the structure data of the structured document is transferred to the data output means 8. The data output unit 8 expands the components of the structured document into data that can be output based on the above-described operation, adds depth information to the data, and writes the data as sequential data to the magnetic disk device that is the external device 10. Conversely, when the read command is executed, the data of the sequential structured document stored in the magnetic disk device is extracted for each component through the data input means 2, and the structure is assembled based on the depth information.

Furthermore, simultaneous editing and the like can be supported by editing the partial structure and components of the structured document while communicating with another structured document editing device via an external communication device.

As described above, figure data can be handled as structural data and applied to a CAD system or the like. At this time, a printing device such as a plotter or the like can be added as an external device for printing a drawing.

[0061]

As is apparent from the above description, according to the present invention, input / output can be performed with structural data having a sufficiently small data amount as compared with the conventional structural data processing apparatus. The time can be greatly reduced, and the processing time of the entire computer system can be reduced. Further, since the data amount is small, the storage area occupied is small. For example, a small-scale system can be realized, and a large amount of information can be stored without using an expensive and large-capacity data storage device. With a system configuration equivalent to that of the related art, the surplus memory can be used for an index, a cache, and the like, so that high-speed data reference can be expected. It is also advantageous to use data locality such as clustering. Even when referring to data, only a small area needs to be searched, so that there is an effect that the search can be performed at high speed.

[Brief description of the drawings]

FIG. 1 is a block diagram showing one embodiment of a structural data processing device of the present invention.

FIG. 2 is an explanatory diagram of an example of a structure data expressing method used in the present invention.

FIG. 3 is a flowchart illustrating an example of a data input process.

FIG. 4 is a flowchart illustrating a part of a process of searching for a parent.

FIG. 5 is an explanatory diagram of a method for determining a structural position.

FIG. 6 is a flowchart illustrating another example of the data input process.

FIG. 7 is a flowchart illustrating a part of a process of searching for a parent in another example.

FIG. 8 is a flowchart illustrating an example of a data output process.

FIG. 9 is a flowchart illustrating a part of a component output process.

FIG. 10 is a block diagram of a conventional structural data processing device.

FIG. 11 is an explanatory diagram of a conventional structure data expressing method.

[Explanation of symbols]

1 structural data processing device, 2 data input means, 3 structural data processing means, 4 editing means, 5 search means, 6 display means, 7 input means, 8 data output means, 9 structure position determination means, 10 external devices.

Claims (2)

(57) [Claims] 1. A structural data processing apparatus for processing structural data having a tree structure, wherein constituent elements serving as nodes of the structural data have structural depth information as numerical data, and are arranged in a depth-first order. Inputting means for receiving the sequential data and converting the data into a tree-structured data, and the component based on the numerical value indicated by the structural depth information of the component of the sequential data input at the time of conversion by the data inputting means. A structure data processing apparatus comprising: a structure position determining unit that searches for a constituent element that is a parent of the system and determines a structure position. 2. A structural data processing apparatus for processing structural data having a tree structure, wherein the structural elements are traced in a depth-first order based on the data of the tree structure, and numerical values are designated as structural positional information for each of the structural elements. A structural data processing apparatus comprising: data output means for generating sequential data with depth information and outputting the sequential data.