CN111881140A - Data structure tree checking method, device, equipment and storage medium - Google Patents
Data structure tree checking method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN111881140A CN111881140A CN202010746737.3A CN202010746737A CN111881140A CN 111881140 A CN111881140 A CN 111881140A CN 202010746737 A CN202010746737 A CN 202010746737A CN 111881140 A CN111881140 A CN 111881140A
- Authority
- CN
- China
- Prior art keywords
- data structure
- structure tree
- data volume
- data
- checking
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 238000012795 verification Methods 0.000 claims abstract description 77
- 238000004590 computer program Methods 0.000 claims description 11
- 238000001914 filtration Methods 0.000 claims description 11
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000000547 structure data Methods 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/22—Indexing; Data structures therefor; Storage structures
Abstract
The application discloses a data structure tree checking method, a device, equipment and a storage medium. The method comprises the following steps: counting a data structure tree in the data volume; judging whether an unverified target data structure tree exists in the data structure tree or not; if the target data structure tree which is not verified exists, calling the thread to execute verification operation on the target data structure tree; the total number of the threads is greater than 1, and a unique corresponding relation exists between the target data structure tree and the threads; and executing the step of judging whether the target data structure tree which is not checked exists in the data structure tree. The method relatively ensures the overall efficiency of the process of checking the data structure tree in the data volume. In addition, the application also provides a data structure tree checking device, equipment and a storage medium, and the beneficial effects are as described above.
Description
Technical Field
The present application relates to the field of data storage, and in particular, to a method, an apparatus, a device, and a storage medium for checking a data structure tree.
Background
The data structure tree is a data structure, which is a data set with a hierarchical relationship and composed of n (n is greater than or equal to 0) finite nodes, and comprises a root node, an internal node and a leaf node. The data structure tree is generally used in a file system of a database system and an operating system, is used for indexing data, can keep stable and ordered data storage, and has stable logarithmic time complexity in insertion and modification.
In a database system or a file system, a data structure tree is often stored in pre-partitioned data volumes, and when the data structure tree is verified, separate threads are often allocated to each data volume, and then verification is completed on the data structure tree in the corresponding data volume by using the threads.
Therefore, it is a problem to be solved by those skilled in the art to provide a data structure tree verification method to relatively ensure the overall efficiency of the verification process performed on the data structure tree in the data volume.
Disclosure of Invention
The application aims to provide a data structure tree checking method, a device, equipment and a storage medium, so as to relatively ensure the overall efficiency of the checking process of the data structure tree in a data volume.
In order to solve the above technical problem, the present application provides a data structure tree checking method, including:
counting a data structure tree in the data volume;
judging whether an unverified target data structure tree exists in the data structure tree or not;
if the target data structure tree which is not verified exists, calling the thread to execute verification operation on the target data structure tree; the total number of the threads is greater than 1, and a unique corresponding relation exists between the target data structure tree and the threads;
and executing the step of judging whether the target data structure tree which is not checked exists in the data structure tree.
Preferably, when the number of data volumes is greater than 1, after determining whether there is an unverified target data structure tree in the data structure tree, the method further includes:
if the target data structure tree which is not verified does not exist, judging whether a data volume which is not subjected to verification operation exists or not;
if the data volume which does not execute the verification operation exists, executing a step of counting the data structure tree in the data volume based on the data volume which does not execute the verification operation;
otherwise, the checking operation is stopped.
Preferably, before the step of performing statistics on the data structure tree in the data volume based on the data volume for which no check operation is performed, the method further comprises:
judging whether the data volume which does not execute the verification operation meets a preset verification standard or not;
if the preset check standard is met, performing statistics on a data structure tree in the data volume based on the data volume which is not subjected to the check operation;
otherwise, the data volumes for which no verification operation is performed are filtered.
Preferably, before the invoking thread performs the checking operation on the target data structure tree, the method further comprises:
judging whether the root node data can be obtained through the access of the root address of the target data structure tree or not;
if the root node data can be obtained through access, executing a step of executing a check operation on the target data structure tree by using a calling thread;
otherwise, the target data structure tree is filtered.
Preferably, the data structure tree includes one or more of a B-tree, a B + tree, and a balanced binary tree.
In addition, this application still provides a data structure tree verifying attachment, includes:
the statistical module is used for counting the data structure tree in the data volume;
the structure tree judging module is used for judging whether an unverified target data structure tree exists in the data structure tree or not, and if yes, the thread checking module and the structure tree judging module are sequentially called;
the thread checking module is used for calling a thread to execute checking operation on the target data structure tree; the total number of the threads is greater than 1, and the target data structure tree and the threads have unique corresponding relation.
Preferably, when the number of the data volumes is greater than 1, the structure tree judging module calls the data volume judging module when the unverified target data structure tree does not exist;
the data volume judging module is used for judging whether the data volume which does not execute the verification operation exists, if so, the statistical module is called based on the data volume which does not execute the verification operation, and if not, the verification stopping module is called;
and the verification stopping module is used for stopping verification operation.
Preferably, the apparatus further comprises:
the verification standard judging module is used for judging whether the data volume which does not execute the verification operation meets the preset verification standard, if so, the statistical module is called based on the data volume which does not execute the verification operation, and if not, the data volume filtering module is called;
and the data volume filtering module is used for filtering the data volume which does not execute the verification operation.
In addition, this application still provides a data structure tree check-up equipment, includes:
a memory for storing a computer program;
a processor for implementing the steps of the data structure tree verification method when executing the computer program.
In addition, the present application also provides a computer readable storage medium, on which a computer program is stored, and when being executed by a processor, the computer program implements the steps of the data structure tree checking method as described above.
The data structure tree checking method provided by the application comprises the steps of firstly counting data structure trees in a data volume, further judging whether an unverified target data structure tree exists in the data structure trees, if the unverified target data structure tree exists, calling a thread which is uniquely corresponding to the target data structure tree to carry out checking operation on the target data structure tree, wherein the total number of the threads is larger than 1, and further carrying out the step of judging whether the unverified target data structure tree exists in the data structure tree, so that checking on all the data structure trees in the data volume is completed. According to the method, the independent threads are distributed to the target data structure trees which are not verified in the data volume, and the overall number of the data structure trees in the data volume is relatively large, so that the overall utilization rate of the threads can be relatively ensured, the situation that idle threads exist in the threads due to the fact that the number of the available threads is larger than that of the data volume is relatively avoided, and the overall efficiency of the verification process of the data structure trees in the data volume is relatively ensured. In addition, the application also provides a data structure tree checking device, equipment and a storage medium, and the beneficial effects are as described above.
Drawings
In order to more clearly illustrate the embodiments of the present application, the drawings needed for the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings can be obtained by those skilled in the art without inventive effort.
Fig. 1 is a flowchart of a data structure tree checking method disclosed in an embodiment of the present application;
fig. 2 is a flowchart of a data structure tree checking method disclosed in an embodiment of the present application;
fig. 3 is a schematic structural diagram of a data synchronization apparatus according to an embodiment of the present application.
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 the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present application without any creative effort belong to the protection scope of the present application.
In a database system or a file system, a data structure tree is often stored in pre-partitioned data volumes, and when the data structure tree is verified, separate threads are often allocated to each data volume, and then verification is completed on the data structure tree in the corresponding data volume by using the threads.
Therefore, the core of the application is to provide a data structure tree checking method to relatively ensure the overall efficiency of the checking process of the data structure tree in the data volume.
In order that those skilled in the art will better understand the disclosure, the following detailed description will be given with reference to the accompanying drawings.
Referring to fig. 1, an embodiment of the present application discloses a data structure tree checking method, including:
step S10: and counting the data structure tree in the data volume.
It should be noted that the data volume in this embodiment refers to a file directory that can be used by one or more containers, and in addition, the data structure is stored in a pre-divided data volume and is used for recording a storage address of data stored in the data volume, so as to provide access and retrieval for the data stored in the data volume.
In this step, the data structure tree in the data volume is counted, so as to check the data structure tree in the subsequent step, where the purpose of checking includes but is not limited to repairing the index content in the data structure tree, or accessing the storage data in the data volume by using the data structure tree, and the like.
In addition, the number of the data structure trees stored in the data volume may be one or more according to the actual situation.
Step S11: and judging whether the data structure tree has an unverified target data structure tree, if so, sequentially executing the step S12 and the step S11.
Step S12: and the calling thread executes the checking operation on the target data structure tree.
The total number of the threads is greater than 1, and the target data structure tree and the threads have unique corresponding relation.
After the data structure tree in the data volume is counted, the present embodiment further determines whether an unverified target data structure tree exists in the data structure tree, and then calls a thread to perform a verification operation on the target data structure tree when the unverified target data structure tree is stored. In addition, it should be emphasized that the important point of the present embodiment is that the total number of threads is greater than 1, and there is a unique correspondence between the target data structure tree and the threads, that is, when the number of the data structure trees is greater than 1, there are at least two or more threads that simultaneously perform the checking operation on different data structure trees in the same data volume.
The data structure tree checking method provided by the application comprises the steps of firstly counting data structure trees in a data volume, further judging whether an unverified target data structure tree exists in the data structure trees, if the unverified target data structure tree exists, calling a thread which is uniquely corresponding to the target data structure tree to carry out checking operation on the target data structure tree, wherein the total number of the threads is larger than 1, and further carrying out the step of judging whether the unverified target data structure tree exists in the data structure tree, so that checking on all the data structure trees in the data volume is completed. According to the method, the independent threads are distributed to the target data structure trees which are not verified in the data volume, and the overall number of the data structure trees in the data volume is relatively large, so that the overall utilization rate of the threads can be relatively ensured, the situation that idle threads exist in the threads due to the fact that the number of the available threads is larger than that of the data volume is relatively avoided, and the overall efficiency of the verification process of the data structure trees in the data volume is relatively ensured.
On the basis of the foregoing embodiment, as a preferred implementation manner, before the invoking thread performs the checking operation on the target data structure tree, the method further includes:
judging whether the root node data can be obtained through the access of the root address of the target data structure tree or not;
if the root node data can be obtained through access, executing a step of executing a check operation on the target data structure tree by using a calling thread;
otherwise, the target data structure tree is filtered.
It should be noted that, the key point of the embodiment is that before the invoking thread performs the verifying operation on the target data structure tree, it is first determined whether root node data can be obtained through the access of the root address of the target data structure tree, that is, it is determined that the target data structure tree can be normally traversed and accessed, if the root node data can be obtained through the access, it is determined that the target data structure tree can be normally traversed and accessed, and then the step of executing the verifying operation on the target data structure tree by the invoking thread is further performed; conversely, if the root node data is not accessible via the root address of the target data structure tree, the target data structure tree is further filtered. The present embodiment further ensures the reliability of the check on the data structure tree.
Referring to fig. 2, when the number of data volumes is greater than 1, an embodiment of the present application discloses a data structure tree checking method, including:
step S20: and counting the data structure tree in the data volume.
Step S21: and judging whether the data structure tree has an unverified target data structure tree, if so, sequentially executing the step S22 and the step S21, and otherwise, executing the step S23.
Step S22: and if the target data structure tree which is not verified exists, calling the thread to execute verification operation on the target data structure tree.
The total number of the threads is greater than 1, and the target data structure tree and the threads have unique corresponding relation.
Step S23: and judging whether the data volume which does not execute the verification operation exists, if so, executing the step S20 based on the data volume which does not execute the verification operation, otherwise, executing the step S24.
Step S24: the verification operation is stopped.
It should be noted that the present embodiment is applicable to a scenario where the number of data volumes is greater than 1, and when the number of data volumes is greater than 1, if the result of determining whether the target data structure tree is not verified in the data structure tree is that the target data structure tree is not verified, it indicates that all the data structure trees in the current data volume have been checked, and therefore, in this case, it is further determined whether there is a data volume for which a check operation is not performed, if the data volume which does not execute the check operation exists, the data structure tree in the data volume which does not execute the check operation is further counted, and further checking the data structure tree in the data volume which does not execute the checking operation, if the data volume which does not execute the checking operation does not exist, it is indicated that the check of the data structure tree has been completed for all data volumes and the check operation is stopped. The present embodiment further ensures reliability and comprehensiveness of the check on the data structure tree when the number of data volumes is greater than 1.
On the basis of the foregoing embodiment, as a preferred implementation manner, before the step of performing statistics on the data structure tree in the data volume based on the data volume for which the check operation is not performed, the method further includes:
judging whether the data volume which does not execute the verification operation meets a preset verification standard or not;
if the preset check standard is met, performing statistics on a data structure tree in the data volume based on the data volume which is not subjected to the check operation;
otherwise, the data volumes for which no verification operation is performed are filtered.
It should be noted that the present embodiment is focused on a step of further determining whether a data volume that does not perform a verification operation satisfies a preset verification criterion before a step of performing statistics on a data structure tree in a data volume based on a data volume that does not perform a verification operation, and further performing statistics on a data structure tree in a data volume based on a data volume that does not perform a verification operation when the data volume that does not perform a verification operation satisfies the preset verification criterion; in contrast, when the data volume on which the check operation is not performed does not satisfy the preset check standard, the data volume on which the check operation is not performed is further filtered. In addition, the preset verification criteria in this embodiment include, but are not limited to, that the data volume belongs to a specific type, that the data volume can be accessed, or that the read-write control authority of the data volume belongs to a local controller, etc.
In the embodiment, the data structure tree is verified only for the data volume meeting the preset verification standard, so that the overall reliability of the data structure tree verification is further ensured.
On the basis of the above series of embodiments, as a preferred embodiment, the data structure tree includes one or more of a B-tree, a B + tree, and a balanced binary tree.
The balanced binary tree is data which is assembled into a tree structure according to rules by adopting a dichotomy thought, and the retrieval of irrelevant data is reduced by using the tree structure data, so that the data retrieval speed is greatly improved; the B tree is also called a balanced multipath search tree, and compared with a balanced binary tree, more than two search paths are searched; compared with the B tree, the B + tree more fully utilizes the space of the node, so that the query speed is more stable, and the speed of the B + tree is completely close to that of binary search.
The embodiment further ensures the diversity of the data structure tree and further improves the overall flexibility of checking the data structure tree.
Referring to fig. 3, an embodiment of the present application provides a data structure tree checking apparatus, including:
a statistic module 10, configured to count a data structure tree in a data volume;
the structure tree judging module 11 is configured to judge whether an unverified target data structure tree exists in the data structure tree, and if yes, the thread verifying module 12 and the structure tree judging module 11 are sequentially invoked;
the thread checking module 12 is configured to invoke a thread to perform a checking operation on the target data structure tree; the total number of the threads is greater than 1, and the target data structure tree and the threads have unique corresponding relation.
Preferably, when the number of the data volumes is greater than 1, the structure tree judging module calls the data volume judging module when the unverified target data structure tree does not exist;
the data volume judging module is used for judging whether the data volume which does not execute the verification operation exists, if so, the statistical module is called based on the data volume which does not execute the verification operation, and if not, the verification stopping module is called;
and the verification stopping module is used for stopping verification operation.
Preferably, the apparatus further comprises:
the verification standard judging module is used for judging whether the data volume which does not execute the verification operation meets the preset verification standard, if so, the statistical module is called based on the data volume which does not execute the verification operation, and if not, the data volume filtering module is called;
and the data volume filtering module is used for filtering the data volume which does not execute the verification operation.
The data structure tree checking device provided by the application firstly counts the data structure trees in the data volume, and then judges whether an unverified target data structure tree exists in the data structure trees, if the unverified target data structure tree exists, a thread which is uniquely corresponding to the target data structure tree is called to carry out checking operation on the target data structure tree, the total number of the threads is greater than 1, and the step of judging whether the unverified target data structure tree exists in the data structure trees is further carried out, so that checking on all the data structure trees in the data volume is completed. According to the device, the independent threads are distributed to the target data structure trees which are not verified in the data volume, and the whole quantity of the data structure trees in the data volume is relatively large, so that the whole utilization rate of the threads can be relatively ensured, the situation that idle threads exist in the threads due to the fact that the quantity of the available threads is larger than that of the data volume is relatively avoided, and the whole efficiency of the verification process of the data structure trees in the data volume is relatively ensured.
In addition, an embodiment of the present application further provides a data structure tree checking device, including:
a memory for storing a computer program;
a processor for implementing the steps of the data structure tree verification method when executing the computer program.
The data structure tree checking device provided by the application firstly counts the data structure trees in the data volume, and then judges whether an unverified target data structure tree exists in the data structure trees, if the unverified target data structure tree exists, a thread which is uniquely corresponding to the target data structure tree is called to carry out checking operation on the target data structure tree, the total number of the threads is greater than 1, and the step of judging whether the unverified target data structure tree exists in the data structure trees is further carried out, so that checking on all the data structure trees in the data volume is completed. According to the equipment, the independent threads are distributed to the target data structure trees which are not verified in the data volume, and the whole quantity of the data structure trees in the data volume is relatively large, so that the whole utilization rate of the threads can be relatively ensured, the condition that idle threads exist in the threads due to the fact that the quantity of the available threads is larger than that of the data volume is relatively avoided, and the whole efficiency of the verification process of the data structure trees in the data volume is relatively ensured.
In addition, an embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of the data structure tree verification method are implemented as described above.
The computer-readable storage medium provided by the application firstly counts data structure trees in a data volume, and then judges whether an unverified target data structure tree exists in the data structure trees, if the unverified target data structure tree exists, a thread uniquely corresponding to the target data structure tree is called to perform verification operation on the target data structure tree, the total number of the threads is greater than 1, and the step of judging whether the unverified target data structure tree exists in the data structure trees is further performed, so that verification on all the data structure trees in the data volume is completed. The computer-readable storage medium allocates the independent threads to the target data structure trees which are not verified in the data volume, and the whole number of the data structure trees in the data volume is relatively large, so that the whole utilization rate of the threads can be relatively ensured, the situation that idle threads exist in the threads due to the fact that the number of the available threads is larger than that of the data volume is relatively avoided, and the whole efficiency of the verification process of the data structure trees in the data volume is relatively ensured.
The data structure tree verification method, device, equipment and storage medium provided by the present application are introduced in detail above. The embodiments are described in a progressive manner in the specification, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description. It should be noted that, for those skilled in the art, it is possible to make several improvements and modifications to the present application without departing from the principle of the present application, and such improvements and modifications also fall within the scope of the claims of the present application.
It is further noted that, in the present specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
Claims (10)
1. A data structure tree verification method is characterized by comprising the following steps:
counting a data structure tree in the data volume;
judging whether an unverified target data structure tree exists in the data structure tree or not;
if the target data structure tree which is not verified exists, calling a thread to execute verification operation on the target data structure tree; wherein the total number of the threads is greater than 1, and a unique corresponding relationship exists between the target data structure tree and the threads;
and executing the step of judging whether the data structure tree has an unverified target data structure tree.
2. The method of claim 1, wherein when the number of data volumes is greater than 1, after the determining whether there is an unverified target data structure tree in the data structure tree, the method further comprises:
if the target data structure tree which is not verified does not exist, judging whether a data volume which does not execute the verification operation exists;
if the data volume which does not execute the verification operation exists, executing a data structure tree in the statistical data volume based on the data volume which does not execute the verification operation;
otherwise, stopping the checking operation.
3. The method of claim 2, wherein before the step of performing the data structure tree in the statistical data volume based on the data volume for which the check operation is not performed, the method further comprises:
judging whether the data volume which does not execute the verification operation meets a preset verification standard or not;
if the preset check standard is met, executing the data structure tree in the statistical data volume based on the data volume which does not execute the check operation;
otherwise, filtering the data volume which does not execute the verification operation.
4. The data structure tree checking method according to claim 1, wherein before the invoking thread performs the checking operation on the target data structure tree, the method further comprises:
judging whether the root node data can be obtained through the access of the root address of the target data structure tree or not;
if the root node data can be obtained through access, executing the step that the calling thread executes verification operation on the target data structure tree;
otherwise, filtering the target data structure tree.
5. The method according to any one of claims 1 to 4, wherein the data structure tree comprises one or more of a B-tree, a B + tree, and a balanced binary tree.
6. A data structure tree checking apparatus, comprising:
the statistical module is used for counting the data structure tree in the data volume;
the structure tree judging module is used for judging whether an unverified target data structure tree exists in the data structure tree or not, and if yes, the thread checking module and the structure tree judging module are sequentially called;
the thread checking module is used for calling a thread to execute checking operation on the target data structure tree; wherein the total number of the threads is greater than 1, and a unique correspondence exists between the target data structure tree and the threads.
7. The data structure tree checking device according to claim 6, wherein when the number of the data volumes is greater than 1, the structure tree determining module calls a data volume determining module when there is no unverified target data structure tree;
the data volume judging module is used for judging whether a data volume which does not execute the verification operation exists, if so, the counting module is called based on the data volume which does not execute the verification operation, and if not, the verification stopping module is called;
and the checking stopping module is used for stopping the checking operation.
8. The data structure tree checking apparatus according to claim 7, wherein the apparatus further comprises:
the verification standard judging module is used for judging whether the data volume which does not execute the verification operation meets a preset verification standard, if so, the statistical module is called based on the data volume which does not execute the verification operation, and otherwise, the data volume filtering module is called;
and the data volume filtering module is used for filtering the data volume which does not execute the verification operation.
9. A data structure tree checking apparatus, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the data structure tree checking method according to any one of claims 1 to 5 when executing said computer program.
10. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the data structure tree checking method according to any one of claims 1 to 5.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010746737.3A CN111881140A (en) | 2020-07-29 | 2020-07-29 | Data structure tree checking method, device, equipment and storage medium |
| PCT/CN2021/077348 WO2022021865A1 (en) | 2020-07-29 | 2021-02-23 | Data structure tree verification method, apparatus, and device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010746737.3A CN111881140A (en) | 2020-07-29 | 2020-07-29 | Data structure tree checking method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111881140A true CN111881140A (en) | 2020-11-03 |
Family
ID=73201205
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010746737.3A Withdrawn CN111881140A (en) | 2020-07-29 | 2020-07-29 | Data structure tree checking method, device, equipment and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111881140A (en) |
| WO (1) | WO2022021865A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112463042A (en) * | 2020-11-19 | 2021-03-09 | 苏州浪潮智能科技有限公司 | Data volume import data verification method, device, terminal and storage medium |
| WO2022021865A1 (en) * | 2020-07-29 | 2022-02-03 | 苏州浪潮智能科技有限公司 | Data structure tree verification method, apparatus, and device, and storage medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9753813B1 (en) * | 2015-09-25 | 2017-09-05 | Amazon Technologies, Inc. | Data replication snapshots for persistent storage using operation numbers |
| CN106326040B (en) * | 2016-08-27 | 2019-12-31 | 苏州浪潮智能科技有限公司 | Snapshot metadata management method and device |
| CN106445412A (en) * | 2016-09-14 | 2017-02-22 | 郑州云海信息技术有限公司 | Data volume compression ratio assessment method and system |
| CN110688377B (en) * | 2019-08-30 | 2020-07-17 | 阿里巴巴集团控股有限公司 | Method and device for updating state Merck tree |
| CN110825734B (en) * | 2019-10-09 | 2023-04-28 | 上海交通大学 | Concurrent updating method of balance tree and read-write system |
| CN111881140A (en) * | 2020-07-29 | 2020-11-03 | 苏州浪潮智能科技有限公司 | Data structure tree checking method, device, equipment and storage medium |
-
2020
- 2020-07-29 CN CN202010746737.3A patent/CN111881140A/en not_active Withdrawn
-
2021
- 2021-02-23 WO PCT/CN2021/077348 patent/WO2022021865A1/en active Application Filing
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022021865A1 (en) * | 2020-07-29 | 2022-02-03 | 苏州浪潮智能科技有限公司 | Data structure tree verification method, apparatus, and device, and storage medium |
| CN112463042A (en) * | 2020-11-19 | 2021-03-09 | 苏州浪潮智能科技有限公司 | Data volume import data verification method, device, terminal and storage medium |
| CN112463042B (en) * | 2020-11-19 | 2022-08-12 | 苏州浪潮智能科技有限公司 | Data volume import data verification method, device, terminal and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022021865A1 (en) | 2022-02-03 |
| WO2022021865A9 (en) | 2022-09-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102099544B1 (en) | Method and device for processing distribution of streaming data | |
| CN111881140A (en) | Data structure tree checking method, device, equipment and storage medium | |
| CN112968917B (en) | Penetration test method and system for network equipment | |
| CN110059068B (en) | Data verification method and data verification system in distributed storage system | |
| US20130159347A1 (en) | Automatic and dynamic design of cache groups | |
| CN106325756A (en) | Data storage and data computation methods and devices | |
| US20160261541A1 (en) | Prioritizing log messages | |
| US9104567B2 (en) | Memory-leak identification | |
| CN111241059A (en) | Database optimization method and device based on database | |
| CN111090395B (en) | Electronic information intelligent storage system for accounting industry | |
| CN113220597A (en) | Test method, test device, electronic apparatus, and storage medium | |
| CN109101595B (en) | Information query method, device, equipment and computer readable storage medium | |
| CN106202374A (en) | A kind of data processing method and device | |
| CN106845263A (en) | A kind of method for accessing database, device and electronic equipment | |
| CN111857721B (en) | SQL statement verification method, data acquisition method, equipment and storage device | |
| CN115114289A (en) | Data query method and device and electronic equipment | |
| CN110413617B (en) | Method for dynamically adjusting hash table group according to size of data volume | |
| CN114580381A (en) | Report automatic checking method and system, control device and storage medium | |
| CN113342647A (en) | Test data generation method and device | |
| CN114238704B (en) | Tree index splitting method, data access method and device and electronic equipment | |
| CN110517010A (en) | A kind of data processing method, system and storage medium | |
| CN115632877B (en) | Large-scale PCAP data correctness verification method, system and storage medium | |
| CN116303586B (en) | Metadata cache elimination method based on multi-level b+tree | |
| CN113821501B (en) | Data archiving method and device | |
| WO2023030461A1 (en) | Distributed database detection method and apparatus |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20201103 |
|
| WW01 | Invention patent application withdrawn after publication |