JP4045283B2 - Data management apparatus and data management method - Google Patents

Description

  The present invention relates to a data management apparatus, and more particularly to a data management apparatus and method having a hierarchical structure of data.

  As a method for managing data having a hierarchical structure, a method for managing hierarchical structure data described in an Extensible markup language (XML) is known. For example, there is a method of managing with RDB (Relational Database) and OODB (Object Oriented Database).

FIG. 33 is a diagram illustrating an example of a data structure in the hierarchical structure data.
In the figure, each data has a parent-child relationship. For example, if sales management 2201 is a parent, product 2202, customer 2203, and sales 2204 are children. If the product 2202 is a parent, the product name 2205 and the product price 2206 are children. Further, when the sales management 2201 is a parent, a product name 2205 and a product price 2206, which are children of the product 2202 as a child, become grandchildren. The parent and child are connected by a line called a branch.

  FIG. 34 is a diagram showing an example of data values arranged for the product 2202, product name 2205, and product price 2206 in the data structure shown in FIG. As shown in FIG. 34, four data, product A 2301, product B 2302, product C 2303, and product D 2304, are set for product 2202. In the child data of the product A 2301, “AAA” 2305 is set in the product name 2205 having a child structure of the product 2202, and “30000” 2309 is set in the product price 2206. Similarly, “BBB” 2306 and “60000” 2310 are set as the child data of the product B 2302. “CCC” 2307 and “20000” 2311 are set as the child data of the product C2303. “ABC” 2308 and “70000” 2312 are set as the child data of the product D2304. In this way, a plurality of data is set for each data structure shown in FIG. 33 as shown in FIG.

As such a hierarchical data management method, there is a method of expressing the hierarchical structure relationship of hierarchical data as a table (for example, Patent Document 1).
Japanese Patent Laid-Open No. 10-240741

  However, in the conventional hierarchical data management method, when searching for data for a plurality of conditions, a table storing the relationship of the hierarchical structure of hierarchical data in the middle of performing the next search from the search result for the first condition Therefore, it is necessary to check the relationship of the corresponding data every time, and there is a problem that it takes time to search.

  FIG. 35 is a flowchart of the search operation of the conventional hierarchical data management method. For example, in the data structure of the hierarchical structure data shown in FIG. 33 and the data values shown in FIG. 1. “A” is added to the product name 2205; A case will be described in which a product 2202 that satisfies the two conditions that the product price 2206 is 50,000 yen or more is searched.

  First, the search condition 1. And 2. Is input (S21). Next, all data corresponding to the product name 2205 is acquired (S22). That is, data 2305 to 2308 are acquired. Data with “A” is acquired from the acquired data 2305 to 2308 (S23). That is, “AAA” 2305 and “ABC” 2308 are acquired. Further, search condition 2. In order to perform a search (No in S24), the search condition 1. Data corresponding to the structure of the product price 2206 corresponding to the data narrowed down in is acquired (S22). That is, data 2309 and 2312 are acquired. At this time, in the conventional data management method, the table storing the relationship of the hierarchical structure and the search condition 1. It is necessary to determine the data of the corresponding product price 2206 from the unique ID possessed by the data narrowed down in (1). Next, data having a data value of 50000 or more is acquired from the data 2309 and 2312 (S23). That is, the data 2312 whose data value is “70000” is acquired. Since the search based on the two search conditions is completed (Yes in S24), the product A2301 that is the parent data of the data 2312 is displayed as the search result (S25). At this time, in order to determine the product A 2301 from the data 2312, it is necessary to use a table indicating the relationship of the hierarchical structure. As described above, the conventional hierarchical data management method requires checking the relation of the corresponding data from the table storing the relation of the hierarchical structure of the hierarchical data in the middle of the search, and the search takes time. There is a problem that it takes.

  Therefore, an object of the present invention is to provide a data management apparatus and a data management method that can search hierarchical structure data at high speed.

  In order to achieve the above object, a data management apparatus according to the present invention comprises a structure storage means for storing a plurality of structure data defining a hierarchical structure, and a data storage for storing a plurality of value data corresponding to each structure data. And data search means for searching for the value data corresponding to the search target and search condition input by the user, wherein the value data has a parent-child relationship in a hierarchical structure defined by the structure data. And the data storage means stores a tree ID for identifying data having a parent-child relationship between two or more generations included in the plurality of value data as one tree, and the data search means Search using the tree ID.

  Thus, by using the tree ID for data search, data corresponding to the search target and search condition input by the user can be searched at high speed only from the value data.

  The plurality of structure data includes a structure ID for uniquely determining each structure data and a parent structure ID indicating a structure ID of parent data of each structure data.

  The hierarchical value data includes a plurality of value data, a data ID for uniquely determining each value data, a parent data ID indicating a data ID of parent data of each value data, and each value data. And the structure ID of the corresponding structure data.

  As a result, the data structure can be easily changed simply by changing the structure data. Therefore, the data management apparatus can be used not only for data management having a specific data structure but also for general-purpose and wide-use data management. Further, since the structure ID 901 is included in the value data, information on the structure data corresponding to the value data is included. This ensures that the value data is data corresponding to the structure defined by the structure data. That is, it is possible to prevent the user from arranging data that does not correspond to the structure by mistake.

  In addition, the data search means acquires value data corresponding to the search target, acquires a tree ID of each acquired value data, narrows down the value data having each acquired tree ID, The search is performed under the search condition, and the value data having the tree ID of each searched value data is output as a search result.

  Thereby, since the search result is output in units of tree IDs, a list of data including valid information can be immediately output from the search result.

  The data management device further includes data inquiry means for inquiring information specified by a user from the structure data and value data, and the data inquiry means is included in value data corresponding to the information specified by the user. To obtain the first value data, obtain the structure data having the structure ID of the first value data as the parent structure ID, obtain one or more value data having the structure ID of the obtained structure data, and Hierarchical structure data is created from one value data and the one or more value data, and the created hierarchical structure data is displayed.

Further, value data having the same parent data ID has the same tree ID.
Thereby, since the same tree ID is set for the value data having the same parent, the data inquiry means does not monitor the change of the tree ID when inquiring the child data from the parent data. Only changes should be monitored. Therefore, the processing amount of the data inquiry unit is reduced, and the inquiry operation can be processed at high speed.

  In addition, the data management device further includes an editing unit that edits the value data and the structure data, and when the first user is editing data by the editing unit, the second user edits the data. Exclusive control means for performing exclusive control so that it cannot be performed, and the exclusive control means performs exclusive control in units of data IDs.

  Further, the plurality of value data includes value data having a tree value of another value data as a data value, and the inquiry means inquires about the value data having a tree ID of the other value data as a data value. As a result, the data value of the value data having the tree ID is referenced and output.

  Thus, by using the tree ID, other data can be easily referred to without using a plurality of tables or join statements as in the prior art.

  The plurality of structural data includes virtual type data that defines a relationship with other structural data and does not have corresponding value data in the data storage unit, and the inquiry means includes the virtual type data. The query result is output according to the definition of the relationship with the structure data.

  As a result, information that is not actually stored can be displayed in the data storage unit, and data to be stored can be reduced.

  The virtual type data includes virtual type data defining information in which the value data is referred to by other value data, and the inquiry means includes the referenced value data as the referenced value data. The information referenced from is output as a query result.

  As a result, information that is not actually stored in the data storage unit and that is referred to by other data can be displayed, and the data to be stored can be reduced.

  Note that the present invention can be realized not only as such a data management apparatus but also as a data management method using characteristic means included in the data management apparatus as a step. Can be realized as a program that can be executed by a computer. Needless to say, such a program can be distributed via a recording medium such as a CD-ROM or a transmission medium such as the Internet.

  The present invention can provide a data management apparatus and method for retrieving hierarchical structure data at high speed.

  Embodiments of a data management apparatus according to the present invention will be described below in detail with reference to the drawings.

(Embodiment 1)
First, the configuration of the data management apparatus in the present embodiment will be described.

  FIG. 1 is a diagram showing a configuration of a data management system including a data management apparatus according to the present embodiment.

  A data management system 5 shown in FIG. 1 is a system that manages data of hierarchical structure data, and includes a data management device 1, user terminals 2 and 3, and a network 4.

The data management device 1 is connected to user terminals 2 and 3 via a network 4.
The data management device 1 is accessed from the plurality of user terminals 2 and 3.

FIG. 2 is a diagram illustrating a block configuration of the data management apparatus 1.
The data management device 1 is a device that inquires, searches, and edits hierarchical structure data, and includes an IO control unit 10, a user authentication unit 11, a data storage unit 12, a structure storage unit 14, and a data inquiry unit 16. A tree search unit 17, a data editing unit 18, a structure editing unit 19, and an exclusive control unit 20.

  The IO control unit 10 is a communication interface that controls access performed by the user terminal 2 via the network 5 and controls output of data to the user terminal 2 via the network 5.

The user authentication unit 11 authenticates a user who has accessed the data management apparatus 1.
The data storage unit 12 is a hard disk or the like that stores value data 13 that defines data values of hierarchical structure data.

  The structure storage unit 14 is a hard disk or the like that stores structure data 15 that defines the structure of hierarchical structure data.

  The data inquiry unit 16 forms hierarchical structure data from the value data 13 and the structure data 15 stored in the data storage unit 12 and the structure storage unit 14, and outputs them to the IO control unit 10.

  The tree search unit 17 searches for specific data from the value data 13 and the structure data 15 stored in the data storage unit 12 and the structure storage unit 14 and outputs them to the data inquiry unit 16.

The data editing unit 18 edits the value data 13 stored in the data storage unit 12.
The structure editing unit 19 edits the structure data 15 stored in the structure storage unit 14.

  The exclusive control unit 20 monitors whether the data editing unit 18 and the structure editing unit 19 are editing the value data 13 and the structure data 15. When the value data 13 and the structure data 15 are edited, the exclusive control unit 20 can edit the data being edited by a user other than the user who is editing. Do not.

  Next, the data format of the hierarchical structure data stored in the data management apparatus 1 in this embodiment will be described.

FIG. 3 is a diagram illustrating an example of a relationship between a parent and a child in the structure data 15.
As shown in FIG. 3, for example, three children of a sales date 31, a customer 32, and a total amount 33 are configured in a hierarchy below the parent sales 30. Hereinafter, a data structure including a parent and a child in hierarchical structure data as shown in FIG. 3 is referred to as a tree structure definition.

FIG. 4 is a diagram showing actual information stored in accordance with the tree structure definition shown in FIG.
As shown in FIG. 4, for example, “sales A” 41 is set as the value of sales 30 shown in FIG. 3, “2005/7/10” 42 is set as the value of sales date 31, and the value of customer 32 "Taro Yamamoto" 43 is set, and "50000" 44 is set as the value of the total amount 32. Hereinafter, actual information stored in accordance with the tree structure definition as shown in FIG. 4 is referred to as tree structure data.

  A plurality of tree structure data can be set for one tree structure definition. FIG. 5 is a diagram showing an example in which three tree structure data are set in accordance with the tree structure definition shown in FIG. Hereinafter, a plurality of information set according to one tree structure definition as shown in FIG. 5 is referred to as forest structure data. That is, the forest structure data is a set of tree structure data.

FIG. 6 is a diagram illustrating an example of a data structure in the structure data 15.
As shown in FIG. 6, a product 61, a customer 62, and a sales 63 are set as children for a sales management 60 that is one root. If the product 61 is a parent, a product name 64 and a product price 65 are set as children. Here, the product 61, the product name 64, and the product price 65 form a tree structure definition 77. Similarly, the customer 62, customer name 66, customer address 67 and sales history 68 form a tree structure definition 78. Thus, a hierarchical structure is formed as a collection of a plurality of tree structure definitions. Hereinafter, a collection of tree structure definitions as shown in FIG. 6 is referred to as a forest structure definition.

FIG. 7 is a diagram showing actual information stored in accordance with the forest structure definition shown in FIG.
As shown in FIG. 7, forest structure data is set according to each tree structure. For example, “SH-00A” is set for the product 61 of the tree structure definition 77 shown in FIG. 6, “Product A” is set for the product name 64, and “500000” is set for the product price 65. . Hereinafter, as shown in FIG. 7, the stored information is referred to as forest structure data in accordance with the forest structure definition.

  The data management device 1 manages the hierarchical structure data by storing the forest structure definition and the forest structure data. The forest structure definition is stored as structure data 15 in the structure storage unit 14. The forest structure data is stored as value data 13 in the data storage unit 12.

Hereinafter, the data format of the structure data 15 stored in the structure storage unit 14 will be described.
FIG. 9 is a diagram illustrating an example of the structure data 15.

  The structure data 15 includes a structure ID 901, a parent structure ID 902, a structure name 903, a structure type 904, a structure section 905, and definition information 906.

  The structure ID 901 is an ID for uniquely specifying the structure of each data, and an individual structure ID 901 is set for each data structure.

  The parent structure ID 902 is the structure ID 901 of the data structure corresponding to the parent of the structure of each data. As the parent structure ID 902, the structure ID 901 that has already been stored in the structure storage unit 14 as the structure data 15 must be specified. Further, the data structure of the uppermost layer does not have a parent structure ID 902.

In the structure name 903, the name of the structure of each data is set.
The structure type 904 indicates the structure type of each data, and is classified into the following three structure types 904.

1. This is the type of data structure that is the parent of the tree structure, and the corresponding information is stored as value data 13 in the data storage unit 12 (hereinafter referred to as “forest type”).
2. Corresponding information is not stored as value data 13 in the data storage unit 12 but is created in the data inquiry unit 16 (hereinafter referred to as “virtual type”). For example, information referenced from formulas and other data.
3. Above 1. And 2. The corresponding information is stored in the data storage unit 12 as value data 13.
(Hereinafter referred to as “value type”). For example, text and numbers.

  A structural section 905 indicates a structural section of the structural type 904. The structure whose structure type 904 is “value type” is classified into the following four structure sections 905.

1. “Root”: The data structure at the top level of the forest structure data (the root portion at the top), and there is only one structure and data. Also, the structure whose structure classification 905 is “root” does not have a parent structure. A structure whose structure section 905 is “root” has a structure type 904 of “root”.
Child structures of “value type”, “forest type” and “virtual type” can be set.
2. "Field": A child structure can be set. A plurality of data can be set for the parent data as the data corresponding to the structure of the field “structure” 905.
3. “Record link”: Data reference corresponding to another structure can be set. Structural division 9
For the structure with 05 “record link”, the structure ID 902 of the structure to be referred to is set.
Also, the child structure cannot be set.
4). “Directory”: A child structure having a structure type 904 of “value type” and “virtual type” can be set. Only one piece of data corresponding to the structure of the directory “directory” can be set.

  The structure type 904 is “forest type”, and the following structure classification 905 is set.

1. “Record”: A child structure having a structure type 904 of “value type”, “forest type”, and “virtual type” can be set. A plurality of data can be set for the parent data for the data corresponding to the structure whose structure classification 905 is “record”.

  In addition, the structure whose structure type 904 is “virtual type” is classified into the following three structure sections 905.

1. “Recorded link”: It is set that the structure classification 905 is referenced from the structure of “record link”. A structure ID 901 of a structure that refers to data corresponding to its own structure is set.
2. “Ancestral data”: own ancestor data (parent data, parent data of parent data, etc.)
Can be displayed. The structure ID 901 of the ancestor structure is set for the structure whose structure classification 905 is “ancestor data”.
3. “Calculation field”: Displays the calculation result of the set calculation formula. The structure ID of a structure in which numerical data is set as data is set in the calculation formula.

  The definition information 906 includes a minimum occurrence count, a maximum occurrence count, a data type (for example, a binary file such as a character, a numerical value, a date, an image), a virtual display content (for example, a mathematical expression and other data) And related information such as security information is set.

  The minimum number of occurrences and the maximum number of occurrences set in the definition information 906 define the number of child data set in the parent data. That is, the minimum number of occurrences is defined as the minimum number that the value data 13 having the data structure must exist for the parent data. The maximum number of occurrences is defined as the maximum number of value data 13 having the data structure that must exist for the parent data. For example, in the tree structure shown in FIG. 10, “name” 82 defines minimum occurrence count = 1 and maximum occurrence count = 1. As a result, when data is set for “customer” 81, data must be set for name 82. Also, two or more data cannot be set. Further, the minimum occurrence count = 0 and the maximum occurrence count = 3 are set in the base 83. Thus, even when data is set for “customer” 81, data corresponding to base 83 need not be set. Further, up to three pieces of data corresponding to the base 83 may be set. 11 is a diagram showing an example of tree structure data corresponding to the tree structure shown in FIG. For example, in the tree structure data 91 shown in FIG. 11, “Taro Yamamoto” is set in “Name” 82, and no data is set in “Base” 83. In the tree structure data 92, “Taro Yamamoto” is set in “Name” 82, and “Home” is set in “Base” 83. In the tree structure data 93, “Taro Yamamoto” is set in the “Name” 82, and two data “Home” and “Work” are set in the “Base” 83. In this way, by setting the minimum number of occurrences and the maximum number of occurrences in the definition information 906, it is possible to prevent the user from accidentally setting data that does not match the structure.

