CN116361272A - Correlation adjustment method for binary data link library - Google Patents
Correlation adjustment method for binary data link library Download PDFInfo
- Publication number
- CN116361272A CN116361272A CN202310564384.9A CN202310564384A CN116361272A CN 116361272 A CN116361272 A CN 116361272A CN 202310564384 A CN202310564384 A CN 202310564384A CN 116361272 A CN116361272 A CN 116361272A
- Authority
- CN
- China
- Prior art keywords
- dynamic
- database
- link
- static
- time
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000003068 static effect Effects 0.000 claims abstract description 138
- 238000012545 processing Methods 0.000 claims abstract description 25
- 238000012795 verification Methods 0.000 claims abstract description 15
- 230000002902 bimodal effect Effects 0.000 claims abstract description 4
- 238000013507 mapping Methods 0.000 claims description 36
- 230000002159 abnormal effect Effects 0.000 claims description 19
- 230000008569 process Effects 0.000 claims description 14
- 230000002457 bidirectional effect Effects 0.000 claims description 8
- 230000008859 change Effects 0.000 abstract description 2
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
Images
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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/21—Design, administration or maintenance of databases
-
- 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/25—Integrating or interfacing systems involving database management systems
- G06F16/256—Integrating or interfacing systems involving database management systems in federated or virtual databases
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the field of database association adjustment, in particular to an association adjustment method of a binary data link library, which comprises the following steps: s1, respectively establishing a static database and a dynamic database; s2, respectively acquiring a static link corresponding to the static database and a dynamic link corresponding to the dynamic database; s3, establishing a basic bimodal data link library by utilizing the static database, the static link, the dynamic database and the dynamic link; s4, the basic binary data link library is utilized to carry out independent verification processing to obtain a binary data link library, a static database is firstly established, dynamic links are generated at all times of data to establish a dynamic database, the conditions of time consuming and complex addressing of calling with substantial data to establish the library are avoided, meanwhile, the dynamic database can be adjusted at any time according to real-time change of the static database or application environment, the relevance and the concordance degree are improved to a great extent, the consistency of the binary data link library in use is ensured, and program error reporting caused by asynchronous conditions of subsequent calling is reduced as far as possible.
Description
Technical Field
The invention relates to the field of database association adjustment, in particular to an association adjustment method of a binary data link library.
Background
In reality, each program depends on a plurality of basic underlying libraries, the same program needs to use a plurality of databases from a component to operation, and the correlation cooperation among the databases is ensured to become the basis of code construction, but in practical working application, the operation memory of the system is not infinite, and when the excessive libraries or operations are executed, abnormal conditions such as error reporting and the like can exist, so that the operation error of the system crashes.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a correlation adjustment method of a binary database link library, which ensures that the binary database link library under the same program has strong correlation by mutually constructing mapping links through respectively established static and dynamic databases, thereby keeping high stability.
In order to achieve the above object, the present invention provides a method for adjusting association of a binary data link library, comprising:
s1, respectively establishing a static database and a dynamic database;
s2, respectively acquiring a static link corresponding to the static database and a dynamic link corresponding to the dynamic database;
s3, establishing a basic bimodal data link library by utilizing the static database, the static link, the dynamic database and the dynamic link;
and S4, performing independent verification processing by using the basic binary data link library to obtain a binary data link library.
Preferably, the establishing a static database and a dynamic database respectively includes:
s1-1, acquiring a corresponding moment of target data as a tail verification time stamp;
s1-2, establishing a basic target database by utilizing the target data and the corresponding suffix verification time stamp;
s1-3, acquiring a data attribute catalog of a basic target database;
s1-4, establishing a dynamic database by utilizing the data attribute catalog and a basic target database;
s1-5, utilizing the basic target database as a static database;
the target data are bottom-layer basic data corresponding to the binary data link library.
Further, establishing a dynamic database using the data attribute directory and the underlying target database includes:
s1-4-1, establishing a fixed mapping link by utilizing the data attribute catalog and corresponding target data;
s1-4-2, establishing an initial dynamic database by utilizing the fixed mapping link;
s1-4-3, judging whether an abnormal corresponding condition exists in the initial dynamic database, if yes, executing S1-4-4, otherwise, executing S1-4-6;
s1-4-4, acquiring a corresponding moment of target data with an abnormal corresponding condition as an additional time tag;
s1-4-5, updating the initial dynamic database by utilizing the additional time tag and the target data with the abnormal corresponding condition, and returning to S1-4-3;
s1-4-6, using the initial dynamic database as a dynamic database;
the exception corresponding condition is that a single data attribute catalog corresponds to a plurality of target data.
Further, updating the initial dynamic database by using the additional time tag and the target data with the abnormal corresponding condition includes:
acquiring a data attribute directory of target data with abnormal corresponding conditions as a data attribute directory to be updated;
and carrying out covering processing on the data attribute catalog of the target data with the abnormal corresponding condition by utilizing the additional time tag and the data attribute catalog to be updated to finish updating.
Preferably, the respectively obtaining the static link corresponding to the static database and the dynamic link corresponding to the dynamic database includes:
s2-1, acquiring a first static fixed link by utilizing the static database;
s2-2, acquiring a second static fixed link by utilizing the static database and the dynamic database;
s2-3, acquiring a dynamic internal link by utilizing the dynamic database;
s2-4, acquiring a dynamic external link by utilizing the second static fixed link and a dynamic database;
s2-5, using the first static fixed link and the second static fixed link as static links corresponding to a static database;
s2-6, using the dynamic internal link and the dynamic external link as dynamic links corresponding to the dynamic database.
Further, the obtaining the first static fixed link using the static database includes:
establishing data time sequence mapping by utilizing target data in the static database and corresponding suffix verification time stamps thereof;
and establishing a first static fixed link with a static database by utilizing the data time sequence mapping.
Further, the obtaining a second static fixed link using the static database and the dynamic database includes:
s2-2-1, acquiring corresponding target data in a static database according to the dynamic database to serve as real-time dynamic target data;
s2-2-2, judging whether the real-time dynamic target data has an additional time tag, if yes, executing S2-2-3, otherwise, establishing a bidirectional mapping link with the real-time dynamic target data by using the real-time dynamic target data corresponding to the current moment as a static time tag as a second static fixed link;
s2-2-3, judging whether all the real-time dynamic target data have additional time labels, if so, using the real-time dynamic target data corresponding to the current moment as a static time mark, and then using the static time mark, the real-time dynamic target data and the additional time labels to establish a triangle self-circulation link as a second static fixed link, otherwise, using the real-time dynamic target data without the additional time labels and the real-time dynamic target data with the additional time labels to establish a unidirectional mapping link as a second static fixed link;
s2-2-4, judging whether the second static fixed link is of a single type, if so, reserving the second static fixed link, otherwise, returning to S2-2-1;
wherein the single type is that the second static fixed link only has a bi-directional mapping link, a triangle self-loop link or a unidirectional mapping link.
Further, the obtaining the dynamic internal link using the dynamic database includes:
s2-3-1, acquiring a dynamic database at the current moment corresponding to a dynamic database at the last moment adjacent to the current moment as a historical dynamic database;
s2-3-2, judging whether the current time dynamic database and the historical dynamic database are completely the same, if yes, establishing a dynamic internal link by using the current time dynamic database and the current time, otherwise, establishing a dynamic internal link by using a difference fixed mapping link of the current time dynamic database and the historical dynamic database and the current time.
Further, the obtaining the dynamic external link by using the second static fixed link and the dynamic database includes:
s2-4-1, judging whether all real-time dynamic target data in the second static fixed link correspond to each other in a dynamic database, if so, executing S2-4-2, otherwise, executing S2-4-3;
s2-4-2, judging whether the second static fixed link is a unidirectional mapping link, if so, establishing a three-node double-channel unidirectional link with the dynamic database by using real-time dynamic target data without an additional time tag in the second static fixed link and real-time dynamic target data with the additional time tag as a dynamic external link, otherwise, establishing a bidirectional link with the dynamic database by using any node in the second static fixed link as a dynamic external link;
s2-4-3, judging whether the dynamic target data in the second static fixed link are all different in the dynamic database, if so, returning to S1-4-1, otherwise, returning to S2-1.
Preferably, the performing independent verification processing by using the basic binary data link library to obtain a binary data link library includes:
respectively establishing an actual running process and a virtual running process;
executing in an actual running process by utilizing a static database of a basic binary data link library to obtain a static real-time processing result;
executing in a virtual running process by utilizing a dynamic database of a basic binary data link library to obtain a dynamic real-time processing result;
and judging whether the static real-time processing result completely corresponds to the dynamic real-time processing result at the corresponding moment, if so, outputting a basic binary data link library as a binary data link library, otherwise, returning to S1-4-1.
Compared with the closest prior art, the invention has the following beneficial effects:
the scheme creatively provides the view of taking a plurality of association mapping links as the dynamic database, firstly, the static database is established, dynamic links are generated at all moments of data to establish the dynamic database, the conditions of time consuming and complex addressing and the like when the database is established by using substantial data are avoided, meanwhile, the dynamic database can be adjusted at any time according to the real-time change of the static database or the application environment, the association and the degree of the association are improved to a great extent, the consistency of the binary data link database in use is ensured, and the error reporting of programs caused by the asynchronous condition of subsequent calling is reduced as far as possible.
Drawings
FIG. 1 is a flowchart of a method for adjusting association of a binary data link library according to the present invention.
Detailed Description
The following describes the embodiments of the present invention in further detail with reference to the drawings.
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Example 1: the invention provides a method for adjusting association of a binary data link library, which is shown in figure 1 and comprises the following steps:
s1, respectively establishing a static database and a dynamic database;
s2, respectively acquiring a static link corresponding to the static database and a dynamic link corresponding to the dynamic database;
s3, establishing a basic bimodal data link library by utilizing the static database, the static link, the dynamic database and the dynamic link;
and S4, performing independent verification processing by using the basic binary data link library to obtain a binary data link library.
S1 specifically comprises:
s1-1, acquiring a corresponding moment of target data as a tail verification time stamp;
s1-2, establishing a basic target database by utilizing the target data and the corresponding suffix verification time stamp;
s1-3, acquiring a data attribute catalog of a basic target database;
s1-4, establishing a dynamic database by utilizing the data attribute catalog and a basic target database;
s1-5, utilizing the basic target database as a static database;
the target data are bottom-layer basic data corresponding to the binary data link library.
S1-4 specifically comprises:
s1-4-1, establishing a fixed mapping link by utilizing the data attribute catalog and corresponding target data;
s1-4-2, establishing an initial dynamic database by utilizing the fixed mapping link;
s1-4-3, judging whether an abnormal corresponding condition exists in the initial dynamic database, if yes, executing S1-4-4, otherwise, executing S1-4-6;
s1-4-4, acquiring a corresponding moment of target data with an abnormal corresponding condition as an additional time tag;
s1-4-5, updating the initial dynamic database by utilizing the additional time tag and the target data with the abnormal corresponding condition, and returning to S1-4-3;
s1-4-6, using the initial dynamic database as a dynamic database;
the exception corresponding condition is that a single data attribute catalog corresponds to a plurality of target data.
S1-4-5 specifically comprises:
s1-4-5-1, acquiring a data attribute catalog of target data with abnormal corresponding conditions as a data attribute catalog to be updated;
s1-4-5-2, performing covering processing on the data attribute catalog of the target data with the abnormal corresponding condition by utilizing the additional time tag and the data attribute catalog to be updated to finish updating.
In this embodiment, in the method for adjusting association of a binary data link library, the overlay process is to completely replace a data attribute directory of target data with an abnormal corresponding condition by using a newly generated additional time tag and a data attribute directory to be updated, and then, to use an initial dynamic database updated by using the newly generated additional time tag and the data attribute directory to be updated as the initial dynamic database at the current moment in step S1-4-3.
S2 specifically comprises:
s2-1, acquiring a first static fixed link by utilizing the static database;
s2-2, acquiring a second static fixed link by utilizing the static database and the dynamic database;
s2-3, acquiring a dynamic internal link by utilizing the dynamic database;
s2-4, acquiring a dynamic external link by utilizing the second static fixed link and a dynamic database;
s2-5, using the first static fixed link and the second static fixed link as static links corresponding to a static database;
s2-6, using the dynamic internal link and the dynamic external link as dynamic links corresponding to the dynamic database.
S2-1 specifically comprises:
s2-1-1, establishing data time sequence mapping by utilizing target data in the static database and corresponding tail verification time stamps thereof;
s2-1-2, establishing a first static fixed link with a static database by utilizing the data time sequence mapping.
S2-2 specifically comprises:
s2-2-1, acquiring corresponding target data in a static database according to the dynamic database to serve as real-time dynamic target data;
s2-2-2, judging whether the real-time dynamic target data has an additional time tag, if yes, executing S2-2-3, otherwise, establishing a bidirectional mapping link with the real-time dynamic target data by using the real-time dynamic target data corresponding to the current moment as a static time tag as a second static fixed link;
s2-2-3, judging whether all the real-time dynamic target data have additional time labels, if so, using the real-time dynamic target data corresponding to the current moment as a static time mark, and then using the static time mark, the real-time dynamic target data and the additional time labels to establish a triangle self-circulation link as a second static fixed link, otherwise, using the real-time dynamic target data without the additional time labels and the real-time dynamic target data with the additional time labels to establish a unidirectional mapping link as a second static fixed link;
s2-2-4, judging whether the second static fixed link is of a single type, if so, reserving the second static fixed link, otherwise, returning to S2-2-1;
wherein the single type is that the second static fixed link only has a bi-directional mapping link, a triangle self-loop link or a unidirectional mapping link.
In this embodiment, a method for adjusting association of a binary data link library is that a bidirectional mapping link is that a static time stamp and real-time dynamic target data can be mutually addressed, that is, real-time dynamic target data can be obtained according to mapping by using the static time stamp, or the static time stamp is addressed by using the real-time dynamic target data, a triangle self-circulation link is that three vertexes of a triangle are used as the static time stamp, the real-time dynamic target data and an additional time stamp, two pairs of the vertexes correspond to the bidirectional mapping, and a unidirectional mapping link is that the real-time dynamic target data with the additional time stamp can be addressed by using only the real-time dynamic target data without the additional time stamp.
S2-3 specifically comprises:
s2-3-1, acquiring a dynamic database at the current moment corresponding to a dynamic database at the last moment adjacent to the current moment as a historical dynamic database;
s2-3-2, judging whether the current time dynamic database and the historical dynamic database are completely the same, if yes, establishing a dynamic internal link by using the current time dynamic database and the current time, otherwise, establishing a dynamic internal link by using a difference fixed mapping link of the current time dynamic database and the historical dynamic database and the current time.
S2-4 specifically comprises:
s2-4-1, judging whether all real-time dynamic target data in the second static fixed link correspond to each other in a dynamic database, if so, executing S2-4-2, otherwise, executing S2-4-3;
s2-4-2, judging whether the second static fixed link is a unidirectional mapping link, if so, establishing a three-node double-channel unidirectional link with the dynamic database by using real-time dynamic target data without an additional time tag in the second static fixed link and real-time dynamic target data with the additional time tag as a dynamic external link, otherwise, establishing a bidirectional link with the dynamic database by using any node in the second static fixed link as a dynamic external link;
s2-4-3, judging whether the dynamic target data in the second static fixed link are all different in the dynamic database, if so, returning to S1-4-1, otherwise, returning to S2-1.
S4 specifically comprises the following steps:
s4-1, respectively establishing an actual running process and a virtual running process;
s4-2, executing in an actual running process by utilizing a static database of the basic binary data link library to obtain a static real-time processing result;
s4-3, executing in a virtual running process by utilizing a dynamic database of the basic binary data link library to obtain a dynamic real-time processing result;
s4-4, judging whether the static real-time processing result completely corresponds to the dynamic real-time processing result at the corresponding moment, if so, outputting a basic binary data link library as a binary data link library, otherwise, returning to S1-4-1.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical aspects of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the above embodiments, it should be understood by those of ordinary skill in the art that: modifications and equivalents may be made to the specific embodiments of the invention without departing from the spirit and scope of the invention, which is intended to be covered by the claims.
Claims (10)
1. The association adjustment method of the binary data link library is characterized by comprising the following steps of:
s1, respectively establishing a static database and a dynamic database;
s2, respectively acquiring a static link corresponding to the static database and a dynamic link corresponding to the dynamic database;
s3, establishing a basic bimodal data link library by utilizing the static database, the static link, the dynamic database and the dynamic link;
and S4, performing independent verification processing by using the basic binary data link library to obtain a binary data link library.
2. The method for adjusting association of a binary data link library as claimed in claim 1, wherein said respectively creating a static database and a dynamic database comprises:
s1-1, acquiring a corresponding moment of target data as a tail verification time stamp;
s1-2, establishing a basic target database by utilizing the target data and the corresponding suffix verification time stamp;
s1-3, acquiring a data attribute catalog of the basic target database;
s1-4, establishing a dynamic database by utilizing the data attribute catalog and a basic target database;
s1-5, utilizing the basic target database as a static database;
the target data are bottom-layer basic data corresponding to the binary data link library.
3. The method of claim 2, wherein creating a dynamic database with the data attribute directory and the underlying target database comprises:
s1-4-1, establishing a fixed mapping link by utilizing the data attribute catalog and corresponding target data;
s1-4-2, establishing an initial dynamic database by utilizing the fixed mapping link;
s1-4-3, judging whether an abnormal corresponding condition exists in the initial dynamic database, if yes, executing S1-4-4, otherwise, executing S1-4-6;
s1-4-4, acquiring a corresponding moment of target data with an abnormal corresponding condition as an additional time tag;
s1-4-5, updating the initial dynamic database by utilizing the additional time tag and the target data with the abnormal corresponding condition, and returning to S1-4-3;
s1-4-6, using the initial dynamic database as a dynamic database;
the exception corresponding condition is that a single data attribute catalog corresponds to a plurality of target data.
4. The method for adjusting association of a binary data link library as claimed in claim 3, wherein updating the initial dynamic database by using the additional time stamp and the target data corresponding to the abnormal condition comprises:
acquiring a data attribute directory of target data with abnormal corresponding conditions as a data attribute directory to be updated;
and carrying out covering processing on the data attribute catalog of the target data with the abnormal corresponding condition by utilizing the additional time tag and the data attribute catalog to be updated to finish updating.
5. The method for adjusting association of a binary data link library according to claim 1, wherein the respectively obtaining a static link corresponding to a static database and a dynamic link corresponding to a dynamic database comprises:
s2-1, acquiring a first static fixed link by utilizing the static database;
s2-2, acquiring a second static fixed link by utilizing the static database and the dynamic database;
s2-3, acquiring a dynamic internal link by utilizing the dynamic database;
s2-4, acquiring a dynamic external link by utilizing the second static fixed link and a dynamic database;
s2-5, using the first static fixed link and the second static fixed link as static links corresponding to a static database;
s2-6, using the dynamic internal link and the dynamic external link as dynamic links corresponding to the dynamic database.
6. The method of claim 5, wherein obtaining a first static fixed link using the static database comprises:
establishing data time sequence mapping by utilizing target data in the static database and corresponding suffix verification time stamps thereof;
and establishing a first static fixed link with a static database by utilizing the data time sequence mapping.
7. The method of claim 5, wherein obtaining a second static fixed link using the static database and the dynamic database comprises:
s2-2-1, acquiring corresponding target data in a static database according to the dynamic database to serve as real-time dynamic target data;
s2-2-2, judging whether the real-time dynamic target data has an additional time tag, if yes, executing S2-2-3, otherwise, establishing a bidirectional mapping link with the real-time dynamic target data by using the real-time dynamic target data corresponding to the current moment as a static time tag as a second static fixed link;
s2-2-3, judging whether all the real-time dynamic target data have additional time labels, if so, using the real-time dynamic target data corresponding to the current moment as a static time mark, and then using the static time mark, the real-time dynamic target data and the additional time labels to establish a triangle self-circulation link as a second static fixed link, otherwise, using the real-time dynamic target data without the additional time labels and the real-time dynamic target data with the additional time labels to establish a unidirectional mapping link as a second static fixed link;
s2-2-4, judging whether the second static fixed link is of a single type, if so, reserving the second static fixed link, otherwise, returning to S2-2-1;
wherein the single type is that the second static fixed link only has a bi-directional mapping link, a triangle self-loop link or a unidirectional mapping link.
8. The method of claim 5, wherein obtaining dynamic internal links using the dynamic database comprises:
s2-3-1, acquiring a dynamic database at the current moment corresponding to a dynamic database at the last moment adjacent to the current moment as a historical dynamic database;
s2-3-2, judging whether the current time dynamic database and the historical dynamic database are completely the same, if yes, establishing a dynamic internal link by using the current time dynamic database and the current time, otherwise, establishing a dynamic internal link by using a difference fixed mapping link of the current time dynamic database and the historical dynamic database and the current time.
9. The method of claim 7, wherein the step of obtaining the dynamic external link using the second static fixed link and the dynamic database comprises:
s2-4-1, judging whether all real-time dynamic target data in the second static fixed link correspond to each other in a dynamic database, if so, executing S2-4-2, otherwise, executing S2-4-3;
s2-4-2, judging whether the second static fixed link is a unidirectional mapping link, if so, establishing a three-node double-channel unidirectional link with the dynamic database by using real-time dynamic target data without an additional time tag in the second static fixed link and real-time dynamic target data with the additional time tag as a dynamic external link, otherwise, establishing a bidirectional link with the dynamic database by using any node in the second static fixed link as a dynamic external link;
s2-4-3, judging whether the dynamic target data in the second static fixed link are all different in the dynamic database, if so, returning to S1-4-1, otherwise, returning to S2-1.
10. The method for adjusting association of a binary data link library according to claim 1, wherein the step of performing independent verification processing using the basic binary data link library to obtain the binary data link library comprises:
respectively establishing an actual running process and a virtual running process;
executing in an actual running process by utilizing a static database of a basic binary data link library to obtain a static real-time processing result;
executing in a virtual running process by utilizing a dynamic database of a basic binary data link library to obtain a dynamic real-time processing result;
and judging whether the static real-time processing result completely corresponds to the dynamic real-time processing result at the corresponding moment, if so, outputting a basic binary data link library as a binary data link library, otherwise, returning to S1-4-1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310564384.9A CN116361272B (en) | 2023-05-17 | 2023-05-17 | Correlation adjustment method for binary data link library |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310564384.9A CN116361272B (en) | 2023-05-17 | 2023-05-17 | Correlation adjustment method for binary data link library |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116361272A true CN116361272A (en) | 2023-06-30 |
| CN116361272B CN116361272B (en) | 2023-12-01 |
Family
ID=86928299
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310564384.9A Active CN116361272B (en) | 2023-05-17 | 2023-05-17 | Correlation adjustment method for binary data link library |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116361272B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1758251A (en) * | 2004-10-09 | 2006-04-12 | 微软公司 | Interactive of static and dynamic data set |
| US20070288913A1 (en) * | 2006-04-07 | 2007-12-13 | Sunplus Technology Co., Ltd. | Method for sharing static link code by software components in DLL and main program |
| US20090210441A1 (en) * | 2008-02-19 | 2009-08-20 | Paul Mercer | Integration of static and dynamic data for database entities and the unified presentation thereof |
| US20180349156A1 (en) * | 2017-06-02 | 2018-12-06 | Apple Inc. | Techniques for performing dynamic linking |
| CN112650539A (en) * | 2019-09-26 | 2021-04-13 | 无锡江南计算技术研究所 | Dynamic link operation supporting method for heterogeneous many-core processor |
| CN114780654A (en) * | 2022-05-27 | 2022-07-22 | 河北省科学技术情报研究院(河北省科技创新战略研究院) | Processing method for modular construction of multi-source main and auxiliary entity structure |
-
2023
- 2023-05-17 CN CN202310564384.9A patent/CN116361272B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1758251A (en) * | 2004-10-09 | 2006-04-12 | 微软公司 | Interactive of static and dynamic data set |
| US20070288913A1 (en) * | 2006-04-07 | 2007-12-13 | Sunplus Technology Co., Ltd. | Method for sharing static link code by software components in DLL and main program |
| US20090210441A1 (en) * | 2008-02-19 | 2009-08-20 | Paul Mercer | Integration of static and dynamic data for database entities and the unified presentation thereof |
| US20180349156A1 (en) * | 2017-06-02 | 2018-12-06 | Apple Inc. | Techniques for performing dynamic linking |
| CN112650539A (en) * | 2019-09-26 | 2021-04-13 | 无锡江南计算技术研究所 | Dynamic link operation supporting method for heterogeneous many-core processor |
| CN114780654A (en) * | 2022-05-27 | 2022-07-22 | 河北省科学技术情报研究院(河北省科技创新战略研究院) | Processing method for modular construction of multi-source main and auxiliary entity structure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116361272B (en) | 2023-12-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106611037A (en) | Method and device for distributed diagram calculation | |
| CN110941602B (en) | Database configuration method and device, electronic equipment and storage medium | |
| CN110837520A (en) | Data processing method, platform and system | |
| CN111897808B (en) | Data processing method and device, computer equipment and storage medium | |
| CN109614454B (en) | Vector big data parallel space superposition analysis method based on MPI | |
| CN103069396A (en) | Object arrangement apparatus, method therefor, and computer program | |
| CN111522811B (en) | Database processing method and device, storage medium and terminal | |
| CN105183880A (en) | Hash join method and device | |
| CN106610857A (en) | Hot patch information inquiring method and device | |
| CN111782404A (en) | Data processing method and related equipment | |
| CN110597821B (en) | Method and device for changing database table structure | |
| Sattler et al. | Towards Elastic Stream Processing: Patterns and Infrastructure. | |
| CN111475511A (en) | Data storage method, data access method, data storage device, data access device and data access equipment based on tree structure | |
| CN104991836A (en) | Database recovery method and apparatus and database server | |
| CN116361272B (en) | Correlation adjustment method for binary data link library | |
| CN113672692A (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN105210059A (en) | Data processing method and system | |
| CN108334532A (en) | A kind of Eclat parallel methods, system and device based on Spark | |
| CN111125090B (en) | Data access method and device | |
| CN105630778A (en) | DB data migration method and system | |
| CN106776810A (en) | The data handling system and method for a kind of big data | |
| CN107562943B (en) | Data calculation method and system | |
| CN112929400A (en) | Distributed cache database data rebalancing method and system | |
| CN113821517A (en) | Data synchronization method, device, equipment and storage medium | |
| CN107622070A (en) | A kind of data base management 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 |