CN111159752B - Method and device for sharing information between mechanisms - Google Patents
Method and device for sharing information between mechanisms Download PDFInfo
- Publication number
- CN111159752B CN111159752B CN201911235136.XA CN201911235136A CN111159752B CN 111159752 B CN111159752 B CN 111159752B CN 201911235136 A CN201911235136 A CN 201911235136A CN 111159752 B CN111159752 B CN 111159752B
- Authority
- CN
- China
- Prior art keywords
- layer
- data
- node
- architecture
- sharing
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Data Mining & Analysis (AREA)
- Computing Systems (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Storage Device Security (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the technical field of information sharing, and provides a method and a device for information sharing between mechanisms. The method comprises the steps of generating a hierarchical relationship in a sharing architecture according to an authority division mechanism among mechanisms; the data of the same layer in the sharing architecture is synchronously stored and synchronously modified in each node, wherein the abstract of the data content of the next layer is stored in the upper layer between two adjacent layers in the sharing architecture; when the next layer of data is modified, the next layer of data needs to be authorized by the previous layer of mechanism which generates the summary according to the data to be modified. The invention utilizes the authority level mechanism of the existing mechanism, and properly designs a set of hierarchical information sharing architecture which is equivalent to the authority, so that for operators, only parameter items for generating the abstract need to be set, and the transfer of the existing mechanism data to the hierarchical information sharing architecture provided by the invention is automatically realized, thereby improving the efficiency of converting the data in the existing mechanism platform to the information sharing platform.
Description
[ technical field ] A method for producing a semiconductor device
The present invention relates to the field of information sharing technologies, and in particular, to a method and an apparatus for information sharing between organizations.
[ background of the invention ]
The organization data system is mainly based on the Internet, so that the cooperation among government affairs is accelerated, and the efficiency of legal administration is improved. However, in actual government work, similar problems are always encountered:
1. according to the conventional method, the corresponding organization is required to provide an interface of an information base of the corresponding organization, and developers can obtain the information of the required information base in the form of calling the interface, so that the data is difficult to carry out or slow to carry out in the aspects of development, real-time performance of the data and business promotion.
2. The efficiency problem caused by the non-real-time property of data sharing between organizations.
3. Security and trust issues with previous centralized system solutions.
The reasons for this are that the amount of organization data is huge, the security of the organization data is another reason, and the intranet of the system is isolated.
[ summary of the invention ]
The invention aims to solve the technical problems of low data docking and exchange efficiency, non-real-time sharing, safety and trust in data management in the existing mechanism.
The technical problem to be solved by the present invention is how to quickly and efficiently transfer the existing data from its own architecture to the blockchain architecture proposed by the present invention.
The invention further solves the technical problem of how to infinitely dynamically expand the upper and lower level organizations under the original block chain basic network, issue certificates in an automatic mode and increase the organizations.
The invention adopts the following technical scheme:
in a first aspect, the present invention provides an inter-organization information sharing method, including:
generating a hierarchical relation in a sharing architecture according to an authority division mechanism among mechanisms;
the data of the same layer in the sharing architecture is synchronously stored and synchronously modified in each node, wherein the abstract of the data content of the next layer is stored in the upper layer between two adjacent layers in the sharing architecture;
when the next layer of data is modified, the next layer of data needs to be authorized by the previous layer of mechanism which generates the abstract according to the data to be modified;
if the modification content does not relate to the modification of the corresponding abstract stored in the previous layer, only finishing the modification of the data in each node of the layer where the next layer mechanism is located after the previous layer mechanism authorizes the previous layer mechanism; if the modification content of the next layer of data relates to the modification of the abstract stored in the previous layer, the modification of the data in each node of the layer where the next layer of mechanism is located is completed after the last layer of mechanism authorizes the data, and then the modification of the corresponding abstract in each node of the layer where the previous layer of mechanism is located is completed;
and if the data in one node is different compared with the data of other nodes in the uniform shared architecture layer, generating a log and reporting the log.
Preferably, if the modified data is in the top layer, the data content in each node in the top layer is allowed to be directly modified under the condition that the storage of the abstract in the lower layer is kept unchanged.
Preferably, if there is one or more next-layer mechanisms below the layer where the next-layer mechanism is located, the completing of the data modification in each node of the layer where the next-layer mechanism is located specifically includes:
determining whether the abstract of the next layer of shared architecture layer stored in the node of the layer where the next layer of mechanism is located needs to be modified;
and if the modification is needed, correspondingly adjusting the content corresponding to the abstract stored in the next layer of shared architecture layer.
Preferably, the digest is a hash value generated according to a parameter item in a preset sharing architecture layer, where the parameter item includes one or more of a path name, a folder name, a file name, a table name in a database, a row number in a table in the database, a column number in the table, a key value in the table, and instruction data completed in the database.
Preferably, the correspondingly adjusting the content corresponding to the summary stored in the next level of shared architecture layer if modification is required specifically includes:
and if the corresponding abstract item is modified to be deleted, deleting the corresponding content corresponding to the abstract stored in the next level of sharing architecture layer.
Preferably, if new data is added to the shared architecture layer a, and the data object newly added to the shared architecture layer a belongs to one of the data objects specified by the digest generation rule in the shared architecture layer B of the previous layer, the method further includes:
after permission of authority of the last sharing architecture layer B is obtained, after the data object in the sharing architecture layer A is updated, a new abstract is generated according to the abstract generation rule, and the abstracts stored in the sharing architecture layer B and other nodes in the sharing architecture layer B are updated.
Preferably, if the data in one of the nodes is found to be different from the data of other nodes in the unified shared architecture layer, a log is generated and reported, which specifically includes:
if the data in a certain node C is different from the data of other nodes in the same shared architecture layer, the data in the node C is directly replaced by the data content in other nodes in the same shared architecture layer.
Preferably, the method further comprises:
and if the number of different nodes storing data among all nodes in the same sharing architecture layer exceeds a preset threshold value, applying summary information matching to the sharing architecture layer on the upper layer, and selecting the node data which is qualified in matching to replace the data stored in the node which is unqualified in matching according to the summary information matching result.
In a second aspect, the present invention further provides an inter-organization information sharing apparatus, configured to implement the inter-organization information sharing method in the first aspect, where the apparatus includes:
at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor and programmed to perform the inter-organization information sharing method of the first aspect.
In a third aspect, the present invention also provides a non-transitory computer storage medium storing computer-executable instructions for execution by one or more processors for performing the inter-organization information sharing method of the first aspect.
The invention utilizes the authority level mechanism of the existing mechanism, and properly designs a set of hierarchical information sharing architecture which is equivalent to the authority, so that for operators, only parameter items for generating the abstract need to be set, and the transfer of the existing mechanism data to the hierarchical information sharing architecture provided by the invention can be realized automatically through a customized program or a script, thereby improving the efficiency of converting the data in the existing mechanism platform to the information sharing platform.
Furthermore, the information sharing among the mechanisms provided by the invention has the characteristics of distribution, decentralization, safety, reliability, no tampering and traceability, and the network nodes can be deployed in different places.
In a third aspect, the invention further provides a scheme for automatically and infinitely increasing organizations and certificates, wherein the block information is obtained for analysis by using an automatic script and a jq tool, and the increase is performed in an automatic mode.
[ description of the drawings ]
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the embodiments of the present invention will be briefly described below. It is obvious that the drawings described below are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.
Fig. 1 is a schematic flowchart of an inter-organization information sharing method according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of an inter-organization information sharing method according to an embodiment of the present invention;
FIG. 3 is a flow chart of another method for sharing information between organizations according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of an inter-organization information sharing apparatus according to an embodiment of the present invention.
[ detailed description ] embodiments
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
In the description of the present invention, the terms "inner", "outer", "longitudinal", "lateral", "upper", "lower", "top", "bottom", and the like indicate orientations or positional relationships based on those shown in the drawings, and are for convenience only to describe the present invention without requiring the present invention to be necessarily constructed and operated in a specific orientation, and thus should not be construed as limiting the present invention.
In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
Example 1:
embodiment 1 of the present invention provides an inter-organization information sharing method, where the structural features proposed in the embodiment of the present invention have an organization scenario of multi-level authority management, and the above organization scenario features further include that modification of part of data in data management at a lower level or modification of all data requires permission of an authority at a higher level, as shown in fig. 1, the method includes:
in step 201, a hierarchical relationship in the shared architecture is generated according to the authority division mechanism between the organizations.
The implementation principle is that the hierarchical relationship in the to-be-generated sharing architecture is set according to the existing authority division mechanism among the existing mechanisms. Wherein, the hierarchical relationship between different data types is not always consistent, and in the practical operation of the present invention, the highest hierarchical data type is usually satisfied preferentially; for data types with relatively few layers, compatibility operations can be achieved by skipping one or more designated shared architecture layers among the same number of shared architecture layers. Thus, in the preferred approach, the respective shared architectural relationships are typically maintained according to data type (which may also be understood as organization type).
In step 202, data in the same layer in the shared architecture is synchronously stored and synchronously modified in each node, wherein between two adjacent layers in the shared architecture, the upper layer stores the summary of the data content in the next layer.
In actual operation, one or more layers of shared architecture layers may be stored on one node, and the same layer of shared architecture layer is not distributed discretely on different nodes in general (this is for management efficiency, and the complete layer of shared architecture layer is arranged on one node to facilitate the execution of various modification operations and control commands).
In step 203, when the next layer of data is modified, it needs to have the authority of the previous layer of organization generating the summary according to the data to be modified.
The relationship shown here is that when the next layer of data is modified, it needs to see whether the previous layer stores the summary generated according to the corresponding data; if not, the current layer can be directly modified after the permission of the administrator of the current layer is obtained, and the authorization of the previous layer is not needed; however, if the above summary relationship exists, the authorization of the previous layer is needed before the data of the next layer can be modified. The specific operation process will be specifically described by the following steps 204 and 205.
It should be noted that the next layer and the previous layer only represent a relative relationship, and in the shared architecture, it may be any set of shared architecture layers in which a relationship between the next layer and the previous layer exists. That is, only the upper and lower layer relationships between the two are shown, and no other limitation is implied.
In step 204, if the modification content does not relate to the modification of the corresponding summary stored in the previous layer, after the authority of the previous layer authorizes, only the modification of the data in each node of the layer where the next layer authority is located is completed.
The expression means that, as explained above in step 203, it can be further seen that, even if no summary of the data to be modified currently is stored in the previous layer, after modifying the data content stored in the corresponding next layer, the same data content stored in other nodes in the same layer in the next layer is modified. The scheme provided by the invention has consistency, safety and reliability in the shared architecture layer of the same level.
In step 205, if the modified content of the next-layer data relates to the modification of the digest stored in the previous layer, after the authority of the previous layer authorizes the next-layer data to be modified in each node of the layer where the next-layer authority is located, and then the modification of the corresponding digest in each node of the layer where the previous-layer authority is located is completed.
Wherein, the modification of the data in each node of the layer of the next layer of mechanism and the modification of the corresponding abstract in each node of the layer of the previous layer of mechanism are completed, the sequence is not strictly regulated, the modification of the data in each node of the layer where the next mechanism is located can be firstly executed, then the modification of the corresponding abstract in each node of the layer where the previous mechanism is located can be finished, or the modification of the corresponding abstract in each node of the layer where the previous mechanism is located can be firstly executed, then the modification of the data in each node of the layer where the next mechanism is located can be finished, however, one regulation is unified, i.e., the modification process is not completed until the two blocks of execution have not been completed, even in the preferred embodiment, if any side does not complete the execution or fails to execute, the data content before the corresponding modification is executed needs to be traced back. Therefore, the effective operation of the hierarchical management mechanism between the sharing architectures provided by the invention is ensured, and the mismatching between the data content of the next level and the summary information which is stored in the previous level and is generated according to the corresponding data content is avoided.
In step 206, each node in each sharing architecture layer performs security check according to a preset rule, and if the data in one node is found to be different from the data of other nodes in the uniform sharing architecture layer, a log is generated and reported.
The embodiment of the use of the sharing architecture mechanism proposed by the above step 201 and 205 is to perform security management on the maintained consistent data content, and once the data in a certain node is changed, the data can be corrected by the method content of the above step 206, thereby ensuring the security of the whole sharing architecture system.
The embodiment of the invention utilizes the authority level mechanism of the existing mechanism, and properly designs a set of hierarchical information sharing architecture which is equivalent to the authority, so that for operators, only parameter items for generating the abstract need to be set, and the transfer of the existing mechanism data to the hierarchical information sharing architecture provided by the invention can be realized automatically through a customized program or a script, thereby improving the efficiency of converting the data in the existing mechanism platform into the information sharing platform.
Furthermore, the information sharing between the organizations provided by the embodiment of the invention has the characteristics of distribution, decentralization, safety, reliability, no tampering and traceability, and the network nodes can be deployed in different places.
The conventional case process is described in the steps 201 and 206 of the present invention, however, there are some special cases in the process implemented by the embodiment of the present invention, such as: if the modified data is in the top layer, the data content in each node in the top layer is allowed to be directly modified under the condition that the abstract storage of the lower layer is kept unchanged.
As an extension and a supplement of the corresponding relationship between the next layer and the previous layer described in the above embodiment 1, if there is one or more next-layer mechanisms below the layer where the next-layer mechanism is located, the completing of the modification of the data in each node of the layer where the next-layer mechanism is located specifically includes, as shown in fig. 2:
in step 301, it is determined whether the digest of the next layer shared architecture layer stored in the node of the layer where the next layer mechanism is located needs to be modified.
In step 302, if modification is required, the content corresponding to the summary stored in the next layer of shared architecture layer is adjusted accordingly.
In the embodiment of the present invention, the abstract is specifically a hash value generated according to a parameter item in a preset sharing architecture layer, where the parameter item includes one or more items of a path name, a folder name, a file name, a table name in a database, a row number in a table in the database, a column number in the table, a key value in the table, and instruction data completed in the database. In different implementation scenarios, the parameter items can be flexibly combined, and different combination modes can often achieve the effect of larger difference. In the following, the following description is given by way of example with reference to several specific scenarios.
Scene 1: the upper and lower levels adopt general type databases for management
In this scenario, typical features are: corresponding data are presented in a form of a table, and at the moment, parameter items can be selected in table names, table names-row number-column number-key values and three modes of selection according to the required strength of the management authority of the previous layer. Usually, the method of table name-row number-column number-key value is the finest, and this indicates that the modification of the data of the next stage by the previous stage is the finest management, but the disadvantage is very obvious, that is, the resources and time required for generating the abstract by using the hash algorithm are too much.
In scenario 1, the embodiment of the present invention further provides a flexible manner, that is, the instruction related to data modification recorded in the database log is used to perform the management in the finest degree in cooperation with "table name-row number-column number", and compared with the "table name-row number-column number-key value", the management manner is more flexible, has higher efficiency, and is generally applicable to the existing database scenario.
Scene 2: the upper and lower levels adopt the conventional UI interface of the operating system to manage the data
For example, it is most conventional to use word documents in WINDOWS systems for data management. In this scenario, the abstract may be generated by using a folder name, a file name, and a storage path, and in addition, further detailed management may be performed by using access time of a document, size of the document, and the like.
In this embodiment of the present invention, in a specific operation scenario, more lower-level shared architecture layers (also described as a lower layer in this embodiment of the present invention) need to be added with data, and then an additional modification is performed on an upper-level shared architecture layer (also described as an upper layer in this embodiment of the present invention) storing an associated abstract, but there is also a case that an upper-level shared architecture layer needs to be cleaned with data (specifically, a deletion operation in this embodiment of the present invention), and if the modification is required, the content corresponding to the abstract stored in the lower-level shared architecture layer is correspondingly adjusted, specifically including:
and if the corresponding abstract item is modified to be deleted, deleting the corresponding content corresponding to the abstract stored in the next level of sharing architecture layer.
Next, the data adding operation process (which may be understood as a specific expression of modification) described in the embodiment of the present invention is described by taking the sharing architecture layer B and the sharing architecture layer a as the sharing architecture layer of the upper-lower layer relationship, and if new data is added to the sharing architecture layer a and a data object newly added to the sharing architecture layer a belongs to one of the data objects specified by the digest generation rule in the sharing architecture layer B on the upper layer, the method further includes:
after permission of authority of the last sharing architecture layer B is obtained, after the data object in the sharing architecture layer A is updated, a new abstract is generated according to the abstract generation rule, and the abstracts stored in the sharing architecture layer B and other nodes in the sharing architecture layer B are updated.
In a specific implementation, the modification operation further includes deletion, replacement, and the like. The specific operation process is similar to the above addition, and therefore, the detailed description is omitted here.
In the embodiment of the present invention, as to the data related in step 206, if it is found that the data in one of the nodes is different from the data of the other nodes in the uniform shared architecture layer, a log is generated and reported, and a specific implementation process is further provided, which includes:
if the data in a certain node C is different from the data of other nodes in the same shared architecture layer, the data in the node C is directly replaced by the data content in other nodes in the same shared architecture layer.
As shown in fig. 3, for a specific possible case implemented in step 206, the method further includes:
in step 206', if the number of nodes with different data stored between nodes in the same shared architecture layer exceeds the preset threshold, applying for summary information matching to the upper shared architecture layer, and selecting the data of the nodes with qualified matching to replace the data stored in the nodes with unqualified matching according to the summary information matching result.
Example 2:
fig. 4 is a schematic structural diagram of an inter-organization information sharing apparatus according to an embodiment of the present invention. The inter-organization information sharing apparatus of the present embodiment includes one or more processors 21 and a memory 22. In fig. 4, one processor 21 is taken as an example.
The processor 21 and the memory 22 may be connected by a bus or other means, such as the bus connection in fig. 4.
The memory 22, which is a nonvolatile computer-readable storage medium, may be used to store a nonvolatile software program and a nonvolatile computer-executable program, such as the inter-organization information sharing method in embodiment 1. The processor 21 executes the inter-mechanism information sharing method by executing a nonvolatile software program and instructions stored in the memory 22.
The memory 22 may include high speed random access memory and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, the memory 22 may optionally include memory located remotely from the processor 21, and these remote memories may be connected to the processor 21 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The program instructions/modules are stored in the memory 22 and, when executed by the one or more processors 21, perform the inter-mechanism information sharing method of embodiment 1 described above, for example, perform the steps shown in fig. 1 to 3 described above.
It should be noted that, for the information interaction, execution process and other contents between the modules and units in the apparatus and system, the specific contents may refer to the description in the embodiment of the method of the present invention because the same concept is used as the embodiment of the processing method of the present invention, and are not described herein again.
Those of ordinary skill in the art will appreciate that all or part of the steps of the various methods of the embodiments may be implemented by associated hardware as instructed by a program, which may be stored on a computer-readable storage medium, which may include: read Only Memory (ROM), Random Access Memory (RAM), magnetic or optical disks, and the like.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (9)
1. An inter-organization information sharing method, comprising:
generating a hierarchical relation in a sharing architecture according to an authority division mechanism among mechanisms;
the data of the same layer in the sharing architecture is synchronously stored and synchronously modified in each node, wherein the abstract of the data content of the next layer is stored in the upper layer between two adjacent layers in the sharing architecture;
when the next layer of data is modified, the next layer of data needs to be authorized by the previous layer of mechanism which generates the abstract according to the data to be modified;
if the modification content does not relate to the modification of the corresponding abstract stored in the previous layer, only finishing the modification of the data in each node of the layer where the next layer mechanism is located after the previous layer mechanism authorizes the previous layer mechanism; if the modification content of the next layer of data relates to the modification of the abstract stored in the previous layer, the modification of the data in each node of the layer where the next layer of mechanism is located is completed after the last layer of mechanism authorizes the data, and then the modification of the corresponding abstract in each node of the layer where the previous layer of mechanism is located is completed;
and if the data in one node is different compared with the data of other nodes in the uniform shared architecture layer, generating a log and reporting the log.
2. The method according to claim 1, wherein if the modified data is at the top level, the data content in each node at the top level is allowed to be directly modified while keeping the digest storage at the lower level unchanged.
3. The method according to claim 1, wherein if there is one or more next-level mechanisms below the level of the next-level mechanism, the modifying of data in each node of the level of the next-level mechanism is completed specifically including:
determining whether the abstract of the next layer of shared architecture layer stored in the node of the layer where the next layer of mechanism is located needs to be modified;
and if the modification is needed, correspondingly adjusting the content corresponding to the abstract stored in the next layer of shared architecture layer.
4. The method according to claim 3, wherein the digest is a hash value generated according to a parameter item in a preset sharing architecture layer, and the parameter item includes one or more of a path name, a folder name, a file name, a table name in the database, a row number in a table in the database, a column number in the table, a key value in the table, and instruction data completed in the database.
5. The method according to claim 3, wherein if modification is required, the adjusting the content corresponding to the summary stored in the next shared architecture layer correspondingly comprises:
and if the corresponding abstract item is modified to be deleted, deleting the corresponding content corresponding to the abstract stored in the next level of sharing architecture layer.
6. The method according to claim 1, wherein if new data is added to the shared architecture layer a, and a data object newly added to the shared architecture layer a belongs to one of data objects specified by the digest creation rule in the shared architecture layer B of the previous layer, the method further comprises:
after permission of authority of the last sharing architecture layer B is obtained, after the data object in the sharing architecture layer A is updated, a new abstract is generated according to the abstract generation rule, and the abstracts stored in the sharing architecture layer B and other nodes in the sharing architecture layer B are updated.
7. The method according to claim 1, wherein if it is found that data in one of the nodes is different from data in other nodes in the uniform shared architecture layer, a log is generated and reported, and the method specifically comprises:
if the data in a certain node C is different from the data of other nodes in the same shared architecture layer, the data in the node C is directly replaced by the data content in other nodes in the same shared architecture layer.
8. The method of claim 1, further comprising:
and if the number of different nodes storing data among all nodes in the same sharing architecture layer exceeds a preset threshold value, applying summary information matching to the sharing architecture layer on the upper layer, and selecting the node data which is qualified in matching to replace the data stored in the node which is unqualified in matching according to the summary information matching result.
9. An inter-organization information sharing apparatus, comprising:
at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor and programmed to perform the inter-facility information sharing method of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911235136.XA CN111159752B (en) | 2019-12-05 | 2019-12-05 | Method and device for sharing information between mechanisms |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911235136.XA CN111159752B (en) | 2019-12-05 | 2019-12-05 | Method and device for sharing information between mechanisms |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111159752A CN111159752A (en) | 2020-05-15 |
| CN111159752B true CN111159752B (en) | 2022-02-01 |
Family
ID=70556479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911235136.XA Active CN111159752B (en) | 2019-12-05 | 2019-12-05 | Method and device for sharing information between mechanisms |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111159752B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1444160A (en) * | 2003-02-17 | 2003-09-24 | 刘莎 | Integrated information structured abstract service system and service method |
| CN103607469A (en) * | 2013-11-28 | 2014-02-26 | 东莞中国科学院云计算产业技术创新与育成中心 | Cloud platform for achieving distributed isomerous data sharing and data sharing method thereof |
| CN104951557A (en) * | 2015-07-01 | 2015-09-30 | 武汉噢易云计算有限公司 | System and method for upgrading administrative division resources on basis of tree structure |
| CN109933800A (en) * | 2019-03-22 | 2019-06-25 | 中国农业银行股份有限公司 | Creation method, information query method and the device of data structures system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10210170B2 (en) * | 2017-01-28 | 2019-02-19 | Microsoft Technology Licensing, Llc | Chunk storage deduplication using graph structures |
-
2019
- 2019-12-05 CN CN201911235136.XA patent/CN111159752B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1444160A (en) * | 2003-02-17 | 2003-09-24 | 刘莎 | Integrated information structured abstract service system and service method |
| CN103607469A (en) * | 2013-11-28 | 2014-02-26 | 东莞中国科学院云计算产业技术创新与育成中心 | Cloud platform for achieving distributed isomerous data sharing and data sharing method thereof |
| CN104951557A (en) * | 2015-07-01 | 2015-09-30 | 武汉噢易云计算有限公司 | System and method for upgrading administrative division resources on basis of tree structure |
| CN109933800A (en) * | 2019-03-22 | 2019-06-25 | 中国农业银行股份有限公司 | Creation method, information query method and the device of data structures system |
Non-Patent Citations (3)
| Title |
|---|
| 《Key lookup from a data structure based on range》;Prasanna;《https://stackoverflow.com/questions/6852283/key-lookup-from-a-data-structure-based-on-range》;20110727;全文 * |
| 《基于变种概率图模型的文本生成算法》;刘廷镇等;《计算机应用》;20181231;第38卷(第S1期);第99-103页 * |
| 《默克尔树（Merkle Tree）总结》;xushiyu1996818;《https://blog.csdn.net/xushiyu1996818/article/details/90265545》;20190516;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111159752A (en) | 2020-05-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107332701A (en) | The method and system of management node | |
| CN111324577B (en) | Yml file reading and writing method and device | |
| CN110008665B (en) | Authority control method and device for blockchain | |
| CN105187551A (en) | Distributed computing method based on cloud platform | |
| US20220215002A1 (en) | Image File Management Method, Apparatus, and System, Computer Device, and Storage Medium | |
| CN110362633B (en) | Block data storage method, device, computer equipment and storage medium | |
| CN106155775B (en) | Message processing method, device and system | |
| CN107016047A (en) | Document query, document storing method and device | |
| CN106326239A (en) | Distributed file system and file meta-information management method thereof | |
| CN109783451A (en) | File updating method, device, equipment and medium based on Message Digest 5 | |
| CN104008441A (en) | Task management system and method for automatically submitting files into version library | |
| US10700934B2 (en) | Communication control device, communication control method, and computer program product | |
| CN111930850A (en) | Data verification method and device, computer equipment and storage medium | |
| CN110599166A (en) | Method and device for acquiring transaction dependency relationship in block chain | |
| CN109460252A (en) | Configuration file processing method, device and computer equipment based on git | |
| CN106021566A (en) | Method, device and system for improving concurrent processing capacity of single database | |
| CN114077602A (en) | Data migration method and device, electronic equipment and storage medium | |
| CN110990336A (en) | Industrial control-oriented function design method and system | |
| CN106815232A (en) | Catalog management method, apparatus and system | |
| CN110502242A (en) | Code automatic generation method, device, computer equipment and storage medium | |
| CN111159752B (en) | Method and device for sharing information between mechanisms | |
| CN111858764B (en) | Data synchronization method, device, computer equipment and storage medium | |
| US9442698B2 (en) | Migration between model elements of different types in a modeling environment | |
| US9009731B2 (en) | Conversion of lightweight object to a heavyweight object | |
| CN105760424A (en) | Database establishment method for storing key data of enterprise products |
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 |