Next, the data format of the value data 13 stored in the data storage unit 12 will be described.
FIG. 12 is a diagram illustrating an example of the value data 13.

  The value data 13 has a data ID 1001, a parent data ID 1002, a structure ID 901, a tree ID 1003, and a value 1004.

  The data ID 1001 is an ID that uniquely identifies each data, and an individual data ID 1001 is set for each data.

  The parent data ID 1002 is a data ID 1001 of data corresponding to the parent of each data. For the parent data ID 1002, the data ID 1001 of the data already stored as the value data 13 of the data storage unit 12 must be specified. Further, the uppermost layer data does not have a parent data ID 1002.

  The structure ID 901 is the structure ID 901 of the structure data 15 stored in the structure storage unit 14. Here, the structure ID 901 of the structure corresponding to each data is set. The structure ID 901 of the value data 13 cannot specify the structure ID 901 of which the structure type 904 is a virtual structure.

  Tree ID 1003 is an ID for identifying data having a parent-child relationship between two or more generations as one tree. That is, it is an ID for recognizing data of a specific generation as one tree among parent data, child data, grandchild data, and data corresponding to descendants. As the tree ID 1003, when the structure type 904 of each data structure is a forest type, a new ID that is not already set in the value data 13 of the data storage unit 12 is set. If the structure type 904 of each data structure is other than the forest type, the tree ID 1003 is set to the tree ID 1003 of the parent data. That is, by setting the structure type 904 having a child structure to a value type or a forest type, it is possible to set a data range in which the same tree ID 1003 is set. For example, as shown in FIG. 8, a tree ID 1003 is set in the hierarchical structure data. The numbers in the figure indicate the tree ID 1003 set for each data.

  A value 1004 is an actual data value stored in each data. In the value 1004, binary files such as characters, numerical values, dates, images, and other data tree IDs 1003 are set.

  As described above, the data management device 1 according to the present embodiment has two data, that is, the value data 13 and the structure data 15. As a result, the data structure can be easily changed simply by changing the structure data 15. In the conventional data management apparatus, when the information format changes, the storage definition information in the related database must be changed. That is, it is necessary to rewrite a table indicating related column definition information. On the other hand, in the data management apparatus 1 according to the present embodiment, the data structure can be added by adding one line of data to the structure data 15 shown in FIG. That is, the data structure can be easily changed. As a result, the data management apparatus 1 in the present embodiment can be used not only for data management having a specific data structure but also for data management for a wide range of uses.

  Further, the value data 13 includes a structure ID 901. That is, the value data 13 includes information on the corresponding structure data 15. This ensures that the value data 13 is data corresponding to the structure defined by the structure data 15. In the conventional data management apparatus, unintended data may be stored. For example, as shown in FIG. 34, “AAA” 2305 corresponding to the product name 2205 as the data structure is arranged as child data of the product A 2301. In the conventional data management apparatus, there is a possibility that unrelated data such as the customer name A is arranged as the data corresponding to the product name 2205, for example. On the other hand, since the data management apparatus 1 in the present embodiment includes information on the structure data 15 corresponding to the value data 13, data that does not correspond to the structure is not arranged. That is, it is possible to prevent the user from arranging data that does not correspond to the structure by mistake.

  When a large number of users modify information at the same time, it is necessary to perform exclusive control so that other users cannot modify the data while a user is modifying a part of the data. Each data of the value data 13 has three IDs of a data ID 1001, a structure ID 901, and a tree ID 1003. Thereby, the exclusive control part 20 can perform exclusive control by data ID1001 unit, structure ID901 unit, and tree ID unit 1003. FIG. That is, exclusive control can be performed in units suitable for the purpose. Therefore, exclusive control can be performed more easily than in the past.

  Next, the inquiry operation of hierarchical data by the data management apparatus 1 in this embodiment will be described.

  FIG. 13 is a flowchart of the inquiry operation of the hierarchical data stored in the data management device 1.

  First, the user terminal 2 accesses the IO control unit 10 of the data management device 1 via the network 5 (S1).

  For user access, the user authentication unit 11 authenticates the user (S2). For example, the user is authenticated by comparing the input user ID and password with the user data stored in the user authentication unit 11. Further, the user authentication unit 11 determines a group to which the user belongs from the user data, and sends information on data that can be inquired or edited by the user to the data inquiry unit 16, the data editing unit 18, and the structure editing unit 19.

  FIG. 14 shows an example of user data stored in the user authentication unit 11. The user data includes a user name 1401, a password 1402, and a group 1403. For example, as shown in FIG. 14, “tanaka” is set as the user name 1401 and “2181” is set as the password 1402 in the user data 1404. Further, “system administrator” is set as the group 1403. For example, the user “tanaka” is permitted to inquire and edit all data. Further, “group A user” is set in the group 1403 of the user data 1405, and for example, inquiry of data belonging to the group A and editing of the value data 13 are permitted. “Group B administrator” is set in the group 1403 of the user data 1406, and for example, inquiry of data belonging to the group B, editing of the value data 13 and editing of the structure data 15 are permitted. Further, which value data 13 and structure data 15 can be inquired or edited by a user belonging to which group 1403 is stored as security information in the definition information 906 of the structure data 15.

If it is not an authorized user (No in S2), access is denied.
When the correct user ID and password are input (Yes in S2), access is permitted. FIG. 15 is a diagram illustrating an example of the top page screen of the data management apparatus 1.

  A data ID 1001 of data to be queried by the user is input (S3). For example, the input of the data ID 1001 is input by clicking the corresponding item on the Web page. Here, a case where data ID = 14-5 is input will be described. Further, it is assumed that the value data 13 illustrated in FIG. 12 is stored in the data storage unit 12. Assume that the structure data shown in FIG. 9 is stored in the structure storage unit 14. In this case, for example, the order 1201 is clicked on the top page screen shown in FIG.

  The data inquiry unit 16 acquires data 1005 corresponding to the input data ID = 14-5 from the data storage unit 12 (S4).

  Since the structure ID 901 of the data 1005 is S14, the data inquiry unit 16 acquires the data structures 907, 908, and 909 whose parent structure ID 903 is S14 from the structure storage unit 14 (S5).

  The data inquiry unit 16 determines whether or not the structure type 904 of the acquired data structures 907, 908, and 909 is a virtual type (S6).

  Since the structure type 904 of the acquired data structures 907 and 908 is a value type and the structure type 904 of the data structure 909 is a forest type (No in S6), the data inquiry unit 16 uses the structures 907, 908, and 909. Data corresponding to each structure ID 901 is acquired from the data storage unit 12. That is, since the structure ID 901 of the structure 907 is S141, the data inquiry unit 16 acquires data 1006 having S141 in the structure ID 901 from the data storage unit 12. Further, since the structure ID 901 of the structure 908 is S142, the data inquiry unit 16 acquires data 1007 having S142 in the structure ID 901 from the data storage unit 12. In addition, since the structure ID 901 of the structure 909 is S143, the data inquiry unit 16 acquires data 1008 and 1009 having S143 in the structure ID 901 (S7).

  The data inquiry unit 16 arranges the data 1006, 1007, 1008, and 1009 acquired in step S7, one level below the data 1005 acquired in step S4. Thereby, the hierarchical structure data shown in FIG. 16 is created (S8).

  Next, it is determined whether or not all the hierarchical structure data has been acquired (S9). Since the data 1008 and 1009 have child data (No in S9), the data inquiry unit 16 performs the processing of steps S3 to S5 using the data ID 1001 = 143-6 of the data 1008 as the input data ID. In step S5, the data inquiry unit 16 acquires data structures 910, 911, 912, and 913 having the structure ID 901 = S143 of the data 1008 as the parent structure ID 902.

  Since the structure type 904 of the acquired data structures 910, 911, and 912 is a value type (No in S6), the data inquiry unit 16 uses the structure IDs 901 of the data structures 910, 911, and 912, S1432, S1433, Data 1010 to 1015 having the same structure ID 901 as S1434 are acquired.

  Here, in the data structure 908, the structure classification 905 is “record link”, and “S13 tree ID” is set as the definition information 906. The value 1004 of the data 1007 corresponding to the data structure 908 is set to “T3”. Thus, by setting the tree ID 1003 of other data to the value 1004, other data can be referred to. That is, “KK-00A” that is the value 1004 of the data 1016 is referred to as the data 1007. Also, the tree ID 1003 = T3 and the data 1017 and 1018 arranged in the lower layer of the data 1016 can be referred to from the data 1007. Similarly, in the data structure 1431, the structure classification 905 is “record link”, and “S12 tree ID” is set as the definition information 906. The values 1004 of the data 1010 and 1013 corresponding to the data structure 1431 are “T1” and “T2”. Therefore, the data 1010 refers to the data 1019 to 1021 with the tree ID 1003 = T1. The data 1013 refers to data 1022 to 1024 in which the tree ID 1003 = T2. As described above, the data management apparatus 1 can easily refer to other data by using the tree ID 1003 without using a plurality of tables or join statements as in the prior art.

  Since the structure type 904 of the data structure 913 acquired in step S5 is a virtual type (Yes in S6), the data inquiry unit 16 creates data according to the definition information of the data structure 913. Since the structure classification 905 of the structure 913 is “calculation field”, the data inquiry unit 16 outputs the calculation result of the mathematical formula set in the definition information 906. That is, the data inquiry unit 16 adds the value 1004 = 3 of the data 1011 having the structure ID 901 = S1432 and the value 1004 of the data 1012 having the structure ID 901 = S1433 to S1432 × S1433 which is the definition information 906 of the data structure 913. = 450,000 is substituted. As a result, the data inquiry unit 16 creates the value 1004 = 3 × 450,000 = 1350000 of the data structure 913. Similarly, the value 1004 = 4 of the data 1014 having the structure ID 901 = S1432 and the value 1004 = 300000 of the data 1015 having the structure ID 901 = S1433 are substituted into S1432 × S1433 which is the definition information of the data configuration 913. As a result, the data inquiry unit 16 creates the value 1004 = 3 × 450,000 = 12,000,000 of the data structure 913 (S10). As described above, the structure type 904 is a virtual type, and the structure classification 905 uses the structure of the data of “calculation field”, so that even if data is not stored in the value data 13 stored in the data storage unit 12, By simply setting a mathematical expression in the structure data 15, a value can be displayed as a calculation result of the mathematical expression at the time of inquiry. Thereby, the data amount of the value data 13 stored in the data storage unit 12 can be reduced.

  The data inquiry unit 16 places the data 1010 to 1015 acquired in S7 and the value of the virtual data created in S10 in the data structures 910 to 913 acquired in step S5. Thereby, the hierarchical structure shown in FIG. 17 is created (S8).

  Since all the data of the hierarchical structure data has been arranged (Yes in S9), the process ends. The hierarchical structure data created in step S8 is displayed as a query result on the user terminal 2 via the IO control unit 10 and the network 5. For example, a Web page screen as shown in FIG. 18 is displayed.

  In the above description of the inquiry operation, data having a mathematical expression defined as data structure 913 has been described as virtual data, but in addition to this, virtual data indicating that data is referenced from other data There is type data. For example, in the data structure 914 shown in FIG. 9, the structure type 904 is a virtual type, the structure classification 905 is “recorded link”, and the definition information 906 is set to “S 142 indicates itself”. In the structure 908 of data with structure ID 901 = S142, the structure classification 905 is “record link”, and “S13 tree ID” is set in the definition information. A data structure 915 that is a parent structure of the data structure 914 has a structure ID 901 = S13. That is, the data structure 915 corresponding to the parent structure of the data structure 914 whose structure classification 905 is “recorded link” is referenced from the data structure 908. Therefore, the data structure 914 can determine which data the parent structure 915 is referenced from the information of the data 1007 corresponding to the data structure 908 referring to the parent structure 915. For example, since the tree ID 1003 = T5 of the data 1006, it is understood that the own tree ID 1003 = T3 is referenced from the tree ID 1003 = T5. In this way, by using the data structure in which the structure type 904 is a virtual type and the structure classification 905 is “recorded link”, which parent data and data having the same tree ID 1003 as the parent data are referred to from which data Can be displayed. Accordingly, by setting which structure is referred to in the structure data 15 without creating data in the value data 13 stored in the data storage unit 12, the parent data and the parent data can be set. It is possible to display from which data data having the same tree ID 1003 is referenced. Thereby, the data amount of the value data 13 stored in the data storage unit 12 can be reduced.

Next, the search operation of the data management apparatus 1 in this embodiment will be described.
FIG. 19 is a flowchart of the search operation of the data management apparatus 1 in this embodiment.

  In the search operation of the data management apparatus 1 in the present embodiment, the tree ID 1003 of data that matches the search target and the search condition is acquired from the data storage unit 12. As a result, the tree search unit 17 can process the data storage unit 12 with a combination of simple search commands, so that the search can be performed at high speed.

FIG. 20 is a diagram illustrating an example of the value data 13 stored in the data storage unit 12.
Hereinafter, the search of the value data 13 shown in FIG. 20 will be described. It is assumed that the structure data 15 illustrated in FIG. 9 is stored in the structure storage unit 14.

  A search target and search conditions are input by the user (S11). For example, the search target is a product. Further, it is assumed that the search condition includes a product price of 400,000 or more, and “A” is included in the product name.

  The tree search unit 17 acquires product data to be searched from the value data 13 shown in FIG. 20 (S12). That is, since the structure ID 901 of the product is S12, data 1701, 1704, 1707, 1710, 1713, 1716, 1719, and 1722 with the structure ID 901 = S12 are acquired as shown in FIG.

  The tree search unit 17 acquires tree IDs 1003 = T1 to T8 of the acquired data 1701, 1704, 1707, 1710, 1713, 1716, 1719, and 1722. The tree search unit 17 acquires data 1701 to 1724 corresponding to the acquired tree ID 1003 = T1 to T8 for the value data 13 of FIG. 20 (S13).

  The tree search unit 17 acquires the product price data of the search condition value = 400000 or more from the acquired data 1701-1724 (S14). That is, the tree search unit 17 obtains data 1703, 1706, 1709, 1712, 1715, 1718, 1721, and 1724 with the structure ID 901 = S122 because the structure price 901 is S122. Furthermore, as shown in FIG. 22, the tree search unit 17 obtains data 1703, 1709, 1718 and 1721 having a value of 400,000 or more among the data 1703, 1706, 1709, 1712, 1715, 1718, 1721 and 1724. To do.

  The tree search unit 17 determines whether or not the search is performed under all the conditions for the search condition input in S11 (S15). In this case (No in S15), the search is subsequently performed under a search condition of a product including “A” in the product name.

  The tree search unit 17 acquires T1, T3, T6, and T7, which are the tree IDs 1003 of the data 1703, 1709, 1718, and 1721 shown in FIG. The tree search unit 17 acquires data 1701 to 1703, 1707 to 1709, and 1716 to 1721 corresponding to the acquired tree ID 1003 T1, T3, T6, and T7 with respect to the value data 13 illustrated in FIG. 20 (S13). .

  The tree search unit 17 acquires data 1702, 1708, 1717, and 1721 having the same structure ID 901 as the product name structure ID 901 = S121 among the acquired data 1701-1703, 1707-1709, and 1716-1721. Further, as shown in FIG. 23, the tree search unit 17 acquires data 1702 and 1720 including “A” in the value among the data 1702, 1708, 1717, and 1721 (S14).

  As described above, the tree search unit 17 performs the search using the search condition in step S14 after narrowing down by the tree ID 1003 in step S13. Thereby, the data having the structure of the second search condition corresponding to the data narrowed down by the first search can be easily narrowed down from the tree ID 1003 and the structure ID 901. Therefore, the tree search unit 17 can search at a high speed for a plurality of search conditions. In the example of the search operation described above, there are two types of search conditions. However, if the number of items in the search conditions increases, the data management apparatus 1 can perform a search more effectively.

  Since the data narrowing has been completed for all the search conditions input in step S11 (Yes in S15), the tree search unit 17 outputs the search result to the data inquiry unit 16. The data inquiry unit 16 inquires data corresponding to the search result, and outputs it to the user terminal 2 via the IO control unit 10 and the network 5 (S16). FIG. 24 is a diagram showing an example of a search result output display screen of the data management apparatus 1. As shown in FIG. 24, the search results are displayed as products of T1 and T7 which are tree IDs 1003 of data 1702 and 1720 shown in FIG. That is, data 1701 and 1719 and child data 1702, 1703, 1720, and 1721 of data 1701 and data 1719 are displayed in units of tree ID 1003. As described above, the tree search unit 17 outputs the search result in units of the tree ID 1003, so that a list of data including valid information can be immediately output from the search result.

  In the above description, the same tree ID 1003 is set for data having a two-generation parent-child relationship (consisting only of parent data and child data). However, depending on the type of data, there is a case where sufficient information cannot be output even if only parent data and child data are output as search results.

  FIG. 25 and FIG. 26 are diagrams showing an example of the structure data 15. FIG. 27 is a diagram showing value data 13 corresponding to the structure data 15 shown in FIG. FIG. 28 is a diagram showing value data 13 corresponding to the structure data 15 shown in FIG.

  In the structure data 15 shown in FIG. 25, the structure type 904 of the structure 2401 is a forest type, whereas in the structure data 15 shown in FIG. 26, the structure type 904 of the structure 2501 is a value type. Thereby, T3 is set in the tree ID 1003 of the data 2601 and 2602 shown in FIG. 27, and T4 is set in the tree ID 1003 of the data 2603 to 2605. On the other hand, T3 is set in the tree ID 1003 of the data 2701 to 2705 shown in FIG. That is, by setting the structure type 904 of the parent data to the forest type or the value type, the range of the tree having the same tree ID 1003 is changed. Also, the value data 13 shown in FIGS. 27 and 28 are both arranged as data shown in FIG.

  For example, a case will be described in which search is performed on the value data 13 in FIGS. 27 and 28 under the condition of telephone number. In the value data 13 of FIG. 27, the tree ID 1003 = T4 is acquired from the data 2605 corresponding to the telephone number. As a result, as shown in FIG. 30, data 2603 to 2605 with tree ID 1003 = T4 are displayed as search results. However, if the user wants to know the customer's name from the phone number, this information is not sufficient. On the other hand, in the value data 13 of FIG. 28, the tree ID 1003 = T3 is acquired from the data 2705 corresponding to the telephone number. As a result, as shown in FIG. 29, data 2701 to 2705 of tree ID 1003 = T3 are displayed as search results. Therefore, the user can obtain necessary information immediately. In this way, by changing the structure type 904, one tree ID 1003 can be set for arbitrary tree data. Thereby, a necessary data group can be output immediately as a search result.

  As described above, the data management apparatus 1 in the present embodiment narrows down data by the tree ID 1003 in the hierarchical structure data search operation. Thereby, even when there is a search under a plurality of conditions, the search range can be easily narrowed down and the search can be performed at high speed. In addition, since the data management apparatus 1 according to the present embodiment outputs a search result for each tree ID 1003, it is possible to immediately output a list of data including valid information from the search result. In addition, the data management apparatus 1 according to the present embodiment can easily refer to other data without using a plurality of tables or join statements as in the prior art by using the tree ID. Further, since the structural type 904 uses virtual data, information that is not actually stored can be displayed in the data storage unit 12. Thereby, the data amount of the value data 13 stored in the data storage unit 12 can be reduced. Further, the data management device 1 in the present embodiment has two data, that is, value data 13 and structure data 15. As a result, the data structure can be easily changed simply by changing the structure data. Therefore, the data management apparatus 1 in the present embodiment can be used not only for data management having a specific data structure but also for data management for a wide range of uses. Further, the value data 13 includes information on the corresponding structure data 15. This ensures that the value data 13 is data corresponding to the structure defined by the structure data 15. That is, it is possible to prevent the user from arranging data that does not correspond to the structure by mistake. Furthermore, by using the tree ID 1003, the data management apparatus 1 according to the present embodiment can perform exclusive control in units of trees and easily perform exclusive control.

  Although the data management apparatus according to the embodiment of the present invention has been described above, the present invention is not limited to this embodiment.

  For example, in FIG. 1, two user terminals are connected to the network, but the number of user terminals is not limited to this.

  Moreover, although the said embodiment uses the method in which a user accesses a web page via a network and uses a data management apparatus, it saves to a hard disk of a terminal as software, or CD-ROM etc. It may be used via an information recording medium.

(Embodiment 2)
In the value data 13 of the data management device 1 in the first embodiment, when a plurality of child data is set for the parent data, the structure ID 901 and the tree ID 1003 may be different between the child data. For example, in the value data 13 shown in FIG. 12, the data 1007 has a structure ID 901 = S142 and a tree ID 1003 = T5. The data 1008 has a structure ID 901 = S143 and a tree ID 1003 = T6. As described above, when the structure ID 901 and the tree ID 1003 of data having the same parent are sometimes different, the following problem occurs. In the inquiry operation by the data inquiry unit 16, when referring to a plurality of child data of the parent data, it is necessary to always monitor both the structure ID 901 and the tree ID 1003. As a result, the processing amount of the data inquiry unit 16 increases, and there is a problem that the inquiry operation cannot be processed at high speed.

  In the second embodiment, the data management apparatus 1 that can process the inquiry operation at high speed without the structure ID 901 and the tree ID 1003 of data having the same parent being different from each other will be described. Note that a description of the same configuration and operation as in the first embodiment will be omitted.

  In the first embodiment, the four classifications are shown as the structural classification 905 having the structure of the “value type” structure type 904. However, in the second embodiment, the fifth classification shown below is added.

5. “Table”: Only one child structure whose structure type 904 is “forest type” can be set. Only one piece of data corresponding to the structure of “table” can be set.

  Further, in the second embodiment, the definition of “record” that is the structure classification 905 of the structure whose structure type is “forest type” is changed as follows.

1. “Record”: A child structure having a structure type 904 of “value type” and “virtual type” can be set.
For the data corresponding to the structure whose structure classification 905 is “record”, a plurality of data can be set for the parent data.

  Furthermore, in the second embodiment, the definition of the “root” in the structural section 905 is changed as follows.

1. “Root”: The data structure at the top level of the forest structure data (the root portion at the top), and there is only one structure and data. Also, the structure whose structure classification 905 is “root” does not have a parent structure. A structure whose structure section 905 is “root” has a structure type 904 of “root”.
Child structures of “value type” and “virtual type” can be set.

FIG. 31 is a diagram illustrating an example of the structure data 15 in the second embodiment.
In Embodiment 1 shown in FIG. 9, a forest type is set as the structure type 904 of the structure 909. A structure 3101 and a structure 3102 illustrated in FIG. 31 correspond to the structure 909. A “value type” is set in the structure type 904 of the structure 3101, and a “table” is set in the structure category 905. In addition, “forest type” is set in the structure type 904 of the structure 3102, and “record” is set in the structure category 905. As described above, in the second embodiment, the structure type 904 is “value type” and the structure classification 905 is “table”, compared to the structure in which “forest type” is set as the structure type 904 in the first embodiment. A structure is set, and a structure 3102 with a structure type 904 of “forest type” is set as a child structure of the structure 3101 with a structure section 905 of “table”.

FIG. 32 is a diagram showing value data 13 corresponding to the structure data 15 shown in FIG.
As shown in FIG. 32, the data 3201 corresponding to the structure 3101 having the structure classification 905 “table” has a tree ID 1003 = T5, and the same tree ID 1003 as the data 3203 and 3204 having the same parent data 3202 as a parent is set. . In this way, since the same tree ID 1003 is set for data having the same parent, the data inquiry unit 16 does not monitor the change of the tree ID 1003 when inquiring the child data from the parent data. Only changes should be monitored. Therefore, the processing amount of the data inquiry unit 16 is reduced, and the inquiry operation can be processed at high speed.

  The present invention can be applied to a data management apparatus and method, and in particular to a data management apparatus and method having hierarchical structure data.

It is a figure which shows the structure of the data management system containing the data management apparatus in this Embodiment. 2 is a diagram showing a block configuration of a data management device 1. FIG. It is a figure which shows an example of a tree structure definition. It is a figure which shows an example of tree structure data. It is a figure which shows an example of forest structure data. It is a figure which shows an example of a forest structure definition. It is a figure which shows an example of forest structure data. It is a figure which shows the example of a setting of tree ID. 4 is a diagram illustrating an example of structure data 15. FIG. It is a figure which shows an example of a tree structure definition. It is a figure which shows an example of tree structure data. It is a figure which shows an example of the value data. 3 is a flowchart of an inquiry operation of the data management device 1. It is a figure which shows an example of user data. 3 is a diagram illustrating an example of a top page screen of the data management device 1. FIG. It is a figure which shows the hierarchical structure data arrange | positioned by inquiry operation | movement. It is a figure which shows the hierarchical structure data arrange | positioned by inquiry operation | movement. It is a figure which shows an example of the screen which displays the hierarchical structure data arrange | positioned by inquiry operation | movement. 3 is a flowchart of a search operation of the data management device 1. It is a figure which shows an example of the value data. It is a figure which shows the value data 13 narrowed down by search operation. It is a figure which shows the value data 13 narrowed down by search operation. It is a figure which shows the value data 13 narrowed down by search operation. It is a figure which shows an example of the screen which displays a search result. 4 is a diagram illustrating an example of structure data 15. FIG. 4 is a diagram illustrating an example of structure data 15. FIG. It is a figure which shows the value data 13 corresponding to the structure data 15 of FIG. It is a figure which shows the value data 13 corresponding to the structure data 15 of FIG. It is a figure which shows the hierarchical structure data corresponding to the value data 13 of FIG. 27 and FIG. It is a figure which shows the search result with respect to the value data 13 of FIG. It is a figure which shows an example of the structure data 15 in Embodiment 2. FIG. It is a figure which shows an example of the value data 13 in Embodiment 2. FIG. It is a figure which shows the structure of the conventional hierarchical structure data. It is a figure which shows the data of the conventional hierarchical structure data. It is a flowchart of the search operation | movement of the conventional data management apparatus.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Data management device 2, 3 User terminal 4 Network 5 Data management system 10 IO control part 11 User authentication part 12 Data storage part 13 Value data 14 Structure storage part 15 Structure data 16 Data inquiry part 17 Tree search part 18 Data edit part 19 Structure editing unit 20 Exclusive control unit 30 to 33, 60 to 75, 81 to 83, 906 to 915, 2201 to 2208, 2401, 2501, 3101 to 1033 Structure 41 to 44, 1005 to 1024, 1701 to 1724, 2301 to 2312 , 2601 to 2605, 2701 to 2705, 3201 to 3204 Data 77, 78 Tree structure definition 91 to 93 Tree structure data 901 Structure ID
902 Parent structure ID
903 Structure name 904 Structure type 905 Structure classification 906 Definition information 1001 Data ID
1002 Parent data ID
1003 Tree ID
1004 Value 1401 User name 1402 Password 1403 Group 1404 to 1406 User data

Claims (13)

Structure storage means for storing a plurality of structure data defining a hierarchical structure as a table ;
Data storage means for storing a plurality of value data corresponding to each structure data as a table different from the table stored in the structure storage means ;
Data search means for searching for the value data corresponding to the search target and search condition input by the user,
The value data has a parent-child relationship with each other in the hierarchical structure defined by the structure data,
Each of the structural data is
Having a structure ID that uniquely determines the structure data;
Each value data is
Data values that are text, numbers, or images;
An identifier for identifying data having a parent-child relationship between two or more generations included in the plurality of value data as one tree, and the same for value data having a parent-child relationship between two or more generations and wood ID that of value is given,
A data ID for uniquely determining the value data;
And the structure ID of the structure data corresponding to the value data,
The search target is information indicating a structure ID of one structure data having child structure data among the plurality of structure data.
The search condition is:
First information indicating a structure ID of structure data in a hierarchy below the search target;
Second value indicating a condition of the data value of the value data having the structure ID indicated by the first information;
The data search means includes
Gets a value data have a more structured ID indicated in the search target,
Gets the tree ID to each value data obtained has,
Have a respective tree ID obtained, and refine the values data that have a structure ID indicated by the first information,
A data management device , wherein value data having a data value satisfying a condition indicated by the second information is searched from the narrowed value data. Each structural data further includes:
The data management apparatus according to claim 1, further comprising a parent structure ID indicating a structure ID of parent data of each structure data. Each value data further includes:
The data management device according to claim 2, further comprising a parent data ID indicating a data ID of parent data of each value data. When the search condition includes a first search condition and a second search condition each having the first information and the second information , the data search means
Gets a value data have a more structured ID indicated in the search target,
Gets the tree ID to each value data obtained has,
Have a respective tree ID obtained, and refine the values data having a structure ID indicated by the first information the first search condition has,
Among the refined value data, search for value data having a data value that satisfies the condition indicated by the second information of the first search condition,
It gets the tree ID with each value data search,
Have a respective tree ID obtained, and refine the values data having a structure ID indicated by the first information the second search condition has,
Among the refined value data, search for value data having a data value that satisfies the condition indicated by the second information that the second search condition has ,
The data management apparatus according to claim 3, wherein value data having a tree ID included in each value data searched under the second search condition is output as a search result. The data management device further includes:
Data inquiry means for inquiring information on the data ID designated by the user from the structure data and the value data;
The data inquiry means includes
Obtaining first value data having a data ID designated by the user ;
Obtain structure data having the structure ID of the first value data as the parent structure ID,
Obtaining one or more value data having a structure ID of the obtained structure data;
Creating hierarchical structure data from the first value data and the one or more value data;
The data management apparatus according to claim 3 or 4, wherein the created hierarchical structure data is displayed. The data management apparatus according to claim 5, wherein the value data having the same parent data ID has the same tree ID. The data management device further includes:
Editing means for editing the value data and the structure data;
An exclusive control means for performing exclusive control so that the second user cannot edit when the first user is editing data by the editing means,
The data management apparatus according to claim 3, 4, 5, or 6, wherein the exclusive control unit performs exclusive control in units of tree IDs. The plurality of value data includes value data whose data value is a tree ID of other value data,
The inquiry means refers to and outputs the data value of the value data having the tree ID as a result of inquiry of the value data having the tree ID of the other value data as a data value. 6. The data management device according to 6. The plurality of structure data includes virtual type data that defines a relationship with other structure data and does not have corresponding value data in the data storage unit,
The data management apparatus according to claim 8, wherein the inquiry means outputs an inquiry result in accordance with a definition of a relationship between the virtual data and other structure data. The virtual type data includes virtual type data defining information in which the value data is referred to by other value data,
The data management apparatus according to claim 9, wherein the inquiry unit outputs, as an inquiry result, information in which the referenced value data is referred to from the referenced value data. A structure storing step for storing a plurality of structure data defining a hierarchical structure as a table ;
A data storage step of storing a plurality of value data corresponding to each structure data as a table different from the table stored in the structure storage means ;
A data management method in which a computer executes a data search step of searching for the value data corresponding to a search target and a search condition input by a user,
The value data has a parent-child relationship with each other in the hierarchical structure defined by the structure data,
Each of the structural data is
Having a structure ID that uniquely determines the structure data;
Each value data is
Data values that are text, numbers, or images;
An identifier for identifying data having a parent-child relationship between two or more generations included in the plurality of value data as one tree, and the same for value data having a parent-child relationship between two or more generations and wood ID that of value is given,
A data ID for uniquely determining the value data;
And the structure ID of the structure data corresponding to the value data,
The search target is information indicating a structure ID of one structure data having child structure data among the plurality of structure data.
The search condition is:
First information indicating a structure ID of structure data in a hierarchy below the search target;
Second value indicating a condition of the data value of the value data having the structure ID indicated by the first information;
In the data search step, a computer
Gets a value data have a more structured ID indicated in the search target,
Gets the tree ID to each value data obtained has,
Have a respective tree ID obtained, and refine the values data that have a structure ID indicated by the first information,
A data management method comprising: searching for value data having a data value satisfying the condition indicated by the second information from the narrowed value data. A structure storing step for storing a plurality of structure data defining a hierarchical structure as a table ;
A data storage step of storing a plurality of value data corresponding to each structure data as a table different from the table stored in the structure storage means ;
A data search step for searching for the value data corresponding to the search target and search condition entered by the user,
The value data has a parent-child relationship with each other in the hierarchical structure defined by the structure data,
Each of the structural data is
Having a structure ID that uniquely determines the structure data;
Each value data is
Data values that are text, numbers, or images;
An identifier for identifying data having a parent-child relationship between two or more generations included in the plurality of value data as one tree, and the same for value data having a parent-child relationship between two or more generations and wood ID that of value is given,
A data ID for uniquely determining the value data;
And the structure ID of the structure data corresponding to the value data,
The search target is information indicating a structure ID of one structure data having child structure data among the plurality of structure data.
The search condition is:
First information indicating a structure ID of structure data in a hierarchy below the search target;
Second value indicating a condition of the data value of the value data having the structure ID indicated by the first information;
In the data search step,
Gets a value data have a more structured ID indicated in the search target,
Gets the tree ID to each value data obtained has,
Have a respective tree ID obtained, and refine the values data that have a structure ID indicated by the first information,
A program for causing a computer to execute a data management method for searching for value data having a data value satisfying a condition indicated by the second information among the narrowed value data. A structure storing step for storing a plurality of structure data defining a hierarchical structure as a table ;
A data storage step of storing a plurality of value data corresponding to each structure data as a table different from the table stored in the structure storage means ;
A data search step for searching for the value data corresponding to the search target and search condition entered by the user,
The value data has a parent-child relationship with each other in the hierarchical structure defined by the structure data,
Each of the structural data is
Having a structure ID that uniquely determines the structure data;
Each value data is
Data values that are text, numbers, or images;
An identifier for identifying data having a parent-child relationship between two or more generations included in the plurality of value data as one tree, and the same for value data having a parent-child relationship between two or more generations and wood ID that of value is given,
A data ID for uniquely determining the value data;
And the structure ID of the structure data corresponding to the value data,
The search target is information indicating a structure ID of one structure data having child structure data among the plurality of structure data.
The search condition is:
First information indicating a structure ID of structure data in a hierarchy below the search target;
Second value indicating a condition of the data value of the value data having the structure ID indicated by the first information;
In the data search step,
Gets a value data have a more structured ID indicated in the search target,
Gets the tree ID to each value data obtained has,
Have a respective tree ID obtained, and refine the values data that have a structure ID indicated by the first information,
A computer-readable recording medium storing a program for causing a computer to execute a data management method for searching for value data having a data value satisfying a condition indicated by the second information among the narrowed value data.

Images