CN104346350B - The tree node querying method and system of Asynchronous Tree - Google Patents
The tree node querying method and system of Asynchronous Tree Download PDFInfo
- Publication number
- CN104346350B CN104346350B CN201310320814.9A CN201310320814A CN104346350B CN 104346350 B CN104346350 B CN 104346350B CN 201310320814 A CN201310320814 A CN 201310320814A CN 104346350 B CN104346350 B CN 104346350B
- Authority
- CN
- China
- Prior art keywords
- tree
- node
- querying
- tree node
- target
- 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
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 the tree node querying methods and system of a kind of Asynchronous Tree, are Asynchronous Tree the method includes initialization Flex tree control；Server gets the goal tree querying node information of input, carries out fuzzy matching in all tree nodes accordingly, obtains target tree node to the routing information of root node and be back to client；The routing information that the Flex tree control parsing of client obtains, navigates to target tree node using recursive algorithm and shows.The tree node querying method and system of Asynchronous Tree provided by the invention are compared with prior art, on the basis of not changing the query function of original Flex tree, very good solution tree node loads the inquiry problem under situation in asynchronous system, and tree node can be positioned from top to down according to tree construction, is greatly improved in terms of ease for use.
Description
Technical field
The present invention relates to power & environment supervision technical field more particularly to the tree node querying method and system of a kind of Asynchronous Tree,
Specifically, for needing the tree node of office station to be loaded tree relatively more in power & environment supervision and needing to add in an asynchronous manner
When load, the tree node inquiry of Asynchronous Tree is realized.
Background technique
In power & environment supervision system, in order to preferably embody the hierarchical relationship between superior node and downstream site, such as
Region generallys use tree construction at present with the hierarchical relationship between office station to show this hierarchical relationship.
In general, office's station number of bottom is often relatively more in power & environment supervision system, in the loading method of tree node
Usually all loaded using asynchronous system.In general, the loading method of Asynchronous Tree is: only default loads first layer tree first
Node, other nodes (such as child node of first layer tree node etc.) needs just can be gradually loaded after being clicked, existing skill
The mode of this inertia on-demand loading can promote the response speed of tree node load to a certain extent in art.Work as in practical application
In, when maintenance personnel or other staff need the inquiry in power & environment supervision system to obtain a certain specific office's tiny node for information about
When, and when the tree node of magnanimity is loaded in an asynchronous manner, then it is faced with such as next technical problem:
The tree node querying method provided in the prior art is merely capable of solving in all tree nodes by disposable whole quilts
Inquiry problem after load is then directly retrieved from obtained tree construction after all tree nodes are completely loaded
Desired node.However, after the tree node of magnanimity loads in an asynchronous manner, by above content it is known that obtained tree
The information of all tree nodes will not be shown in structure, and is only shown for the first time by the tree node information of default load, therefore
The tree node querying method for taking the prior art to provide can not solve inquiry of the tree node under asynchronous system load situation and ask
Topic.
Summary of the invention
The inquiry under situation is loaded in asynchronous system in order to solve the problems, such as that the prior art can not solve tree node, the present invention is real
Apply the tree node querying method and system for being designed to provide a kind of Asynchronous Tree of example.
In order to reach the purpose of the present invention, the present invention is implemented with the following technical solutions:
A kind of tree node querying method of Asynchronous Tree provided in an embodiment of the present invention comprising:
Initialization Flex tree control is Asynchronous Tree；
Server gets the goal tree querying node information of input, carries out fuzzy matching in all tree nodes accordingly,
Target tree node is obtained to the routing information of root node and is back to client；
The routing information that the Flex tree control parsing of client obtains, navigates to target tree node using recursive algorithm and shows
Show.
Preferably, server gets the goal tree querying node information of input, carries out mould in all tree nodes accordingly
Paste matching, the step of obtaining routing information of the target tree node to root node include:
1. getting the goal tree querying node keyword and inquiry times of input；
2. judging whether is goal tree querying node keyword that the current goal tree querying node keyword and last time obtain
Unanimously, if it is, inquiry times add 1 and go to step 6., otherwise, step is executed 3.；
3. obtaining all tree nodes, and take tree construction by these burl point caches to first list A；
4. carrying out fuzzy matching according to the current goal tree querying node keyword in first list A, matching is obtained
Matched node cache to second list B；
5. judging the length of second list B, if being gone to step 8. the length is 0, otherwise, go to step 6.；
6. obtaining target tree node in second list B；
7. foundation recursive algorithm obtains the target tree node to the routing information of root node in first list A；
8. returning to the prompt information for not inquiring target tree node.
It is further preferable that server get input goal tree querying node keyword and inquiry times it is same
When, the inquiry times for going back initialized target tree node key word of the inquiry are 0.
Preferably, the routing information that the Flex tree control parsing of client obtains, and target is navigated to using recursive algorithm
The step of tree node includes:
1. parsing the routing information of acquisition, and each tree node in path is stored in path array, and initialize road
Diameter 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 it is, exit, it is no
Then, step is executed 3.；
3. according to the data of tree node corresponding in path array pointer index to acquisite approachs array, and in Flex tree control
In matched；
4. judging whether the tree node has loaded child node, if it is, going to step 5., otherwise, go to step 6.；
5. the tree node is unfolded, and path array pointer index is executed and adds 1, gone to step later 2.；
6. obtaining all child nodes of the tree node and the tree node being unfolded, and path array pointer index is executed and is added
1, it goes to step later 2..
A kind of tree node inquiry system of Asynchronous Tree provided in an embodiment of the present invention comprising:
Client is Asynchronous Tree for initializing Flex tree control；For input goal tree querying node information and by its
It is sent to server；And the Flex tree control of client is used for the routing information that resolution server returns, and is calculated using recurrence
Method navigates to target tree node and shows；
Server for obtaining goal tree querying node information from client, and carries out mould in all tree nodes accordingly
Paste matching, obtains target tree node to the routing information of root node and is back to client.
Preferably, server obtains goal tree querying node information from client, and carries out in all tree nodes accordingly
Fuzzy matching, obtaining target tree node to the method for routing information of root node includes:
1. getting the goal tree querying node keyword and inquiry times of input；
2. judging whether is goal tree querying node keyword that the current goal tree querying node keyword and last time obtain
Unanimously, if it is, inquiry times add 1 and go to step 6., otherwise, step is executed 3.；
3. obtaining all tree nodes, and take tree construction by these burl point caches to first list A；
4. carrying out fuzzy matching according to the current goal tree querying node keyword in first list A, matching is obtained
Matched node cache to second list B；
5. judging the length of second list B, if being gone to step 8. the length is 0, otherwise, go to step 6.；
6. obtaining target tree node in second list B；
7. foundation recursive algorithm obtains the target tree node to the routing information of root node in first list A；
8. returning to the prompt information for not inquiring target tree node.
It is further preferable that server get input goal tree querying node keyword and inquiry times it is same
When, the inquiry times for going back initialized target tree node key word of the inquiry are 0.
Preferably, the routing information that the Flex tree control parsing of client obtains, and target is navigated to using recursive algorithm
The method of tree node includes:
1. parsing the routing information of acquisition, and each tree node in path is stored in path array, and initialize road
Diameter 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 it is, exit, it is no
Then, step is executed 3.；
3. according to the data of tree node corresponding in path array pointer index to acquisite approachs array, and in Flex tree control
In matched；
4. judging whether the tree node has loaded child node, if it is, going to step 5., otherwise, go to step 6.；
5. the tree node is unfolded, and path array pointer index is executed and adds 1, gone to step later 2.；
6. obtaining all child nodes of the tree node and the tree node being unfolded, and path array pointer index is executed and is added
1, it goes to step later 2..
The tree node querying method and system of Asynchronous Tree provided by the invention are compared with prior art, original not changing
On the basis of the query function of Flex tree, very good solution tree node loads the inquiry problem under situation in asynchronous system, and
And tree node can be positioned from top to down according to tree construction, it is greatly improved in terms of ease for use.
Detailed description of the invention
Fig. 1 is the tree node querying method flow diagram of Asynchronous Tree provided in an embodiment of the present invention；
Fig. 2 is that server foundation goal tree querying node information provided in an embodiment of the present invention carries out fuzzy matching to obtain
Target tree node to root node routing information method flow schematic diagram；
Fig. 3 is that the Flex tree control of client provided in an embodiment of the present invention parses the routing information obtained from server simultaneously
The method flow schematic diagram of target tree node is navigated to using recursive algorithm；
Fig. 4 is the tree node inquiry system structural schematic diagram of Asynchronous Tree provided in an embodiment of the present invention.
The realization, functional characteristics and excellent effect of the object of the invention, below in conjunction with specific embodiment and attached drawing do into
The explanation of one step.
Specific embodiment
Technical solution of the present invention is described in further detail in the following with reference to the drawings and specific embodiments, so that this
The technical staff in field can better understand the present invention and can be practiced, but illustrated embodiment is not as to limit of the invention
It is fixed.
Core of the invention thought is: in server end, according to the tree node search key that user inputs, from upper
Under carry out fuzzy matching in all tree nodes loaded, determine the tree node that is matched in tree construction using recursive algorithm
In hierarchical path after；In client, Flex tree control utilizes the path orientation to the tree node.
As shown in Figure 1, a kind of tree node querying method of Asynchronous Tree provided in an embodiment of the present invention comprising following step
It is rapid:
S10, initialization Flex tree control are Asynchronous Tree；
S20, server get the goal tree querying node information of input, carry out fuzzy in all tree nodes accordingly
Match, obtain target tree node to the routing information of root node and is back to client；
The routing information that the Flex tree control parsing of S30, client obtain, navigates to target tree node using recursive algorithm
And it shows.
For the step S10, initialization Flex tree control is Asynchronous Tree, and provide Asynchronous Tree querying node it is corresponding after
The method of platform service.
In the step S20, as shown in Fig. 2, server gets the goal tree querying node information of input, exist accordingly
The step of carrying out fuzzy matching in all tree nodes, obtaining routing information of the target tree node to root node include:
Step S201, the goal tree querying node keyword and inquiry times of input are got；
Step S202, the goal tree querying node for judging that the current goal tree querying node keyword and last time obtain is crucial
Whether word is consistent, if it is, inquiry times add 1 and go to step S206, otherwise, executes step S203；
Step S203, all tree nodes are obtained, and take tree construction by these burl point caches to first list A；
Step S204, fuzzy matching, general are carried out according to the current goal tree querying node keyword in first list A
It caches with obtained matched node to second list B；
Step S205, judge the length of second list B, if going to step S208 the length is 0, otherwise, go to step
S206；
Step S206, target tree node is obtained in second list B；
Step S207, according to recursive algorithm obtained in first list A the target tree node to root node routing information；
Step S208, the prompt information for not inquiring target tree node is returned.
More specifically, with continued reference to Fig. 2, in the step S207, obtains this in first list A according to recursive algorithm
The method of routing information of target tree node to root node includes:
Step S2071, first list A is traversed, and obtains the superior node of current tree node；
Step S2072, judge whether the superior node of the current tree node has father node, if so, then going to step
Otherwise S2073 goes to step S2074；
Step S2073, it saves the routing information found and goes to step S2071；
Step S2074, the routing information and inquiry times for returning to finally obtained target tree node to root node are (i.e. inclined
Shifting amount), while the goal tree querying node keyword and the offset are associated storage.
In particularly preferred embodiment, in the step S201, looked into the target tree node that server gets input
While asking keyword and inquiry times, the inquiry times for going back initialized target tree node key word of the inquiry are 0.
In the step S30, as shown in figure 3, the routing information that the Flex tree control parsing of client obtains, and utilize
Recursive algorithm navigates to the step of target tree node and includes:
Step S301, the routing information that parsing obtains, and each tree node in path is stored in path array, and just
Beginningization 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 it is, moving back
Out, otherwise, step S303 is executed；
Step S303, the data according to tree node corresponding in path array pointer index to acquisite approachs array, and in Flex
It is matched in tree control；
Step S304, judge whether the tree node has loaded child node, if it is, going to step S305, otherwise, go to step
S306；
Step S305, the tree node is unfolded, and path array pointer index is executed and adds 1, goes to step S302 later；
Step S306, all child nodes of the tree node are obtained and the tree node is unfolded, and to path array pointer index
It executes and adds 1, go to step S302 later.
As shown in figure 4, a kind of tree node inquiry system of Asynchronous Tree provided in an embodiment of the present invention comprising:
Client 100 is Asynchronous Tree for initializing Flex tree control；For inputting goal tree querying node information and inciting somebody to action
It is sent to server 200；And the Flex tree control of client 100 is used for the routing information that resolution server 200 returns,
And target tree node is navigated to using recursive algorithm and is shown；
Server 200, for obtaining goal tree querying node information from client 100, and accordingly in all tree nodes
Fuzzy matching is carried out, target tree node is obtained to the routing information of root node and is back to client 100.
In the present embodiment, server 200 obtains goal tree querying node information from client 100, and accordingly in all trees
Fuzzy matching is carried out in node, obtaining target tree node to the method for routing information of root node includes:
1. getting the goal tree querying node keyword and inquiry times of input；
2. judging whether is goal tree querying node keyword that the current goal tree querying node keyword and last time obtain
Unanimously, if it is, inquiry times add 1 and go to step 6., otherwise, step is executed 3.；
3. obtaining all tree nodes, and take tree construction by these burl point caches to first list A；
4. carrying out fuzzy matching according to the current goal tree querying node keyword in first list A, matching is obtained
Matched node cache to second list B；
5. judging the length of second list B, if being gone to step 8. the length is 0, otherwise, go to step 6.；
6. obtaining target tree node in second list B；
7. foundation recursive algorithm obtains the target tree node to the routing information of root node in first list A；
8. returning to the prompt information for not inquiring target tree node.
In embodiment, it is preferable that step 1. in, server 200 get input goal tree querying node close
While key word and inquiry times, the inquiry times for going back initialized target tree node key word of the inquiry are 0.
In the present embodiment, the routing information that the Flex tree control parsing of client 100 obtains, and positioned using recursive algorithm
Method to target tree node includes:
1. parsing the routing information of acquisition, and each tree node in path is stored in path array, and initialize road
Diameter 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 it is, exit, it is no
Then, step is executed 3.；
3. according to the data of tree node corresponding in path array pointer index to acquisite approachs array, and in Flex tree control
In matched；
4. judging whether the tree node has loaded child node, if it is, going to step 5., otherwise, go to step 6.；
5. the tree node is unfolded, and path array pointer index is executed and adds 1, gone to step later 2.；
6. obtaining all child nodes of the tree node and the tree node being unfolded, and path array pointer index is executed and is added
1, it goes to step later 2..
The above description is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all utilizations
Equivalent structure or equivalent flow shift made by description of the invention and accompanying drawing content is applied directly or indirectly in other correlations
Technical field, be included within the scope of the present invention.
Claims (6)
1. a kind of tree node querying method of Asynchronous Tree characterized by comprising
Initialization Flex tree control is Asynchronous Tree；
Server gets the goal tree querying node information of input, carries out fuzzy matching in all tree nodes accordingly, obtains
Target tree node to root node routing information and be back to client；
The routing information that the Flex tree control parsing of client obtains, navigates to target tree node using recursive algorithm and shows；
Wherein, the routing information that the Flex tree control parsing of client obtains, and target tree node is navigated to using recursive algorithm
The step of include:
1. parsing the routing information of acquisition, and each tree node in path is stored in path array, and initialization path number
Group pointer index is 0；
2. judging whether the value of path array pointer index is greater than path array length and subtracts 1, if it is, exiting, otherwise, hold
Row step is 3.；
3. according to the data of tree node corresponding in path array pointer index to acquisite approachs array, and in Flex tree control into
Row matching；
4. judging whether the tree node has loaded child node, if it is, going to step 5., otherwise, go to step 6.；
5. the tree node is unfolded, and path array pointer index is executed and adds 1, gone to step later 2.；
6. obtaining all child nodes of the tree node and the tree node being unfolded, and path array pointer index is executed and adds 1, it
After go to step 2..
2. the tree node querying method of Asynchronous Tree as described in claim 1, which is characterized in that server gets the mesh of input
Tree node query information is marked, fuzzy matching is carried out in all tree nodes accordingly, obtains target tree node to the path of root node
The step of information includes:
1. getting the goal tree querying node keyword and inquiry times of input；
2. judge the input goal tree querying node keyword and last time obtain goal tree querying node keyword whether one
It causes, if it is, inquiry times add 1 and go to step 6., otherwise, executes step 3.；
3. obtaining all tree nodes, and take tree construction by these burl point caches to first list A；
4. carrying out fuzzy matching according to the goal tree querying node keyword of the input in first list A, matching is obtained
Matched node is cached to second list B；
5. judging the length of second list B, if being gone to step 8. the length is 0, otherwise, go to step 6.；
6. obtaining target tree node in second list B；
7. foundation recursive algorithm obtains the target tree node to the routing information of root node in first list A；
8. returning to the prompt information for not inquiring target tree node.
3. the tree node querying method of Asynchronous Tree as claimed in claim 2, which is characterized in that get input in server
While goal tree querying node keyword and inquiry times, the inquiry times of initialized target tree node key word of the inquiry are gone back
It is 0.
4. a kind of tree node inquiry system of Asynchronous Tree characterized by comprising
Client is Asynchronous Tree for initializing Flex tree control；For inputting goal tree querying node information and being sent to
To server；And the Flex tree control of client is used for the routing information that resolution server returns, and fixed using recursive algorithm
Position is to target tree node and shows；
Server for obtaining goal tree querying node information from client, and carries out fuzzy in all tree nodes accordingly
Match, obtain target tree node to the routing information of root node and is back to client；
Wherein, the routing information that the Flex tree control parsing of client obtains, and target tree node is navigated to using recursive algorithm
Method include:
1. parsing the routing information of acquisition, and each tree node in path is stored in path array, and initialization path number
Group pointer index is 0；
2. judging whether the value of path array pointer index is greater than path array length and subtracts 1, if it is, exiting, otherwise, hold
Row step is 3.；
3. according to the data of tree node corresponding in path array pointer index to acquisite approachs array, and in Flex tree control into
Row matching；
4. judging whether the tree node has loaded child node, if it is, going to step 5., otherwise, go to step 6.；
5. the tree node is unfolded, and path array pointer index is executed and adds 1, gone to step later 2.；
6. obtaining all child nodes of the tree node and the tree node being unfolded, and path array pointer index is executed and adds 1, it
After go to step 2..
5. the tree node inquiry system of Asynchronous Tree as claimed in claim 4, which is characterized in that server obtains mesh from client
Tree node query information is marked, and carries out fuzzy matching in all tree nodes accordingly, obtains target tree node to the road of root node
The method of diameter information includes:
1. getting the goal tree querying node keyword and inquiry times of input；
2. judge the input goal tree querying node keyword and last time obtain goal tree querying node keyword whether one
It causes, if it is, inquiry times add 1 and go to step 6., otherwise, executes step 3.；
3. obtaining all tree nodes, and take tree construction by these burl point caches to first list A；
4. carrying out fuzzy matching according to the goal tree querying node keyword of the input in first list A, matching is obtained
Matched node is cached to second list B；
5. judging the length of second list B, if being gone to step 8. the length is 0, otherwise, go to step 6.；
6. obtaining target tree node in second list B；
7. foundation recursive algorithm obtains the target tree node to the routing information of root node in first list A；
8. returning to the prompt information for not inquiring target tree node.
6. the tree node inquiry system of Asynchronous Tree as claimed in claim 5, which is characterized in that get input in server
While goal tree querying node keyword and inquiry times, the inquiry times of initialized target tree node key word of the inquiry are gone back
It is 0.
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 CN104346350A (en) | 2015-02-11 |
| CN104346350B true 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) |
Families Citing this family (4)
| 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 |
| 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 |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN103020092A (en) * | 2011-09-28 | 2013-04-03 | 深圳市金蝶中间件有限公司 | Method and system for positioning node in lazy loading tree |
| 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 |
| CN103020054B (en) * | 2011-09-20 | 2016-04-13 | 深圳市金蝶中间件有限公司 | Fuzzy query method and system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100465967C (en) * | 2007-08-20 | 2009-03-04 | 华为技术有限公司 | Inquiry result processing method and device |
| CN103186674A (en) * | 2013-04-02 | 2013-07-03 | 浪潮电子信息产业股份有限公司 | Web data quick inquiry method based on extensive makeup language (XML) |
-
2013
- 2013-07-26 CN CN201310320814.9A patent/CN104346350B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| 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 |
Non-Patent Citations (2)
| Title |
|---|
| ExtJs框架下树形组件改进及应用;朱立明;《计算机应用》;20101231;第242-247页 * |
| 基于Ajax 技术实现Web异步树的应用研究;戴维 等;《计算机与现代化》;20101231;第148-149页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104346350A (en) | 2015-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6788027B2 (en) | How and devices to jump between pages | |
| Bilal et al. | Time aware least recent used (TLRU) cache management policy in ICN | |
| CN104346350B (en) | The tree node querying method and system of Asynchronous Tree | |
| CN110347722A (en) | Data capture method, device, equipment and storage medium based on HBase | |
| US20090158161A1 (en) | Collaborative search in virtual worlds | |
| CN103379217B (en) | The method of input content auto-complete, device and server in a kind of handheld device | |
| CN109948017A (en) | A kind of information processing method and device | |
| CN103810260B (en) | Complex network community based on topological property finds method | |
| CN101399688A (en) | Publishing method and device for distributed region lookup zone | |
| US10938929B2 (en) | Adjusting prominence of a participant profile in a social networking interface | |
| CN104021205B (en) | Method and device for establishing microblog index | |
| US9280402B2 (en) | System and method for updating a dual layer browser | |
| KR101072937B1 (en) | Semantic service system and method | |
| US20210076224A1 (en) | Network convergence method and device, electronic apparatus, and storage medium | |
| CN103226591B (en) | A kind of support multiple key quick access method and device | |
| CN110377745B (en) | Information processing method, information retrieval device and server | |
| JP2018530827A (en) | Content delivery method and apparatus | |
| CN103647843B (en) | Method and device for triggering and responding to cloud input requests | |
| JP2010211556A (en) | Sightseeing route provision device, sightseeing route provision method and program | |
| CN105205062B (en) | Date storage method, method for reading data and device | |
| CN107729421B (en) | The execution method, apparatus and storage medium of storing process | |
| CN109446417A (en) | A kind of intellectualized retrieval method and apparatus | |
| US20110200040A1 (en) | Extremum route determining engine and method | |
| Fofack et al. | An approximate analysis of heterogeneous and general cache networks | |
| CN104572945B (en) | A kind of file search method and device based on cloud storage space |
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 |