CN104346350A - Method and system for inquiring tree node of asynchronous tree - Google Patents
Method and system for inquiring tree node of asynchronous tree Download PDFInfo
- Publication number
- CN104346350A CN104346350A CN201310320814.9A CN201310320814A CN104346350A CN 104346350 A CN104346350 A CN 104346350A CN 201310320814 A CN201310320814 A CN 201310320814A CN 104346350 A CN104346350 A CN 104346350A
- Authority
- CN
- China
- Prior art keywords
- tree
- node
- goal
- querying
- asynchronous
- 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.)
- Granted
Links
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/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2468—Fuzzy queries
-
- 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/95—Retrieval from the web
- G06F16/951—Indexing; Web crawling techniques
Abstract
The invention discloses a method and a system for inquiring a tree node of an asynchronous tree. The method comprises the steps of: initializing a Flex tree control as an asynchronous tree; obtaining input target tree node inquiry information by a server, and accordingly performing fuzzy matching on all the tree nodes to obtain path information from the target tree nodes to root nodes and returning the path information to a client; analyzing the obtained path information by the Flex tree control at the client, locating the path information to the target tree nodes by utilizing a recursive algorithm and displaying. In comparison with the prior art, the method and the system for inquiring the tree node of the asynchronous tree provided by the invention well solve the inquiry problem of the tree nodes under the asynchronous loading condition on the basis of unchanging the original inquiry function of the Flex tree, can position the tree nodes from upside to downside according to the tree structure, and is greatly improved in the aspect of usability.
Description
Technical field
The present invention relates to power & environment supervision technical field, particularly relate to a kind of tree node querying method and system of Asynchronous Tree, specifically, during for needing the tree node of the office station tree loaded many in power & environment supervision and needing to load in an asynchronous manner, the tree node inquiry of Asynchronous Tree is realized.
Background technology
In power & environment supervision system, in order to better embody the hierarchical relationship between superior node and downstream site, such as region, with the hierarchical relationship between office station, adopts tree construction to show this hierarchical relationship at present usually.
Generally speaking, in power & environment supervision system, office's station number of bottom is often many, usually all adopts asynchronous system to load in the load mode of tree node.Usually, the load mode of Asynchronous Tree is: first only acquiescence loads ground floor tree node, other nodes (such as the child node etc. of ground floor tree node) need just progressively to be loaded afterwards clicked, and in prior art, the mode of this inertia on-demand loading to a certain extent can the response speed that loads of boosted tree node.In the middle of real world applications, when maintainer or other staff need inquiry in power & environment supervision system obtain a certain concrete office tiny node for information about time, and when the tree node of magnanimity loads in an asynchronous manner, be then faced with as next technical matters:
The tree node querying method provided in prior art only can solve all tree nodes by disposable be all loaded after inquiry problem, after all tree nodes are by complete loading, then from the tree construction obtained, directly retrieve the node wanted.But, after the tree node of magnanimity loads in an asynchronous manner, can be learnt by foregoing, the information of all tree nodes can not be shown in the tree construction obtained, and only showing first time by the tree node information of acquiescence loading, the tree node querying method therefore taking the prior art to provide cannot solve the inquiry problem of tree node under asynchronous system loads situation.
Summary of the invention
Cannot solve the inquiry problem of tree node under asynchronous system loading situation to solve prior art, the object of the embodiment of the present invention is the tree node querying method and the system that provide a kind of Asynchronous Tree.
In order to reach object of the present invention, the present invention realizes by the following technical solutions:
The tree node querying method of a kind of Asynchronous Tree that the embodiment of the present invention provides, it comprises:
Initialization Flex tree control is Asynchronous Tree;
Server gets the goal tree querying node information of input, carry out fuzzy matching accordingly in all tree nodes, obtains goal tree node to the routing information of root node and is back to client;
The Flex tree control of client resolves the routing information obtained, and utilizes recursive algorithm navigate to goal tree node and show.
Preferably, server gets the goal tree querying node information of input, carries out fuzzy matching accordingly in all tree nodes, obtains goal tree node and comprises to the step of the routing information of root node:
1. goal tree querying node key word and the inquiry times of input is got;
2. judge that whether this current goal tree querying node key word is consistent with the goal tree querying node key word that last time obtains, if so, then inquiry times adds 1 and goes to step 6., otherwise, perform step 3.;
3. obtain all tree nodes, and take tree construction by these tree node buffer memorys to first row Table A;
4. in first row Table A, carry out fuzzy matching according to this current goal tree querying node key word, will matched node buffer memory to the second list B obtained be mated;
5. judge the length of the second list B, if its length is 0, then go to step 8., otherwise, go to step 6.;
6. in the second list B, goal tree node is obtained;
7. in first row Table A, the routing information of this goal tree node to root node is obtained according to recursive algorithm;
8. the information not inquiring goal tree node is returned.
More preferably, while the goal tree querying node key word getting input at server and inquiry times, the inquiry times of going back initialized target tree node key word of the inquiry is 0.
Preferably, the Flex tree control of client resolves the routing information obtained, and the step utilizing recursive algorithm to navigate to goal tree node comprises:
1. the routing information of acquisition is resolved, and by each tree node in path all stored in path array, and initialization path array pointer index is 0;
2. judge whether the value of path array pointer index is greater than path array length and subtracts 1, if so, then exits, otherwise, perform step 3.;
3. according to the data of corresponding tree node in the array pointer index acquisition approach array of path, and mate in Flex tree control;
4. judge whether this tree node loads child node, if so, then go to step 5., otherwise, go to step 6.;
5. launch this tree node, and 1 is added to path array pointer index execution, go to step 2. afterwards;
6. obtain all child nodes of this tree node and launch this tree node, and 1 is added to path array pointer index execution, going to step 2. afterwards.
The tree node inquiry system of a kind of Asynchronous Tree that the embodiment of the present invention provides, it comprises:
Client is Asynchronous Tree for initialization Flex tree control; For inputting goal tree querying node information and sending it to server; And the Flex tree control of client is used for the routing information that resolution server returns, and utilizes recursive algorithm navigate to goal tree node and show;
Server, for obtaining goal tree querying node information from client, and carry out fuzzy matching accordingly in all tree nodes, obtains goal tree node to the routing information of root node and be back to client.
Preferably, server obtains goal tree querying node information from client, and in all tree nodes, carries out fuzzy matching accordingly, obtains goal tree node and comprises to the method for the routing information of root node:
1. goal tree querying node key word and the inquiry times of input is got;
2. judge that whether this current goal tree querying node key word is consistent with the goal tree querying node key word that last time obtains, if so, then inquiry times adds 1 and goes to step 6., otherwise, perform step 3.;
3. obtain all tree nodes, and take tree construction by these tree node buffer memorys to first row Table A;
4. in first row Table A, carry out fuzzy matching according to this current goal tree querying node key word, will matched node buffer memory to the second list B obtained be mated;
5. judge the length of the second list B, if its length is 0, then go to step 8., otherwise, go to step 6.;
6. in the second list B, goal tree node is obtained;
7. in first row Table A, the routing information of this goal tree node to root node is obtained according to recursive algorithm;
8. the information not inquiring goal tree node is returned.
More preferably, while the goal tree querying node key word getting input at server and inquiry times, the inquiry times of going back initialized target tree node key word of the inquiry is 0.
Preferably, the Flex tree control of client resolves the routing information obtained, and the method utilizing recursive algorithm to navigate to goal tree node comprises:
1. the routing information of acquisition is resolved, and by each tree node in path all stored in path array, and initialization path array pointer index is 0;
2. judge whether the value of path array pointer index is greater than path array length and subtracts 1, if so, then exits, otherwise, perform step 3.;
3. according to the data of corresponding tree node in the array pointer index acquisition approach array of path, and mate in Flex tree control;
4. judge whether this tree node loads child node, if so, then go to step 5., otherwise, go to step 6.;
5. launch this tree node, and 1 is added to path array pointer index execution, go to step 2. afterwards;
6. obtain all child nodes of this tree node and launch this tree node, and 1 is added to path array pointer index execution, going to step 2. afterwards.
The tree node querying method of Asynchronous Tree provided by the invention and system are compared with prior art, on the basis not changing the query function that original Flex sets, well solve the inquiry problem of tree node under asynchronous system loads situation, and according to tree construction locating tree node from top to down, can be greatly improved in ease for use.
Accompanying drawing explanation
Fig. 1 is the tree node querying method schematic flow sheet of the Asynchronous Tree that the embodiment of the present invention provides;
Fig. 2 is that the server that the embodiment of the present invention provides carries out fuzzy matching to obtain the method flow schematic diagram of goal tree node to the routing information of root node according to goal tree querying node information;
Fig. 3 is that the Flex tree control of the client that the embodiment of the present invention provides is resolved the routing information from server acquisition and utilizes recursive algorithm to navigate to the method flow schematic diagram of goal tree node;
Fig. 4 is the tree node inquiry system structural representation of the Asynchronous Tree that the embodiment of the present invention provides.
The realization of the object of the invention, functional characteristics and excellent effect, be described further below in conjunction with specific embodiment and accompanying drawing.
Embodiment
Below in conjunction with the drawings and specific embodiments, technical scheme of the present invention is described in further detail, can better understand the present invention to make those skilled in the art and can be implemented, but illustrated embodiment is not as a limitation of the invention.
Core concept of the present invention is: at server end, according to the tree node search key of user's input, from top to down in all tree nodes loaded, carry out fuzzy matching, after the hierarchical path of the tree node utilizing recursive algorithm to determine to match in tree construction; In client, Flex tree control utilizes this path orientation to this tree node.
As shown in Figure 1, the tree node querying method of a kind of Asynchronous Tree that the embodiment of the present invention provides, it comprises the steps:
S10, initialization Flex tree control are Asynchronous Tree;
S20, server get the goal tree querying node information of input, carry out fuzzy matching accordingly in all tree nodes, obtain goal tree node to the routing information of root node and are back to client;
The Flex tree control of S30, client resolves the routing information obtained, and utilizes recursive algorithm navigate to goal tree node and show.
For described step S10, initialization Flex tree control is Asynchronous Tree, and provides the method for the background service that Asynchronous Tree querying node is corresponding.
In described step S20, as shown in Figure 2, server gets the goal tree querying node information of input, carries out fuzzy matching accordingly in all tree nodes, obtains goal tree node and comprises to the step of the routing information of root node:
Step S201, the goal tree querying node key word getting input and inquiry times;
Step S202, judge that whether this current goal tree querying node key word is consistent with the goal tree querying node key word that last time obtains, if so, then inquiry times adds 1 and goes to step S206, otherwise, perform step S203;
Step S203, obtain all tree nodes, and take tree construction by these tree node buffer memorys to first row Table A;
Step S204, in first row Table A, carry out fuzzy matching according to this current goal tree querying node key word, will matched node buffer memory to the second list B obtained be mated;
Step S205, judge the length of the second list B if its length is 0, then to go to step S208, otherwise, go to step S206;
Step S206, in the second list B, obtain goal tree node;
Step S207, foundation recursive algorithm obtain the routing information of this goal tree node to root node in first row Table A;
Step S208, return the information not inquiring goal tree node.
More specifically, continue with reference to figure 2, in described step S207, foundation recursive algorithm obtains this goal tree node and comprises to the method for the routing information of root node in first row Table A:
Step S2071, traversal first row Table A, and obtain the superior node of current tree node;
Step S2072, judge whether the superior node of this current tree node has father node, if had, then goes to step S2073, otherwise goes to step S2074;
The routing information that step S2073, preservation have been found also goes to step S2071;
Step S2074, return the goal tree node that finally obtains to the routing information of root node and inquiry times (i.e. side-play amount), described goal tree querying node key word and described side-play amount are carried out association store simultaneously.
More in preferred embodiment, in described step S201, while the goal tree querying node key word getting input at server and inquiry times, the inquiry times of going back initialized target tree node key word of the inquiry is 0.
In described step S30, as shown in Figure 3, the Flex tree control of client resolves the routing information obtained, and the step utilizing recursive algorithm to navigate to goal tree node comprises:
The routing information that step S301, parsing obtain, and by each tree node in path all stored in path array, and initialization path array pointer index is 0;
Step S302, judge whether the value of path array pointer index is greater than path array length and subtracts 1, if so, then exits, otherwise, perform step S303;
The data of corresponding tree node in step S303, foundation path array pointer index acquisition approach array, and mate in Flex tree control;
Step S304, judge whether this tree node loads child node, if so, then go to step S305, otherwise, go to step S306;
Step S305, launch this tree node, and path array pointer index is performed add 1, go to step S302 afterwards;
Step S306, obtain this tree node all child nodes and launch this tree node, and to path array pointer index perform add 1, go to step S302 afterwards.
As shown in Figure 4, the tree node inquiry system of a kind of Asynchronous Tree that the embodiment of the present invention provides, it comprises:
Client 100 is Asynchronous Tree for initialization Flex tree control; For inputting goal tree querying node information and sending it to server 200; And the Flex tree control of client 100 is used for the routing information that resolution server 200 returns, and utilizes recursive algorithm navigate to goal tree node and show;
Server 200, for obtaining goal tree querying node information from client 100, and carry out fuzzy matching accordingly in all tree nodes, obtains goal tree node to the routing information of root node and be back to client 100.
In the present embodiment, server 200 obtains goal tree querying node information from client 100, and in all tree nodes, carries out fuzzy matching accordingly, obtains goal tree node and comprises to the method for the routing information of root node:
1. goal tree querying node key word and the inquiry times of input is got;
2. judge that whether this current goal tree querying node key word is consistent with the goal tree querying node key word that last time obtains, if so, then inquiry times adds 1 and goes to step 6., otherwise, perform step 3.;
3. obtain all tree nodes, and take tree construction by these tree node buffer memorys to first row Table A;
4. in first row Table A, carry out fuzzy matching according to this current goal tree querying node key word, will matched node buffer memory to the second list B obtained be mated;
5. judge the length of the second list B, if its length is 0, then go to step 8., otherwise, go to step 6.;
6. in the second list B, goal tree node is obtained;
7. in first row Table A, the routing information of this goal tree node to root node is obtained according to recursive algorithm;
8. the information not inquiring goal tree node is returned.
In an embodiment, preferably, step 1. in, while the goal tree querying node key word getting input at server 200 and inquiry times, the inquiry times of going back initialized target tree node key word of the inquiry is 0.
In the present embodiment, the Flex tree control of client 100 resolves the routing information obtained, and the method utilizing recursive algorithm to navigate to goal tree node comprises:
1. the routing information of acquisition is resolved, and by each tree node in path all stored in path array, and initialization path array pointer index is 0;
2. judge whether the value of path array pointer index is greater than path array length and subtracts 1, if so, then exits, otherwise, perform step 3.;
3. according to the data of corresponding tree node in the array pointer index acquisition approach array of path, and mate in Flex tree control;
4. judge whether this tree node loads child node, if so, then go to step 5., otherwise, go to step 6.;
5. launch this tree node, and 1 is added to path array pointer index execution, go to step 2. afterwards;
6. obtain all child nodes of this tree node and launch this tree node, and 1 is added to path array pointer index execution, going to step 2. afterwards.
The foregoing is only the preferred embodiments of the present invention; not thereby the scope of the claims of the present invention is limited; every utilize instructions of the present invention and accompanying drawing content to do equivalent structure or equivalent flow process conversion; or be directly or indirectly used in other relevant technical fields, be all in like manner included in scope of patent protection of the present invention.
Claims (8)
1. a tree node querying method for Asynchronous Tree, is characterized in that, comprising:
Initialization Flex tree control is Asynchronous Tree;
Server gets the goal tree querying node information of input, carry out fuzzy matching accordingly in all tree nodes, obtains goal tree node to the routing information of root node and is back to client;
The Flex tree control of client resolves the routing information obtained, and utilizes recursive algorithm navigate to goal tree node and show.
2. the tree node querying method of Asynchronous Tree as claimed in claim 1, it is characterized in that, server gets the goal tree querying node information of input, carries out fuzzy matching accordingly in all tree nodes, obtains goal tree node and comprises to the step of the routing information of root node:
1. goal tree querying node key word and the inquiry times of input is got;
2. judge that whether this current goal tree querying node key word is consistent with the goal tree querying node key word that last time obtains, if so, then inquiry times adds 1 and goes to step 6., otherwise, perform step 3.;
3. obtain all tree nodes, and take tree construction by these tree node buffer memorys to first row Table A;
4. in first row Table A, carry out fuzzy matching according to this current goal tree querying node key word, will matched node buffer memory to the second list B obtained be mated;
5. judge the length of the second list B, if its length is 0, then go to step 8., otherwise, go to step 6.;
6. in the second list B, goal tree node is obtained;
7. in first row Table A, the routing information of this goal tree node to root node is obtained according to recursive algorithm;
8. the information not inquiring goal tree node is returned.
3. the tree node querying method of Asynchronous Tree as claimed in claim 2, is characterized in that, while the goal tree querying node key word getting input at server and inquiry times, the inquiry times of going back initialized target tree node key word of the inquiry is 0.
4. the tree node querying method of the Asynchronous Tree as described in as arbitrary in claim 1-3, is characterized in that, the Flex tree control of client resolves the routing information obtained, and the step utilizing recursive algorithm to navigate to goal tree node comprises:
1. the routing information of acquisition is resolved, and by each tree node in path all stored in path array, and initialization path array pointer index is 0;
2. judge whether the value of path array pointer index is greater than path array length and subtracts 1, if so, then exits, otherwise, perform step 3.;
3. according to the data of corresponding tree node in the array pointer index acquisition approach array of path, and mate in Flex tree control;
4. judge whether this tree node loads child node, if so, then go to step 5., otherwise, go to step 6.;
5. launch this tree node, and 1 is added to path array pointer index execution, go to step 2. afterwards;
6. obtain all child nodes of this tree node and launch this tree node, and 1 is added to path array pointer index execution, going to step 2. afterwards.
5. a tree node inquiry system for Asynchronous Tree, is characterized in that, comprising:
Client is Asynchronous Tree for initialization Flex tree control; For inputting goal tree querying node information and sending it to server; And the Flex tree control of client is used for the routing information that resolution server returns, and utilizes recursive algorithm navigate to goal tree node and show;
Server, for obtaining goal tree querying node information from client, and carry out fuzzy matching accordingly in all tree nodes, obtains goal tree node to the routing information of root node and be back to client.
6. the tree node inquiry system of Asynchronous Tree as claimed in claim 5, it is characterized in that, server obtains goal tree querying node information from client, and in all tree nodes, carries out fuzzy matching accordingly, obtains goal tree node and comprises to the method for the routing information of root node:
1. goal tree querying node key word and the inquiry times of input is got;
2. judge that whether this current goal tree querying node key word is consistent with the goal tree querying node key word that last time obtains, if so, then inquiry times adds 1 and goes to step 6., otherwise, perform step 3.;
3. obtain all tree nodes, and take tree construction by these tree node buffer memorys to first row Table A;
4. in first row Table A, carry out fuzzy matching according to this current goal tree querying node key word, will matched node buffer memory to the second list B obtained be mated;
5. judge the length of the second list B, if its length is 0, then go to step 8., otherwise, go to step 6.;
6. in the second list B, goal tree node is obtained;
7. in first row Table A, the routing information of this goal tree node to root node is obtained according to recursive algorithm;
8. the information not inquiring goal tree node is returned.
7. the tree node inquiry system of Asynchronous Tree as claimed in claim 6, is characterized in that, while the goal tree querying node key word getting input at server and inquiry times, the inquiry times of going back initialized target tree node key word of the inquiry is 0.
8. the tree node inquiry system of Asynchronous Tree as claimed in claim 5, is characterized in that, the Flex tree control of client resolves the routing information obtained, and the method utilizing recursive algorithm to navigate to goal tree node comprises:
1. the routing information of acquisition is resolved, and by each tree node in path all stored in path array, and initialization path array pointer index is 0;
2. judge whether the value of path array pointer index is greater than path array length and subtracts 1, if so, then exits, otherwise, perform step 3.;
3. according to the data of corresponding tree node in the array pointer index acquisition approach array of path, and mate in Flex tree control;
4. judge whether this tree node loads child node, if so, then go to step 5., otherwise, go to step 6.;
5. launch this tree node, and 1 is added to path array pointer index execution, go to step 2. afterwards;
6. obtain all child nodes of this tree node and launch this tree node, and to path array pointer index
Execution adds 1, goes to step 2. afterwards.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310320814.9A CN104346350B (en) | 2013-07-26 | 2013-07-26 | The tree node querying method and system of Asynchronous Tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310320814.9A CN104346350B (en) | 2013-07-26 | 2013-07-26 | The tree node querying method and system of Asynchronous Tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104346350A true CN104346350A (en) | 2015-02-11 |
| CN104346350B CN104346350B (en) | 2019-09-20 |
Family
ID=52501977
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310320814.9A Active CN104346350B (en) | 2013-07-26 | 2013-07-26 | The tree node querying method and system of Asynchronous Tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104346350B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108108435A (en) * | 2017-12-19 | 2018-06-01 | 中国航天科工集团第四研究院第四总体设计部 | A kind of front end fast display method for space product structure tree |
| CN109582380A (en) * | 2017-09-26 | 2019-04-05 | 北京国双科技有限公司 | A kind of Node Processing Method and device, storage medium, processor |
| CN110442584A (en) * | 2019-08-19 | 2019-11-12 | 浪潮通用软件有限公司 | A method of the tree structure resource retrieval based on asynchronous load |
| CN111597184A (en) * | 2020-04-01 | 2020-08-28 | 深圳英飞拓智能技术有限公司 | Message publishing and subscribing method and device based on tree structure data |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101127048A (en) * | 2007-08-20 | 2008-02-20 | 华为技术有限公司 | Inquiry result processing method and device |
| CN101408877A (en) * | 2007-10-10 | 2009-04-15 | 英业达股份有限公司 | System and method for loading tree node |
| CN101639845A (en) * | 2009-08-12 | 2010-02-03 | 东软集团股份有限公司 | Tree-node displaying method and device |
| CN102982161A (en) * | 2012-12-05 | 2013-03-20 | 北京奇虎科技有限公司 | Method and device for acquiring webpage information |
| CN103020054A (en) * | 2011-09-20 | 2013-04-03 | 深圳市金蝶中间件有限公司 | Fuzzy query method and system |
| CN103020092A (en) * | 2011-09-28 | 2013-04-03 | 深圳市金蝶中间件有限公司 | Method and system for positioning node in lazy loading tree |
| CN103186674A (en) * | 2013-04-02 | 2013-07-03 | 浪潮电子信息产业股份有限公司 | Web data quick inquiry method based on extensive makeup language (XML) |
| US8656379B2 (en) * | 2011-09-26 | 2014-02-18 | Oracle International Corporation | Systems and methods for uniquely defining Fortran run time type descriptors for polymorphic entities |
-
2013
- 2013-07-26 CN CN201310320814.9A patent/CN104346350B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101127048A (en) * | 2007-08-20 | 2008-02-20 | 华为技术有限公司 | Inquiry result processing method and device |
| CN101408877A (en) * | 2007-10-10 | 2009-04-15 | 英业达股份有限公司 | System and method for loading tree node |
| CN101408877B (en) * | 2007-10-10 | 2011-03-16 | 英业达股份有限公司 | System and method for loading tree node |
| CN101639845A (en) * | 2009-08-12 | 2010-02-03 | 东软集团股份有限公司 | Tree-node displaying method and device |
| CN103020054A (en) * | 2011-09-20 | 2013-04-03 | 深圳市金蝶中间件有限公司 | Fuzzy query method and system |
| CN103020054B (en) * | 2011-09-20 | 2016-04-13 | 深圳市金蝶中间件有限公司 | Fuzzy query method and system |
| US8656379B2 (en) * | 2011-09-26 | 2014-02-18 | Oracle International Corporation | Systems and methods for uniquely defining Fortran run time type descriptors for polymorphic entities |
| CN103020092A (en) * | 2011-09-28 | 2013-04-03 | 深圳市金蝶中间件有限公司 | Method and system for positioning node in lazy loading tree |
| CN102982161A (en) * | 2012-12-05 | 2013-03-20 | 北京奇虎科技有限公司 | Method and device for acquiring webpage information |
| CN103186674A (en) * | 2013-04-02 | 2013-07-03 | 浪潮电子信息产业股份有限公司 | Web data quick inquiry method based on extensive makeup language (XML) |
Non-Patent Citations (2)
| Title |
|---|
| 戴维 等: "基于Ajax 技术实现Web异步树的应用研究", 《计算机与现代化》 * |
| 朱立明: "ExtJs框架下树形组件改进及应用", 《计算机应用》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109582380A (en) * | 2017-09-26 | 2019-04-05 | 北京国双科技有限公司 | A kind of Node Processing Method and device, storage medium, processor |
| CN108108435A (en) * | 2017-12-19 | 2018-06-01 | 中国航天科工集团第四研究院第四总体设计部 | A kind of front end fast display method for space product structure tree |
| CN110442584A (en) * | 2019-08-19 | 2019-11-12 | 浪潮通用软件有限公司 | A method of the tree structure resource retrieval based on asynchronous load |
| CN110442584B (en) * | 2019-08-19 | 2023-07-18 | 浪潮通用软件有限公司 | Method for retrieving tree-structure resources based on asynchronous loading |
| CN111597184A (en) * | 2020-04-01 | 2020-08-28 | 深圳英飞拓智能技术有限公司 | Message publishing and subscribing method and device based on tree structure data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104346350B (en) | 2019-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2750053B1 (en) | Data storage program, data retrieval program, data retrieval apparatus, data storage method and data retrieval method | |
| CN107590214B (en) | Recommendation method and device for search keywords and electronic equipment | |
| CN102346747B (en) | Method for searching parameters in data model | |
| CN110347722A (en) | Data capture method, device, equipment and storage medium based on HBase | |
| JP2019518257A (en) | State control method and apparatus | |
| CN101408877B (en) | System and method for loading tree node | |
| CN103902535B (en) | Obtain the method, apparatus and system of associational word | |
| CN104424199A (en) | Search method and device | |
| CN104346350A (en) | Method and system for inquiring tree node of asynchronous tree | |
| CN104933175B (en) | Performance data correlation analysis method and performance monitoring system | |
| US11368855B2 (en) | Network convergence method and device, electronic apparatus, and storage medium | |
| US20100076980A1 (en) | Tokenized javascript indexing system | |
| JP5873925B2 (en) | Compression match enumeration | |
| CN103123650A (en) | Extensible markup language (XML) data bank full-text indexing method based on integer mapping | |
| CN106227821A (en) | A kind for the treatment of method and apparatus of order line order | |
| KR101255639B1 (en) | Column-oriented database system and join process method using join index thereof | |
| CN114428907A (en) | Information searching method and device, electronic equipment and storage medium | |
| CN103544036A (en) | Page loading method, terminal and system | |
| CN111290714B (en) | Data reading method and device | |
| CN103177038A (en) | Query expression in vertical search engine | |
| CN104615737A (en) | Search box based computing method and device | |
| CN107577712A (en) | The method, apparatus and computer equipment of a kind of loading page | |
| CN102063501B (en) | Internet web page conversion method and device | |
| CN104866545A (en) | Method for searching keywords on information display page | |
| CN109241164A (en) | A kind of data processing method, device, server and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |