CN109947460B - Program linking method and program linking system - Google Patents
Program linking method and program linking system Download PDFInfo
- Publication number
- CN109947460B CN109947460B CN201711390482.6A CN201711390482A CN109947460B CN 109947460 B CN109947460 B CN 109947460B CN 201711390482 A CN201711390482 A CN 201711390482A CN 109947460 B CN109947460 B CN 109947460B
- Authority
- CN
- China
- Prior art keywords
- program
- composition table
- segment
- fragment
- contents
- 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
- 238000000034 method Methods 0.000 title claims abstract description 53
- 239000012634 fragment Substances 0.000 claims description 31
- 230000006870 function Effects 0.000 claims description 8
- 230000000694 effects Effects 0.000 abstract description 3
- 238000012423 maintenance Methods 0.000 abstract description 3
- 238000007796 conventional method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000004927 fusion Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Landscapes
- Stored Programmes (AREA)
Abstract
A program linking method and a program linking system. The program linking method comprises: obtaining a program content database; establishing a first program composition table for generating a first program, wherein the first program is provided with a plurality of first program segments; and establishing a second program composition table for generating a second program, wherein the second program is provided with a plurality of second program segments, and the second program composition table records whether the second program segments are connected with the first program segments of the first program composition table. Therefore, the effects of keeping independence of a plurality of programs and easy maintenance of the programs are achieved.
Description
Technical Field
The present disclosure relates to electronic methods and systems, and more particularly, to methods and systems for inter-process and inter-process connections.
Background
In the process of software development, the function is utilized to enable the program to accelerate the development speed and keep the consistency of program logic in the process of writing. However, sometimes a plurality of programs with high similarity are encountered, and the fragmented program fragments cannot be expressed by function functions, and two methods are usually adopted for the fragmented program fragments, one is to copy the programs and then directly adjust the programs for the program fragments with different logics, but if a plurality of programs share the program fragments, the programs can only be respectively adjusted, which is very troublesome. The other is that the program segments used under different conditions are respectively marked by using the judgment formulas in different program segments, and the method has the advantages that the method can adapt to various conditions only by adjusting once, the readability of the program is worsened, and if the adjusted program section has problems, all related programs can be influenced (for example, the program segments with three different logics are adjusted to share, the program segments with the three different logics can be influenced). Therefore, how to make fragmented program fragments able to be used by other programs sharing the program fragment immediately only by changing the fragments once for a plurality of programs with high similarity, and meanwhile, the independence of the plurality of programs is maintained, so that the programs are easy to maintain, which is one of the problems to be improved in the field.
Disclosure of Invention
The present invention provides a linking method and a linking system, which mainly improve the conventional method for fragmented program fragments, so that the program fragments can be changed once to be used by other programs sharing the program fragments, thereby achieving the effects of maintaining the independence of a plurality of programs and facilitating the maintenance of the programs.
To achieve the above object, a first aspect of the present invention provides a program connection method, which includes the following steps: obtaining a program content database, wherein the program content database stores a plurality of general program fragment contents and a plurality of program composition tables; establishing a first program composition table for generating a first program, wherein the first program is provided with a plurality of first program segments; and establishing a second program composition table for generating a second program, wherein the second program is provided with a plurality of second program segments, and the second program composition table records whether the second program segments are connected with the first program segments of the first program composition table.
According to an embodiment of the present disclosure, the program content database further includes a plurality of local program contents, each of the plurality of general program fragment contents has at least one version, and different versions of the plurality of general program fragment contents each have different fragment version numbers.
According to an embodiment of the present disclosure, the first program composition table records fragment version numbers of contents of the common program fragments respectively referenced by the plurality of first program fragments.
According to an embodiment of the present invention, whether the second program segment is linked to the first program segment of the first program composition table further includes: if the second program segment does not refer to the first program segment of the first program composition table; and the second program composition table records that the plurality of second program segments respectively use one of the plurality of regional program contents.
According to an embodiment of the present disclosure, the method further comprises: generating a new fragment version number corresponding to one of the plurality of general program fragment contents if one of the plurality of first program fragments updates one of the plurality of general program fragment contents; determining whether the second program segment is linked to the first program segment of the first program composition table; if the second program segment has the first program segment referring to the first program composition table; and updating the fragment version number of the second program fragment.
In a second aspect of the present invention, a process connection system is provided, which includes: a storage device and a processor. The storage device is used for storing a program content database, and a plurality of general program fragment contents are stored in the program content database. The processor is coupled to the storage device, and establishes a first program composition table for generating a first program, the first program having a plurality of first program segments, and establishes a second program composition table for generating a second program, the second program having a plurality of second program segments, the second program composition table recording whether the second program segments are linked to the first program segments of the first program composition table.
According to an embodiment of the present disclosure, the program content database further includes a plurality of local program contents and a plurality of program composition tables, the plurality of general program fragment contents respectively have at least one version, and different versions of the plurality of general program fragment contents respectively have different fragment version numbers.
According to an embodiment of the present disclosure, the first program composition table records fragment version numbers of contents of the common program fragments respectively referenced by the plurality of first program fragments.
According to an embodiment of the present disclosure, the processor further includes: a program disconnection unit, configured to determine whether the second program segment is linked to the first program segment of the first program composition table, and if the second program segment does not refer to the first program segment of the first program composition table, the second program composition table records that the plurality of second program segments respectively use one of the plurality of regional program contents.
According to an embodiment of the present disclosure, the processor further includes: a program merging unit, configured to determine whether one of the first program segments updates one of the general-purpose program segment contents, if so, generate a new segment version number corresponding to one of the general-purpose program segment contents, then determine whether the second program segment is linked to the first program segment of the first program composition table, and if the second program segment has the first program segment referring to the first program composition table, update the segment version number of the second program segment.
The program linking method and the program linking system mainly improve the conventional method for fragmented program fragments, so that other programs sharing the program fragments can be used only by changing the program fragments once, and the effects of keeping independence of a plurality of programs and easy maintenance of the programs are achieved.
Drawings
In order to make the aforementioned and other objects, features, and advantages of the invention, as well as others which will become apparent, reference is made to the following description taken in conjunction with the accompanying drawings in which:
FIG. 1 is a schematic diagram of a process connection system according to some embodiments of the present disclosure;
fig. 2 is a flow chart of a process connection method according to some embodiments of the disclosure;
fig. 3 is a flowchart illustrating the step S230 according to some embodiments of the disclosure; and
fig. 4 is a flowchart of a process connection method according to some embodiments of the disclosure.
Detailed Description
The following disclosure provides many different embodiments, or examples, for implementing different features of the invention. Elements and configurations in the specific illustrations are used in the following discussion to simplify the present disclosure. Any examples discussed are intended for illustrative purposes only and do not limit the scope or meaning of the invention or its illustrations in any way. Moreover, the present disclosure may repeat reference numerals and/or letters in the various examples, which are for purposes of simplicity and clarity, and do not in themselves dictate a relationship between the various embodiments and/or configurations discussed below.
The term (terms) used throughout the specification and claims has the ordinary meaning as commonly understood in the art, in the disclosure herein and in the claims, unless otherwise indicated. Certain terms used to describe the present disclosure will be discussed below or elsewhere in this specification to provide additional guidance to those skilled in the art in describing the present disclosure.
As used herein, to "couple" or "connect" may mean that two or more elements are in direct physical or electrical contact with each other, or in indirect physical or electrical contact with each other, and "couple" or "connect" may also mean that two or more elements are in operation or act with each other.
It will be understood that the terms first, second, third, etc. may be used herein to describe various elements, components, regions, layers and/or sections. These elements, components, regions, layers and/or regions should not be limited by these terms. These terms are only used to distinguish one element, component, region, layer or section from another. Thus, a first element, component, region, layer or section discussed below could be termed a second element, component, region, layer or section without departing from the teachings of the present invention. As used herein, the word "and/or" includes any combination of one or more of the associated listed items. Reference to "and/or" in this document refers to any one, all, or any combination of at least one of the listed elements.
Please refer to fig. 1. Fig. 1 is a schematic diagram of a procedural connection system 100 according to some embodiments of the present disclosure. As shown in fig. 1, the program connection system 100 includes a processor 110 and a storage device 120. The processor 110 includes a program disconnection unit 111 and a program fusion unit 112. The storage device 120 is used for storing a program content database, in which a plurality of general program segment contents and a plurality of program composition tables are stored. The processor 110 is electrically coupled to the storage device 120, and is configured to establish a first program composition table for generating a first program, the first program having a plurality of first program segments, and establish a second program composition table for generating a second program, the second program having a plurality of second program segments, the second program composition table recording whether the second program segments are linked to the first program segments of the first program composition table.
In one embodiment, the processor 110 may be implemented as an integrated circuit such as a micro control unit (microcontroller), a microprocessor (microprocessor), a digital signal processor (digital signal processor), an Application Specific Integrated Circuit (ASIC), a logic circuit, or other similar components or combinations thereof (actually, no hardware processing is required). The storage device 120 may include a portable computer readable recording medium, such as a memory, a hard disk, a portable disk, a memory card, etc. In some embodiments, the computer program and data may be stored on a portable computer readable recording medium and loaded onto the storage device 102 via the I/O interface. The I/O interface may also be connected to a display.
Please refer to fig. 1 and fig. 2. Fig. 2 is a flow chart of a process connection method 200 according to some embodiments of the disclosure. As shown in fig. 2, the process linking method 200 comprises the following steps:
step S210: obtaining a plurality of general program fragment contents stored in a program content database;
step S220: establishing a first program composition table for generating a first program; and
step S230: a second program composition table for generating a second program is established, and the second program composition table records whether the second program segment is connected to the first program segment of the first program composition table.
In order to make the procedure linking method 200 of the first embodiment of the present disclosure easy to understand, two procedures, i.e., procedure a and procedure B, are taken as an example, and please refer to fig. 1 to 4 together.
In step S210, a plurality of general program segment contents stored in the program content database are obtained. The general program fragment content refers to the program fragment content of the A program, and the program fragment content of the A program is stored in the program content database and is accessed from the program content database when the A program is needed.
In step S220, a first program composition table for generating a first program is established. For example, the first program is the program a, and a program composition table of the program a needs to be established, as shown in table one, the program a has 4 fragments (Piece _ a1 to Piece _ a4), each fragment corresponds to its version, for example, Piece _ a1 corresponds to version 2, because the program a does not refer to other programs, and thus does not have version information of the source content of the fragment. The fragment version of each program fragment of the program A is stored in the program content database, and the program composition table of the program A records the information of the program A as the basis for modifying the program at a later time.
Table one: program composition table of A program
| Program code | Program version | Program fragment | Fragment versions | Whether or not to refer to | Segment source content version |
| Procedure A | 1 | Piece_a1 | 2 | Whether or not | Is free of |
| Procedure A | 1 | Piece_a2 | 1 | Whether or not | Is free of |
| Procedure A | 1 | Piece_a3 | 3 | Whether or not | Is free of |
| Procedure A | 1 | Piece_a4 | 2 | Whether or not | Is free of |
In step S230, a second program composition table for generating a second program is created, and the second program composition table records whether the second program segment is connected to the first program segment of the first program composition table. For example, the second program is the program B, a program schedule of the program B needs to be established, and as shown in table two, the program B has 4 segments (Piece _ B1-Piece _ B4), each segment corresponds to its version, for example, Piece _ B1 corresponds to version 1, and version 1 of the program B refers to the program a completely, so that the source content version of the segment of the program B refers to the program segment version of the program a.
Table two: program composition table of B program
Referring to fig. 3, fig. 3 is a flowchart illustrating step S230 according to some embodiments of the disclosure. As shown in fig. 3, step S230 includes the following steps:
step S231: judging whether the second program segment is connected to the first program segment of the first program composition table;
step S232: the second program composition table records one of the regional program contents respectively used by the second program segments; and
step S233: the second program segment refers to the first program segment of the first program composition table.
In step S231, it is determined whether the second program segment is linked to the first program segment of the first program composition table. In table two, since all the B programs have the program fragment referencing the a program, after the determination is yes, step S233 is entered, and the second program fragment refers to the first program fragment of the first program composition table, for example, the fragment Piece _ B1 of the B program is the version 2 of the fragment Piece _ a1 referencing the a program.
If the determination in step S231 is "no", meaning that the second program fragment does not refer to the first program fragment in the first program composition table, step S232 is executed, in which the second program composition table records that the second program fragment uses one of the local program contents, respectively, please refer to the example shown in table three, in which neither the fragment Piece _ B2 nor the fragment Piece _ B4 of the B program refers to the program fragment of the a program, and therefore the program contents of the fragment Piece _ B2 and the fragment Piece _ B4 of the B program use the local program contents stored in the program content database, and the local program contents refer to the program fragment contents of the B program. The operations in step S231 and step S232 are the program breaking unit 111, and when the program is broken, the B program can not refer to the program fragment of the a program, and can adjust the content belonging to the B program by itself, and the content cannot be changed to the B program due to the modification of the a program.
Table three: program composition table-disconnection adjustment of B program
In another embodiment, referring to fig. 4, fig. 4 is a flowchart of a process connection method 400 according to some embodiments of the disclosure. As shown in fig. 4, the process linking method 400 includes the following steps:
step S410: obtaining a plurality of general program fragment contents stored in a program content database;
step S420: establishing a first program composition table for generating a first program;
step S430: if one of the first program segments updates one of the contents of the generic program segment;
step S440: generating a new fragment version number corresponding to one of the general program fragment contents;
step S450: judging whether the second program segment is connected to the first program segment of the first program composition table;
step S460: the second program composition table records that the second program segments respectively use one of the regional program contents; and
step S470: the fragment version number of the second program fragment is updated.
In steps S410 and S420, please refer to steps S210 and S220 respectively for the method of obtaining the contents of the general program segments stored in the program content database and establishing the first program composition table for generating the first program, which is the same as that in step S410 and step S220.
In steps S430 and S440, if one of the first program segments updates one of the contents of the general program segments, a new segment version number corresponding to the one of the contents of the general program segments is generated. For example, referring to table four together, the Piece _ a5 is newly added to the a program shown in table four, and the Piece _ a3 is adjusted from version 3 to version 4, the number of the Piece version field is updated, so the a program is updated to version 2.
Table four: program composition table-version adjustment of A program
In step S450, it is determined whether the second program segment is linked to the first program segment of the first program composition table. For example, please refer to table five together, as shown in table five, the B program updates from version 1 to version 2 with reference to the updated version of the a program, and also newly adds the Piece _ B5, and the Piece _ B3 and the Piece _ B5 both refer to the program content of the 2 nd version of the a program, and the Piece source content version fields of the Piece _ B3 and the Piece _ B5 both refer to the 4 th version of the Piece _ a3 and the Piece _ a5 of the a program.
Table five: program composition table-version adjustment of B program
| Program code | Program version | Program fragment | Fragment versions | Whether or not to refer to | Segment source content version |
| Procedure B | 2 | Piece_b1 | 1 | Is that | 2 |
| Procedure B | 2 | Piece_b2 | 1 | Whether or not | Is free of |
| Procedure B | 2 | Piece_b3 | 2 | Is that | 4 |
| Procedure B | 2 | Piece_b4 | 1 | Whether or not | Is free of |
| Procedure B | 2 | Piece_b5 | 2 | Is that | 4 |
Continuing from the above, if the determination in step S450 is "no", meaning that the second program fragment does not refer to the first program fragment of the first program composition table, step S460 is executed, in which the second program composition table records that the second program fragment uses one of the area program contents, respectively, and in table five, neither the fragment Piece _ B2 nor the fragment Piece _ B4 of the B program refers to the program fragment of the a program, so that the program contents of the fragment Piece _ B2 and the fragment Piece _ B4 of the B program refer to the area program contents stored in the program content database, which is the same as step S232.
Continuing from the above, if the determination in step S450 is "yes", the process proceeds to step S470, and the clip version number of the second program clip is updated, and in table 5, the clip Piece _ B3 and the clip Piece _ B5 of the B program are updated to the 2 nd version as the clip Piece _ a3 and the clip Piece _ a5 of the a program are updated to the 4 th edition.
Subsequently, the operations in step S430 and step S440 are the program fusing unit 112. The program B can be updated together with the version update of the program A, so that only the content of the program A can be modified, and other programs referring to the program A can be updated synchronously without updating the programs one by one. The operations of step S450 and step S460 are the program disconnection unit 111, and the functions are the same as those of step S231 and step S232. Therefore, in the program linking method 400, the program disconnecting unit 111 and the program fusing unit 112 are combined, so that the program a can fuse all the program fragments referenced by the program B into the program B by the program fusing unit 112, and the reference relationship between the program B and the program a is cut off by the program disconnecting unit 111, so that the program B can independently adjust the program content of the program B.
It can be seen from the above embodiments of the present disclosure that, mainly, the conventional method for fragmented program fragments is improved, the program fusion unit is used to enable the program fragments to be changed once for other programs that refer to the program fragments to be used together, and the program disconnection unit is also used to maintain the independence of a plurality of programs.
Additionally, the above illustration includes exemplary steps in sequential order, but the steps need not be performed in the order shown. It is within the contemplation of the disclosure to perform these steps in a different order. Steps may be added, substituted, changed in order, and/or omitted as appropriate within the spirit and scope of embodiments of the present disclosure.
Although the present disclosure has been described with reference to the above embodiments, it should be understood that various changes and modifications can be made therein by those skilled in the art without departing from the spirit and scope of the disclosure, and therefore, the scope of the disclosure is to be determined by the appended claims.
Claims (10)
1. A program connection method, comprising:
obtaining a program content database, wherein the program content database stores a plurality of general program fragment contents and a plurality of program composition tables;
establishing a first program composition table for generating a first program, wherein the first program is provided with a plurality of first program segments; and
establishing a second program composition table for generating a second program, the second program having a plurality of second program segments, the second program composition table recording whether the second program segments are linked to the first program segments of the first program composition table, wherein the plurality of first program segments and the plurality of second program segments cannot be expressed by function functions.
2. The program linkage method according to claim 1, wherein the program content database further comprises a plurality of local program contents, each of the plurality of general program fragment contents has at least one version, and different versions of the plurality of general program fragment contents have different fragment version numbers.
3. The method according to claim 2, wherein the first program composition table records fragment version numbers of contents of the common program fragments respectively referenced by the plurality of first program fragments.
4. The method of claim 2, wherein determining whether the second program segment is linked to the first program segment of the first program composition table further comprises:
if the second program segment does not refer to the first program segments of the first program composition table; and
the second program composition table records that the plurality of second program segments respectively use one of the plurality of regional program contents.
5. The program connection method according to claim 2, further comprising:
generating a new fragment version number corresponding to one of the plurality of general program fragment contents if one of the plurality of first program fragments updates one of the plurality of general program fragment contents;
determining whether the second program segment is linked to the first program segment of the first program composition table;
if the second program segment has the first program segment referring to the first program composition table; and
updating the fragment version number of the second program fragment.
6. A program connection system, comprising:
a storage device for storing a program content database, wherein the program content database stores a plurality of general program fragment contents;
a processor, electrically coupled to the storage device, for creating a first program composition table for generating a first program, the first program having a plurality of first program segments, and creating a second program composition table for generating a second program, the second program having a plurality of second program segments, the second program composition table recording whether the second program segments are linked to the first program segments of the first program composition table, wherein the plurality of first program segments and the plurality of second program segments cannot be expressed by function functions.
7. The system of claim 6, wherein the program content database further comprises a plurality of local program contents and a plurality of program composition tables, each of the plurality of general program fragment contents has at least one version, and different versions of the plurality of general program fragment contents have different fragment version numbers.
8. The system of claim 7, wherein the first program composition table records fragment version numbers of contents of the common program fragments respectively referenced by the plurality of first program fragments.
9. The system of claim 7, wherein the processor further comprises:
a program disconnection unit, configured to determine whether the second program segment is linked to the first program segment of the first program composition table, and if the second program segment does not refer to the first program segment of the first program composition table, the second program composition table records that the plurality of second program segments respectively use one of the plurality of regional program contents.
10. The system of claim 7, wherein the processor further comprises:
a program merging unit, configured to determine whether one of the first program segments updates one of the general-purpose program segment contents, if so, generate a new segment version number corresponding to one of the general-purpose program segment contents, then determine whether the second program segment is linked to the first program segment of the first program composition table, and if the second program segment has the first program segment referring to the first program composition table, update the segment version number of the second program segment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711390482.6A CN109947460B (en) | 2017-12-21 | 2017-12-21 | Program linking method and program linking system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711390482.6A CN109947460B (en) | 2017-12-21 | 2017-12-21 | Program linking method and program linking system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109947460A CN109947460A (en) | 2019-06-28 |
| CN109947460B true CN109947460B (en) | 2022-03-22 |
Family
ID=67005713
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711390482.6A Active CN109947460B (en) | 2017-12-21 | 2017-12-21 | Program linking method and program linking system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109947460B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102521117A (en) * | 2011-10-27 | 2012-06-27 | 北京航空航天大学 | Java exception propagation static structure extraction method |
| CN103810423A (en) * | 2012-11-06 | 2014-05-21 | 财团法人资讯工业策进会 | Safety processing method and safety processing system for application program |
| CN105808209A (en) * | 2011-05-03 | 2016-07-27 | 高通股份有限公司 | Methods and apparatus for storage and translation of entropy encoded software embedded within a memory hierarchy |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7055146B1 (en) * | 2001-03-08 | 2006-05-30 | Microsoft Corporation | Method and system for dynamically inserting modifications for identified programs |
| US7159208B2 (en) * | 2001-10-25 | 2007-01-02 | Keeley Thomas M | Programming toolkit for use in the development of knowledge enhanced electronic logic programs |
| US8392400B1 (en) * | 2005-12-29 | 2013-03-05 | Amazon Technologies, Inc. | Method and apparatus for stress management in a searchable data service |
| US8032877B2 (en) * | 2006-10-20 | 2011-10-04 | International Business Machines Corporation | Compiler neutral linking solution for C++ code |
| CN101441566B (en) * | 2008-11-18 | 2012-04-25 | 腾讯科技（深圳）有限公司 | Method for dynamically linking program on the Embedded type platform |
| WO2015191746A1 (en) * | 2014-06-13 | 2015-12-17 | The Charles Stark Draper Laboratory, Inc. | Systems and methods for a database of software artifacts |
| CN104699485A (en) * | 2015-03-19 | 2015-06-10 | 神华集团有限责任公司 | Massive program management method and massive program construction method |
| CN104881285B (en) * | 2015-05-25 | 2018-04-20 | 北京理工大学 | Code snippet mark and reuse system based on body |
-
2017
- 2017-12-21 CN CN201711390482.6A patent/CN109947460B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105808209A (en) * | 2011-05-03 | 2016-07-27 | 高通股份有限公司 | Methods and apparatus for storage and translation of entropy encoded software embedded within a memory hierarchy |
| CN102521117A (en) * | 2011-10-27 | 2012-06-27 | 北京航空航天大学 | Java exception propagation static structure extraction method |
| CN103810423A (en) * | 2012-11-06 | 2014-05-21 | 财团法人资讯工业策进会 | Safety processing method and safety processing system for application program |
Non-Patent Citations (2)
| Title |
|---|
| AUTOCAD的二次开发中对实体操作功能的设计;白广利等;《自动化技术与应用》;20081125;第49-52页 * |
| Automatic Program Segment Similarity Detection in Targeted Program Performance Improvement;Haiping Wu等;《2007 IEEE International Parallel and Distributed Processing Symposium》;20070611;第1-8页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109947460A (en) | 2019-06-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10771417B2 (en) | Control of messages in publish/subscribe system | |
| US10540368B2 (en) | System and method for resolving synchronization conflicts | |
| US8589349B2 (en) | Tracking and viewing revision history on a section-by-section basis | |
| US10346381B2 (en) | Atomic update operations in a data storage system | |
| CN104391725A (en) | Page display method and page display device | |
| US20130066832A1 (en) | Application state synchronization | |
| CN110673920A (en) | Internationalization processing method and device, computer equipment and storage medium | |
| CN106789249B (en) | Hot updating method, client and server | |
| US11068536B2 (en) | Method and apparatus for managing a document index | |
| CN109284066B (en) | Data processing method, device, equipment and system | |
| US20190325043A1 (en) | Method, device and computer program product for replicating data block | |
| US10372684B2 (en) | Metadata peering with improved inodes | |
| US10249068B2 (en) | User experience for multiple uploads of documents based on similar source material | |
| US8296399B2 (en) | Connecting galleries to dynamic server-hosted content | |
| CN104572917A (en) | Method and device for locking data and distributed storage system | |
| CN110674084A (en) | Method, apparatus, and computer-readable storage medium for data protection | |
| US9250828B2 (en) | Writable clone data structure | |
| US9047300B2 (en) | Techniques to manage universal file descriptor models for content files | |
| CN108108392B (en) | Commodity data management method, commodity data management device, computer equipment and storage medium | |
| CN109947460B (en) | Program linking method and program linking system | |
| US20080275959A1 (en) | Distributed Search in a Casual Network of Servers | |
| US8725765B2 (en) | Hierarchical registry federation | |
| US10678453B2 (en) | Method and device for checking false sharing in data block deletion using a mapping pointer and weight bits | |
| US11630742B2 (en) | System and method of performing recovery using a backup image | |
| US20170364496A1 (en) | Visualization interface for information object system |
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 |