CN114443646A - Bi-directional linear linked list directory retrieval based multi-way tree structure, electronic device and readable storage medium - Google Patents

Bi-directional linear linked list directory retrieval based multi-way tree structure, electronic device and readable storage medium Download PDF

Info

Publication number
CN114443646A
CN114443646A CN202111630317.XA CN202111630317A CN114443646A CN 114443646 A CN114443646 A CN 114443646A CN 202111630317 A CN202111630317 A CN 202111630317A CN 114443646 A CN114443646 A CN 114443646A
Authority
CN
China
Prior art keywords
node
linked list
data storage
tree structure
directory
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
Application number
CN202111630317.XA
Other languages
Chinese (zh)
Inventor
陈卓
郭寅远
李宗原
韩聪
李春阳
李二海
任高全
曹元威
朱洋洋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xuchang Ketop Testing Research Institute Co ltd
Original Assignee
Xuchang Ketop Testing Research Institute Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xuchang Ketop Testing Research Institute Co ltd filed Critical Xuchang Ketop Testing Research Institute Co ltd
Priority to CN202111630317.XA priority Critical patent/CN114443646A/en
Publication of CN114443646A publication Critical patent/CN114443646A/en
Pending legal-status Critical Current

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/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2246—Trees, e.g. B+trees
    • 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/24—Querying
    • G06F16/245—Query processing
    • G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2471—Distributed queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Abstract

The invention provides a bifurcate tree structure based on bidirectional linear linked list directory retrieval, electronic equipment and a readable storage medium. The multi-fork structure comprises a root node, a plurality of data storage nodes and a directory linked list, wherein the created data storage nodes are registered in the directory linked list in advance in the process of creating the data storage nodes in the multi-fork tree structure. Through the multi-branch tree structure provided by the application, the functions of fast traversing, fast adding and deleting, checking and modifying and the like of tree nodes can be realized: the traversal of the multi-branch tree does not need to carry out preorders or subsequent recursions, and the full-node traversal of the multi-branch tree structure can be realized only by traversing the corresponding directory linked list. Meanwhile, the number of the sub nodes of the multi-branch tree structure is not limited, the number of the sub nodes and the subordinate structure can be added and deleted according to actual requirements, the flexibility is strong, the adaptability is high, and the popularization value is high.

Description

Bi-directional linear linked list directory retrieval based multi-way tree structure, electronic device and readable storage medium
Technical Field
The invention relates to the technical field of data storage and data indexing, and particularly discloses a bifurcate tree structure based on bidirectional linear linked list directory retrieval, electronic equipment and a readable storage medium.
Background
Data is a basic element of information processing, and is particularly important in the context of rapid development of the internet. How to efficiently process, store, query and the like in different carriers also becomes a problem generally faced and solved by enterprises and researchers. Compared with the conventional data, one sums the features of large data to 5V, i.e., large data Volume (Volume), fast speed (Velocity), multiple types (Velocity), difficult to identify (Veracity), and low Value density (Value) (CHENGX Q, JINX L, WANGY Z, etc.. Survey on big data system and analytical technology [ J ]. Journal of Software,2014,25(9): 1889-1908)
In the context of big data applications, tree families exist for easy and fast lookup. The height of the tree is an irresistible lower time limit for hit lookup. Under certain data conditions, the height and width of the tree are constrained to each other. The varieties of the multi-branch tree are various, and the requirements of operations such as encapsulation of tree nodes, searching of trees and the like are different according to different application requirements.
In database applications, the prior art uses a lot of B-trees: the method for searching the given keyword in the B-tree is that the root node is firstly taken, the given keyword is searched for in the keywords K1, … and Kn contained in the root node (the method can be used for sequential searching or binary searching), and if the keyword equal to the given value is found, the searching is successful; otherwise, the keyword to be searched can be determined to be between Ki and Ki +1, Pi is a pointer pointing to a root node of the subtree, and the node pointed by the pointer Pi is taken to continue searching until the node is found, or the pointer Pi fails to search when the node is empty.
However, in embedded software, the query operation related to the B-tree is too complex, and the data traversal complexity is high, so that there is a certain limit to the data traversal and indexing efficiency.
Disclosure of Invention
In view of the above-mentioned drawbacks in the prior art, the present invention provides a bifurcate tree structure, an electronic device, and a readable storage medium based on a bidirectional linear linked list directory search.
In a first aspect of the present application, a bifurcate tree structure based on a doubly-linked linear list directory search is provided, the bifurcate tree structure comprising:
a root node;
the data storage nodes are used for storing data resources;
the method comprises the following steps that all data storage nodes and a root node form a multi-branch tree structure, and each data storage node comprises a father node and/or at least one child node;
the directory linked list is used for realizing rapid traversal of the data storage nodes in the multi-branch tree structure;
in the process of establishing the data storage nodes in the multi-branch tree structure, the established data storage nodes are registered in a directory linked list in advance.
In one possible implementation of the first aspect, the data structure of the multi-way tree structure includes:
location information of the root node;
location information of the data storage nodes; and
at least one or more of the number information of the data storage nodes.
In a possible implementation of the first aspect, the directory linked list includes a plurality of linked list nodes, and the linked list nodes are in one-to-one correspondence with the data storage nodes to serve as indexes of the data storage nodes;
each link list node comprises a front pointer and a back pointer, the front pointer points to the link list node in the previous order in the directory link list, and the back pointer points to the link list node in the next order in the directory link list.
In a possible implementation of the first aspect, the data structure of the directory linked list includes at least one or more of index information corresponding to each linked list node and information about the number of linked list nodes.
In a possible implementation of the first aspect, the data structure of the data storage node includes at least one or more of a corresponding linked list node, a data resource stored by the data storage node, corresponding parent node information, and corresponding child node information.
In a possible implementation of the first aspect, the parent node information includes a first address of the parent node;
the child node information includes a first address of each child node.
In a possible implementation of the first aspect, in creating a data storage node, the method includes:
registering a linked list node corresponding to the data storage node in a directory linked list;
pointing a parent node pointer of the linked list node to the first address of the parent node of the data storage node;
and respectively pointing the front pointer and the back pointer of the linked list node to the adjacent data storage nodes.
In a possible implementation of the first aspect, in the process of deleting a data storage node, a child node of the data storage node to be deleted is used as a new child node of a parent node of the data storage node to be deleted.
A second aspect of the present application provides an electronic device comprising: a memory for storing a processing program; and the processor is used for realizing the multi-way tree structure based on the bidirectional linear linked list directory retrieval provided by the first aspect when executing the processing program.
A third aspect of the present application provides a computer-readable storage medium having stored thereon a processing program, which, when executed by a processor, implements the dual-way linear linked list directory retrieval based multi-way tree structure provided in the first aspect.
Compared with the prior art, the method has the following beneficial effects:
according to the technical scheme, the multi-branch tree based on the bidirectional linear linked list directory retrieval is provided, and the multi-branch tree structure can realize the functions of fast traversal, fast addition and deletion, retrieval and modification and the like of tree nodes: the traversal of the multi-branch tree does not need to carry out preorders or subsequent recursions, and the full-node traversal of the multi-branch tree structure can be realized only by traversing the corresponding directory linked list.
Compared with the prior art, the number of the sub-nodes of the multi-branch tree structure is not limited, and the B-number requires that the root node has at least two sub-nodes, other non-leaf nodes have at least M/2 sub-nodes, and M is the tree order. The multi-branch tree structure in the technical scheme provided by the application is more flexible and changeable, and the number of the sub nodes and the subordinate structures can be added and deleted according to actual requirements.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
FIG. 1 illustrates a schematic diagram of a data storage node in a multi-way tree structure according to an embodiment of the present application;
FIG. 2 illustrates a tree structure diagram of a two-level multi-way tree, according to an embodiment of the present application;
FIG. 3 is a diagram illustrating a directory chain table corresponding to a two-level multi-way tree according to an embodiment of the present application;
FIG. 4 illustrates a tree structure diagram of a two-level multi-way tree, according to an embodiment of the present application;
FIG. 5 is a diagram illustrating a directory chain table corresponding to a three-level multi-way tree according to an embodiment of the present application;
fig. 6 is a schematic diagram illustrating a tree structure with TreeNode1 nodes removed according to an embodiment of the present disclosure;
fig. 7 is a schematic diagram illustrating a directory chain table after a TreeNode1 node is deleted according to an embodiment of the present application.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that it would be obvious to those skilled in the art that various changes and modifications can be made without departing from the spirit of the invention. All falling within the scope of the present invention.
In order to solve the problems that in the prior art, the B-number structure query operation in embedded software is too complex, the data traversal complexity is high, and therefore certain limiting pain points exist in the data traversal and indexing efficiency, the application provides a multi-way tree structure based on bidirectional linear linked list directory retrieval, electronic equipment and a readable storage medium. Through the multi-branch tree structure based on the bidirectional linear linked list directory retrieval, the functions of fast traversal, fast addition and deletion, check and modification and the like of tree nodes can be realized, and meanwhile, the number of the sub-nodes of the multi-branch tree structure is not limited at all.
Specifically, in some embodiments of the present application, the bifurcate tree structure based on the bidirectional linear linked list directory retrieval specifically includes:
a root node;
the data storage nodes are used for storing data resources;
the method comprises the following steps that all data storage nodes and a root node form a multi-branch tree structure, and each data storage node comprises a father node and/or at least one child node;
the directory linked list is used for realizing rapid traversal of the data storage nodes in the multi-branch tree structure;
in the process of establishing the data storage nodes in the multi-branch tree structure, the established data storage nodes are registered in a directory linked list in advance.
In some embodiments of the present application, further, the data structure of the multi-way tree structure may include: at least one or more of location information of the root node, location information of the data storage nodes, and number information of the data storage nodes. Specifically, in a specific implementation of the above embodiment, the data structure of the multi-way tree structure may be represented by the following expression:
Figure BDA0003440076810000041
in some embodiments of the present application, further, the directory chain table includes a plurality of chain table nodes, and the chain table nodes are in one-to-one correspondence with the data storage nodes to serve as indexes of the data storage nodes; each link list node comprises a front pointer and a back pointer, the front pointer points to the link list node in the previous order in the directory link list, and the back pointer points to the link list node in the next order in the directory link list.
In some embodiments of the present application, the data structure of the directory linked list further includes at least one or more of index information corresponding to each linked list node and number information of linked list nodes.
Specifically, in a specific implementation of the foregoing embodiment, the data structure of the linked list nodes in the multi-way tree and the data structure of the directory linked list may be represented by the following expression:
Figure BDA0003440076810000051
in a possible implementation of the first aspect, the data structure of the data storage node includes at least one or more of a corresponding linked list node, a data resource stored by the data storage node, corresponding parent node information, and corresponding child node information. Further, the parent node information may include a first address of the parent node; the child node information may include a first address of each child node and the number information of the child nodes.
Specifically, in a specific implementation of the above embodiment, the data structure of the data storage node in the multi-way tree structure may be represented by the following expression:
node data structure of typedef struct TreeNode {// multi-way tree
A NODE NODE; // nodes of the directory Link List (as index to node)
BYTE data; // data area
struct TreeNode Front; // parent node of current node
BYTE NextNum; // number of children of current node
struct TreeNode p; // child node head Address of Current node
}TreeNode；
Further, FIG. 1 shows a graphical structural representation of data storage nodes in a multi-way tree structure. Wherein: the single Node in the multi-branch tree structure consists of a directory linked list Node, a parent Node pointer front and n child Node pointers P1-Pn. Wherein, Node is the link list Node in the directory link list, which contains a back pointer next and a front pointer previous. Next pointer in Node points to the first address of next data storage Node in list chain table, previous points to the first address of previous Node in list; front points to the parent node's home address; p1 Pn points to the first address of the n child nodes of the node; data points to the data region of the node.
In some embodiments of the present application, further, in the creating a data storage node, the method includes:
registering a linked list node corresponding to the data storage node in a directory linked list;
pointing a parent node pointer of a linked list node to the initial address of a parent node of a data storage node;
and respectively pointing the front pointer and the back pointer of the linked list node to the adjacent data storage nodes.
In some embodiments of the present application, further, in the process of deleting a data storage node, a child node of the data storage node to be deleted may be taken as a new child node of a parent node of the data storage node to be deleted.
The following provides a specific embodiment to further illustrate and explain the present invention:
in the above embodiment, taking creating a three-level multi-way tree "TreeList tree" as an example, it is necessary to create a node directory LIST "LIST" and create root nodes "TreeNode root", "LIST.
FIG. 2 shows a schematic diagram of a tree structure of a two-layer multi-way tree: in the process of building the multi-branch tree, a child node "TreeNode 1" is added to the root: in the adding process, TreeNode1 needs to be added to the directory linked list, that is, the next-level pointer of "list. node" points to the first address of "TreeNode 1", and the upper-level pointer of TreeNode1 points to list.
“list.node->next＝&TreeNode1.node”
“TreeNode1.node->previous＝list.node”
In the addition process, TreeNode1 needs to be added to the child node of "ntre. I.e., the child node pointer of "ntre. root" points to the first address of "TreeNode 1" and the parent node pointer of "TreeNode 1" points to "ntre. root", as follows:
“ntree.root->p[0]＝TreeNode1“
“TreeNode1.front＝ntree.root“
the root can be added with the second sub-node and the third sub-node "TreeNode 2 according to the above steps, and the directory chain table structure of the nodes of TreeNode 3" can be as shown in fig. 3.
Fig. 4 shows a tree structure diagram of a three-level multi-way tree. Taking the example of adding sub-nodes TreeNode1_1, TreeNode1_2, and TreeNode1_3 to TreeNode1, first, it is necessary to add "TreeNode 1_ 1" to the directory chain table, that is, a next-level pointer of "TreeNode 3" points to a first address of "TreeNode 1_ 1", and a previous-level pointer of "TreeNode 1_ 1" points to "TreeNode 3", as shown in detail below:
“TreeNode3.node->next＝&TreeNode1_1.node”
“TreeNode1_1->previous＝TreeNode3.node”
in the addition process, TreeNode1_1 needs to be added to the child nodes of TreeNode 1. That is, the child node pointer of "TreeNode 1" points to the head address of "TreeNode 1_ 1" and the parent node pointer of "TreeNode 1_ 1" points to "TreeNode 1", as follows:
“TreeNode1->p[0]＝TreeNode1_1“
“TreeNode1_1.front＝TreeNode1“
the directory linked list structure of its nodes may be as shown in fig. 5.
In the above embodiment, when the node "TreeNode 1" needs to be deleted, the child node of "TreeNode 1" needs to be added below the parent node of "TreeNode 1", that is, "TreeNode 1" needs to be deleted from the child node of "ntre. After the node of the TreeNode1 is deleted, the node is empty, and the node needs to be moved to the positions of the node of the TreeNode2 and the node of the TreeNode3, such as the node of the "ntree. The tree structure diagram after deleting "TreeNode 1" can be shown in fig. 6, and the directory linked list structure diagram after deleting "TreeNode 1" can be shown in fig. 7.
In summary, according to the technical solution provided by the present application, a bifurcate tree based on bidirectional linear linked list directory retrieval is provided, and the bifurcate tree structure can implement functions of fast traversal, fast add-delete, check-modify, and the like for tree nodes: the traversal of the multi-branch tree does not need to carry out preorders or subsequent recursions, and the full-node traversal of the multi-branch tree structure can be realized only by traversing the corresponding directory linked list. Compared with the prior art, the number of the child nodes of the multi-branch tree structure is not limited and is more flexible and changeable, and the number of the child nodes and the subordinate structure can be added and deleted completely according to actual requirements.
In some embodiments of the present application, an electronic device is also provided. The electronic device comprises a memory and a processor, wherein the memory is used for storing a processing program, and the processor executes the processing program according to instructions. The processor, when executing the processing program, enables the implementation of the multi-way tree structure based on bi-directional linear linked list directory retrieval in the foregoing embodiments.
In some embodiments of the present application, a readable storage medium is also provided, which may be a non-volatile readable storage medium or a volatile readable storage medium. The readable storage medium has stored therein instructions that, when executed on a computer, cause an electronic device containing such readable storage medium to perform the aforementioned bifurcate tree structure based on doubly linked linear list directory retrieval.
It is understood that, for each functional module in the computer medium corresponding to the multi-branch tree structure, if the functional module is implemented in the form of a software functional module and sold or used as a separate product, the functional module may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
A computer readable storage medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable storage medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
The program code in which aspects disclosed herein are implemented may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the C language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The embodiments of the technical solutions according to the present application are described in detail with reference to the drawings, but the technical solutions according to the present application are not limited to the above embodiments. Even if various changes are made in the technical solutions related to the present application, if the changes fall within the technical solution claims related to the present application and the technical equivalents thereof, the changes still fall within the protective scope of the technical solutions related to the present application.
The foregoing description has described specific embodiments of the present invention. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes or modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention. The embodiments and features of the embodiments of the present application may be combined with each other arbitrarily without conflict.

