Database cooperation system, method and program
Patent Information
- Application Number
- JP2024097637
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2024-06-17
- Publication Date
- 2026-01-05
Smart Images

Figure 2026000341000001_ABST
Abstract
Description
[Technical Field]
[0001] An embodiment of the present invention relates to a database linking technology for multiple subsystems with different code systems. [Background technology]
[0002] Nuclear power plants are promoting the realization of CPS (Cyber-Physical System) and are proceeding with the digitization of processes, design information, and plant data related to the lifecycle.Each design department is examining services to utilize digitized assets and improve the value of the plant, and is proceeding with the development of software and the construction of databases.
[0003] In order to increase the added value of these digitized assets, the systems must be able to link together. Generally, the method of linking databases in multiple systems involves a subsystem corresponding to each system and an overseeing system that connects the subsystems. [Prior art documents] [Patent documents]
[0004] [Patent Document 1] Japanese Patent Application Publication No. 2023-113953 Summary of the Invention [Problem to be solved by the invention]
[0005] However, if multiple subsystems are each built with their own unique code system, the databases they each have cannot be linked together. In such cases, the databases in the subsystems can be linked by converting the unique code systems into a common code system. However, even if the code system is standardized through conversion processing, searches still require accessing each subsystem individually and in sequence, making data linking inefficient.
[0006] The embodiments of the present invention have been made in consideration of these circumstances, and aim to provide a database linkage technology that enables efficient cross-sectional searches across multiple subsystems that are constructed separately using unique code systems. [Means for solving the problem]
[0007] a receiving unit that receives a search request from a client terminal; an extraction unit that extracts the nth unique code associated with the common code included in the search request from the first table and transmits the extracted nth unique code to the obtaining unit identified by the nth identifier; and a reply unit that collects the stored data obtained from the nth database (n=1 to N) and returns the extracted stored data to the client terminal. [Effects of the Invention]
[0008] The embodiments of the present invention provide a database linkage technology that efficiently searches across multiple subsystems that are constructed separately using unique code systems. [Brief explanation of the drawings]
[0009] [Figure 1] FIG. 1 is a diagram illustrating the configuration of a database linkage system according to each embodiment of the present invention. [Figure 2] FIG. 1 is a logical configuration diagram of a database linkage system according to a first embodiment. [Figure 3] FIG. 10 is a logical configuration diagram of a database linkage system according to a second embodiment. [Figure 4]FIG. 4 is a sequence diagram illustrating an initial setting flow in the database linkage method and database linkage program according to each embodiment. [Figure 5] FIG. 4 is a sequence diagram illustrating a search flow in the database linkage method and database linkage program according to each embodiment. DETAILED DESCRIPTION OF THE INVENTION
[0010] (First embodiment) Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. FIG. 1 is a diagram showing the equipment configuration of a database linkage system 10 (hereinafter simply referred to as "linkage system 10") according to each embodiment of the present invention. FIG. 2 is a diagram showing the logical configuration of a database linkage system 10A (10) according to the first embodiment. This linkage system 10 can be constructed in an environment of internal networks 16 (16a, 16b, 16c, 16d) interconnected to an external network 15 via routers 17 (17a, 17b, 17c, 17d).
[0011] The terminal 22 (client terminal 22) on the client side 11 searches a plurality of n-th databases 50 on the server side 12 using the common code 28 included in the search request 25 (FIG. 2) as a search key. n (n=1 to N) and retrieve the corresponding stored data 24. n Each of the nth control unit 40 (n=1 to N) is constructed with a separate unique code system different from the common code 28. n is the corresponding n-th unique code 51 n This allows the stored data 24 to be directly searched.
[0012] The control unit 20, the master database 35 and its management unit 30 are connected to a plurality of subsystems 18. n (n=1~N) nth database 50 n The nth control unit 40 is added later to enable cross-sectional search of the stored data 24. n Collaboration Department 41 n(Figure 2) can also be retrofitted to existing specifications that allow direct individual searches of stored data 24.
[0013] Although the example in which the control unit 20, the master database 35, and its management unit 30 are constructed on a common internal network 16 is shown, they may be constructed on separate internal networks 16. Also, the components of the management unit 30 may be incorporated into the control unit 20. Also, the control unit 20 and the management unit 30 are connected to the nth control unit 40. n However, they may be built on a common internal network 16.
[0014] As shown in FIG. 2, the linkage system 10A (10) includes the n-th unique code 51 n (n=1~N) for the nth database 50 n and acquires the associated stored data 24. n and server terminal 21 n By command from the nth database 50 n From nth unique code 51 n a collection unit 43 that collects the n-th unique code 51; n nth database 50 n nth identifier 48 n and an associating unit 44 for associating the common code 28.
[0015] Furthermore, the database linkage system 10A (10) stores the associated n-th unique code 51 n , nth identifier 48 n a first registration unit 37 that registers a data set of the common code 28 in a first table 31; a reception unit 26 that receives a search request 25 from a client terminal 22; and an n-th unique code 51 that is related to the common code 28 included in the search request 25. n is extracted from the first table 31 and the n-th identifier 48 n The acquisition unit 42 identified by n an extraction unit 36 that transmits the n-th database 50 n and a reply unit 27 that collects the stored data 24 acquired from the client terminals 22 (n=1 to N) and returns the data to the client terminals 22.
[0016] nth control unit 40 n Each of the (n=1 to N) is a link unit 41 n and Acquisition Section 42 n and a server terminal 21 n and n database 50 n By having such a combination, a specific n-th unique code 51 n The subsystem 18 in which the stored data 24 is managed n can be successively added to the internal network 16.
[0017] nth database 50 n In the example, a plurality of stored data 24 are stored in an n-th unique code 51 that identifies each piece of attribute information. n The acquisition unit 42 stores the n is the n-th unique code 51 received from the management unit 30 n The nth database 50 n and send this n-th unique code 51 n Then, the acquisition unit 42 acquires the stored data 24 associated with the n The acquired stored data 24 is returned to the client terminal 22 via the control unit 20.
[0018] Collaboration Department 41 n is the server terminal 21 n Under the command of the nth database 50 n From nth unique code 51 n The collection unit 43 collects these n-th unique codes 51 n The common code 28 is a unique code 51 having common attribute information. n (n=1 to N) into one. In other words, the definition section 45 is a definition of the n-th unique code 51 which has common attribute information but different notations. n When each of the (n=1 to N) inputs is entered, the same common code 28 is output.
[0019] nth unique code 51 n Subsystem 18n (n=1 to N) is defined based on the attribute information in accordance with the unique criteria. n Although they are defined by different standards, the labels tend to have similarities to each other.
[0020] Here, the n-th unique code 51 having the same attribute information is n (n=1 to N) will be used to explain an example of how to define a unified common code 28. n nth unique code 51 with similar symbols among (n=1 to N) n The conversion rule 47 converts the n-th database 50 into a unified common code 28. n n-th unique code collected from 51 n is defined to the common code 28 based on the conversion rule 47. Furthermore, the association unit 44 converts the collected n-th unique code 51 n , nth database 50 n nth identifier 48 n and associates the defined common code 28.
[0021] Then, in the management unit 30, the first registration unit 37 registers the associated n-th unique code 51 n , nth identifier 48 n and the data set of the common code 28 is registered in the first table 31. Furthermore, the management unit 30, in the extraction unit 36, acquires the common code 28 included in the search request 25 received from the client terminal 22 via the receiving unit 26 of the control unit 20. Then, the n-th unique code 51 related to this common code 28 is n is extracted from the first table 31 and the associated nth identifier 48 n The acquisition unit 42 identified by n is sent to.
[0022] In the control unit 20, when the receiving unit 26 receives the search request 25 from the client terminal 22, the stored data 24 linked to the common code 28 included therein is transmitted to the nth control unit 40. n(n=1 to N), and then returns these to the client terminal 22 after accumulating them.
[0023] By the way, the nth unique code 51 has common attribute information but different notation. n Regarding a method of defining a unified common code 28 from (n=1 to N), a method other than using the above-mentioned conversion rule 47 will be exemplified. First, a predetermined common code 28 and an n-th unique code 51 n Furthermore, the n-th identifier 48 n nth unique code related to 51 n Based on the n-th naming model learned from the dataset, the n-th unique code 51 corresponding to the common code 28 is n The nth identifier 48 n One way to define it is to associate it with the
[0024] (Second embodiment) Next, a second embodiment of the present invention will be described with reference to Fig. 3. Fig. 3 is a logical configuration diagram of a database linkage system 10B (10) according to the second embodiment. The database linkage system 10B of the second embodiment has a configuration in which a second registration unit 38, a second table 32, and a reference unit 39 are further added to the configuration of the first embodiment described above. In Fig. 3, parts having the same configuration or function as those in Fig. 1 are indicated by the same reference numerals, and duplicated explanations will be omitted.
[0025] The second registration unit 38 of the management unit 30 registers all the defined common codes 28 in the second table 32. That is, the nth control unit 40 n The common codes 28 defined in all of the definition sections 45 (n=1 to N) are registered in the second table 32 after eliminating duplication.
[0026] The reference unit 39 of the management unit 30 then acquires the common code 28 included in the search request 25 received from the client terminal 22 via the receiving unit 26 of the control unit 20. The reference unit 39 then refers to the second table 32, and if no matching common code 28 is found, causes the unmatched information 23 to be returned to the client terminal 22 via the reply unit 27 of the control unit 20.
[0027] In the database linkage system 10B of the second embodiment, a new configuration added to the first embodiment provides a new effect that cannot be obtained in the first embodiment. n If it does not exist in any of the n-th control units 40 n (n=1 to N) is not accessed. Therefore, when stored data 24 corresponding to search request 25 does not exist, client terminal 22 can instantly obtain unmatched information 23 to that effect, improving search efficiency.
[0028] The initial setting flow in the database linking method and database linking program according to the second embodiment will be described with reference to the sequence diagram of FIG. 4 (see FIG. 1 and FIG. 3 as appropriate). n When (n=1 to N) are installed, each server terminal 21 n By order of the nth database 50 n From nth unique code 51 n are collected (S11).
[0029] Next, the nth unique code 51 collected n is the nth database 50 n nth identifier 48 n and the common code 28 are associated with each other, and the linking unit 41 n The nth unique code 51 is then sent to the management unit 30 (S12). n , nth identifier 48 nA data set of the common codes 28 is registered in the first table 31 (S13). Furthermore, all the defined common codes 28 are registered in the second table 32 (S14).
[0030] The search flow in the database linking method and database linking program according to each embodiment will now be described with reference to the sequence diagram of Figure 5. When a search request 25 is received from a client terminal 22 (S15), the second table 32 is referenced (S16). If the common code 28 included in the search request 25 does not exist in the second table 32, the unmatched information 23 is returned to the client terminal 22 (S17).
[0031] On the other hand, if the common code 28 included in the search request 25 exists in the second table 32, the n-th unique code 51 associated with this common code 28 is n is extracted from the first table 31 (S18), and the n-th identifier 48 n The nth database 50 identified by n (S19).
[0032] And the nth database 50 n From this n-th unique code 51 n The stored data 24 associated with the n-th database 50 is acquired (S20). n The stored data 24 acquired from each of the (n=1 to N) clients is accumulated and then returned to the client terminal 22 (S21; END).
[0033] According to at least one of the embodiments of the database linkage system described above, by registering database identifiers and common codes in association with unique codes, it is possible to efficiently search across multiple subsystems that are constructed separately using unique code systems.
[0034] Although several embodiments of the present invention have been described, these embodiments are presented as examples and are not intended to limit the scope of the invention. These embodiments can be implemented in various other forms, and various omissions, substitutions, modifications, and combinations can be made without departing from the spirit of the invention. These embodiments and their modifications are included within the scope and spirit of the invention, as well as the inventions described in the claims and their equivalents.
[0035] The database linkage system described above includes a control device with a highly integrated processor such as a dedicated chip, FPGA (Field Programmable Gate Array), GPU (Graphics Processing Unit), or CPU (Central Processing Unit), a storage device such as ROM (Read Only Memory) or RAM (Random Access Memory), an external storage device such as HDD (Hard Disk Drive) or SSD (Solid State Drive), a display device such as a monitor, input devices such as a mouse and keyboard, and a communication I / F, and can be realized with a hardware configuration using a normal computer. Therefore, the components of the database linkage system can also be realized by a computer processor and can be operated by a database linkage program.
[0036] The database linkage program may be provided by being pre-installed in a ROM, etc. Alternatively, the program may be provided by being stored in an installable or executable file format on a computer-readable storage medium such as a CD-ROM, CD-R, memory card, DVD, or flexible disk (FD).
[0037] The database linkage program according to this embodiment may be stored on a computer connected to a network such as the Internet and provided by downloading it via the network. The database linkage system may also be configured by connecting and combining separate modules that independently perform the functions of the components via a network or dedicated lines. [Explanation of symbols]
[0038] 10 (10A, 10B)...database linkage system, 11...client side, 12...server side, 15...external network, 16...internal network, 17...router, 18...subsystem, 20...control department, 21...server terminal, 22...client terminal, 23...unmatched information, 24...stored data, 25...search request, 26...receiving department, 27...reply department, 28...common code, 30...management department, 31...first table, 32...second table, 35...master database, 36...extraction department, 37...first registration department, 38...second registration department, 39...reference department, 40...nth control department, 41...linkage department, 42...acquisition department, 43...collection department, 44...association department, 45...definition department, 47...conversion rule, 48...nth identifier, 50...nth database, 51...nth unique code.
Claims
1. an acquisition unit that transmits an n-th unique code (n=1 to N) to an n-th database and acquires associated stored data; a collection unit that collects the nth unique code from the nth database in response to a command from a server terminal; an association unit that associates the collected nth unique code with the nth identifier and common code of the nth database; a first registration unit that registers a data set of the associated n-th unique code, the n-th identifier, and the common code in a first table; a receiving unit that receives a search request from a client terminal; an extracting unit that extracts the nth unique code associated with the common code included in the search request from the first table and transmits the extracted unique code to the acquiring unit identified by the nth identifier; a reply unit that accumulates the stored data acquired from the nth database (n=1 to N) and returns the data to the client terminal.
2. 2. The database linkage device according to claim 1, a second registration unit that registers all the defined common codes in a second table; a reference unit that references the second table and returns unmatched information to the client terminal if the common code included in the search request does not exist.
3. 3. The database linkage device according to claim 1, A database linkage system in which the common code is defined based on a conversion rule from the nth unique code.
4. 3. The database linkage device according to claim 1, A database linkage system in which the preset common code and the nth unique code are associated with each other based on a fuzzy search.
5. 3. The database linkage device according to claim 1, A database linkage system that associates the nth unique code corresponding to the common code with the nth identifier based on an nth naming model learned from a dataset of the nth unique code associated with the nth identifier.
6. collecting the n-th unique code from the n-th database in response to a command from the server terminal; associating the nth unique code with an nth identifier and a common code of the nth database; registering a data set of the associated n-th unique code, the n-th identifier, and the common code in a first table; receiving a search request from a client terminal; extracting the nth unique code associated with the common code included in the search request from the first table; a step of transferring the extracted n-th unique code (n=1 to N) to the n-th database identified by the n-th identifier and acquiring associated stored data; a step of collecting the stored data acquired from the nth database (n=1 to N) and returning the collected data to the client terminal.
7. On the computer, collecting the n-th unique code from the n-th database in response to a command from the server terminal; associating the nth unique code with an nth identifier and a common code of the nth database; registering a data set of the associated n-th unique code, the n-th identifier, and the common code in a first table; receiving a search request from a client terminal; extracting the nth unique code associated with the common code included in the search request from the first table; a step of transferring the extracted n-th unique code (n=1 to N) to the n-th database identified by the n-th identifier and acquiring associated stored data; a step of accumulating the stored data acquired from the nth database (n=1 to N) and returning the data to the client terminal;
Citation Information
Patent Citations
Data cooperation system, method and program
JP2023113953A