CN113064881A - Database management method, device, equipment and readable storage medium - Google Patents
Database management method, device, equipment and readable storage medium Download PDFInfo
- Publication number
- CN113064881A CN113064881A CN202110405579.XA CN202110405579A CN113064881A CN 113064881 A CN113064881 A CN 113064881A CN 202110405579 A CN202110405579 A CN 202110405579A CN 113064881 A CN113064881 A CN 113064881A
- Authority
- CN
- China
- Prior art keywords
- child node
- information
- current
- node information
- node
- 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.)
- Pending
Links
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
- G06F16/211—Schema design and management
-
- 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
Abstract
The application discloses a database management method, a database management device, a database management equipment and a readable storage medium. The method disclosed by the application comprises the following steps: if any father node in the OVSDB database creates a new child node, recording the current child node information of the father node; and comparing the current child node information with all child node information of the current father node before the new child node is created, thereby determining which new child nodes are created currently, and then only creating context information of the new child nodes for corresponding processing, so that table association processing only needs to be performed on the new child nodes, and old child nodes under the father node do not need to be considered, thereby reducing the complexity of flow processing and the processing complexity of the OVSDB database. Accordingly, the database management device, the apparatus and the readable storage medium provided by the present application also have the technical effects described above.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a database management method, apparatus, device, and readable storage medium.
Background
The OVSDB Database (Open vSwitch Database, Open virtual switch Database) communicates with the client through an OVSDB protocol (Open vSwitch Database management protocol).
If any father node (a certain table recorded in the OVSDB database) in the OVSDB database creates a new child node (a certain column of the table), then when the table association processing is carried out, the current father node including all the children needs to be createdContext information of the node. Assuming that after a child node is newly created, the current parent node includes N child nodes, N pieces of context information need to be created for table association processing, and N pieces of loop processing need to be performed. That is: after a child node is newly built, the process processing complexity of the database is O (N)2) If any one processing includes 3 stages, the overall processing complexity is 3 × O (N)2). O represents temporal complexity.
Therefore, how to reduce the processing complexity of the OVSDB database is a problem to be solved by those skilled in the art.
Disclosure of Invention
In view of the above, an object of the present application is to provide a database management method, apparatus, device and readable storage medium, so as to reduce the processing complexity of the OVSDB database. The specific scheme is as follows:
in a first aspect, the present application provides a database management method, including:
if any father node in the OVSDB database creates a new child node, recording the current child node information of the father node;
obtaining historical child node information of the father node; the history child node information includes: before the new child node is created, all child node information of the father node;
and comparing the historical child node information with the current child node information to determine the new child node, and creating context information of the new child node to perform corresponding processing.
Preferably, the recording the current child node information of the parent node includes:
and recording identification information and corresponding bitmap marks corresponding to each child node included in the current parent node by using a bitmap to obtain the current child node information.
Preferably, the comparing the historical child node information and the current child node information to determine the new child node includes:
querying the historical child node information and the current child node information by using a binary search method to determine a target child node which simultaneously appears in the historical child node information and the current child node information;
and determining other nodes except the target child node in the current child node information as the new child node.
Preferably, the comparing and querying the historical child node information and the current child node information by using a binary search method to determine a target child node appearing in the historical child node information and the current child node information at the same time includes:
and inquiring and marking the target child node in the current child node information by using the binary search method based on the historical child node information.
Preferably, the comparing and querying the historical child node information and the current child node information by using a binary search method to determine a target child node appearing in the historical child node information and the current child node information at the same time includes:
and inquiring and marking the target child node in the historical child node information by using the binary search method based on the current child node information.
Preferably, the method further comprises the following steps:
if the configuration information in the OVSDB database is synchronized to the client, the client judges whether the current synchronization type is initial synchronization; and if so, reading the configuration information from the OVSDB database, inquiring first information with a parent-child association relationship in the configuration information, and analyzing the first information at one time.
Preferably, the method further comprises the following steps:
and the client analyzes the second information one by one aiming at the second information which does not have a parent-child association relationship in the configuration information.
In a second aspect, the present application provides a database management apparatus, comprising:
the recording module is used for recording the current child node information of any father node in the OVSDB database if the father node creates a new child node;
the acquisition module is used for acquiring historical child node information of the father node; the history child node information includes: before the new child node is created, all child node information of the father node;
and the processing module is used for comparing the historical child node information with the current child node information to determine the new child node and creating the context information of the new child node for corresponding processing.
In a third aspect, the present application provides a database management apparatus, including:
a memory for storing a computer program;
a processor for executing the computer program to implement the database management method disclosed in the foregoing.
In a fourth aspect, the present application provides a readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the database management method disclosed above.
According to the scheme, the application provides a database management method, which comprises the following steps: if any father node in the OVSDB database creates a new child node, recording the current child node information of the father node; obtaining historical child node information of the father node; the history child node information includes: before the new child node is created, all child node information of the father node; and comparing the historical child node information with the current child node information to determine the new child node, and creating context information of the new child node to perform corresponding processing.
Therefore, according to the method and the device, after a new child node is created in any father node in the OVSDB database, the current child node information of the father node is recorded, and the current child node information is compared with all child node information of the current father node before the new child node is created, so that the new child nodes which are newly created can be determined, and then only the context information of the new child node is created for corresponding processing, so that table association processing only needs to be performed on the new child node, and the old child node under the father node does not need to be considered, and therefore the complexity of flow processing and the processing complexity of the OVSDB database are reduced.
Accordingly, the database management device, the apparatus and the readable storage medium provided by the present application also have the technical effects described above.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a flow chart of a database management method disclosed herein;
FIG. 2 is a flow chart of another database management method disclosed in the present application
Figure 3 is a schematic diagram of a basic framework of an SDN network version disclosed in the present application;
FIG. 4 is a schematic diagram of a database management apparatus according to the present disclosure;
FIG. 5 is a schematic diagram of a database management apparatus disclosed herein;
FIG. 6 is a schematic diagram of another database management apparatus disclosed herein.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
At present, if any parent node (a certain table recorded in the OVSDB database) in the OVSDB database creates a new child node (a certain column of the table), when performing table association processing, it is necessary to create context information of the current parent node including all child nodes for processing. Suppose a son is newly builtAfter the node, if the current parent node includes N child nodes, N pieces of context information need to be created for table association processing, and N pieces of loop processing need to be performed. That is: after a child node is newly built, the process processing complexity of the database is O (N)2) If any one processing includes 3 stages, the overall processing complexity is 3 × O (N)2). O represents temporal complexity. Therefore, the data base management scheme is provided, and the processing complexity of the OVSDB data base can be reduced.
Referring to fig. 1, an embodiment of the present application discloses a database management method, including:
s101, if any father node in the OVSDB database creates a new child node, recording the current child node information of the father node.
In this embodiment, the client manages an OVSDB database through the OVSDB protocol, and the OVSDB database is used for recording configuration information. Namely: configuration information is recorded in a table in the OVSDB database, and the table comprises a plurality of columns. If a table is a father node, a plurality of columns included in the table are child nodes. If a child node is created, table association processing is also required to be performed, so that the newly created child node is written into the column of the corresponding parent node.
In one embodiment, recording the current child node information of the parent node includes: and recording identification information (such as UUID) corresponding to each child node included in the current parent node and a corresponding bitmap mark by using a bitmap to obtain the current child node information. For example: if the current parent node includes 2 child nodes, the UUID (Universally Unique Identifier) and the corresponding bitmap flag (initially a default value, such as 0) of the 2 child nodes are recorded in the bitmap. UUIDs are used to distinguish different children nodes under the same parent node. The UUIDs of different children under the same parent node have a fixed order (e.g., arranged according to the A, B, C, D … … english alphabet), and then the UUIDs are recorded in the bitmap in that fixed order) and corresponding bitmap labels. Of course, the historical child node information and the current child node information may also be recorded in a table or other manner.
S102, obtaining historical child node information of the father node.
Wherein. The history child node information includes: all child node information of the parent node before creating a new child node. Of course, the historical child node information is recorded by using a bitmap, and the identification information and the corresponding bitmap mark corresponding to each child node included in the parent node are also recorded, and compared with the current child node information, the record time is different.
S103, comparing the historical child node information with the current child node information to determine a new child node, and creating context information of the new child node to perform corresponding processing.
In this embodiment, table association processing, such as increasing or decreasing reference counts, is performed based on the context information of the new child node, and reference may be specifically made to the related art.
In one embodiment, comparing the historical child node information and the current child node information to determine a new child node comprises: querying historical child node information and current child node information by using a binary search method to determine a target child node which simultaneously appears in the historical child node information and the current child node information; and determining other nodes except the target child node in the current child node information as new child nodes.
Specifically, child nodes (i.e., target child nodes) which are commonly recorded in the historical child node information and the current child node information can be found out, and the commonly recorded child nodes are original child nodes of the parent node before the new child nodes are created, so that the new child nodes which are newly created at present can be determined by excluding the commonly recorded child nodes.
The method for comparing and inquiring the historical sub-node information and the current sub-node information by utilizing a binary search method to determine the target sub-node which simultaneously appears in the historical sub-node information and the current sub-node information comprises the following steps: and inquiring and marking the target child node in the current child node information by using the history child node information as a reference through a binary search method.
The method for comparing and inquiring the historical sub-node information and the current sub-node information by utilizing a binary search method to determine the target sub-node which simultaneously appears in the historical sub-node information and the current sub-node information comprises the following steps: and inquiring and marking the target child node in the historical child node information by using a binary search method based on the current child node information.
Therefore, in the embodiment of the application, after a new child node is created in any father node in the OVSDB database, the current child node information of the father node is recorded, and the current child node information is compared with all child node information of the current father node before the new child node is created, so that which new child nodes are created currently can be determined, and then only the context information of the new child node is created for corresponding processing, so that only table association processing needs to be performed on the new child node, and an old child node under the father node does not need to be considered, thereby reducing the complexity of flow processing and the processing complexity of the OVSDB database.
Referring to fig. 2, an embodiment of the present application discloses another database management method, including:
s201, synchronizing the configuration information in the OVSDB database to the client.
Synchronizing the configuration information in the OVSDB database to the client includes: initial synchronization and normal synchronization. The initial synchronization is as follows: all configuration information in the OVSDB database needs to be synchronized to the client. Normal synchronization is that: configuration information is newly added in the OVSDB database, and the newly added configuration information needs to be synchronized to the client. The newly added configuration information is generally less, so that the problem of slow synchronization generally does not exist.
If the data size of all configuration information in the OVSDB database is large, the synchronization process is relatively long (10 ten thousand configurations are synchronized, which requires more than 30 minutes), so the synchronization efficiency is slow, and the performance time requirement for configuration recovery in the current system cannot be met.
S202, the client judges whether the type of the current synchronization is initial synchronization; if yes, go to S203; if not, executing default operation.
The default operation is: and synchronizing the configuration information to the client according to the normal synchronization process, namely analyzing the configuration information one by one to complete synchronization. In this process, when a certain piece of configuration information in the table is analyzed, the previous pieces of configuration information need to be repeatedly analyzed, so that the default operation has a problem of loop processing, but the problem can be neglected temporarily because the total data volume is small.
S203, the client reads the configuration information from the OVSDB database, inquires the first information with the association relationship between the parent and the child in the configuration information, and analyzes the first information once.
And S204, the client analyzes the second information one by one according to the second information which does not have the parent-child association relationship in the configuration information.
Because the initial synchronization requires a large amount of data to be synchronized, in order to avoid repeatedly analyzing each piece of configuration information in front of a certain piece of configuration information in the analysis table when analyzing the configuration information, the embodiment analyzes the first information with a parent-child association relationship at one time, so that the repeated analysis process can be avoided, thereby improving the synchronization efficiency and reducing the synchronization time.
For a better introduction of the present application, the following is now analyzed in connection with a specific network infrastructure. Referring to fig. 3, an embodiment of the present application discloses a basic framework of an SDN network version, including: a controller, a control plane (including a configuration center), and a data plane. The control plane uses the controller to carry out configuration processing with the data plane, the protocol mainly used is OVSDB, the controller is used as a client to write the configuration into an OVSDB database, and the platform obtains the changed configuration from the OVSDB database.
Protocols in an SDN network may be divided into management plane protocols and control plane protocols by function. The SDN controller is used as a boundary, and the interface can be divided into a south interface and a north interface according to the hierarchy of the programmable interfaces. The OpenFlow protocol is strictly a control-layer southbound interface protocol, and the OVSDB management protocol is a management-layer southbound interface protocol. The controller may manage Open source virtual switches (OVSs) and OVSDB databases based on the OVSDB protocol.
Under the basic framework shown in fig. 3, there are the following problems:
1. bj _ dhcp6_ lease _ info is used as a lease table (a child node) in the OVSDB database, the parent node of the lease table is vr- > bj _ dhcp6_ lease _ info, and when a lease (configuration information) is written into the OVSDB database, the lease table also needs to be written into a corresponding column synchronously, that is: written into the corresponding column of its parent node. At this time, table association processing is required, that is: the context information of the current parent node including all the child nodes needs to be created for processing, and the process complexity of the database is high.
2. If the initial synchronization is performed, the same complexity problem exists when the client analyzes the configuration information with the parent-child association relationship.
For problem 1, the present application is to record two bitmaps for the same father node to solve, and specifically as follows:
after a child node is newly created, before table association processing is performed, a new bitmap is created, and UUIDs and bitmap marks of all child nodes included in a current parent node are recorded in the new bitmap. Meanwhile, UUIDs and bitmap marks of all child nodes included by a parent node before the new child node are recorded by using an old bitmap. The bitmap flags in the new bitmap and the old bitmap default to 0.
Using bitmaps with few bitmap marks as a reference, searching bitmaps with more bitmap marks by using a dichotomy, and if UUIDs recorded in another bitmap are searched in the bitmaps with more bitmap marks, setting the corresponding bitmap marks in the new bitmap and the old bitmap to be 1; otherwise, the bitmap flag remains 0.
When table association processing is carried out, if the bitmap is marked as 1, the child node is skipped; and if the bitmap is marked as 0, creating the context information of the corresponding child node for table association processing.
Such as: before the child node is newly built, the child node comprises: [ ca351d64-e7ba-4acf-a33c-8b16af823ca1, f5301fb8-db6f-4860-be28-5ad2fa3cdb87 ]. After the child node is newly built, the child node comprises: [ ca351d64-e7ba-4acf-a33c-8b16af823ca1, d60dbee3-2118-4949-a002-fd87fb3b8e24, f5301fb8-db6f-4860-be28-5ad2fa3cdb87 ].
As can be seen, the new "d 60dbee 3-2118-" 4949-a002-fd87fb3b8e24 "is added.
If the bitmap is used for recording, initially, the bitmap in the new bitmap is marked as 000, the bitmap in the old bitmap is marked as 00, after the old bitmap and the new bitmap are updated, the bitmap in the new bitmap is marked as 101, and the bitmap in the old bitmap is marked as 11. Then, the new child node can be determined according to the updated new bitmap, the previous two old nodes are skipped over, the old table entry is not processed repeatedly, the time complexity is reduced, and the purpose of optimizing the performance is achieved. The experiment proves that: 4000 stripes were written and the processing time decreased from 1 minute 40 seconds to 40 seconds.
For problem 2, the present application solves the following processing logic:
if the client receives the configuration synchronization message, firstly judging whether the message is an initial synchronization message, if so, judging whether the configuration information with a parent-child association relation needs to be synchronized; when the conditions are met, all the father table processing columns are applied at one time so as to analyze and process the configuration information with the father-son association relationship at one time, thereby avoiding frequent repeated operation and reducing the time complexity to O (N). The experiment proves that: when 10 ten thousand entries are synchronized, the time is reduced from 30 minutes to 8 seconds, and the linear relation is formed. The client and the OVSDB database perform data synchronization through an OVSDB _ idl _ row _ prepare _ backsrefs interface.
It can be seen that, in this embodiment, by making bitmaps for child node information before and after writing, and searching according to the UUID, when both the old bitmap and the new bitmap exist, it is considered that the new child node does not belong to the new child node, and this item is skipped, only the newly added part is processed, so that the time complexity is reduced to o (n), and the writing performance is improved. When the client is initially synchronized, the processing logic is modified, the configuration information with a parent-child association relation is processed in a parent table memory at one time, the child tables are directly associated, the time complexity is reduced to O (N), and the performance is improved.
In the following, a database management apparatus provided in an embodiment of the present application is introduced, and a database management apparatus described below and a database management method described above may be referred to each other.
Referring to fig. 4, an embodiment of the present application discloses a database management apparatus, including:
a recording module 401, configured to record current child node information of any parent node in the OVSDB database if the new child node is created by the parent node;
an obtaining module 402, configured to obtain historical child node information of the parent node; the history child node information includes: before the new child node is created, all child node information of the father node;
a processing module 403, configured to compare the historical child node information with the current child node information to determine the new child node, and create context information of the new child node to perform corresponding processing.
In a specific embodiment, the recording module is specifically configured to:
and recording identification information corresponding to each child node included in the current parent node and a corresponding bitmap mark by using a bitmap to obtain the current child node information.
In one embodiment, the processing module comprises:
the query unit is used for querying the historical child node information and the current child node information by utilizing a binary search method so as to determine a target child node which is simultaneously appeared in the historical child node information and the current child node information;
and the determining unit is used for determining other nodes except the target child node in the current child node information as new child nodes.
In a specific embodiment, the query unit is specifically configured to:
and inquiring and marking the target child node in the current child node information by using the history child node information as a reference through a binary search method.
In a specific embodiment, the query unit is specifically configured to:
and inquiring and marking the target child node in the historical child node information by using a binary search method based on the current child node information.
In a specific embodiment, the method further comprises the following steps:
the synchronization module is used for judging whether the current synchronization type is initial synchronization or not by the client if the configuration information in the OVSDB database is synchronized to the client; and if so, reading the configuration information from the OVSDB database, inquiring the first information with a parent-child association relation in the configuration information, and analyzing the first information at one time.
In a specific embodiment, the method further comprises the following steps:
and the analysis module is used for analyzing the second information one by the client aiming at the second information which does not have the parent-child association relationship in the configuration information.
For more specific working processes of each module and unit in this embodiment, reference may be made to corresponding contents disclosed in the foregoing embodiments, and details are not described here again.
Therefore, the embodiment provides a database management device, which improves the access security of a service system, has higher control efficiency, is easy to implement, and provides a great deal of convenience for subsequent operation and maintenance work.
In the following, a database management device provided in an embodiment of the present application is introduced, and a database management device described below and a database management method and apparatus described above may be referred to each other.
Referring to fig. 5, an embodiment of the present application discloses a database management apparatus, including:
a memory 501 for storing a computer program;
a processor 502 for executing the computer program to implement the method disclosed in any of the embodiments above.
Referring to fig. 6, fig. 6 is a schematic diagram of another database management apparatus provided in this embodiment, which may have a relatively large difference due to different configurations or performances, and may include one or more processors (CPUs) 322 (e.g., one or more processors) and a memory 332, and one or more storage media 330 (e.g., one or more mass storage devices) storing applications 342 or data 344. Memory 332 and storage media 330 may be, among other things, transient storage or persistent storage. The program stored on the storage medium 330 may include one or more modules (not shown), each of which may include a series of instructions operating on a data processing device. Still further, the central processor 322 may be configured to communicate with the storage medium 330 to execute a series of instruction operations in the storage medium 330 on the database management device 301.
The database management apparatus 301 may also include one or more power supplies 326, one or more wired or wireless network interfaces 350, one or more input-output interfaces 358, and/or one or more operating systems 341. Such as Windows Server, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, etc.
In fig. 6, the application 342 may be a program that performs a database management method, and the data 344 may be data required for or generated by the execution of the database management method.
The steps in the database management method described above may be implemented by the structure of a database management apparatus.
In the following, a readable storage medium provided by an embodiment of the present application is introduced, and a readable storage medium described below and a database management method, apparatus, and device described above may be mutually referred to.
A readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the database management method disclosed in the foregoing embodiments. For the specific steps of the method, reference may be made to the corresponding contents disclosed in the foregoing embodiments, which are not described herein again.
References in this application to "first," "second," "third," "fourth," etc., if any, are intended to distinguish between similar elements and not necessarily to describe a particular order or sequence. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Furthermore, the terms "comprises" and "comprising," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, or apparatus.
It should be noted that the descriptions in this application referring to "first", "second", etc. are for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present application.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of readable storage medium known in the art.
The principle and the implementation of the present application are explained herein by applying specific examples, and the above description of the embodiments is only used to help understand the method and the core idea of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (10)
1. A database management method, comprising:
if any father node in the OVSDB database creates a new child node, recording the current child node information of the father node;
obtaining historical child node information of the father node; the history child node information includes: before the new child node is created, all child node information of the father node;
and comparing the historical child node information with the current child node information to determine the new child node, and creating context information of the new child node to perform corresponding processing.
2. The database management method according to claim 1, wherein said recording current child node information of said parent node comprises:
and recording identification information and corresponding bitmap marks corresponding to each child node included in the current parent node by using a bitmap to obtain the current child node information.
3. The database management method of claim 2, wherein said comparing said historical child node information and said current child node information to determine said new child node comprises:
querying the historical child node information and the current child node information by using a binary search method to determine a target child node which simultaneously appears in the historical child node information and the current child node information;
and determining other nodes except the target child node in the current child node information as the new child node.
4. The database management method according to claim 3, wherein said comparatively querying the historical sub-node information and the current sub-node information using a binary search method to determine a target sub-node that is present in both the historical sub-node information and the current sub-node information comprises:
and inquiring and marking the target child node in the current child node information by using the binary search method based on the historical child node information.
5. The database management method according to claim 3, wherein said comparatively querying the historical sub-node information and the current sub-node information using a binary search method to determine a target sub-node that is present in both the historical sub-node information and the current sub-node information comprises:
and inquiring and marking the target child node in the historical child node information by using the binary search method based on the current child node information.
6. The database management method according to any one of claims 1 to 5, further comprising:
if the configuration information in the OVSDB database is synchronized to the client, the client judges whether the current synchronization type is initial synchronization; and if so, reading the configuration information from the OVSDB database, inquiring first information with a parent-child association relationship in the configuration information, and analyzing the first information at one time.
7. The database management method according to claim 6, further comprising:
and the client analyzes the second information one by one aiming at the second information which does not have a parent-child association relationship in the configuration information.
8. A database management apparatus, comprising:
the recording module is used for recording the current child node information of any father node in the OVSDB database if the father node creates a new child node;
the acquisition module is used for acquiring historical child node information of the father node; the history child node information includes: before the new child node is created, all child node information of the father node;
and the processing module is used for comparing the historical child node information with the current child node information to determine the new child node and creating the context information of the new child node for corresponding processing.
9. A database management apparatus, comprising:
a memory for storing a computer program;
a processor for executing the computer program to implement the database management method according to any one of claims 1 to 7.
10. A readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the database management method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110405579.XA CN113064881A (en) | 2021-04-15 | 2021-04-15 | Database management method, device, equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110405579.XA CN113064881A (en) | 2021-04-15 | 2021-04-15 | Database management method, device, equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113064881A true CN113064881A (en) | 2021-07-02 |
Family
ID=76566814
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110405579.XA Pending CN113064881A (en) | 2021-04-15 | 2021-04-15 | Database management method, device, equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113064881A (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5870559A (en) * | 1996-10-15 | 1999-02-09 | Mercury Interactive | Software system and associated methods for facilitating the analysis and management of web sites |
| US6965903B1 (en) * | 2002-05-07 | 2005-11-15 | Oracle International Corporation | Techniques for managing hierarchical data with link attributes in a relational database |
| CN102902811A (en) * | 2012-10-19 | 2013-01-30 | 北京金和软件股份有限公司 | Database design method for quickly generating tree structure |
| US20130097127A1 (en) * | 2011-07-12 | 2013-04-18 | The Board Of Trustees Of The Leland Stanford Junior University | Method and System for Database Storage Management |
| US20160062997A1 (en) * | 2014-08-28 | 2016-03-03 | Weebly, Inc. | Serialized Child Associations in Parent Record |
| CN105554169A (en) * | 2014-11-04 | 2016-05-04 | 中兴通讯股份有限公司 | OID configuration and analytic methods, ORS client, and OID node and database thereof |
| CN106445931A (en) * | 2015-08-04 | 2017-02-22 | 阿里巴巴集团控股有限公司 | Database node association relationship display method and apparatus |
| CN109743388A (en) * | 2018-12-29 | 2019-05-10 | 税友软件集团股份有限公司 | The child node management method and correlation technique and device of a kind of distributed data collection |
| CN111447103A (en) * | 2020-03-09 | 2020-07-24 | 杭州海康威视系统技术有限公司 | Virtual device management system, electronic device, virtual device management method, and medium |
| CN111478791A (en) * | 2020-03-02 | 2020-07-31 | 视联动力信息技术股份有限公司 | Data management method and device |
| CN111949631A (en) * | 2019-05-14 | 2020-11-17 | 华为技术有限公司 | Method and device for determining configuration parameters of database |
| CN112307045A (en) * | 2020-11-11 | 2021-02-02 | 支付宝(杭州)信息技术有限公司 | Data synchronization method and system |
-
2021
- 2021-04-15 CN CN202110405579.XA patent/CN113064881A/en active Pending
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5870559A (en) * | 1996-10-15 | 1999-02-09 | Mercury Interactive | Software system and associated methods for facilitating the analysis and management of web sites |
| US6965903B1 (en) * | 2002-05-07 | 2005-11-15 | Oracle International Corporation | Techniques for managing hierarchical data with link attributes in a relational database |
| US20130097127A1 (en) * | 2011-07-12 | 2013-04-18 | The Board Of Trustees Of The Leland Stanford Junior University | Method and System for Database Storage Management |
| CN102902811A (en) * | 2012-10-19 | 2013-01-30 | 北京金和软件股份有限公司 | Database design method for quickly generating tree structure |
| US20160062997A1 (en) * | 2014-08-28 | 2016-03-03 | Weebly, Inc. | Serialized Child Associations in Parent Record |
| CN105554169A (en) * | 2014-11-04 | 2016-05-04 | 中兴通讯股份有限公司 | OID configuration and analytic methods, ORS client, and OID node and database thereof |
| CN106445931A (en) * | 2015-08-04 | 2017-02-22 | 阿里巴巴集团控股有限公司 | Database node association relationship display method and apparatus |
| CN109743388A (en) * | 2018-12-29 | 2019-05-10 | 税友软件集团股份有限公司 | The child node management method and correlation technique and device of a kind of distributed data collection |
| CN111949631A (en) * | 2019-05-14 | 2020-11-17 | 华为技术有限公司 | Method and device for determining configuration parameters of database |
| CN111478791A (en) * | 2020-03-02 | 2020-07-31 | 视联动力信息技术股份有限公司 | Data management method and device |
| CN111447103A (en) * | 2020-03-09 | 2020-07-24 | 杭州海康威视系统技术有限公司 | Virtual device management system, electronic device, virtual device management method, and medium |
| CN112307045A (en) * | 2020-11-11 | 2021-02-02 | 支付宝(杭州)信息技术有限公司 | Data synchronization method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110502546B (en) | Data processing method and device | |
| CN107040578B (en) | Data synchronization method, device and system | |
| KR102031588B1 (en) | Method and system for implementing index when saving file | |
| CN106407360B (en) | Data processing method and device | |
| CN106874281B (en) | Method and device for realizing database read-write separation | |
| CN111209344A (en) | Data synchronization method and device | |
| US11327990B2 (en) | Method and device for processing user portrait and server | |
| CN104572845A (en) | File distribution method and device, equipment and system | |
| CN104268229A (en) | Resource obtaining method and device based on multi-process browser | |
| EP3173965B1 (en) | System and method for enablement of data masking for web documents | |
| CN109302449B (en) | Data writing method, data reading device and server | |
| CN110515979B (en) | Data query method, device, equipment and storage medium | |
| CN113064881A (en) | Database management method, device, equipment and readable storage medium | |
| CN109522311B (en) | Data storage method, device, server and storage medium | |
| CN111625617A (en) | Data indexing method and device and computer readable storage medium | |
| CN107977440B (en) | Method, device and system for analyzing data file | |
| CN116361287A (en) | Path analysis method, device and system | |
| CN114611039B (en) | Analysis method and device of asynchronous loading rule, storage medium and electronic equipment | |
| CN109739883B (en) | Method and device for improving data query performance and electronic equipment | |
| CN116821232A (en) | Data synchronization method and related device | |
| CN108737522B (en) | Message processing method, device and system | |
| CN114116253A (en) | Message processing method and system for message queue | |
| CN110442604B (en) | Data flow direction query method, data flow direction extraction method, data flow direction processing method and related devices | |
| CN112380208A (en) | Method, system and medium for generating real-time data ID of distribution automation system | |
| CN107679093B (en) | Data query 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 |