Claims (10)

1. A bifurcate tree structure based on a doubly-linked linear list directory search, the bifurcate tree structure comprising:
a root node;
the data storage nodes are used for storing data resources;
all the data storage nodes and the root node form the multi-branch tree structure, and each data storage node comprises a father node and/or at least one child node;
the directory linked list is used for realizing rapid traversal of the data storage nodes in the multi-branch tree structure;
and in the process of establishing the data storage nodes in the multi-branch tree structure, registering the established data storage nodes in the directory linked list in advance.
2. The bi-directional linearly linked list directory retrieval based multi-way tree structure as recited in claim 1, wherein the data structure of the multi-way tree structure comprises:
location information of the root node;
location information of the data storage node; and
at least one or more of the number information of the data storage nodes.
3. The bifurcate tree structure based on two-way linear linked list directory retrieval of claim 1, wherein the directory linked list comprises a plurality of linked list nodes, the linked list nodes corresponding one-to-one with the data storage nodes as indexes of the data storage nodes;
each link list node comprises a front pointer and a back pointer, the front pointer points to the link list node in the previous order in the directory link list, and the back pointer points to the link list node in the next order in the directory link list.
4. The bi-directional linearly linked list directory retrieval based multi-way tree structure as recited in claim 3, wherein the data structure of the directory linked list includes at least one or more of index information corresponding to each of the linked list nodes and quantity information of the linked list nodes.
5. The bi-directional linearly linked list directory retrieval based multi-way tree structure as recited in claim 3, wherein the data structure of the data storage node includes at least one or more of the corresponding linked list node, the data resource stored by the data storage node, the corresponding parent node information, and the corresponding child node information.
6. The bi-directional linearly linked list directory retrieval-based multi-way tree structure of claim 5, wherein said parent node information includes a first address of said parent node;
the child node information includes a head address of each of the child nodes.
7. The bi-directional linearly linked list directory retrieval based multi-way tree structure as recited in claim 1, wherein in creating the data storage node, comprises:
registering a linked list node corresponding to the data storage node in the directory linked list;
pointing a parent node pointer of the linked list node to a head address of a parent node of the data storage node;
and respectively pointing the front pointer and the back pointer of the linked list node to the adjacent data storage nodes.
8. The bi-directional linearly linked list directory retrieval based multi-way tree structure as recited in claim 1, wherein in deleting the data storage node, a child node of the data storage node to be deleted is taken as a newly added child node of a parent node of the data storage node to be deleted.
9. An electronic device, comprising:
a memory for storing a processing program;
a processor that, when executing the handler, implements the bi-directional linearly linked list directory retrieval based multi-way tree structure of any of claims 1 to 8.
10. A computer-readable storage medium, having stored thereon a processing program which, when executed by a processor, implements a bifurcate tree structure based on directory retrieval of a doubly-linked linear list as claimed in any one of claims 1 to 8.
CN202111630317.XA 2021-12-28 2021-12-28 Bi-directional linear linked list directory retrieval based multi-way tree structure, electronic device and readable storage medium Pending CN114443646A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111630317.XA CN114443646A (en) 2021-12-28 2021-12-28 Bi-directional linear linked list directory retrieval based multi-way tree structure, electronic device and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111630317.XA CN114443646A (en) 2021-12-28 2021-12-28 Bi-directional linear linked list directory retrieval based multi-way tree structure, electronic device and readable storage medium

Publications (1)

Publication Number Publication Date
CN114443646A true CN114443646A (en) 2022-05-06

Family

ID=81366577

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111630317.XA Pending CN114443646A (en) 2021-12-28 2021-12-28 Bi-directional linear linked list directory retrieval based multi-way tree structure, electronic device and readable storage medium

Country Status (1)

Country Link
CN (1) CN114443646A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115794838A (en) * 2023-02-07 2023-03-14 深圳开源互联网安全技术有限公司 Method and device for storing bidirectional linked list, terminal equipment and storage medium
CN116028674A (en) * 2022-09-29 2023-04-28 湖北科技学院 Intelligent terminal data communication method and system
CN116861161A (en) * 2023-09-05 2023-10-10 中国西安卫星测控中心 Real-time space measurement data statistics method based on multi-tree structure

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116028674A (en) * 2022-09-29 2023-04-28 湖北科技学院 Intelligent terminal data communication method and system
CN115794838A (en) * 2023-02-07 2023-03-14 深圳开源互联网安全技术有限公司 Method and device for storing bidirectional linked list, terminal equipment and storage medium
CN116861161A (en) * 2023-09-05 2023-10-10 中国西安卫星测控中心 Real-time space measurement data statistics method based on multi-tree structure
CN116861161B (en) * 2023-09-05 2023-11-17 中国西安卫星测控中心 Real-time space measurement data statistics method based on multi-tree structure

Similar Documents

Publication Publication Date Title
CN114443646A (en) Bi-directional linear linked list directory retrieval based multi-way tree structure, electronic device and readable storage medium
US9965545B2 (en) Document order management via relaxed node indexing
US6965903B1 (en) Techniques for managing hierarchical data with link attributes in a relational database
CA2462300C (en) Providing a consistent hierarchical abstraction of relational data
US8255394B2 (en) Apparatus, system, and method for efficient content indexing of streaming XML document content
US9330116B2 (en) Determining hierarchical paths to nodes
US8156156B2 (en) Method of structuring and compressing labeled trees of arbitrary degree and shape
US8229932B2 (en) Storing XML documents efficiently in an RDBMS
US9330124B2 (en) Efficiently registering a relational schema
US20210011889A1 (en) Concurrent enumeration of multiple hierarchies in a database environment
US8566343B2 (en) Searching backward to speed up query
CN103365992B (en) Method for realizing dictionary search of Trie tree based on one-dimensional linear space
US8694510B2 (en) Indexing XML documents efficiently
US20090177669A1 (en) Processing structured electronic document streams using look-ahead automata
CN102867049B (en) Chinese PINYIN quick word segmentation method based on word search tree
CN114491172B (en) Rapid retrieval method, device and equipment for tree structure nodes and storage medium
CN103123650A (en) Extensible markup language (XML) data bank full-text indexing method based on integer mapping
US8145667B2 (en) Schemaless XML payload generation
JP4746698B2 (en) Modeling classification objects
WO2019240912A1 (en) Relational data model for hierarchical databases
Zhu et al. Mini-XML: An efficient mapping approach between XML and relational database
CN109933589B (en) Data structure conversion method for data summarization based on ElasticSearch aggregation operation result
CN108984626A (en) A kind of data processing method, device and server
KR100345277B1 (en) A logical structure information extractor for xml documents
CN109753533A (en) A kind of multi-source relevant database client development approach 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