CN115510204B - Intelligent water service data resource catalog management method and device - Google Patents
Intelligent water service data resource catalog management method and device Download PDFInfo
- Publication number
- CN115510204B CN115510204B CN202211196322.9A CN202211196322A CN115510204B CN 115510204 B CN115510204 B CN 115510204B CN 202211196322 A CN202211196322 A CN 202211196322A CN 115510204 B CN115510204 B CN 115510204B
- Authority
- CN
- China
- Prior art keywords
- target
- node
- nodes
- catalog
- information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 title claims abstract description 31
- 238000007726 management method Methods 0.000 title claims description 29
- 238000000034 method Methods 0.000 claims abstract description 44
- 230000004048 modification Effects 0.000 claims description 23
- 238000012986 modification Methods 0.000 claims description 23
- 230000004044 response Effects 0.000 claims description 17
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000012217 deletion Methods 0.000 claims description 4
- 230000037430 deletion Effects 0.000 claims description 4
- 230000000875 corresponding effect Effects 0.000 description 33
- 238000005516 engineering process Methods 0.000 description 13
- 230000008569 process Effects 0.000 description 8
- 238000003860 storage Methods 0.000 description 6
- 238000004590 computer program Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000005070 sampling Methods 0.000 description 3
- 238000012550 audit Methods 0.000 description 2
- 230000002596 correlated effect Effects 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000007689 inspection Methods 0.000 description 2
- 238000009434 installation Methods 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 238000000926 separation method Methods 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000003631 expected effect Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/332—Query formulation
- G06F16/3322—Query formulation using system suggestions
- G06F16/3323—Query formulation using system suggestions using document space presentation or visualization, e.g. category, hierarchy or range presentation and selection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/02—Knowledge representation; Symbolic representation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The application discloses a method and a device for managing intelligent water affair data resource catalogs. The catalog management comprises catalog compiling, wherein a catalog compiling end for compiling the catalog stores a knowledge graph pre-constructed for compiling the catalog; the knowledge graph comprises a plurality of nodes and edges for representing the connection relation between the nodes; the nodes comprise nodes corresponding to catalog information to be filled in the catalogue; the node stores the corresponding directory information. The method may include: receiving target directory information filled in a directory page by a user; searching a target node corresponding to the target directory information in the knowledge graph; and outputting other catalogue information stored by other nodes connected with the target node to the catalogue page to assist the user in catalogue, so as to assist the user in manually catalogue.
Description
Technical Field
The application relates to computer technology, in particular to a method and a device for managing intelligent water affair data resource catalogs.
Background
The large data field has data transmission requirements of cross departments, cross industries, cross-level data aggregation, data integration, data synchronization, data sharing and the like, and the completion of the requirements requires catalog management on data resources so as to facilitate data to be transmitted through catalog rotation.
At present, the cataloging process is basically finished by manpower, and the efficiency is low. In other related technologies, the catalog information filled in by the user last time can be filled in the catalog page by default, so that although the catalog can be completed manually with a certain degree of assistance, the accuracy is low, and the workload of manually modifying the catalog information is increased, so that the catalog efficiency is lower.
Disclosure of Invention
In view of the above, the present application discloses a method for managing a directory of intelligent water service data resources. The catalog management comprises catalog compiling, wherein a catalog compiling end for compiling the catalog stores a knowledge graph pre-constructed for compiling the catalog; the knowledge graph comprises a plurality of nodes and edges for representing the connection relation between the nodes; the nodes comprise nodes corresponding to catalog information to be filled in the catalogue; the node stores the corresponding directory information. The method may include: receiving target directory information filled in a directory page by a user; searching a target node corresponding to the target directory information in the knowledge graph; and outputting other catalogue information stored by other nodes connected with the target node to the catalogue page so as to assist the user in catalogue.
In some embodiments, the knowledge graph uses the target node as a central node, and other types of directory information nodes except the directory information types stored by the target node are used as auxiliary nodes to be hung on the central node; the node stores the type of the directory information; the outputting the other catalog information stored by the other nodes connected with the target node to the catalog page comprises the following steps: for each of the other types, a target other node storing the other type of directory information is determined from other nodes connected to the target node, and the directory information stored by the target other node is output in a space corresponding to the other type in the directory page.
In some embodiments, the edges contain connection weights that indicate how tight the connection between the nodes is; said determining a target other node storing said other type of directory information from other nodes connected to said target node, comprising: for each other node connected to the target node, determining the other node storing the other type of directory information, and sorting the determined other nodes based on the connection weight indicated by the edge; and determining the other node with the highest connection weight as the target other node.
In some embodiments, the method further comprises: and responding to the modification of the user on the cataloging page aiming at target other cataloging information, and increasing the connection weight value indicated by the target edge when the target edge between the node corresponding to the target other cataloging information and the target node exists in the knowledge graph.
In some embodiments, the increasing the connection weight value indicated by the target edge includes: acquiring a first number of first nodes which are connected with the target node and store the type information of the target other directory information; ordering the edges according to the connection weight values indicated by the edges of the first nodes and the target nodes; determining the position of the target edge; calculating the result of dividing the order by the first number and multiplying the result by a preset value; and increasing the connection weight value indicated by the target edge based on the calculation result.
In some embodiments, the method further comprises: and responding to the modification of the user on the catalog page aiming at the target other catalog information, increasing the target edge between the node corresponding to the target other catalog information and the target node when the target edge between the node corresponding to the target other catalog information and the target node does not exist in the knowledge graph, and setting a preset connection weight value for the target edge.
In some embodiments, the method further comprises: and in response to the user not making any modification to the cataloging page, completing cataloging, and increasing the connection weight value indicated by the edge between the target node and the target other nodes in the knowledge graph.
In some embodiments, the cataloging end corresponds to a preset blockchain, and the blockchain comprises an intelligent contract for cataloging management; the method further comprises the steps of: responsive to the catalog-side end completing catalog-side operations based on a user, constructing a first call transaction for the intelligent contract and issuing to the blockchain; based on the first call transaction, calling auditing logic in the intelligent contract, and synchronizing the catalogue to an auditing party for auditing; and issuing the catalogue in response to the auditing party completing auditing.
In some embodiments, the method further comprises: in response to a delete operation for the directory, constructing a second call transaction for the smart contract and issuing to the blockchain; and calling deletion logic in the intelligent contract to delete the directory based on the second calling transaction.
The application also provides an intelligent water affair data resource catalog management device, wherein the catalog management comprises catalog compiling, and a catalog compiling end for compiling the catalog stores a knowledge graph pre-constructed for compiling the catalog; the knowledge graph comprises a plurality of nodes and edges for representing the connection relation between the nodes; the nodes comprise nodes corresponding to catalog information to be filled in the catalogue; the node stores corresponding directory information; the device comprises: the receiving module is used for receiving target directory information filled in the directory compiling page by a user; the searching module is used for searching target nodes corresponding to the target catalog information in the knowledge graph; and the output module is used for outputting other catalogue information stored by other nodes connected with the target node to the catalogue page so as to assist the user in catalogue.
Based on the technical scheme recorded in any embodiment, the knowledge graph technology can be utilized to automatically fill other directory information according to the target directory information input by the user so as to assist the user to complete cataloging.
Drawings
The drawings that are required for use in the description of the embodiments or the related art will be briefly described below.
FIG. 1 is a flow chart of a method for managing a directory of intelligent water service data resources according to an embodiment of the present disclosure;
FIG. 2 is a schematic flow chart of determining other nodes of a target according to an embodiment of the present disclosure;
FIG. 3 is a flowchart illustrating a method for increasing a connection weight value according to an embodiment of the present disclosure;
FIG. 4 is a method flow diagram of a directory management method according to an embodiment of the present disclosure;
FIG. 5 is a schematic diagram of a smart water service data resource directory management device according to an embodiment of the present disclosure;
fig. 6 is a schematic hardware structure of an electronic device according to an embodiment of the present application.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples are not representative of all implementations consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present application as detailed in the accompanying claims.
The terminology used in the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the present application. As used in this application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any or all possible combinations of one or more of the associated listed items. It will also be appreciated that the term "if," as used herein, may be interpreted as "at … …" or "at … …" or "responsive to a determination," depending on the context.
According to the intelligent water service data resource catalog management method, the knowledge graph technology is utilized to automatically fill other catalog information according to target catalog information input by a user, so that the user is assisted to complete cataloging.
Referring to fig. 1, fig. 1 is a flow chart of a method for managing a smart water service data resource directory according to an embodiment of the present application.
The intelligent water service data resource catalog management method shown in fig. 1 can be applied to electronic equipment. The electronic equipment can execute the method by carrying software logic corresponding to the intelligent water service data resource catalog management method. The type of electronic device may be a notebook computer, a server, a mobile phone, a palm top computer (Personal Digital Assistant, PDA), etc. The type of the electronic device is not particularly limited in this application. The electronic device may also be a client device or a server device.
The catalog management comprises catalog compiling, wherein a catalog compiling end for compiling the catalog stores a knowledge graph pre-constructed for compiling the catalog; the knowledge graph comprises a plurality of nodes and edges for representing the connection relation between the nodes; the nodes comprise nodes corresponding to catalog information to be filled in the catalogue; the node stores the corresponding directory information.
The knowledge-graph may be stored in a graph structure, and in some ways may be stored in a graph structure database. Such as Neo4j graph databases, etc.
The catalog information that is to be filled out for catalog production may include many types of information. For example, the directory information includes directory names, data sources, sharing manners, metadata descriptions, and the like.
The knowledge graph may be maintained empirically in advance by a developer. A developer may obtain a large amount of inventory information. And forming different nodes by using different directory information, and storing the directory information belonging to the same directory in an associated manner, namely forming edges between the nodes. The present application is not limited to the source of the vast majority of cataloging information. Illustratively, the information may be derived from catalogs of related national standards, corporate standards, industry standards, enterprise standards, and finished catalogs.
As shown in fig. 1, the method may include:
s102, receiving target directory information filled in the directory compiling page by a user.
The cataloging page can be a page provided by the cataloging terminal to a user through an interactive interface. The user may enter any type of directory information in the page that is related to the water service data resource.
Illustratively, the water service data resource may include four types of resource tables. Of course, the specific content of the data resources is not limited. The four types of resource tables may include:
(1) And (5) applying a system data table. Including a common table, a collection table, and a history.
(2) SCADA data table. Based on the original point location name of the SCADA, taking the plant station as a unit, each point location is one data, which comprises: the point location data type, the data unit, the monitoring actual value and the monitoring time.
(3) IOT data table. The structure is as follows: serial number, water meter number, area, water meter manufacturer, water meter type, water meter name, installation address, equipment communication code, service code, valve status, caliber, water use type, water use property, installation time, meter reading time.
(4) Water quality detection data table. The structure is as follows: sample number, unit name, factory name, sampling location, sample category, detection type, sampling date, sampling time, consignor, carrier, inspection time, inspector, auditor, inspection result, and validation time.
The target directory information refers to any type of directory information input by a user. In general, the target directory information may be used as index information to query in a knowledge graph to query other types of directory information. In some embodiments, the target directory information may be any of the following: directory name information; a source of data; metadata description.
After the user inputs the target directory information in the page, the directory making end can perceive the target directory information.
S104, searching a target node corresponding to the target catalog information in the knowledge graph.
The step can take the target directory information as an index, and inquire in the knowledge graph to find the target node.
S106, outputting other catalogue information stored by other nodes connected with the target node to the catalogue page to assist the user in catalogue.
In this step, other nodes having an edge connection relationship with the target node may be determined by the connection relationship of the node data in the knowledge graph. The other nodes store other types of directory information, and the other directory information stored in the other nodes is filled in corresponding positions of the directory page, which is equivalent to filling in directory information by an auxiliary user.
Through the scheme recorded in S102-S106, the knowledge graph technology can be utilized to automatically fill other catalogue information according to the target catalogue information input by the user, so as to assist the user to complete catalogue.
In some embodiments, the knowledge graph uses the target node as a central node, and other types of directory information nodes except the directory information types stored by the target node are used as auxiliary nodes to be hung on the central node; the node stores the type of directory information. The knowledge graph structure is equivalent to taking the target node as an index, and other nodes can be queried through the target node to obtain other directory information.
In some modes, information stored in the target node can be used as an index, and other nodes are stored in a correlated mode through a correlated database to form the knowledge graph structure. The storage mode of the knowledge graph is not limited in the present application.
In S106, for each of the other types, a target other node storing the other type of directory information may be determined from other nodes connected to the target node, and the directory information stored by the target other node may be output in a space corresponding to the other type in the catalog page.
Specifically, each of the other types may be respectively used as a current type, information stored by a target node is used as an index, the target other node storing the catalog information of the current type is queried in a knowledge graph, and then the catalog information of the current type may be determined and filled in a corresponding position in the catalog page.
Therefore, the knowledge graph structure taking the target node as the center is provided, and other types of directory information can be efficiently and accurately output by using the knowledge graph structure, so that manual cataloging is assisted.
In some embodiments, the same target node may be connected to a plurality of other nodes storing the same type of directory information, only one for each type of other directory information being output in S106.
Edges in the knowledge graph contain connection weights that indicate how tightly the nodes are connected. In some approaches, the more tightly two nodes are connected, the greater the connection weight, indicating that when the directory information stored by one node is entered by the user, the probability that the directory information stored by the other node is also output is greater.
Referring to fig. 2, fig. 2 is a schematic flow chart of determining other nodes of the target. The steps illustrated in fig. 2 are an explanation of the steps of querying the knowledge graph for other nodes of the target storing the current type of directory information by using the information stored by the target node as an index. As shown in FIG. 2, the illustrated method includes S202-S204.
S202, for each other node connected with the target node, determining other nodes storing directory information of other types, and sorting the determined other nodes based on the connection weight indicated by the edge.
In this step, other nodes storing the other types of directory information may be queried by the target node, and then the other nodes may be ordered in order from large to small according to the connection weights of the edges of the target node and the other nodes. The node arranged in front is output first.
And S204, determining the other node with the highest connection weight as the target other node.
Other directory information stored by other nodes closely connected to the target node may be preferentially output through S202-S204. It can be understood that other directory information output in this way meets the requirements best, reduces the number of manual modification times, and helps to promote the effect of assisting manual cataloging.
In some embodiments, after completing outputting other catalogue information in the catalogue page, the structure of the knowledge graph may be adjusted accordingly according to the operation of the user, such as adjusting the size of the edge, or increasing the edge, so as to better conform to the actual usage habit.
Through S102-S106, the catalog page displays other catalog information, and the user is supposed to modify the target other catalog information, and then, the following two modes of modifying the map structure can be adopted according to whether edges exist between the target node and the nodes of the other catalog information pair modified by the user.
And when the target edge between the node corresponding to the other target directory information and the target node exists in the knowledge graph, increasing the connection weight value indicated by the target edge.
And when the target edges between the nodes corresponding to the target other directory information and the target nodes do not exist in the knowledge graph, adding the target edges between the nodes corresponding to the target other directory information and the target nodes, and setting preset connection weight values for the target edges.
For example, the directory name first input by the user shows other directory information through the directory page of S102-S106, and the user is supposed to adjust the data source in the directory information, and then the following two ways of modifying the map structure can be performed according to whether the edge exists between the directory name node and the data source node modified by the user.
When a target edge exists, the edge weight between the directory name node and the data source node may be increased. If no target edge exists, an edge is added between the directory name node and the data source node, and an initial weight is set.
Therefore, after other catalogue information is output to catalog page, the structure of the knowledge graph can be correspondingly adjusted according to the operation of the user, so that the knowledge graph can be more in line with the actual use habit, and the auxiliary catalogue effect is improved.
In some embodiments, a preset value may be added when it is desired to increase the weight value of the target edge. However, the following problems may exist in these embodiments:
if the preset value is larger, the ordering of the connection weights in the knowledge graph is easy to change. However, the original ordering is arranged according to experience, is relatively reasonable, and can be the opposite if the change is easy to occur; if the preset value is smaller, the user can not perceive the weight modification after modifying the catalog information for many times, and the expected effect can not be achieved.
In order to solve the above problems, in some embodiments, the added value may be dynamically adjusted according to the ranking situation of the target edge weight, so that the target edge weight may be adjusted in combination with the actual situation, so that the structure of the map is not easily changed, and the response to the cataloging habit of the user is relatively quick.
Referring to fig. 3, fig. 3 is a flowchart illustrating a method for increasing the connection weight value. Fig. 3 is a supplementary illustration of a method of increasing target edge weights. As shown in fig. 3, the method may include S302-S310.
S302, a first number of first nodes which are connected with the target node and store the type information of the target other directory information is obtained.
The step can be achieved by querying the knowledge graph by taking the target node as an index.
S304, sorting the edges according to the connection weight values indicated by the edges of the first nodes and the target nodes.
In this step, the order may be from large to small.
S306, determining the order of the target edge.
S308, calculating the calculation result of dividing the cis-position by the first quantity and multiplying the calculated result by a preset value.
The step can adjust the preset value according to the current arrangement condition of the target edge, and achieves the effect of adjusting the preset value according to the actual condition.
And S310, increasing the connection weight value indicated by the target edge based on the calculation result.
Through S302-S310, the added value can be dynamically adjusted according to the ranking condition of the target edge weight, so that the target edge weight can be adjusted according to the actual condition, the structure of the map is not easy to change, and the response to the cataloging habit of the user can be relatively quick.
In some embodiments, after completing the outputting of other directory information in the directory page, the user may not modify the output result, so that the connection relationship between the target node and the target other node may be consolidated, so as to ensure that the target other node will still be output preferentially in the following process.
Specifically, in response to the user completing cataloging without any modification in the cataloging page, increasing a connection weight value of an edge indication between the target node and the target other nodes in the knowledge graph.
In some embodiments, catalogs may be reviewed for release after they are completed. The current process of auditing the catalogue is not supervised, the auditing process is not transparent enough, and the auditing is not obtained.
To address these issues, directory auditing may be driven by intelligent contract technology of the blockchain, so that the directory auditing process may be verified in the blockchain, so that the stature process is sufficiently transparent to be supervised and audited.
Blockchain technology, also known as distributed ledger technology, is an emerging technology that is commonly engaged in "accounting" by several computing devices, together maintaining a complete distributed database. The blockchain technology has the characteristics of decentralization, disclosure transparency, capability of participating in database recording by each computing device and capability of rapidly performing data synchronization among the computing devices, so that the blockchain technology is widely applied in a plurality of fields.
The blockchain provides the functionality of the smart contract. The smart contracts may be defined in the form of codes.
By smart contract creation transactions, smart contracts can be deployed in blockchains. After the contract is created, a contract account corresponding to the intelligent contract appears on the blockchain and has a specific address, and the contract code and account store are stored in the contract account. The behavior of the smart contract is controlled by the contract code, while the account store (Storage) of the smart contract maintains the state of the contract. In other words, the smart contract causes a virtual account to be generated on the blockchain that includes the contract code and account store.
Referring to fig. 4, fig. 4 is a flowchart of a method of directory management shown in the present application. As shown in fig. 4, the method may include S402-S406.
S402, in response to the cataloging terminal completing cataloging operation by a user, constructing a first call transaction for the intelligent contract and issuing the first call transaction to the blockchain.
The blockchain shown may serve as a server, serving clients to users. The user may complete the cataloging operation shown in any of the previous embodiments by the client, after which the client may construct the first call transaction and issue the blockchain in response to completing the cataloging.
S404, based on the first call transaction, calling auditing logic in the intelligent contract, and synchronizing the catalogue to an auditing party for auditing.
Any node in the blockchain equalizes invoking the smart contract in response to the first invoking transaction and then runs the audit logic. In some modes, based on the auditing logic, the arbitrary node can send the catalogue to be audited to the client corresponding to the auditor, and the auditor completes the audit.
S406, issuing the catalogue in response to the auditing party completing auditing.
After the auditing personnel completes the auditing, the auditing logic can call the issuing function to complete the issuing of the catalogue.
The catalog auditing can be driven by using the intelligent contract technology of the blockchain through S402-S406, so that the catalog auditing process can be verified in the blockchain, and the stature process is transparent enough to be supervised and audited.
In some embodiments, in response to a delete operation for the directory, a second call transaction for the smart contract is constructed and issued to the blockchain;
and calling deletion logic in the intelligent contract to delete the directory based on the second calling transaction.
In some implementations, a status identification for each directory may be maintained in the blockchain through the intelligent agent. When a user initiates catalog compiling requirements, the catalog state can be changed into a compiling state by calling the intelligent contract; after cataloging is completed, the intelligent appointment-closing state changes the cataloging state into an auditing state; after the auditing is finished, the intelligent appointment-closing state changes the catalogue state into a release state; if the directory is deleted, the Smart closed date changes the directory state to the closed state. The catalogue in the closed state is not displayed in the client, and the effect of deleting the catalogue is achieved.
Corresponding to any embodiment, the application also provides an intelligent water service data resource catalog management device.
Referring to fig. 5, fig. 5 is a schematic structural diagram of an intelligent water service data resource directory management device according to an embodiment of the present application. The catalog management comprises catalog compiling, wherein a catalog compiling end for compiling the catalog stores a knowledge graph pre-constructed for compiling the catalog; the knowledge graph comprises a plurality of nodes and edges for representing the connection relation between the nodes; the nodes comprise nodes corresponding to catalog information to be filled in the catalogue; the node stores the corresponding directory information.
As shown, the illustrated intelligent water service data resource catalog management apparatus 500 may include:
a receiving module 510, configured to receive target directory information filled in a directory page by a user;
the searching module 520 is configured to search a target node corresponding to the target directory information in the knowledge graph;
and an output module 530, configured to output other catalogue information stored in other nodes connected to the target node to the catalogue page to assist the user in catalogue.
In some embodiments, the knowledge graph uses the target node as a central node, and other types of directory information nodes except the directory information types stored by the target node are used as auxiliary nodes to be hung on the central node; the node stores the type of the directory information;
the output module 530 is further configured to:
for each of the other types, a target other node storing the other type of directory information is determined from other nodes connected to the target node, and the directory information stored by the target other node is output in a space corresponding to the other type in the directory page.
In some embodiments, the edges contain connection weights that indicate how tight the connection between the nodes is;
the output module 530 is further configured to:
for each other node connected to the target node, determining the other node storing the other type of directory information, and sorting the determined other nodes based on the connection weight indicated by the edge;
and determining the other node with the highest connection weight as the target other node.
In some embodiments, the apparatus 500 further comprises:
and the first modification module is used for responding to the modification of the user on the catalogue page aiming at the target other catalogue information, and increasing the connection weight value indicated by the target edge when the target edge between the node corresponding to the target other catalogue information and the target node exists in the knowledge graph.
In some embodiments, the first modification module is further to:
acquiring a first number of first nodes which are connected with the target node and store the type information of the target other directory information;
ordering the edges according to the connection weight values indicated by the edges of the first nodes and the target nodes;
determining the position of the target edge;
calculating the result of dividing the order by the first number and multiplying the result by a preset value;
and increasing the connection weight value indicated by the target edge based on the calculation result.
In some embodiments, the apparatus 500 further comprises:
and the second modification module is used for responding to the modification of the user on the catalogue page aiming at the target other catalogue information, increasing the target edge between the node corresponding to the target other catalogue information and the target node when the target edge between the node corresponding to the target other catalogue information and the target node does not exist in the knowledge graph, and setting a preset connection weight value for the target edge.
In some embodiments, the apparatus 500 further comprises:
and a third modification module, configured to increase, in the knowledge graph, a connection weight value indicated by an edge between the target node and the target other nodes, in response to the user completing cataloging without any modification on the cataloging page.
In some embodiments, the cataloging end corresponds to a preset blockchain, and the blockchain comprises an intelligent contract for cataloging management; the apparatus 500 further comprises:
the first construction module is used for responding to the catalog-programming end and completing catalog-programming operation based on a user, constructing a first call transaction for the intelligent contract and issuing the first call transaction to the blockchain;
the first calling module is used for calling auditing logic in the intelligent contract based on the first calling transaction, and synchronizing the catalogue to an auditing party for auditing;
and the issuing module is used for issuing the catalogue in response to the auditing party completing auditing.
In some embodiments, the apparatus 500 further comprises:
a second building module for building a second call transaction for the smart contract and issuing to the blockchain in response to a delete operation for the directory;
and the second calling module is used for calling the deletion logic in the intelligent contract to delete the directory based on the second calling transaction.
Based on the technical scheme, the knowledge graph technology can be utilized to automatically fill other directory information according to the target directory information input by the user so as to assist the user to complete cataloging.
The embodiment of the intelligent water service data resource catalog management device can be applied to electronic equipment. Accordingly, the present application discloses an electronic device, which may include: a processor.
A memory for storing processor-executable instructions.
The processor is configured to call the executable instructions stored in the memory to implement the intelligent water service data resource catalog management method shown in any one of the foregoing embodiments.
Referring to fig. 6, fig. 6 is a schematic hardware structure of an electronic device according to an embodiment of the present application.
As shown in fig. 6, the electronic device may include a processor for executing instructions, a network interface for network connection, a memory for storing operating data for the processor, and a non-volatile memory for storing instructions corresponding to the intelligent water service data resource directory management device.
The embodiment of the device can be realized by software, hardware or a combination of the hardware and the software. Taking software implementation as an example, the device in a logic sense is formed by reading corresponding computer program instructions in a nonvolatile memory into a memory by a processor of an electronic device where the device is located for operation. In terms of hardware, in addition to the processor, the memory, the network interface, and the nonvolatile memory shown in fig. 6, the electronic device in which the apparatus is located in the embodiment generally includes other hardware according to the actual function of the electronic device, which will not be described herein.
It should be understood that, in order to increase the processing speed, the instruction corresponding to the intelligent water service data resource directory management device may also be directly stored in the memory, which is not limited herein.
The present application proposes a computer readable storage medium storing a computer program that can be used to cause a processor to perform the intelligent water service data resource catalog management method shown in any of the foregoing embodiments.
One skilled in the relevant art will recognize that one or more embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, one or more embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Moreover, one or more embodiments of the present application may take the form of a computer program product on one or more computer-usable storage media (which may include, but are not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
"and/or" in this application means having at least one of the two. All embodiments in the application are described in a progressive manner, and identical and similar parts of all embodiments are mutually referred, so that each embodiment mainly describes differences from other embodiments. In particular, for data processing apparatus embodiments, the description is relatively simple, as it is substantially similar to method embodiments, with reference to the description of method embodiments in part.
Although this application contains many specific implementation details, these should not be construed as limiting the scope of any disclosure or the scope of what is claimed, but rather as primarily describing features of certain disclosed embodiments. Certain features that are described in this application in the context of separate embodiments can also be implemented in combination in a single embodiment. On the other hand, the various features described in the individual embodiments may also be implemented separately in the various embodiments or in any suitable subcombination. Furthermore, although features may be acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, although operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In some cases, multitasking and parallel processing may be advantageous. Furthermore, the separation of various platform modules and components in the embodiments described should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and platforms can generally be integrated together in a single software product or packaged into multiple software products.
The foregoing description of the preferred embodiment(s) of the present application is merely intended to illustrate the embodiment(s) of the present application and is not intended to limit the embodiment(s) of the present application, since any and all modifications, equivalents, improvements, etc. that fall within the spirit and principles of the embodiment(s) of the present application are intended to be included within the scope of the present application.
Claims (6)
1. The intelligent water affair data resource catalog management method is characterized in that the catalog management comprises catalog compiling, and a catalog compiling end for compiling the catalog stores a knowledge graph pre-constructed for compiling the catalog; the knowledge graph comprises a plurality of nodes and edges for representing the connection relation between the nodes; the nodes comprise nodes corresponding to catalog information to be filled in the catalogue; the node stores corresponding directory information;
the method comprises the following steps: receiving target directory information filled in a directory page by a user; searching a target node corresponding to the target directory information in the knowledge graph; in the knowledge graph, the target node is used as a central node, and other types of directory information nodes except the directory information types stored by the target node are used as auxiliary nodes to be hung on the central node; the node stores the type of the directory information; the edge comprises a connection weight indicating the connection tightness degree between the nodes; outputting other catalogue information stored by other nodes connected with the target node to the catalogue page to assist the user in catalogue;
the outputting the other catalog information stored by the other nodes connected with the target node to the catalog page comprises the following steps: for each of the other types, determining a target other node storing the other type of directory information from other nodes connected with the target node, and outputting the directory information stored by the target other node in a space corresponding to the other type in the directory page;
said determining a target other node storing said other type of directory information from other nodes connected to said target node, comprising: for each other node connected to the target node, determining the other node storing the other type of directory information, and sorting the determined other nodes based on the connection weight indicated by the edge; determining the other node with the highest connection weight as the target other node;
the method further comprises the steps of: responding to the modification of the user on the catalog page aiming at target other catalog information, and increasing the connection weight value indicated by the target edge when the target edge between the node corresponding to the target other catalog information and the target node exists in the knowledge graph;
the increasing the connection weight value indicated by the target edge comprises the following steps: acquiring a first number of first nodes which are connected with the target node and store the type information of the target other directory information; ordering the edges according to the connection weight values indicated by the edges of the first nodes and the target nodes; determining the position of the target edge; calculating the result of dividing the order by the first number and multiplying the result by a preset value; and increasing the connection weight value indicated by the target edge based on the calculation result.
2. The method according to claim 1, wherein the method further comprises:
and responding to the modification of the user on the catalog page aiming at the target other catalog information, increasing the target edge between the node corresponding to the target other catalog information and the target node when the target edge between the node corresponding to the target other catalog information and the target node does not exist in the knowledge graph, and setting a preset connection weight value for the target edge.
3. The method according to claim 1, wherein the method further comprises:
and in response to the user not making any modification to the cataloging page, completing cataloging, and increasing the connection weight value indicated by the edge between the target node and the target other nodes in the knowledge graph.
4. The method of claim 1, wherein the cataloging side corresponds to a preset blockchain including an intelligent contract for catalog management; the method further comprises the steps of:
responsive to the catalog-side end completing catalog-side operations based on a user, constructing a first call transaction for the intelligent contract and issuing to the blockchain;
based on the first call transaction, calling auditing logic in the intelligent contract, and synchronizing the catalogue to an auditing party for auditing;
and issuing the catalogue in response to the auditing party completing auditing.
5. The method according to claim 4, wherein the method further comprises:
in response to a delete operation for the directory, constructing a second call transaction for the smart contract and issuing to the blockchain;
and calling deletion logic in the intelligent contract to delete the directory based on the second calling transaction.
6. An intelligent water service data resource catalog management device is characterized in that the catalog management comprises catalog compiling, and a catalog compiling end for conducting catalog compiling stores a knowledge graph pre-constructed for compiling a catalog; the knowledge graph comprises a plurality of nodes and edges for representing the connection relation between the nodes; the nodes comprise nodes corresponding to catalog information to be filled in the catalogue; the node stores corresponding directory information;
the device comprises: the receiving module is used for receiving target directory information filled in the directory compiling page by a user; the searching module is used for searching target nodes corresponding to the target catalog information in the knowledge graph; in the knowledge graph, the target node is used as a central node, and other types of directory information nodes except the directory information types stored by the target node are used as auxiliary nodes to be hung on the central node; the node stores the type of the directory information; the edge comprises a connection weight indicating the connection tightness degree between the nodes; the output module is used for outputting other catalogue information stored by other nodes connected with the target node to the catalogue page so as to assist the user in catalogue;
the output module is further configured to: for each of the other types, determining a target other node storing the other type of directory information from other nodes connected with the target node, and outputting the directory information stored by the target other node in a space corresponding to the other type in the directory page;
the output module is further configured to: for each other node connected to the target node, determining the other node storing the other type of directory information, and sorting the determined other nodes based on the connection weight indicated by the edge; determining the other node with the highest connection weight as the target other node; the device further comprises a first modification module, a second modification module and a third modification module, wherein the first modification module is used for responding to modification of the user on the catalogue programming page aiming at target other catalogue information, and increasing a connection weight value indicated by a target edge when the target edge between a node corresponding to the target other catalogue information and the target node exists in the knowledge graph;
the first modification module is further configured to: acquiring a first number of first nodes which are connected with the target node and store the type information of the target other directory information; ordering the edges according to the connection weight values indicated by the edges of the first nodes and the target nodes; determining the position of the target edge; calculating the result of dividing the order by the first number and multiplying the result by a preset value; and increasing the connection weight value indicated by the target edge based on the calculation result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211196322.9A CN115510204B (en) | 2022-09-29 | 2022-09-29 | Intelligent water service data resource catalog management method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211196322.9A CN115510204B (en) | 2022-09-29 | 2022-09-29 | Intelligent water service data resource catalog management method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115510204A CN115510204A (en) | 2022-12-23 |
| CN115510204B true CN115510204B (en) | 2024-01-12 |
Family
ID=84508521
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211196322.9A Active CN115510204B (en) | 2022-09-29 | 2022-09-29 | Intelligent water service data resource catalog management method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115510204B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109241062A (en) * | 2018-09-27 | 2019-01-18 | 国信优易数据有限公司 | A kind of generation method and device of government data catalogue |
| CN113111125A (en) * | 2021-04-08 | 2021-07-13 | 同方股份有限公司 | Business evidence storage method based on block chain |
| CN113254507A (en) * | 2021-06-23 | 2021-08-13 | 四川国路安数据技术有限公司 | Intelligent construction and inventory method for data asset directory |
| CN113342921A (en) * | 2021-06-16 | 2021-09-03 | 杭州数梦工场科技有限公司 | Resource cataloging method and device |
| CN114138985A (en) * | 2022-02-08 | 2022-03-04 | 深圳希施玛数据科技有限公司 | Text data processing method and device, computer equipment and storage medium |
| CN114896461A (en) * | 2022-05-25 | 2022-08-12 | 杭州数梦工场科技有限公司 | Information resource management method and device, electronic equipment and readable storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10817517B2 (en) * | 2017-01-31 | 2020-10-27 | Boomi, Inc. | System facilitating user access to enterprise related data and methods thereof |
-
2022
- 2022-09-29 CN CN202211196322.9A patent/CN115510204B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109241062A (en) * | 2018-09-27 | 2019-01-18 | 国信优易数据有限公司 | A kind of generation method and device of government data catalogue |
| CN113111125A (en) * | 2021-04-08 | 2021-07-13 | 同方股份有限公司 | Business evidence storage method based on block chain |
| CN113342921A (en) * | 2021-06-16 | 2021-09-03 | 杭州数梦工场科技有限公司 | Resource cataloging method and device |
| CN113254507A (en) * | 2021-06-23 | 2021-08-13 | 四川国路安数据技术有限公司 | Intelligent construction and inventory method for data asset directory |
| CN114138985A (en) * | 2022-02-08 | 2022-03-04 | 深圳希施玛数据科技有限公司 | Text data processing method and device, computer equipment and storage medium |
| CN114896461A (en) * | 2022-05-25 | 2022-08-12 | 杭州数梦工场科技有限公司 | Information resource management method and device, electronic equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115510204A (en) | 2022-12-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111177231B (en) | Report generation method and report generation device | |
| US20130085987A1 (en) | Downloading method and device | |
| CN105760380A (en) | Database query method, device and system | |
| WO2016101811A1 (en) | Information arrangement method and apparatus | |
| CN110245145A (en) | Structure synchronization method and apparatus of the relevant database to Hadoop database | |
| CN108491408B (en) | Activity information processing method and device, electronic equipment and storage medium | |
| CN112256772A (en) | Data service method, device and readable storage medium | |
| CN111414410A (en) | Data processing method, device, equipment and storage medium | |
| CN111522840B (en) | Label configuration method, device, equipment and computer readable storage medium | |
| US20130007023A1 (en) | System and Method for Consolidating Search Engine Results | |
| CN115510204B (en) | Intelligent water service data resource catalog management method and device | |
| CN111026963A (en) | Data query method and device, and configuration information setting method and device | |
| EP2830289B1 (en) | Adaptable reporting in a multi-client telecommunication network | |
| CN115017185A (en) | Data processing method, device and storage medium | |
| CN110851543A (en) | Data modeling method, device, equipment and storage medium | |
| CN112785358A (en) | Order fulfillment merchant access method and device | |
| CN110134867A (en) | Corporation information query method and Related product | |
| CN115146604B (en) | Method, device, equipment and storage medium for generating interface technical document | |
| CN112948441B (en) | Multi-dimensional data collection method and equipment for financial data | |
| CN109254974B (en) | Intelligent input order opening method and device and computer equipment | |
| CN113515504B (en) | Data management method, device, electronic equipment and storage medium | |
| CN111967237B (en) | Remittance form filling method and device | |
| CN112070464B (en) | Project management method, device, equipment and storage medium thereof | |
| CN111752956B (en) | Entity association change method and device and electronic equipment | |
| CN116881564A (en) | Patent information recommending method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |