JP5058729B2 - Classification data management system - Google Patents

Description

  The present invention relates to a classification data management system, and more particularly to a technique capable of efficiently managing classification data having a plurality of hierarchical structures from the highest level to the lowest level.

In order to facilitate the positioning of individual organisms as a whole and comparison with other species, classification attributes with hierarchical structures such as gates, classes, eyes, families, and genera are assigned to each organism, and the classification system is illustrated. This has been done widely from the 18th century to the present day.
In addition, for large corporate groups and administrative organizations, complex organizations such as “corporation → business headquarters → department → section” and “province → department → department → section → clerk” branch from the upper hierarchy to the lower hierarchy. A system has been formed, and the overview of the organization chart has been devised so that the position of a specific organization in the entire organization and the relationship with other organizations can be understood at a glance.
Alternatively, manufacturers that manufacture a large number of products organize and classify their products into multiple levels from various viewpoints, such as “electrical equipment → consumer goods → AV equipment → general use → DVD → model number”. As a result, the user can efficiently find the target product and related products by tracing the above hierarchy on the manufacturer's Web site, and can obtain support information and the like.
Story of classification system Internet URL: http://umiushi.zapto.org/Jpn/Class/Class.html Search date: July 2, 2007

When managing such hierarchical classification system information in a computer database, one method is realized by storing a record having a plurality of classification items ranging from the highest level to the lowest level in a table. .
FIG. 12 shows an example thereof, which is a table storing an organization system for each year of the company group. In this table, a large number of records having classification items of year, corporation, division, department, and section are registered. FIG. 3 represents a part of the organizational structure of the corporate group in a tree structure.

In this case, for example, when the year selection information “2006” is transmitted from the client terminal operated by the user, the list of corporate names of group companies existing in 2006 is transmitted from the server and displayed on the screen of the client terminal.
On the other hand, when the user selects Kosha, a list of divisions of Kosha in 2006 is displayed on the screen of the client terminal.
By repeating the above operation, the user can easily recognize the organizational structure of each company group in each year.

  However, in the conventional management method for recording the hierarchical structure by storing in the table a record having all the upper-lower classification items for each classification pattern in this way, the variation of the classification pattern is proportional to the increase. As a result, a lot of data duplication occurs in the upper classification items. In the case of FIG. 12, a comparatively simple classification system is exemplified, but in the case where both the number of layers and the number of classification items at the lowest level are enormous, such as the biological classification system, international patent classification, and international product classification, It reaches a level where the existence of duplicate data cannot be overlooked.

  In addition, if it is necessary to increase the classification hierarchy on the way, for example, when adding “Region” between “FY” and “Corporate”, add the “Region” column to the table. In this case, it is necessary to make a corresponding correction for the application program that uses the database.

As another method for managing the hierarchical classification system information in a computer database, illustration is omitted, but “FY-corporation master”, “Corporate-division master”, “Division-department master”, etc. Often, subdivided records are stored in a plurality of mutually related tables.
In this case, while duplication of data can be reduced, the number of tables increases as the hierarchy of the classification system increases, resulting in a problem that management becomes complicated.

  In addition, when it is necessary to increase the classification hierarchy on the way, for example, when adding “region” between “year” and “corporation”, “year-region master” and “region-corporation master”. Need to be newly established, and in this case, it is necessary to make a corresponding correction for the application program.

  The present invention has been devised in order to solve the above-described problem that the conventional classification data management system has, and can reduce the duplication of the upper classification items as much as possible, and also can increase the column of the classification system. Therefore, it is an object of the present invention to provide a classification data management technique that does not require the addition of a table or the addition of a table, and therefore does not require modification of a corresponding application program.

In order to achieve the above object, a classification data management system according to claim 1 includes a DB server having a classification table storing records defining a classification system, and a plurality of APs connected to the DB server via a network. A classification system information management system comprising a server, wherein the record of the classification table has a parent item describing a higher level classification attribute and a child item describing a lower level classification attribute directly connected thereto. When the classification attribute described in the child item of a record has a recursive structure described as the value of the parent item of the record related to another lower classification attribute, and the classification system is expressed in a tree structure For the record of the classification attribute that is the top node directly connected to the ROOT node, ROOT is set as the value of its parent item, and each AP server above is (1) the above DB server Issue a SQL statement to retrieve records that have ROOT as the parent item value stored in the above classification table, and (2) extract the child item values of each retrieved record and list the top node (3) Issue the SQL statement to the above DB server and get records that do not contain ROOT as the value of the parent item, and (4) The value of the parent item is common among the obtained records Processing to create a group with the parent item value as a common key part and each child item value as a member part, and (5) a group with a specific top-level node as a key part. In addition to extraction, a process of adding each group to the highest node, and (6) extracting a group using the value of the member part belonging to the added group as a key part, and making each group a classification attribute of the member part (7) splicing The group that uses the value of the member part that belongs to the selected group as a key part, and adds each group to the classification attribute of the member part until there is no group that uses the value of the member part as a key part Repeat the process to complete the tree structure under one top node on the memory, and (8) repeat the above steps (5) to (7) with respect to the other top nodes. The process of completing the subordinate tree structure in the memory, and (9) the classification attribute described in the tree structure classification system information generated on the memory is described as a folder name or file name, and each folder or file Processing to generate folder-file format classification system information in which files are arranged at the corresponding hierarchical positions of the above tree structure classification system, and store them on the hard disk; (10) If necessary, the necessary part of the classification system information in the folder-file format is restored on the memory as the classification system information of the tree structure, and the classification system information on the memory is referred to and It is characterized by executing a process for obtaining a classification attribute and (11) a process for outputting the classification attribute .
The above “output” corresponds to, for example, displaying on a display, printing out via a printer, or transmitting a screen generated by a server to a client terminal via a network.

The classification data management system according to claim 2 is the system according to claim 1 , and further, unique information for ensuring uniqueness is added to at least some of the classification attributes stored in the record. cage, when generating a classification scheme information of the tree structure, is characterized in that the unique information is deleted.

A classification data management system according to a third aspect is the system according to the second aspect , wherein the unique information is a serial number composed of numerical values that do not overlap each other.

The classification data management system according to claim 4 is the system according to claim 2 , wherein the unique information is route information obtained by connecting classification attributes positioned higher than the classification attributes. .

In the classification data management system according to claim 1, in each record stored in the classification table on the DB server side, the child item of the upper record becomes the parent item of the record of the next hierarchy, and the child item Since a so-called recursive data structure in which classification attributes are described is provided, duplication of data can be greatly reduced as compared with the case where classification attributes are defined in a flat table format. Even if it is necessary to increase the hierarchy of the classification system during the operation of the system, it is only necessary to add corresponding records and there is no need to add columns, so the flexibility of system change is improved. .
Also on the AP server side, multiple records that share the value of the parent item from the records received from the DB server are grouped with a common key part, and this group unit is added to the higher classification attribute. By adopting the method of repeating the above, it becomes possible to efficiently generate the tree structure classification system information from the classification table having a recursive data structure.
Furthermore, since the classification system information is stored in the folder-file format on the hard disk, even if the classification system information has a relatively large size, it is only necessary to restore the necessary parts individually to the memory. There is an advantage that it is possible to effectively avoid pressing.

The classification data management system according to any one of claims 2 to 4 includes a mechanism in which unique information such as a serial number or route information is added to the classification attribute stored in the record as necessary. Therefore, even when there are a plurality of mutually overlapping classification attributes, as a result of ensuring the uniqueness among the classification attributes, it is possible to generate correct tree-structured classification system information without causing misunderstanding of the classification attributes.

FIG. 1 is an overall configuration diagram of a classification data management system 10 according to the present invention, and this system 10 includes a plurality of AP servers 12, a DB server 14, and a load balancer (load balancer) 16. .
The load balancer 16 and each AP server 12, and each AP server 12 and DB server 14 are connected by a network.
A large number of client terminals 20 are connected to each AP server 12 via a network such as an intranet 18 or the Internet and a load balancer 16.

Each AP server 12 includes a data processing unit 22, a classification system information generation unit 24, a memory 26, and a hard disk (HDD) 27.
The hard disk 27 of each AP server 12 is set up with an OS and an application program dedicated to this system, and the CPU of the AP server 12 operates according to these programs, so that the above data processing unit 22 and classification system information generation Part 24 is realized.

The DB server 14 includes a DB management system (RDBMS) 28 and a classification table 30.
The DB management system 28 manages the classification table 30, and performs input / output of data stored in the table, update, predetermined calculation, and the like.

  The load balancer 16 serves to distribute the request transmitted from the client terminal 20 according to the load applied to each AP server 12.

  The client terminal 20 is composed of a computer such as a PC, and an application program such as a Web browser program is set up in addition to the OS.

FIG. 2 shows an example of the configuration of the classification table 30, in which a large number of records 36 having two data items, a parent ID (parent item) and a child ID (child item), are registered.
The classification table 30 defines a classification system having a hierarchical structure with a recursive data structure.

FIG. 3 represents the classification system defined in the classification table 30 in a tree structure, and the years “2005”, “2006”, and “2007” are arranged directly under the ROOT. In each fiscal year, corporate names such as “Kosha”, “Otosha”, and “Tatsumisha” are assigned, and each corporate name is “Information Division”, “Electricity Division”, “Machinery Division”. Business division names such as are arranged. In addition, department names such as “development department” and “information sales department” are arranged in each business department name. In addition, in each department name, a section name such as “hardware design section”, “software development section”, “domestic sales section 1”, “domestic sales section 2”, “overseas sales section”, etc. is arranged.
By referring to this classification system, it can be read that, for example, “Hardware Design Division” belonged to the Information Division-Development Division of Kosha in FY2006.

  In the conventional classification data management system, as shown in FIG. 11, such a classification system is expressed by providing classification items of year, corporation, division, department and section in each record. However, in the case of this system 10, an organization classification system is defined by a classification table 30 having two data items of a parent ID and a child ID.

  First, the top level connected to ROOT by three record groups A of “parent ID = ROOT, child ID = 2005”, “parent ID = ROOT, child ID = 2006”, “parent ID = ROOT, child ID = 2007”. Are classified into three classification attributes “2005”, “2006”, and “2007”.

  In addition, a record group B of “parent ID = 2006, child ID = 101_Company”, “parent ID = 2006, child ID = 102_Otosha”, “parent ID = 2006, child ID = 103_Company” This stipulates that the classification attributes connected to 2006 are “Kosha”, “Otosha”, and “Shosha”.

“101_” added in front of Company A, “102_” added in front of Company B, and “103_” added in front of Company H003 give each node (classification attribute) uniqueness. For the purpose, it is a serial number automatically assigned to the necessary data by the AP server 12.
That is, the company A is not limited to the year 2006, and may exist under the year 2005 or 2007, so the data processing unit 22 of the AP server 12 is distinguished from the company A in other years. Automatically assigns a unique serial number to the record 36 stored in the classification table 30 in advance.
Incidentally, 2005, 2006, and 2007 are the highest classification attributes connected to ROOT, and are inherently unique, so they are excluded from automatic serial number assignment.

Also, “Parent ID = 101_Kosha, Child ID = 104_Information Division”, “Parent ID = 101_Kosha, Child ID = 105_Electricity Division”, “Parent ID = 101_Kosha, Child The record group C of “ID = 106_machinery division” defines that the lower classification attributes connected to the company A are “information division”, “electrical division”, and “machine division”.
Again, “104_” added before the Information Division, “105_” added before the Electrical Division, and “106_” added before the Machinery Division give each node uniqueness. Therefore, it means a serial number automatically assigned to each data by the AP server 12.

In addition, a record group D of “parent ID = 104_information business department, child ID = 107_development department” and “parent ID = 104_information business department, child ID = 108_information sales department” is assigned to the information business department. It is specified that the subordinate classification attributes to be connected are “development department” and “information sales department”.
As described above, “107_” added before the development department and “108_” added before the information sales department are automatically taken into each data by the AP server 12 to give each node uniqueness. It is a serial number to be numbered.

In addition, the record group E of “parent ID = 107_development department, child ID = 109_hardware design section” and “parent ID = 107_development department, child ID = 110_software development section” leads to the development department. It is stipulated that the classification attributes are “hardware design section” and “software development section”.
“109_” added before the hardware design section and “110_” added before the software development section are automatically assigned to each data by the AP server 12 in order to give each node uniqueness as described above. It is a serial number that is numbered.

Furthermore, “parent ID = 108_information sales department, child ID = 111_domestic sales department 1”, “parent ID = 108_information sales department, child ID = 112_domestic sales department 2”, “parent ID = 108_ According to the record group F of the information sales department, child ID = 113_overseas sales section, the lower classification attributes connected to the information sales department are “domestic sales section 1”, “domestic sales section 2”, and “overseas sales section”. It is prescribed.
“111_” added before the Domestic Sales Division 1, “112_” added before the Domestic Sales Division 2, and “113_” added before the Overseas Sales Division are unique to each node as above. This is a serial number that is automatically assigned to each data by the AP server 12 in order to give a property.

Hereinafter, a processing procedure related to generation of classification system information by the AP server 12 will be described with reference to the flowchart of FIG.
First, the data processing unit 22 of the AP server 12 issues an SQL statement to the DB server 14 and obtains a record 36 whose parent is the ROOT node stored in the classification table 30 (S10).
Next, the classification system information generation unit 24 extracts the child values of the record 36, and generates a list of the highest nodes directly connected to the ROOT node (S12). Specifically, as shown in FIG. 5, “2005”, “2006”, and “2007” are recognized as the highest nodes.

  Next, the data processing unit 22 issues an SQL statement to the DB server 14 and acquires a record 36 not having the ROOT node as a parent from the classification table 30 in units of the highest node (S14).

  Next, the classification system information generating unit 24 collects the records 36 having a common parent and generates a group 38 (S16). As shown in FIG. 6, this group 38 has a common parent as a key part and each child as a member part.

  Next, the classification system information generation unit 24 refers to the key part of each group 38 and generates a list of parent nodes (S18). That is, a node that appears in any key part is determined as a parent node, and a node that never appears in the key part is excluded from the list as not being a parent node. This parent node list is later referred to when determining whether or not the child of each group corresponds to the parent of another group.

  Next, after selecting one of the highest nodes (S20), the classification system information generator 24 adds a lower node to the highest node to form a tree structure. Here, the description will proceed assuming that the tree structure under “2005” has already been completed and “2006” has been selected as the next processing target.

  First, the classification system information generation unit 24 searches for a group having “2006” as a parent (S22). As a result, the group 38a shown in FIG. 6A having “Kosha”, “Otosha”, and “Tatsuyasha” as members is extracted.

Next, the classification system information generation unit 24 refers to the parent node list generated in S18, and determines whether the member part of the group is the parent of another group (S24).
In this case, since “Kosha” or the like is a parent in the lower group 38b having “Information Business Department” or the like as a member part, a determination result of YES is obtained.
As a result, the classification system information generation unit 24 adds the group 38a in FIG. 6A as a branch to the 2006 tree (S26). At this time, the serial number assigned to each data is deleted by the classification system information generation unit 24 (the same applies hereinafter).

  Next, the classification system information generation unit 24 selects “Kosha” which is one of the child nodes belonging to this group (S28), and then searches for a group having “Kosha” as a parent (S30). As a result, the group 38b in FIG. 6B is extracted.

Next, the classification system information generation unit 24 refers to the parent node list generated in S18, and determines whether the member part of the group is the parent of another group (S32).
In this case, since the “information division” or the like is a parent in the lower group 38c having “development department” or the like as a member section, a determination result of YES is obtained.
As a result, the classification system information generation unit 24 adds the group 38b in FIG. 6B as a branch to the 2006 tree (S34).

  Next, the classification system information generation unit 24 selects an “information division” that is one of the child nodes belonging to this group (S36), and then searches for a group having this “information division” as a parent (S38). ). As a result, the group 38c in FIG. 6C is extracted.

Next, the classification system information generation unit 24 refers to the parent node list generated in S18, and determines whether the member part of the group is the parent of another group (S40).
In this case, the “development department” or the like is the parent in the lower group having “hardware design section” or the like as a member section, and therefore a determination result of YES is obtained.
As a result, the classification system information generation unit 24 adds the group 38c in FIG. 6C as a branch to the 2006 tree (S42).

  Next, the classification system information generation unit 24 selects a “development unit” that is one of the child nodes belonging to this group (S44), and then searches for a group having this “development unit” as a parent (S46). As a result, the group 38d in FIG. 6 (d) is extracted.

Next, the classification system information generation unit 24 refers to the parent node list generated in S18 and determines whether the member part of the group is the parent of another group (S48).
In this case, since the “hardware design section” and the “software development section” which are member parts of the “development department” are not parents in any other group, a determination result of NO is obtained.
As a result, the classification system information generation unit 24 adds the group 38d as a leaf to the Tree (S50).

  After completing the 2006-Kosha-Information Division-Development Division-Hardware Design Division and 2006-Kosha-Information Division-Development Division-Software Development Division lines (classification patterns) The classification system information generation unit 24 repeats the processing of S44 to S50, and adds a group having “Information Sales Department” as a key part to the Tree as a leaf, thereby adding “2006-Kosha-Information Division-Information Sales Department”. -"Domestic Sales Division 1", "2006-Kosha-Information Division-Information Sales Division-Domestic Sales Division 2" and "2006-Kosha-Information Division-Information Sales Division-Overseas Sales Division" ) Is completed (see FIG. 3).

After that, the classification system information generation unit 24 repeats the processes of S28 to S50 for “Otosha” and below and “Keisha” and below to complete the tree under “2006”.
Then, after the tree having “2006” as the highest node is completed, the classification system information generation unit 24 starts generating a tree having “2007” as the highest node.

  In addition, when it determines with No in said S24, S32, and S40 (when the child of a group is not a parent of another group), the classification system information generation part 24 adds a corresponding group to a Tree as a leaf, Stop deepening and move on to the next branch or leaf addition process.

  If it is determined to be Yes in the above S48 (when the child of the group is the parent of another group), the classification system information generation unit 24 adds the corresponding group to the Tree as a branch and constructs the next hierarchy. Migrate to

  In this way, the classification system information generation unit 24 determines whether a child of a certain group 38 is a parent or not a parent of another group 38, and whether to add as a branch or a leaf to the Tree depending on the result By adopting this method, the classification system information generation unit 24 can correctly reproduce the hierarchical structure even if the classification system hierarchy increases or decreases.

As described above, the classification system information generation unit 24 that has completed all the trees under the highest classification attribute in the memory 26, the classification system information in the folder-file format based on the classification system information of this tree structure. Is generated on the hard disk 27.
Specifically, as shown in FIG. 7, year folders 46 of “2005”, “2006”, and “2007” are created under the “ROOT” folder 44 of the hard disk 27, and corporate folders 48 ( "Company" etc.) is generated.
Further, the classification system information generation unit 24 generates a business unit folder 50 (such as “information business unit”) under each corporate folder 48.
Furthermore, the classification system information generation unit 24 generates a text file 52 having a file name (such as “development unit”) corresponding to the unit and stores it in the corresponding business unit folder 50.
In these text files 52, specific section names 54 (“hardware design section” and the like belonging to the section are described.

Next, according to the flowchart of FIG. 8, the presentation procedure of the classification system information by the system 10 will be described.
For example, when the AP server 12 receives a display request for classification system information specifying “2006” year from the client terminal 20 (S60), the data processing unit 22 displays the classification system information in the folder-file format formed on the hard disk 27. With reference to 42, the classification attributes of “Kosha”, “Otosha”, and “Toshisha” directly under “2006” are acquired (S62).
Next, the data processing unit 22 generates a Web page listing the classification attributes of “Kosha”, “Otosha”, and “Shosha” as options, and transmits them to the client terminal 20 (S64).

By repeating the processes of S60 to S64, the data processing unit 22 provides lower level classification system information to the user in stages.
That is, when the selection information of “Kosha” is transmitted from the client terminal 20, the data processing unit 22 refers to the classification system information 42, and the “Information Business Division”, “Electricity Business Division”, “Machine Business Division” The Web page describing the options is returned to the client terminal 20.
Next, when the selection information of “Information Division” is transmitted from the client terminal 20, the data processing unit 22 refers to the classification system information 42 and describes the options of “Development Department” and “Information Sales Department”. The web page is returned to the client terminal 20.
On the other hand, when the selection information of “development department” is transmitted from the client terminal 20, the data processing section 22 refers to the classification system information 42, and the Web in which “hardware design section” and “software development section” are described. The page is returned to the client terminal 20.

Through the series of operations described above, the user can comprehensively recognize the organizational structure of Kosha in FY2006.
Of course, instead of letting the user follow the classification system step by step to the final section level as described above, the data processing unit 22 describes the entire organizational structure of the company when the user selects Kosha. It is also possible to operate such that a generated Web page is generated and returned to the client terminal 20.

In this system 10, unlike the conventional method of registering records with classification items such as year, corporation, division, department, and section for each classification pattern, the upper child item becomes the parent item of the next hierarchy. Since the classification system is expressed by a recursive structure of designating (associating) lower classification attributes as child items, duplication of data in the upper classification items can be greatly reduced.
For example, when the classification system is recorded by the conventional method of FIG. 12, it is necessary to describe the year data “2006” by the number of all records related to 2006, but the classification table having the recursive structure of FIG. In the case of recording at 30, the data of “2006” only needs to be described once as a child of the number of corporations, which is a lower classification attribute + ROOT.

Further, even when it is necessary to increase the classification hierarchy during the operation of the system 10, there is an advantage that only the addition / deletion of records to the classification table 30 is required.
For example, as shown in Fig. 9, the regional classification of "Eastern Japan" and "Western Japan" is changed between the fiscal year classification of "2006" and the corporate classification of "Kosha", "Otosha", and "Tatsumisha". As shown in FIG. 10, the record group B composed of records “2006 / 101_Company”, “2006 / 102_Otosha”, and “2006 / 103_Company” is inserted. At the same time, the record group G including “2006 / 301_East Japan” and “2006 / 302_West Japan”, “301_East Japan / 101_Kosha”, “301_East Japan / 102_Otosha”, “302 All you need to do is add a record group H consisting of “_West Japan / 103_Shosha”.

  When adding a classification attribute to the lowest layer of the classification system (for example, adding “person” as a subordinate category of “section”), the illustration is omitted, but “109_hardware design section / 401_technical information” "Recorder", "109_Hardware Design Section / 402_Patenter", etc. Records that describe the lowermost category attribute so far in the parent item and the category attribute that forms a new hierarchy in the child item May be added to the classification table 30.

  Thus, since it is not necessary to add a column to the classification table 30 when increasing the hierarchy of the classification system, it is not necessary to make a large correction on the application program side, and the flexibility of system modification is improved.

  Note that when adding a new record 36 to the classification table 30, the data processing unit 22 of the AP server 12 refers to the classification table 30 to check the last serial number, and a serial number after this (not necessarily the serial number immediately after) It is not necessary to be a certain interval, and a certain interval may be provided) is automatically given to the necessary data.

  Alternatively, a serial number management table is provided in the DB server 14, and when assigning a new serial number, the AP server 12 refers to this and adds the value of the final serial number +1 to the record 36. You may comprise. In this case, the AP server 12 updates the final value of the serial number management table with the latest serial number.

  As described above, the classification system information of the tree structure once built on the memory 26 is converted into the classification system information of the folder-file format and stored in the hard disk 27. However, there is an advantage that it is possible to effectively avoid instantaneously squeezing the memory 26 of the AP server 12 because it is only necessary to restore the necessary parts individually to the memory, but the number of classification attributes (number of records 36) is When the number is relatively small, the data processing unit 22 may be configured to refer to the tree-structured classification system information generated on the memory 26 as it is.

  FIG. 11 shows another configuration example of the classification table 30, instead of automatically assigning sequential numbers such as “101_” and “102_” in order to ensure the uniqueness of each node (classification attribute). The feature is that the route information of the upper node is given to the necessary data by the data processing unit 22 of the AP server 12.

For example, if “2006_” is added before “Kosha”, such as “2006_Kosha”, it becomes clear that the company is under 2006. Can be identified.
In addition, by adding “2006 Kosha_” in front of “Information Division” as in “2006 Kosha_Information Division”, it becomes clear that the information division is under 2006 × Kosha. Even if there is an information division under the control of 2006 x B, both can be identified.

The route information is deleted by the classification system information generation unit 24 at the timing when the tree-structured classification system information is generated on the memory 26, as in the case of the classification table 30 of the serial number assignment method.
In addition, when the classification system needs to be changed during the operation of the system, and when the record 36 is added to or deleted from the classification table 30, the data processing unit 22 of the AP server 12 Rewriting of data path information is executed.

  Needless to say, when there is no possibility that the same value is duplicated between the classification attributes, it is not necessary to add the serial number or the route information to the classification attribute of the record 36 as described above.

1 is an overall configuration diagram of a classification data management system according to the present invention. It is a figure which shows the structural example of a classification table. It is the figure which expressed the classification system prescribed | regulated by the classification table by the tree structure. It is a flowchart which shows the production | generation procedure of classification system information. It is a figure which shows the process which produces | generates the classification | category system information of a tree structure. It is a figure which shows the production | generation process of a group. It is a figure which shows the classification system information of a folder file format. It is a flowchart which shows the presentation procedure of classification system information. It is a figure which shows the example which adds a new hierarchy to the classification system expressed by the tree structure. It is a figure which shows the example which adds and deletes a record with respect to a classification table. It is a figure which shows the other structural example of a classification table. It is a figure which shows the structural example of the classification table in the conventional classification data management system.

Explanation of symbols

10 Classification data management system
12 AP server
14 DB server
16 Load balancer
18 Intranet
20 Client terminal
22 Data processing section
24 Classification system information generator
26 memory
27 Hard disk
28 DB management system
30 Classification table
36 records
38 groups
42 Folder-file format classification system information
44 Root folder
46 year folder
48 Corporate folder
50 division folders
52 Text file
54 Section name

Claims (4)

A classification system information management system comprising a DB server having a classification table storing records defining a classification system and a plurality of AP servers connected to the DB server via a network,
A record in the above classification table has a parent item in which a higher level classification attribute is described and a child item in which a lower level classification attribute directly connected thereto is described, and the classification attribute described in the child item of a certain record Has a recursive structure that is described as the value of the parent item of the record related to other subordinate classification attributes, and the classification attribute that becomes the top node directly connected to the ROOT node when the classification system is expressed in a tree structure For the record of, ROOT is set as the value of its parent item,
Each of the above AP servers
(1) A process for issuing a SQL statement to the DB server and acquiring a record having ROOT stored as a parent item value in the classification table;
(2) Extracting the value of the child item of each acquired record and generating a list of the top node,
(3) Processing to issue a SQL statement to the above DB server and obtain a record that does not contain ROOT as a parent item value;
(4) Collecting records having the same parent item value among the acquired records, generating a group having the parent item value as a common key part and each child item value as a member part,
(5) extracting a group having a specific top node as a key part and adding each group to the top node;
(6) extracting a group using the value of the member part belonging to the added group as a key part, and adding each group to the classification attribute of the member part;
(7) Extracting a group that uses the value of the member part belonging to the added group as a key part and adding each group to the classification attribute of the member part is a group that uses the value of the member part as a key part. It repeats until it no longer exists, and completes the tree structure under one top node in memory,
(8) By repeating the processes (5) to (7) above for the other highest node, the process for completing all the tree structures under the highest node on the memory;
(9) The classification attribute described in the tree structure classification system information generated on the memory is described as a folder name or file name, and each folder or file is placed in the corresponding hierarchical position of the tree structure classification system. Processing to generate the classification system information of the folder-file format arranged in the file and store it on the hard disk,
(10) When specific classification information is input, the necessary part of the above classification system information in the folder-file format is restored on the memory as the classification system information of the tree structure, and the classification system information on this memory is referred to Then, processing for obtaining the classification attribute under the classification attribute,
(11) Processing to output this classification attribute;
The classification data management system characterized by executing . Unique information for ensuring uniqueness is added to at least some of the classification attributes stored in the record,
Classification data management system of claim 1, in generating the classification scheme information of the tree structure, characterized in that the unique information is deleted. The classification data management system according to claim 2 , wherein the unique information is a serial number composed of numerical values that do not overlap each other. 3. The classification data management system according to claim 2 , wherein the unique information is route information obtained by connecting classification attributes positioned higher than the classification attributes.

Images