CN114491164B - Tree data processing method and system - Google Patents
Tree data processing method and system Download PDFInfo
- Publication number
- CN114491164B CN114491164B CN202210047415.9A CN202210047415A CN114491164B CN 114491164 B CN114491164 B CN 114491164B CN 202210047415 A CN202210047415 A CN 202210047415A CN 114491164 B CN114491164 B CN 114491164B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- data processing
- tree structure
- child
- 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.)
- Active
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/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—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/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/9032—Query formulation
- G06F16/90324—Query formulation using system suggestions
- G06F16/90328—Query formulation using system suggestions using search space presentation or visualization, e.g. category or range presentation and selection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Mathematical Physics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a tree data processing method and a system, wherein the method comprises the following steps: acquiring a target tree structure; traversing the node array in the target tree structure, and calling each element in the array by adopting a recursion method to obtain the node type of each element; and performing visual rendering on the elements after recursive calling so as to realize data processing for accurately searching the child nodes. In order to solve similar requirement difficulties and realize logic component multiplexing, the invention provides an implementation mode which has the advantages that the unified input is a tree structure array, nodes are provided with unique index marks and title texts, the accurate search result can be realized without depending on other logics of the nodes, the tree structure hierarchy is reserved, and the search processing of tree structure data is conveniently and rapidly realized.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a tree data processing method and system.
Background
With the rapid development of the Internet, data information on the web becomes a huge information warehouse, the web is used for displaying more information and can help people to quickly and accurately find target information, the information acquisition speed is increased, and the work efficiency is improved.
The web enterprise background application has very common requirements for displaying data results in a tree structure and searching results, for an application scene of the tree structure, list data is generally traversed, a large number of marks are added, and node relationships are recorded by traversing the list data for many times to perform searching matching and hierarchy reduction, the implementation processing is relatively complex, the list data for butting different enterprise api often needs to be repeatedly adjusted due to different field structures, the reuse of components is not facilitated for enterprise application, the appeal of cost is reduced, and abnormal problems are easy to occur.
Disclosure of Invention
The invention provides a tree data processing method and a tree data processing system, which are simple and convenient to realize tree data processing of a search result with an original hierarchical relation structure.
The first aspect of the present invention provides a tree data processing method, including:
acquiring a target tree structure;
traversing the node array in the target tree structure, and calling each element in the array by adopting a recursion method to obtain the node type of each element;
and performing visual rendering on the elements after recursive calling so as to realize data processing for accurately searching the child nodes.
Further, the traversing the node array in the target tree structure, and calling each element in the array by using a recursive method to obtain the node type of each element includes:
establishing a global node mapping table, and recording and storing the called elements;
judging the node type of the element; wherein the node types include: ancestor nodes and leaf nodes.
Further, the determining the node type of the element specifically includes:
and determining the node type of the element by judging whether the element has a sub-structure or not or whether the element has a sub-element or not.
Further, the determining the node type of the element includes:
judging whether the element is a leaf node;
if not, the element is a father node, all child elements of the father node are obtained, recursion is carried out on the child elements again, and the mark attribute of the element after the recursion processing is deleted;
if yes, determining the element as a leaf node.
A second aspect of the present invention provides a tree data processing system, comprising:
the structure acquisition module is used for acquiring a target tree structure;
the traversal module is used for traversing the node array in the target tree structure and calling each element in the array by adopting a recursion method to obtain the node type of each element;
and the rendering module is used for performing visual rendering on the elements subjected to recursive calling so as to realize data processing of accurately searching the child nodes.
Further, the traversal module is further configured to:
establishing a global node mapping table, and recording and storing the called elements;
judging the node type of the element; wherein the node types include: ancestor nodes and leaf nodes.
Further, the traversal module is further configured to:
and determining the node type of the element by judging whether the element has a sub-structure or not or whether the element has a sub-element or not.
Further, the traversal module is further configured to:
judging whether the element is a leaf node;
if not, the element is a father node, all child elements of the father node are obtained, the child elements are recurred again, and the mark attribute of the element after the recursion is deleted;
and if so, determining the element as a leaf node.
A third aspect of the present invention provides an electronic device, comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor, when executing the computer program, implements the tree data processing method according to any of the first aspects.
A fourth aspect of the present invention provides a computer-readable storage medium, which is characterized in that the computer-readable storage medium includes a stored computer program, and when the computer program runs, the computer-readable storage medium is controlled to implement the tree data processing method according to any one of the first aspects.
Compared with the prior art, the embodiment of the invention has the beneficial effects that:
the invention provides a tree data processing method and a system, wherein the method comprises the following steps: acquiring a target tree structure; traversing the node array in the target tree structure, and calling each element in the array by adopting a recursion method to obtain the node type of each element; and performing visual rendering on the elements after recursive calling so as to realize data processing for accurately searching the child nodes. In order to solve similar requirement difficulties and realize logic component multiplexing, the invention provides an implementation mode which has the advantages that the unified input is a tree structure array, nodes are provided with unique index marks and title texts, the accurate search result can be realized without depending on other logics of the nodes, the tree structure hierarchy is reserved, and the search processing of tree structure data is conveniently and rapidly realized.
Drawings
In order to more clearly illustrate the technical solution of the present invention, the drawings required to be used in the embodiments will be briefly described below, and obviously, the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a flow chart of a method for processing tree data according to an embodiment of the present invention;
FIG. 2 is a flowchart of a tree data processing method according to another embodiment of the present invention;
FIG. 3 is a device diagram of a tree data processing system according to an embodiment of the present invention;
fig. 4 is a block diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be understood that the step numbers used herein are for convenience of description only and are not intended as limitations on the order in which the steps are performed.
It is to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
The terms "comprises" and "comprising" indicate the presence of the described features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The term "and/or" refers to and includes any and all possible combinations of one or more of the associated listed items.
A first aspect.
Referring to fig. 1, an embodiment of the present invention provides a tree data processing method, including:
and S10, acquiring a target tree structure.
And S20, marking a node array in the tree structure, and calling each element in the array by adopting a recursion method to obtain the node type of each element.
In a specific implementation manner of the embodiment of the present invention, the step S20 includes:
establishing a global node mapping table, and recording and storing the called elements;
judging the node type of the element; wherein the node types include: ancestor nodes and leaf nodes.
Preferably, the determining a node type of the element specifically includes:
and determining the node type of the element by judging whether the element has a sub-structure or not or whether the element has a sub-element or not.
The judging the node type of the element comprises the following steps:
judging whether the element is a leaf node;
if not, the element is a father node, all child elements of the father node are obtained, the child elements are recurred again, and the mark attribute of the element after the recursion is deleted;
if yes, determining the element as a leaf node.
And S30, performing visual rendering on the used elements to realize data processing for accurately searching the child nodes.
The method provided by the invention aims to solve similar demand difficulties and realize logic component multiplexing, provides an implementation mode that the unified input is a tree structure array, nodes are provided with unique index marks and title texts, the accurate search result can be realized without depending on other logics of the nodes, and the tree structure hierarchy is reserved, so that the search processing of the tree structure data is conveniently and quickly realized.
Referring to fig. 2, another embodiment of the present invention provides a tree data processing method, including:
1) Acquiring tree structure node arrays (treeDatas);
2) Traversing tree structure node arrays (treeDatas), and calling each element (treeNode) by a recursive method (sealTreeNode, searchKey);
3) The recursive method (dealTreeNode) is as follows: (step 4-step 10);
4) Establishing a global node mapping table (treeNodeMap), recording and storing treeNode nodes accessed by a recursion method (dealTreeNode), using treeNode.id unique index as a key (key) of a key-value pair of the mapping table, and using the treeNode as a value (value);
5) Determining that the node treeNode is an ancestor node or a leaf node, and determining a node type to which the node belongs by determining whether a current node has a sub-structure and whether the sub-structure has a sub-element (treeNode. Child & & treeNode. Child.length = = 0);
6) And judging one: if the current node treeNode is not a leaf node, the current node treeNode is a parent node, an index record of a child element of the child element exists, a child element structure child of the node is taken out (child = treeNode. Child), the child element structure child is traversed, a recursion method (deal TreeEnode) is called again for the child element (child) of the child element structure, the traversed child element object child is filtered, the child element (child) of the child element object is processed by the recursion method, a deletion marker attribute isdell exists, the deletion marker attribute is equal to the node of true (true), and then the filtered child element object child is assigned back to the current node tree to update node data, and the pseudo code represents (tree. Child = node.
7) And judging two: if the title attribute text of the node does not accord with the matching search text, adding a deletion mark attribute isdel to the node treeNode and setting the node treeNode as true (treeNode. Isdel = treeNode), and if the title attribute text of the node accords with the matching search text, deleting the deletion mark attribute isdel (delete treeNode. Isdel) of the node treeNode;
8) After the node treeNode completes the processing in step 6 or step 7, the following processing is continued;
9) Judging that the processed node treeNode is a parent node without a child node, and adding a deletion mark attribute isdel (treeNode. Isdel = true) to the node treeNode when the title text does not conform to the search text;
10 Judging that no child node exists in the node treeNode after the processing is finished, if the title text accords with a search text, the node is a directory matching search result, the child node does not match with the search result, the search result should keep the node data and keep related child node data, the specific method is that the node treeNode needs to re-start all word nodes, namely, the child nodes filtered by the deleted mark attribute are correlated, and the child nodes can be searched back and correlated in a global node mapping table (treeNodeMap) through a node id index, and the pseudo codes are: (tree. Child = tree map [ tree. Id ]. Child), and set up not expanding attribute clearsearch xpanded, avoid the web application from rendering a large amount of nodes and jamming due to too much default expansion of child node content;
11 After all child elements and descendant elements of the tree structure node array (treeDatas) are processed by a recursion method (dealTreeNode), the internal nodes of the t tree structure node array (treeDatas) are actually node sets conforming to search text rules, treeDatas data results are output to web application for visual rendering, so that child nodes are accurately searched, directory nodes are obtained, and result sets matching the parent-child paths of the results are reserved.
The method provided by the invention is used for filtering the result set by operating the original hierarchical relation of the tree-shaped structure data in a simple manner to realize the tree-shaped data processing method which has the original hierarchical structure and accords with the search result, is simple and convenient, only depends on the structural relation of the method, does not depend on other field marks, and has high maintainability and expansibility
A second aspect.
Referring to fig. 3, an embodiment of the invention provides a tree data processing system, including:
and a structure obtaining module 10, configured to obtain a target tree structure.
And the traversing module 20 is configured to traverse the node array in the target tree structure, and call each element in the array by using a recursive method to obtain a node type of each element.
In a specific implementation manner of the embodiment of the present invention, the traversal module 20 is further configured to:
establishing a global node mapping table, and recording and storing the called elements;
judging the node type of the element; wherein the node types include: ancestor nodes and leaf nodes.
Specifically, the traversing module 20 is further configured to:
and determining the node type of the element by judging whether the element has a sub-structure or whether the element has a sub-element.
Specifically, the traversing module 20 is further configured to:
judging whether the element is a leaf node;
if not, the element is a father node, all child elements of the father node are obtained, the child elements are recurred again, and the mark attribute of the element after the recursion is deleted;
and if so, determining the element as a leaf node.
And the rendering module 30 is configured to perform visual rendering on the recursively called elements, so as to implement data processing for accurately finding the child nodes.
In order to solve similar demand difficulties and realize logic component multiplexing, the system provided by the invention provides an implementation mode which can realize accurate search results and retain tree structure levels without depending on other logics of nodes by uniformly inputting tree structure arrays and the nodes with unique index marks and title texts, and can conveniently and quickly realize search processing of tree structure data.
And (c) a third aspect.
The present invention provides an electronic device, including:
a processor, a memory, and a bus;
the bus is used for connecting the processor and the memory;
the memory is used for storing operation instructions;
the processor is configured to invoke the operation instruction, and the executable instruction enables the processor to perform an operation corresponding to the tree data processing method according to the first aspect of the present application.
In an alternative embodiment, an electronic device is provided, as shown in fig. 4, the electronic device 5000 shown in fig. 4 includes: a processor 5001 and a memory 5003. Wherein the processor 5001 is coupled to the memory 5003, such as via bus 5002. Optionally, the electronic device 5000 can also include a transceiver 5004. It should be noted that the transceiver 5004 is not limited to one in practical application, and the structure of the electronic device 5000 is not limited to the embodiment of the present application.
The processor 5001 may be a CPU, general purpose processor, DSP, ASIC, FPGA or other programmable logic device, transistor logic device, hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor 5001 may also be a combination of computing functions, e.g., comprising one or more microprocessors, a combination of a DSP and a microprocessor, or the like.
The memory 5003 may be, but is not limited to, a ROM or other type of static storage device that can store static information and instructions, a RAM or other type of dynamic storage device that can store information and instructions, an EEPROM, a CD-ROM or other optical disk storage, optical disk storage (including compact disk, laser disk, optical disk, digital versatile disk, blu-ray disk, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
The memory 5003 is used for storing application program codes for executing the present solution, and the execution is controlled by the processor 5001. The processor 5001 is configured to execute application program code stored in the memory 5003 to implement the teachings of any of the foregoing method embodiments.
Among them, electronic devices include but are not limited to: mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and fixed terminals such as digital TVs, desktop computers, and the like.
A fourth aspect.
The present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a tree data processing method as set forth in the first aspect of the present application.
Yet another embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, which, when run on a computer, enables the computer to perform the corresponding content of the foregoing method embodiments.
Claims (6)
1. A tree data processing method, comprising:
acquiring a target tree structure; the nodes of the target tree structure comprise corresponding unique index marks and title texts;
traversing the node array in the target tree structure, and calling each element in the array by adopting a recursion method to obtain the node type of each element;
performing visual rendering on the recursively called elements to realize data processing of accurately searching the child nodes;
traversing the node array in the target tree structure, and calling each element in the array by adopting a recursive method to obtain the node type of each element, wherein the method comprises the following steps:
establishing a global node mapping table, and recording and storing the called elements;
judging the node type of the element; wherein the node types include: ancestor nodes and leaf nodes;
the judging the node type of the element comprises the following steps:
judging whether the element is a leaf node;
if not, the element is a father node, all child elements of the father node are obtained, the child elements are recursed again, and the element with the deletion mark attribute after the recursion processing is deleted;
if yes, determining the element as a leaf node;
the determining the node type of the element further includes:
if the element is a leaf node, judging whether the corresponding title text is matched with the search text, if not, adding a deletion mark attribute, otherwise, deleting the corresponding deletion mark attribute;
after elements with the deleted tag attribute exist after the recursive processing are deleted, whether father nodes without child nodes exist is judged, if yes, whether the corresponding header text is matched with the search text is judged, the deleted tag attribute is added when mismatching is judged, and when matching is judged, all the corresponding child nodes filtered by the deleted tag attribute are correlated again according to the global mapping table.
2. A tree data processing method according to claim 1, wherein said determining the node type of said element specifically:
and determining the node type of the element by judging whether the element has a sub-structure or whether the element has a sub-element.
3. A tree data processing system capable of executing the tree data processing method according to claim 1, comprising:
the structure acquisition module is used for acquiring a target tree structure; the nodes of the target tree structure comprise corresponding unique index marks and title texts;
the traversing module is used for traversing the node array in the target tree structure and calling each element in the array by adopting a recursion method to obtain the node type of each element;
the rendering module is used for performing visual rendering on the elements after recursive calling so as to realize data processing of accurately searching the child nodes;
wherein the traversal module is further configured to:
establishing a global node mapping table, and recording and storing the called elements;
judging the node type of the element; wherein the node types include: ancestor nodes and leaf nodes;
the traversal module is further configured to:
judging whether the element is a leaf node;
if not, the element is a father node, all child elements of the father node are obtained, recursion is carried out on the child elements again, and the mark attribute of the element after the recursion processing is deleted;
and if so, determining the element as a leaf node.
4. A tree data processing system according to claim 3, wherein the traverse module is further configured to:
and determining the node type of the element by judging whether the element has a sub-structure or whether the element has a sub-element.
5. An electronic apparatus comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, the processor implementing the tree data processing method according to any of claims 1 to 2 when executing the computer program.
6. A computer-readable storage medium, characterized in that the computer-readable storage medium comprises a stored computer program, wherein the computer program, when running, controls an apparatus on which the computer-readable storage medium is located to perform the tree data processing method according to any one of claims 1 to 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210047415.9A CN114491164B (en) | 2022-01-17 | 2022-01-17 | Tree data processing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210047415.9A CN114491164B (en) | 2022-01-17 | 2022-01-17 | Tree data processing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114491164A CN114491164A (en) | 2022-05-13 |
| CN114491164B true CN114491164B (en) | 2022-12-09 |
Family
ID=81511746
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210047415.9A Active CN114491164B (en) | 2022-01-17 | 2022-01-17 | Tree data processing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114491164B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104699706A (en) * | 2013-12-06 | 2015-06-10 | 中国移动通信集团海南有限公司 | Directory tree generation method, device and system |
| CN106599218A (en) * | 2016-12-16 | 2017-04-26 | 北京奇虎科技有限公司 | Tree structure processing method and device |
| CN112948503A (en) * | 2021-03-30 | 2021-06-11 | 北京环境特性研究所 | Target characteristic tree structure graph rendering method and device |
| CN113282799A (en) * | 2021-05-21 | 2021-08-20 | 武汉联影医疗科技有限公司 | Node operation method and device, computer equipment and storage medium |
| CN113642292A (en) * | 2021-07-14 | 2021-11-12 | 广州市玄武无线科技股份有限公司 | Method, system, equipment and storage medium for implementing tree list |
| CN113704294A (en) * | 2021-08-17 | 2021-11-26 | 北京达佳互联信息技术有限公司 | Data processing method and device, electronic equipment and storage medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5038939B2 (en) * | 2008-03-03 | 2012-10-03 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Information retrieval system, method and program |
| CN112182310B (en) * | 2020-11-04 | 2023-11-17 | 上海德拓信息技术股份有限公司 | Method for realizing built-in real-time search general tree-shaped component |
| CN112069305B (en) * | 2020-11-13 | 2021-03-30 | 北京智慧星光信息技术有限公司 | Data screening method and device and electronic equipment |
| CN112416349A (en) * | 2020-12-08 | 2021-02-26 | 携程计算机技术（上海）有限公司 | Form page generation method, system, equipment and storage medium |
| CN113254751B (en) * | 2021-06-24 | 2021-09-21 | 北森云计算有限公司 | Method, equipment and storage medium for accurately extracting complex webpage structured information |
-
2022
- 2022-01-17 CN CN202210047415.9A patent/CN114491164B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104699706A (en) * | 2013-12-06 | 2015-06-10 | 中国移动通信集团海南有限公司 | Directory tree generation method, device and system |
| CN106599218A (en) * | 2016-12-16 | 2017-04-26 | 北京奇虎科技有限公司 | Tree structure processing method and device |
| CN112948503A (en) * | 2021-03-30 | 2021-06-11 | 北京环境特性研究所 | Target characteristic tree structure graph rendering method and device |
| CN113282799A (en) * | 2021-05-21 | 2021-08-20 | 武汉联影医疗科技有限公司 | Node operation method and device, computer equipment and storage medium |
| CN113642292A (en) * | 2021-07-14 | 2021-11-12 | 广州市玄武无线科技股份有限公司 | Method, system, equipment and storage medium for implementing tree list |
| CN113704294A (en) * | 2021-08-17 | 2021-11-26 | 北京达佳互联信息技术有限公司 | Data processing method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114491164A (en) | 2022-05-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111324665B (en) | Log playback method and device | |
| CN110377796B (en) | Text extraction method, device and equipment based on DOM tree and storage medium | |
| CN113282799B (en) | Node operation method, node operation device, computer equipment and storage medium | |
| CN112434027A (en) | Indexing method and device for multi-dimensional data, computer equipment and storage medium | |
| US20050044075A1 (en) | Method and apparatus for late-binding/dynamic pathname resolution | |
| CN110866024A (en) | Vector database increment updating method and system | |
| CN112347324B (en) | Document query method and device, electronic equipment and storage medium | |
| US20100057713A1 (en) | Entity-driven logic for improved name-searching in mixed-entity lists | |
| CN115114232A (en) | Method, device and medium for enumerating historical version objects | |
| CN114428776A (en) | Index partition management method and system for time sequence data | |
| CN111125216B (en) | Method and device for importing data into Phoenix | |
| CN114491164B (en) | Tree data processing method and system | |
| CN113127660A (en) | Timing graph database storage method and device | |
| CN104572904A (en) | Method and device for determining relevance level between tags | |
| CN116414935A (en) | Method for distributed Search space vector data based on Elastic Search | |
| CN108241710A (en) | A kind of file creating method, device and file polling method, apparatus | |
| CN110019295B (en) | Database retrieval method, device, system and storage medium | |
| CN116361287A (en) | Path analysis method, device and system | |
| CN115270731A (en) | Collaborative editing method and device for mixed document | |
| US9020995B2 (en) | Hybrid relational, directory, and content query facility | |
| CN108446144A (en) | A kind of application program launching method, device, terminal and storage medium | |
| CN111695056B (en) | Page processing and page return processing methods, devices and equipment | |
| CN113032450A (en) | Data storage and retrieval method, system, storage medium and processing terminal | |
| CN112948389A (en) | MD 5-based database table data comparison method and equipment | |
| CN110888870A (en) | Data storage table query method, partition server and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |