CN116010664A - Data processing method and system based on MPTT and parent searching - Google Patents
Data processing method and system based on MPTT and parent searching Download PDFInfo
- Publication number
- CN116010664A CN116010664A CN202310304359.7A CN202310304359A CN116010664A CN 116010664 A CN116010664 A CN 116010664A CN 202310304359 A CN202310304359 A CN 202310304359A CN 116010664 A CN116010664 A CN 116010664A
- Authority
- CN
- China
- Prior art keywords
- value
- node
- nodes
- parent
- tree
- 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
-
- 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
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a data processing method and a system based on MPTT and parent searching, wherein an ID value of a parent is added to a node, and the ID value of the parent is used for finding the parent node of the node upwards; configuring the left value and the right value of each node in the tree-shaped storage structure according to a setting mode, and if the current node has a front brother node in the new addition, adding 1 to the left value of the current node as the right value of the front brother node; if the current node does not have the preposed brother node, the left value of the current node is the right value of the father node, and the right value of the current node is assigned as the left value of the current node plus 1; respectively judging whether the left value and the right value of other nodes in the tree-shaped storage structure are larger than or equal to the left value of the current node; if yes, adding the left value or the right value of other nodes by 2; the invention combines parent searching on the basis of the pre-sequencing traversal tree, can perform quick addition and deletion while considering the query rate, and has the advantages of high query speed and high addition and deletion efficiency.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a data processing method and system based on MPTT and parent searching.
Background
The searching, adding, deleting and modifying of data is an important part in the development of computer programs, and a value is given by searching, and then the specific value is searched in a large amount of information. In computer applications, searching is a common basic algorithm, and the current searching and adding, deleting and modifying methods generally comprise sequential searching, binary searching, hash searching, tree table searching and the like.
The sequence search is a basic search algorithm for traversing and comparing the array according to the original sequence of the sequence, and the basic principle is that for any one sequence and a given element, the given element is sequentially compared with the elements in the sequence until the element which is the same as the given keyword is found out or the elements in the sequence are compared with the elements in the sequence. Sequential searching needs to be checked one by one in the ordered array, and the searching efficiency is low. Binary search is also called binary search, which requires that the linear table must be in a sequential storage structure and that the elements in the table be ordered by key. The efficiency of binary search is higher, but there is also a limitation that the binary method is more suitable for static operation, and if the insertion operation is performed, all values need to be moved later, and the natural speed and efficiency are reduced. The hash lookup is a method for performing lookup by calculating the storage address of the data element, and has high requirement on data although the hash lookup is fast, the hash function is troublesome to design, and additionally, a hash table needs to be established, so that extra space is occupied. The tree table lookup is a lookup made to the tree memory structure. The tree-type storage structure is a multi-linked list in which each node in the list includes a data field and a plurality of pointer fields, each pointer field pointing to a successor node. The tree table lookup method is similar to binary lookup in principle, has relatively high speed, but has low efficiency when performing insertion, addition and deletion. Therefore, how to design a data processing method based on MPTT (Modified Preorder Tree Taversal, pre-ordered traversal tree) and parent searching, which can give consideration to the query speed and rapidly add and delete the changes is a problem to be solved in the industry.
Disclosure of Invention
The invention aims to provide a data processing method based on MPTT and parent searching, which solves the problem that the existing data processing method based on MPTT and parent searching can not give consideration to query speed and can quickly increase and delete.
The invention provides a data processing method based on MPTT and parent searching, wherein the MPTT corresponds to a tree-shaped storage structure of data, each node in the tree-shaped storage structure is configured with a left value and a right value, the left value of a father node is smaller than the right value of the father node, the right value of the father node is larger than the left value and the right value of all child nodes, an ID value of a parent is added to the node, and the ID value of the parent is used for finding the parent node of the node upwards; the data processing method configures a left value and a right value of each node in the tree-shaped storage structure according to a setting mode, wherein the setting mode comprises the following steps: judging whether the current node has a front brother node or not under the condition of carrying out the new addition; if the current node has the front brother node, the left value of the current node is the right value of the front brother node plus 1; if the current node does not have the preposed brother node, the left value of the current node is the right value of the father node, and the right value of the current node is assigned as the left value of the current node plus 1; respectively judging whether the left value and the right value of other nodes in the tree-shaped storage structure are larger than or equal to the left value of the current node; if the left value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the left value of the other nodes; if the right value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the right value of the other nodes; on the basis, an ID value of a parent is added to the parent node, wherein the ID value of the parent represents that a parent domain is arranged in addition to a data domain and is used for indicating the parent node.
Further, the method further comprises: if a node is newly built under the condition that no father node exists in the tree-shaped storage structure, a node with a left value of 1 and a right value of 2 is generated.
Further, under the condition that the node without the sub level is deleted, judging whether the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted node; and if the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted node, subtracting 2 from the left value and the right value of all other nodes in the tree-shaped storage structure respectively.
Further, under the condition that the node with the sub level is deleted, judging whether the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted top level node; if the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted top-level node, subtracting 2 times of the number of the deleted nodes from the left value and the right value of all other nodes in the tree-shaped storage structure respectively; under the condition that only the current node is deleted, the number of the deleted nodes is 1; and under the condition that the current node and the descendant level nodes thereof are deleted, the number of the deleted nodes is the sum of the number of the nodes and the child level nodes of the nodes.
The invention provides a data processing system based on MPTT and parent searching, wherein the MPTT corresponds to a tree-shaped storage structure of data, each node in the tree-shaped storage structure is configured with a left value and a right value, the left value of a father node is smaller than the right value of the father node, the right value of the father node is larger than the left value and the right value of all child nodes, an ID value of a parent is added to the node, and the ID value of the parent is used for finding the parent node of the node upwards; the data processing system comprises a configuration module, wherein the configuration module is used for configuring the left value and the right value of each node in the tree-shaped storage structure according to a setting mode, and the setting mode comprises the following steps:
judging whether the current node has a front brother node or not under the condition of carrying out the new addition; if the current node has the front brother node, the left value of the current node is the right value of the front brother node plus 1; if the current node does not have the preposed brother node, the left value of the current node is the right value of the father node, and the right value of the current node is assigned as the left value of the current node plus 1; respectively judging whether the left value and the right value of other nodes in the tree-shaped storage structure are larger than or equal to the left value of the current node; if the left value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the left value of the other nodes; if the right value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the right value of the other nodes; on the basis, an ID value of a parent is added to the parent node, wherein the ID value of the parent represents that a parent domain is arranged in addition to a data domain and is used for indicating the parent node.
The beneficial effects of the invention are as follows: according to the data processing method and system based on MPTT and parent searching, an ID value of a parent is added to a node, and the ID value of the parent is used for finding the parent node of the node upwards; judging whether the current node has a front brother node or not under the condition of carrying out the new addition; if the current node has the front brother node, the left value of the current node is the right value of the front brother node plus 1; if the current node does not have the preposed brother node, the left value of the current node is the right value of the father node, and the right value of the current node is assigned as the left value of the current node plus 1; respectively judging whether the left value and the right value of other nodes in the tree-shaped storage structure are larger than or equal to the left value of the current node; if the left value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the left value of the other nodes; if the right value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the right value of the other nodes; the invention combines parent searching on the basis of the pre-sequencing traversal tree, can perform quick addition and deletion while considering the query rate, and has the advantages of high query speed and high addition and deletion efficiency.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings that are needed in the embodiments will be briefly described below, and it will be obvious to those skilled in the art that other drawings can be obtained from these drawings without inventive effort.
FIG. 1 is a flow chart of a data processing method based on MPTT and parent lookup of the present invention;
FIG. 2 is a schematic diagram of a tree memory structure;
FIG. 3 is an example of a parent representation of a tree;
FIG. 4 is a node form of a parent representation of a tree;
FIG. 5 is a schematic diagram of the MPTT algorithm;
fig. 6 is a new schematic diagram of the MPTT algorithm.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to specific embodiments of the present invention and corresponding drawings. It will be apparent that the described embodiments are only some, but not all, embodiments of the 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. The following describes in detail the technical solutions provided by the embodiments of the present invention with reference to the accompanying drawings.
Referring to fig. 1, the present invention provides a data processing method based on MPTT and parent lookup, where a pre-ordered traversal tree (Modified Preorder Tree Taversal, MPTT) algorithm corresponds to a tree-shaped storage structure of data, where the tree-shaped storage structure is shown in fig. 2.
To store data representing hierarchical relationships, a simplest scheme, stores the name of the current class, and the name of the previous class, we generally refer to this storage structure as an adjacency list. However, this query mode is inefficient, and if we need to query a certain class, we have to query the first sub-class and the second sub-class of the class first, so that the implementation of the recursive query is easier, but the efficiency is low. In contrast, the MPTT algorithm introduced by the invention has higher query efficiency, and does not directly store parent class classification information, but represents hierarchical relations in the form of left values and right values. When the sub-classification information of a specific classification is queried in this way, the query can be completed only by two times. The left and right values of the MPTT are used to confirm the boundaries of the queried parent node, and in this way, quick positioning is possible.
Referring to fig. 3 and 4, the parent algorithm stores nodes of the tree in a set of consecutive storage units, and each node is provided with a parent field for indicating its parent node in addition to the data field data. When the parent node of a certain sub-level needs to be queried, the parent node of the sub-level needs to be queried and the parent node of the child needs to be searched upwards. The tree traversal has high complexity.
Referring to fig. 5, each node in the tree memory structure is configured with a left value and a right value, the left value of the parent node is smaller than the right value of the parent node, and the right value of the parent node is larger than the left value and the right value of all the child nodes. The method comprises the steps of adding an ID value of a parent to a node, wherein the ID value of the parent is used for finding the parent node of the node upwards; the data processing method configures a left value and a right value of each node in the tree-shaped storage structure according to a setting mode, wherein the setting mode comprises the following steps:
s101, judging whether the current node has a front brother node or not under the condition of adding the new node.
S102, if the current node has a front brother node, the left value of the current node is the right value of the front brother node plus 1.
And S103, if the current node does not have the front brother node, the left value of the current node is the right value of the father node, and the right value of the current node is assigned as the left value of the current node plus 1.
S104, judging whether the left value of other nodes in the tree-shaped storage structure is larger than or equal to the left value of the current node.
S105, judging whether the right value of other nodes in the tree-shaped storage structure is larger than or equal to the left value of the current node.
S106, if the left value of other nodes in the tree-shaped storage structure is larger than or equal to the left value of the current node, adding 2 to the left value of the other nodes.
And S107, if the right value of other nodes in the tree storage structure is greater than or equal to the left value of the current node, adding 2 to the right value of the other nodes.
The data field of the node comprises structural data and business data, wherein the left value, the right value and the ID value of the parent are the structural data and are used for expressing tree behaviors, such as inquiry, movement and the like; the service data comprises node types, node states and the like and is used for service behavior abstraction. The node data can find the deep-hierarchy relation through the ID value of the parent.
In addition, a variety of algorithms may be fused in this form, including child algorithms under parent classification, and child sibling algorithms, among others. The child algorithm is that child nodes of each node are linked by a single-chain table to form a linear structure, n nodes have n child linked lists, and the storage structure is extremely convenient for searching children, but is unfavorable for searching parents, and searching parents needs to traverse n child linked lists pointed by child linked list pointer fields in the n nodes. Child sibling algorithms are also known as binary tree representations, with binary linked lists as the tree's storage structure. The tree node in the algorithm consists of a data domain and two pointer domains, wherein the two pointer domains respectively point to a first child node and a next brother node; the disadvantage is that the parent of the current node is looked up.
In this embodiment, the method further includes: if a node is newly built under the condition that no father node exists in the tree-shaped storage structure, a node with a left value of 1 and a right value of 2 is generated.
Under the condition that the node without the sub level is deleted, judging whether the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted node; and if the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted node, subtracting 2 from the left value and the right value of all other nodes in the tree-shaped storage structure respectively.
Under the condition that the node with the sub level is deleted, judging whether the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted top level node; and if the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted top-level node, subtracting 2 times of the number of the deleted nodes from the left value and the right value of all other nodes in the tree-shaped storage structure. Under the condition that only the current node is deleted, the number of the deleted nodes is 1; and under the condition that the current node and the descendant level nodes thereof are deleted, the number of the deleted nodes is the sum of the number of the nodes and the child level nodes of the nodes.
Compared with the MPTT algorithm, the traditional structure tree algorithm is suitable for scenes with more adding and deleting operations, and only one piece of data needs to be modified for each deletion. In terms of queries, the recursive query efficiency of adjacency tables gradually decreases as the classification hierarchy increases. The pre-ordered traversal tree is suitable for a scene with more query operations, the query efficiency is not affected by the increase of classification levels, but with the increase of data, each time data is added and deleted, a plurality of affected data are operated at the same time, and the execution efficiency is gradually reduced. The invention combines parent searching on the basis of the pre-sequencing traversal tree, and can perform quick adding and deleting while considering the query rate.
Referring to fig. 4, an additional schematic diagram of the MPTT algorithm according to an embodiment of the present invention is shown, where the tree-like storage structure has some existing nodes (e.g., a headquarters, a product development department, a control system group, etc.). And when a XX project group node is newly added under the control system group, assigning a left value of 6 of the XX project group of the current node to a right value of the parent node control system group, and assigning the right value of the XX project group of the current node to be the left value of the current node plus 1, namely 7.
And judging whether the left value and the right value of other nodes in the tree-shaped storage structure are larger than or equal to the left value '6' of the current node or not respectively. And if the left value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the left value of the other nodes. And if the right value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the right value of the other nodes. For the parent node control system group, its left value "5" is less than "6", and is unchanged, and its left value "6" is changed to "8" by adding 2. For the node of the system test group, the previous left value of 7 and the previous right value of 8 are both larger than 6, and then the left value and the right value of the node are added by 2 to become the left value of 9 and the right value of 10.
The invention also provides a data processing system based on MPTT and parent search, the pre-ordered traversal tree algorithm corresponds to a tree-shaped storage structure of data, each node in the tree-shaped storage structure is configured with a left value and a right value, the left value of a father node is smaller than the right value of the father node, the right value of the father node is larger than the left value and the right value of all child nodes, the data processing system comprises a configuration module, and the configuration module is used for configuring the left value and the right value of each node in the tree-shaped storage structure according to a setting mode, wherein the setting mode comprises the following steps:
judging whether the current node has a front brother node or not under the condition of carrying out the new addition; if the current node has the front brother node, the left value of the current node is the right value of the front brother node plus 1; if the current node does not have the preposed brother node, the left value of the current node is the right value of the father node, and the right value of the current node is assigned as the left value of the current node plus 1; respectively judging whether the left value and the right value of other nodes in the tree-shaped storage structure are larger than or equal to the left value of the current node; if the left value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the left value of the other nodes; if the right value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the right value of the other nodes; on the basis, an ID value of a parent is added to the parent node, wherein the ID value of the parent represents that a parent domain is arranged in addition to a data domain and is used for indicating the parent node.
According to the data processing method and system based on MPTT and parent searching, the parent searching is combined on the basis of the pre-sequencing traversal tree, the query rate is considered, and meanwhile, rapid addition and deletion can be performed, and the data processing method and system based on MPTT and parent searching have the advantages of being high in query speed and high in addition and deletion efficiency.
The embodiment of the invention also provides a storage medium, and a computer program is stored in the storage medium, and when the computer program is executed by a processor, part or all of the steps in each embodiment of the data processing method based on MPTT and parent searching provided by the invention are realized. The storage medium may be a magnetic disk, an optical disk, a Read-only memory (ROM), a Random Access Memory (RAM), or the like.
It will be apparent to those skilled in the art that the techniques of embodiments of the present invention may be implemented in software plus a necessary general purpose hardware platform. Based on such understanding, the technical solutions in the embodiments of the present invention may be embodied in essence or what contributes to the prior art in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the embodiments or some parts of the embodiments of the present invention.
The same or similar parts between the various embodiments in this specification are referred to each other. In particular, for data processing system embodiments based on MPTT and parent lookup, since they are substantially similar to method embodiments, the description is relatively simple, with reference to the description of method embodiments.
The embodiments of the present invention described above do not limit the scope of the present invention.
Claims (5)
1. The data processing method based on MPTT and parent searching is characterized in that an ID value of a parent is added to the node, and the ID value of the parent is used for finding the parent node of the node upwards; the data processing method configures a left value and a right value of each node in the tree-shaped storage structure according to a setting mode, wherein the setting mode comprises the following steps:
judging whether the current node has a front brother node or not under the condition of carrying out the new addition;
if the current node has the front brother node, the left value of the current node is the right value of the front brother node plus 1;
if the current node does not have the preposed brother node, the left value of the current node is the right value of the father node, and the right value of the current node is assigned as the left value of the current node plus 1;
respectively judging whether the left value and the right value of other nodes in the tree-shaped storage structure are larger than or equal to the left value of the current node;
if the left value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the left value of the other nodes;
and if the right value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the right value of the other nodes.
2. The data processing method based on MPTT and parent search according to claim 1, wherein the method further comprises:
if a node is newly built under the condition that no father node exists in the tree-shaped storage structure, a node with a left value of 1 and a right value of 2 is generated.
3. The data processing method based on MPTT and parent search according to claim 1, wherein in the case of deleting a node without a child level, it is judged whether the left value and the right value of all other nodes in the tree-shaped storage structure are greater than or equal to the right value of the deleted node;
and if the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted node, subtracting 2 from the left value and the right value of all other nodes in the tree-shaped storage structure respectively.
4. The data processing method based on MPTT and parent lookup according to claim 1, wherein in case of deleting a node having a child level, it is judged whether the left value and the right value of all other nodes in the tree-like storage structure are greater than or equal to the right value of the deleted top node;
if the left value and the right value of all other nodes in the tree-shaped storage structure are larger than or equal to the right value of the deleted top-level node, subtracting 2 times of the number of the deleted nodes from the left value and the right value of all other nodes in the tree-shaped storage structure respectively; under the condition that only the current node is deleted, the number of the deleted nodes is 1; and under the condition that the current node and the descendant level nodes thereof are deleted, the number of the deleted nodes is the sum of the number of the nodes and the child level nodes of the nodes.
5. A data processing system based on MPTT and parent searching, wherein the MPTT corresponds to a tree-shaped storage structure of data, each node in the tree-shaped storage structure is configured with a left value and a right value, the left value of a father node is smaller than the right value of the father node, and the right value of the father node is larger than the left value and the right value of all child nodes, and the data processing system is characterized in that an ID value of a parent is added to the node, and the ID value of the parent is used for finding the parent node of the node upwards; the data processing system comprises a configuration module, wherein the configuration module is used for configuring the left value and the right value of each node in the tree-shaped storage structure according to a setting mode, and the setting mode comprises the following steps:
judging whether the current node has a front brother node or not under the condition of carrying out the new addition; if the current node has the front brother node, the left value of the current node is the right value of the front brother node plus 1; if the current node does not have the preposed brother node, the left value of the current node is the right value of the father node, and the right value of the current node is assigned as the left value of the current node plus 1; respectively judging whether the left value and the right value of other nodes in the tree-shaped storage structure are larger than or equal to the left value of the current node; if the left value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the left value of the other nodes; if the right value of other nodes in the tree-shaped storage structure is greater than or equal to the left value of the current node, adding 2 to the right value of the other nodes; on the basis, an ID value of a parent is added to the parent node, wherein the ID value of the parent represents that a parent domain is arranged in addition to a data domain and is used for indicating the parent node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310304359.7A CN116010664A (en) | 2023-03-27 | 2023-03-27 | Data processing method and system based on MPTT and parent searching |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310304359.7A CN116010664A (en) | 2023-03-27 | 2023-03-27 | Data processing method and system based on MPTT and parent searching |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116010664A true CN116010664A (en) | 2023-04-25 |
Family
ID=86021364
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310304359.7A Pending CN116010664A (en) | 2023-03-27 | 2023-03-27 | Data processing method and system based on MPTT and parent searching |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116010664A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117150095A (en) * | 2023-09-12 | 2023-12-01 | 北京云枢创新软件技术有限公司 | Hierarchical tree node searching method, electronic equipment and medium |
-
2023
- 2023-03-27 CN CN202310304359.7A patent/CN116010664A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117150095A (en) * | 2023-09-12 | 2023-12-01 | 北京云枢创新软件技术有限公司 | Hierarchical tree node searching method, electronic equipment and medium |
| CN117150095B (en) * | 2023-09-12 | 2024-03-22 | 北京云枢创新软件技术有限公司 | Hierarchical tree node searching method, electronic equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yun et al. | Incremental high utility pattern mining with static and dynamic databases | |
| CA2434081C (en) | Data structures utilizing objects and pointers in the form of a tree structure | |
| US8396852B2 (en) | Evaluating execution plan changes after a wakeup threshold time | |
| US8407245B2 (en) | Efficient string pattern matching for large pattern sets | |
| KR101467589B1 (en) | Dynamic fragment mapping | |
| US20110137890A1 (en) | Join Order for a Database Query | |
| US8667027B2 (en) | Directed graph transitive closure | |
| US8442971B2 (en) | Execution plans with different driver sources in multiple threads | |
| CN110442584B (en) | Method for retrieving tree-structure resources based on asynchronous loading | |
| US20120096054A1 (en) | Reading rows from memory prior to reading rows from secondary storage | |
| US10984050B2 (en) | Method, apparatus, and computer program product for managing storage system | |
| CN110928939A (en) | Method for converting Sql result set into Json data based on tree structure | |
| CN116010664A (en) | Data processing method and system based on MPTT and parent searching | |
| CN111666468A (en) | Method for searching personalized influence community in social network based on cluster attributes | |
| Cao et al. | A new method to construct the KD tree based on presorted results | |
| Wong et al. | Online skyline analysis with dynamic preferences on nominal attributes | |
| US11036717B2 (en) | Trie-structure formulation and navigation for joining | |
| CN115840751B (en) | Novel tree-shaped data coding method | |
| Álvarez-García et al. | Compact and efficient representation of general graph databases | |
| US9081578B1 (en) | System and method for graph conditioning with non-overlapping orderable values for efficient graph evaluation | |
| EP3995972A1 (en) | Metadata processing method and apparatus, and computer-readable storage medium | |
| JP6323887B2 (en) | Method and device for changing root node | |
| CN113779068A (en) | Data query method, device, equipment and storage medium | |
| KR102404174B1 (en) | Data structures for nosql, inserting method for nodes, and processing method for range queries | |
| US20200201815A1 (en) | Object creation from hierarchical metadata stored on a storage 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 |