CN106341469A - Method and device for loading tree node data - Google Patents
Method and device for loading tree node data Download PDFInfo
- Publication number
- CN106341469A CN106341469A CN201610784853.8A CN201610784853A CN106341469A CN 106341469 A CN106341469 A CN 106341469A CN 201610784853 A CN201610784853 A CN 201610784853A CN 106341469 A CN106341469 A CN 106341469A
- Authority
- CN
- China
- Prior art keywords
- tree node
- loading
- data
- node
- preset
- 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
- 238000011068 loading method Methods 0.000 title claims abstract description 176
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000008569 process Effects 0.000 description 8
- 230000006870 function Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012827 research and development Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
- H04L67/5681—Pre-fetching or pre-delivering data based on network characteristics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/2866—Architectures; Arrangements
- H04L67/30—Profiles
- H04L67/306—User profiles
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
- H04L67/5682—Policies or rules for updating, deleting or replacing the stored data
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a method and a device for loading the tree node data. The method comprises steps that a node identifier of a tree node on which the to-be-loaded tree node data is stored is acquired; whether the node identifier is in a preset data loading file is determined, and a determination result is acquired; the loading strategy corresponding to the determination result is called to load the tree node data.. Through the method, a hybrid loading strategy including full loading and lazy loading can be adopted, a loading mode of the tree node data can be dynamically determined, and loading efficiency of the tree node data is effectively improved.
Description
Technical Field
The invention relates to the technical field of internet, in particular to a method and a device for loading tree node data.
Background
Users often have a need to view a large amount of data during internet access, for example, real-time follow-up of project development requires viewing a large amount of summary content about processes. In the related art, the tree control calls a full loading strategy to load all tree node data, that is, synchronous loading is adopted, and all tree node data are loaded at one time, or when a user clicks a certain tree node, the tree control can call a lazy loading strategy to load child node data of the tree node.
In the first mode, because all the tree node data are loaded by the full loading strategy, when the quantity of the tree node data is too large, the loading efficiency of the tree node data is low, in the second mode, because the child node data of the tree node is loaded only when a user clicks a certain tree node, when the quantity of the child node data is large, the front end can frequently send data requests to the background server, and the loading efficiency of the tree node data is low.
Disclosure of Invention
The present invention is directed to solving, at least to some extent, one of the technical problems in the related art.
Therefore, one object of the present invention is to provide a method for loading tree node data, which can dynamically determine a loading manner of the tree node data by using a full-loading and lazy-loading mixed loading strategy, thereby effectively improving the loading efficiency of the tree node data.
Another objective of the present invention is to provide a loading apparatus for tree node data.
In order to achieve the above object, an embodiment of the first aspect of the present invention provides a method for loading tree node data, including: acquiring a node identifier of a tree node where tree node data to be loaded is located; judging whether the node identification is in a preset data loading file or not to obtain a judgment result; and calling a loading strategy corresponding to the judgment result to load the tree node data.
In the method for loading tree node data provided in the embodiment of the first aspect of the present invention, the judgment result is obtained by judging whether the node identifier is in the preset data loading file, and the loading policy corresponding to the judgment result is called to load the tree node data, so that a policy of full loading and lazy loading mixed loading can be adopted, the loading mode of the tree node data is dynamically determined, and the loading efficiency of the tree node data is effectively improved.
In order to achieve the above object, an embodiment of a second aspect of the present invention provides an apparatus for loading tree node data, including: the first obtaining module is used for obtaining the node identification of the tree node where the tree node data to be loaded is located; the judging module is used for judging whether the node identification is in a preset data loading file or not to obtain a judging result; and the first calling module is used for calling a loading strategy corresponding to the judgment result to load the tree node data.
The loading device for tree node data provided by the embodiment of the second aspect of the invention obtains the judgment result by judging whether the node identifier is in the preset data loading file, calls the loading strategy corresponding to the judgment result to load the tree node data, can dynamically determine the loading mode of the tree node data by adopting the strategy of full loading and lazy loading, and effectively improves the loading efficiency of the tree node data.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a schematic flowchart of a method for loading tree node data according to an embodiment of the present invention;
FIG. 2 is a diagram illustrating menu options based on tree controls in an embodiment of the present invention;
FIG. 3 is a flowchart illustrating a method for loading tree node data according to another embodiment of the present invention;
FIG. 4 is a flowchart illustrating a method for loading tree node data according to another embodiment of the present invention;
FIG. 5 is a flowchart illustrating a method for loading tree node data according to another embodiment of the present invention;
FIG. 6 is a schematic structural diagram of a tree node data loading apparatus according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of a loading apparatus for tree node data according to another embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention. On the contrary, the embodiments of the invention include all changes, modifications and equivalents coming within the spirit and terms of the claims appended hereto.
Fig. 1 is a flowchart illustrating a method for loading tree node data according to an embodiment of the present invention. The loading method of the tree node data is exemplified in the case that the loading device of the tree node data is configured.
Referring to fig. 1, the method for loading tree node data includes:
s11: and acquiring the node identification of the tree node where the tree node data to be loaded is located.
According to the design specification of a Graphical User Interface (GUI), in the process of generating a computer page or system, a standard universal markup language (e.g., HTML) is executed to implement different function modules for a User to perform human-computer interaction with the computer page or system Interface, where a style of one function module is called a tree structure, and it is understood that a style of the tree structure can be used to display a hierarchical structure, further, the tree structure can be implemented by using a tree control in the universal markup language, see fig. 2, a style of the tree structure can be used to generate menu options of the computer page or system Interface, fig. 2 is a schematic diagram of menu options based on the tree control in an embodiment of the present invention, and fig. 2 includes a tree node 21 and a child node 22, where, when the User clicks on the tree node 21, the background server is triggered to load the tree node data corresponding to the tree node, and when the user clicks the child node 22, the background server is triggered to load the child node data corresponding to the child node. In the embodiment of the present invention, the tree node data to be loaded may be tree node data corresponding to a tree node that needs to be loaded by the background server.
For example, in the process of following up a project progress, a user often has a need to view a large amount of data, for example, for real-time follow-up of project research and development, a large amount of summary content related to each process needs to be viewed, referring to fig. 2, when the use frequency of tree node data is high, a full loading strategy can be called to load the tree node data, and when the use frequency of the tree node data is low, a lazy loading strategy can be called to load the tree node data.
In the related art, the tree control calls a full loading strategy to load all tree node data, that is, synchronous loading is adopted, and all tree node data are loaded at one time, or when a user clicks a certain tree node, the tree control can call a lazy loading strategy to load child node data of the tree node.
In the first mode, because all the tree node data are loaded by the full loading strategy, when the quantity of the tree node data is too large, the loading efficiency of the tree node data is low, in the second mode, because the child node data of the tree node is loaded only when a user clicks a certain tree node, when the quantity of the child node data is large, the front end can frequently send data requests to the background server, and the loading efficiency of the tree node data is low.
In the embodiment of the invention, the strategy of full loading and lazy loading mixed loading is adopted to dynamically determine the loading mode of the tree node data, so that the loading efficiency of the tree node data is effectively improved.
Optionally, a node identifier (e.g., a node ID) of a tree node where the tree node data to be loaded is located is obtained, so as to load the tree node data according to whether the node identifier calls a different loading policy in a preset data loading file.
S12: and judging whether the node identification is in the preset data loading file or not to obtain a judgment result.
The preset data loading file may be configured in advance.
Whether the node identifier is in the preset data loading file or not can be judged, and a judgment result that the node identifier is in the preset data loading file or the node identifier is not in the preset data loading file is obtained.
In some embodiments, referring to fig. 3, the preset data load file may be configured by:
s31: and acquiring the tree node generating the preset event as a target tree node.
In an embodiment of the present invention, the target tree node is used to mark a tree node generating a preset event, and the preset event may be, for example, a user clicking on the tree node event.
S32: and acquiring the node identification of the target tree node and the time point of each target tree node for generating the preset event, wherein the time point of each target tree node for generating the preset event is at least one.
Wherein the node identification of the target tree node (e.g., the node ID of the target tree node), the time point at which the target tree node generates the predetermined event, e.g., the time point at which the user clicks the target tree node, it can be understood that, since the user clicks each target tree node possibly multiple times, there will be at least one time point corresponding to each target tree node, e.g., t can be usediRepresents the respective time points, wherein i is 1, 2, 3, … ….
S33: and acquiring the relative access frequency of each target tree node according to the time point of the preset event generated by each target tree node.
In the embodiment of the present invention, the relative access frequency of each target tree node may be obtained according to a time point of each target tree node generating a preset event and a preset formula, where the preset formula is:
wherein i is 1, 2, … …, k-1, node is the node identification of the target tree node, and frequency is the time node t of the target tree nodekAnd (3) time relative access frequency, wherein the node identification of the target tree node is used as the unique identification for acquiring the relative access frequency.
Specifically, the relative access frequency of each target tree node may be obtained according to the preset formula and the time point at which each target tree node generates the preset event, or may also be obtained according to other algorithms and the time point at which each target tree node generates the preset event, which is not limited in this respect.
S34: and configuring a preset data loading file according to the node identification and the relative access frequency of each target tree node.
By pre-configuring the preset data loading file, the node identification and the relative access frequency of each target tree node can be saved by judging whether the node identification is in the preset data loading file, so that whether the node identification of the tree node is in the preset data loading file can be judged subsequently, the node identification query time of the tree node can be shortened, and the loading efficiency of the tree node data is effectively improved.
Optionally, in some embodiments, referring to fig. 4, step S34 specifically includes:
s41: and arranging the relative access frequency of each target tree node in a descending order to obtain a sequence of the relative access frequencies after the ordering.
For example, the relative access frequency value frequency of each target tree node calculated by the first preset formula in step S23 is sorted in descending order from large to small to obtain a sequence of sorted relative access frequencies.
S42: selecting relative access frequencies of the front preset number in the sequence.
In the embodiment of the present invention, the preset number may be set individually by the user according to the user's own needs, for example, the user may set the preset number to 10, which is not limited to this.
For example, the top 10 relative access frequencies in the sequence of the sorted relative access frequencies are selected, so that the selected relative access frequencies and the node identifiers of the corresponding target tree nodes are correspondingly stored in the preset data loading file.
In this step, the flexibility and the applicability of the loading method of the tree node data can be effectively improved by selecting the relative access frequency of the previous preset number in the sequence, wherein the preset number can be set individually by the user according to the requirement of the user.
S43: and correspondingly storing the selected relative access frequency and the node identification of the corresponding target tree node in a preset data loading file.
Optionally, the node identifier of the target tree node corresponding to the selected relative access frequency is correspondingly stored in a preset data loading file, so that the preset data loading file is configured according to the node identifier of each target tree node and the relative access frequency.
In this embodiment, the selected relative access frequency and the node identifier of the corresponding target tree node are correspondingly stored in the preset data loading file to configure the preset data loading file, and the node identifier and the relative access frequency of each target tree node can be stored, so that whether the node identifier of the tree node is in the preset data loading file or not can be judged subsequently, the node identifier query time of the tree node can be shortened, and the loading efficiency of the tree node data is effectively improved.
S13: and calling a loading strategy corresponding to the judgment result to load the tree node data.
Optionally, invoking the loading policy corresponding to the determination result to load the tree node data includes: when the judgment result is that the node identification is in the preset data loading file, calling a full loading strategy to load tree node data; and calling a lazy loading strategy to load tree node data when the judgment result is that the node identifier is not in the preset data loading file.
It can be understood that when the node identification of the tree node is in the preset data loading file, the use frequency of the tree node data is high, at the moment, a full loading strategy can be called to load the tree node data, when the node identification of the tree node is not in the preset data loading file, the use frequency of the tree node data is low, at the moment, a lazy loading strategy can be called to load the tree node data, a strategy of full loading and lazy loading mixed loading is adopted, the loading mode of the tree node data is dynamically determined, the loading efficiency of the tree node data is effectively improved, and the data loading page display efficiency is improved.
As an example, referring to FIG. 2, in the process of following up the progress of the project, the user may view a large amount of summary content related to each process, and for the tree node of the file with higher usage frequency, a full loading policy may be invoked to load the tree node data, and for the tree node of the file with lower usage frequency, a lazy loading policy may be invoked to load the tree node data.
Optionally, in some embodiments, referring to fig. 5, after step 13, the method further includes:
s51: and calling a loading strategy corresponding to the external instruction to load the tree node data.
The external instruction may be set by a user, for example.
In this step, when the external instruction is received, the loading strategy corresponding to the external instruction is directly called to load the tree node data, and the tree node data does not need to be loaded according to the loading strategy corresponding to the judgment result, so that the flexibility and the applicability of the loading method of the tree node data can be effectively improved, and the loading efficiency of the tree node data is improved.
In the embodiment, the judgment result is obtained by judging whether the node identifier is in the preset data loading file, the loading strategy corresponding to the judgment result is called to load the tree node data, the strategy of full loading and lazy loading mixed loading can be adopted, the loading mode of the tree node data is dynamically determined, and the loading efficiency of the tree node data is effectively improved.
Fig. 6 is a schematic structural diagram of a loading apparatus for tree node data according to an embodiment of the present invention. The loading means 600 of the tree node data may be implemented by software, hardware or a combination of both.
Referring to fig. 6, the loading means 600 of the tree node data may include: a first obtaining module 610, a determining module 620, and a first calling module 630. Wherein,
the first obtaining module 610 is configured to obtain a node identifier of a tree node where tree node data to be loaded is located.
The determining module 620 is configured to determine whether the node identifier is in the preset data loading file, so as to obtain a determination result.
The first invoking module 630 is configured to invoke the loading policy loading tree node data corresponding to the determination result.
Optionally, the first calling module 630 is further configured to:
when the judgment result is that the node identification is in the preset data loading file, calling a full loading strategy to load tree node data;
and calling a lazy loading strategy to load tree node data when the judgment result is that the node identifier is not in the preset data loading file.
In some embodiments, referring to fig. 7, the loading device 600 of the tree node data may further include:
the second calling module 640 is configured to call a loading policy corresponding to the external instruction to load the tree node data.
Optionally, the preset data loading file is configured by the following modules:
and a second obtaining module 650, configured to obtain a tree node generating the preset event as a target tree node.
The third obtaining module 660 is configured to obtain the node identifier of the target tree node and a time point at which each target tree node generates the preset event, where at least one time point is generated by each target tree node.
The fourth obtaining module 670, configured to obtain a relative access frequency of each target tree node according to a time point at which each target tree node generates a preset event.
The configuration module 680 is configured to configure a preset data loading file according to the node identifier and the relative access frequency of each target tree node.
Optionally, the configuration module 680 includes:
and the arranging sub-module 681 is configured to arrange the relative access frequencies of each target tree node in a descending order, so as to obtain a sequence of the relative access frequencies after the ordering.
And the selection submodule 682 is used for selecting the relative access frequencies with the preset number in the sequence.
And the storage sub-module 683 is configured to correspondingly store the selected relative access frequency and the node identifier of the corresponding target tree node in a preset data loading file.
It should be noted that the explanation of the embodiment of the loading method for tree node data in the foregoing embodiments of fig. 1 to fig. 5 is also applicable to the loading apparatus 600 for tree node data in this embodiment, and the implementation principle is similar, and is not described herein again.
In the embodiment, the judgment result is obtained by judging whether the node identifier is in the preset data loading file, the loading strategy corresponding to the judgment result is called to load the tree node data, the strategy of full loading and lazy loading mixed loading can be adopted, the loading mode of the tree node data is dynamically determined, and the loading efficiency of the tree node data is effectively improved.
It should be noted that the terms "first," "second," and the like in the description of the present invention are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. In addition, in the description of the present invention, "a plurality" means two or more unless otherwise specified.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and alternate implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.
Claims (10)
1. A method for loading tree node data is characterized by comprising the following steps:
acquiring a node identifier of a tree node where tree node data to be loaded is located;
judging whether the node identification is in a preset data loading file or not to obtain a judgment result;
and calling a loading strategy corresponding to the judgment result to load the tree node data.
2. The method for loading tree node data according to claim 1, wherein said invoking a loading policy corresponding to the determination result to load the tree node data comprises:
when the judgment result is that the node identification is in the preset data loading file, calling a full loading strategy to load the tree node data;
and calling a lazy loading strategy to load the tree node data when the judgment result is that the node identification is not in the preset data loading file.
3. The method for loading tree node data according to claim 1 or 2, wherein the preset data loading file is configured by:
acquiring tree nodes generating preset events as target tree nodes;
acquiring node identification of the target tree nodes and time points of each target tree node for generating preset events, wherein the time point of each target tree node for generating the preset events is at least one;
acquiring the relative access frequency of each target tree node according to the time point of each target tree node generating a preset event;
and configuring a preset data loading file according to the node identification of each target tree node and the relative access frequency.
4. The method for loading tree node data as claimed in claim 3, wherein said configuring a predetermined data loading file according to the node identifier of each target tree node and the relative access frequency comprises:
arranging the relative access frequency of each target tree node in a descending order to obtain a sequence of the relative access frequencies after the ordering;
selecting relative access frequencies with a preset number in the sequence;
and correspondingly storing the selected relative access frequency and the node identification of the corresponding target tree node in the preset data loading file.
5. The method for loading tree node data according to claim 1, wherein after the calling the loading policy corresponding to the determination result to load the tree node data, the method further comprises:
and calling a loading strategy corresponding to an external instruction to load the tree node data.
6. An apparatus for loading tree node data, comprising:
the first obtaining module is used for obtaining the node identification of the tree node where the tree node data to be loaded is located;
the judging module is used for judging whether the node identification is in a preset data loading file or not to obtain a judging result;
and the first calling module is used for calling a loading strategy corresponding to the judgment result to load the tree node data.
7. The apparatus for loading tree node data as recited in claim 6, wherein the first calling module is further configured to:
when the judgment result is that the node identification is in the preset data loading file, calling a full loading strategy to load the tree node data;
and calling a lazy loading strategy to load the tree node data when the judgment result is that the node identification is not in the preset data loading file.
8. The loading apparatus of tree node data as claimed in claim 6 or 7, wherein the preset data loading file is configured by:
the second acquisition module is used for acquiring the tree node generating the preset event as a target tree node;
a third obtaining module, configured to obtain a node identifier of the target tree node and a time point at which each target tree node generates a preset event, where at least one time point is generated by each target tree node;
the fourth acquisition module is used for acquiring the relative access frequency of each target tree node according to the time point of each target tree node generating the preset event;
and the configuration module is used for configuring a preset data loading file according to the node identification of each target tree node and the relative access frequency.
9. The loading apparatus of tree node data as claimed in claim 8, wherein said configuration module comprises:
the arrangement submodule is used for arranging the relative access frequency of each target tree node in a descending order to obtain a sequence of the relative access frequencies after the ordering;
the selection submodule is used for selecting the relative access frequencies with the preset number in the sequence;
and the storage submodule is used for correspondingly storing the selected relative access frequency and the node identification of the corresponding target tree node in the preset data loading file.
10. The apparatus for loading tree node data according to claim 6, further comprising:
and the second calling module is used for calling a loading strategy corresponding to the external instruction to load the tree node data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610784853.8A CN106341469B (en) | 2016-08-31 | 2016-08-31 | Loading method and device of tree node data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610784853.8A CN106341469B (en) | 2016-08-31 | 2016-08-31 | Loading method and device of tree node data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106341469A true CN106341469A (en) | 2017-01-18 |
| CN106341469B CN106341469B (en) | 2020-03-17 |
Family
ID=57823505
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610784853.8A Active CN106341469B (en) | 2016-08-31 | 2016-08-31 | Loading method and device of tree node data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106341469B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106503026A (en) * | 2015-09-08 | 2017-03-15 | 华为技术有限公司 | A kind of method and apparatus of video data |
| CN107122435A (en) * | 2017-04-19 | 2017-09-01 | 北京奇艺世纪科技有限公司 | The control method and device of non-relational database |
| CN109739495A (en) * | 2018-12-27 | 2019-05-10 | 山东中创软件工程股份有限公司 | A kind of method, apparatus, equipment and storage medium constructing tree construction |
| CN112612845A (en) * | 2020-12-22 | 2021-04-06 | 中国建设银行股份有限公司 | Method and device for realizing organization mechanism view, electronic equipment and readable storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101446973A (en) * | 2008-12-19 | 2009-06-03 | 北京数码大方科技有限公司 | Tree view node loading display method for information management system |
| CN101552694A (en) * | 2009-05-12 | 2009-10-07 | 成都市华为赛门铁克科技有限公司 | Network topology loading method, device and network management system |
| CN101639845A (en) * | 2009-08-12 | 2010-02-03 | 东软集团股份有限公司 | Tree-node displaying method and device |
| CN102346770A (en) * | 2011-09-21 | 2012-02-08 | 晨星软件研发(深圳)有限公司 | WebKit browser webpage content loading method and device |
| CN102999608A (en) * | 2012-11-21 | 2013-03-27 | 用友软件股份有限公司 | System and method for tree table demonstration of large data |
| CN103020092A (en) * | 2011-09-28 | 2013-04-03 | 深圳市金蝶中间件有限公司 | Method and system for positioning node in lazy loading tree |
| CN103606074A (en) * | 2013-11-07 | 2014-02-26 | 北京奇虎科技有限公司 | Mail content loading method and apparatus, and browser |
| CN103957119A (en) * | 2014-04-21 | 2014-07-30 | 南京信息职业技术学院 | Method for managing network equipment by using MIB file and browser |
-
2016
- 2016-08-31 CN CN201610784853.8A patent/CN106341469B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101446973A (en) * | 2008-12-19 | 2009-06-03 | 北京数码大方科技有限公司 | Tree view node loading display method for information management system |
| CN101552694A (en) * | 2009-05-12 | 2009-10-07 | 成都市华为赛门铁克科技有限公司 | Network topology loading method, device and network management system |
| CN101639845A (en) * | 2009-08-12 | 2010-02-03 | 东软集团股份有限公司 | Tree-node displaying method and device |
| CN102346770A (en) * | 2011-09-21 | 2012-02-08 | 晨星软件研发(深圳)有限公司 | WebKit browser webpage content loading method and device |
| CN103020092A (en) * | 2011-09-28 | 2013-04-03 | 深圳市金蝶中间件有限公司 | Method and system for positioning node in lazy loading tree |
| CN102999608A (en) * | 2012-11-21 | 2013-03-27 | 用友软件股份有限公司 | System and method for tree table demonstration of large data |
| CN103606074A (en) * | 2013-11-07 | 2014-02-26 | 北京奇虎科技有限公司 | Mail content loading method and apparatus, and browser |
| CN103957119A (en) * | 2014-04-21 | 2014-07-30 | 南京信息职业技术学院 | Method for managing network equipment by using MIB file and browser |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106503026A (en) * | 2015-09-08 | 2017-03-15 | 华为技术有限公司 | A kind of method and apparatus of video data |
| CN107122435A (en) * | 2017-04-19 | 2017-09-01 | 北京奇艺世纪科技有限公司 | The control method and device of non-relational database |
| CN107122435B (en) * | 2017-04-19 | 2021-02-12 | 北京奇艺世纪科技有限公司 | Control method and device of non-relational database |
| CN109739495A (en) * | 2018-12-27 | 2019-05-10 | 山东中创软件工程股份有限公司 | A kind of method, apparatus, equipment and storage medium constructing tree construction |
| CN112612845A (en) * | 2020-12-22 | 2021-04-06 | 中国建设银行股份有限公司 | Method and device for realizing organization mechanism view, electronic equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106341469B (en) | 2020-03-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11586697B2 (en) | Publishing rest API changes based on subscriber's customized request | |
| RU2737881C1 (en) | Method for managing application program and corresponding device | |
| CN109445869B (en) | Cross-cloud-adaptive micro-service management method and device and storage medium | |
| CN106341469B (en) | Loading method and device of tree node data | |
| AU2018310287A1 (en) | Smart contract processing method and apparatus | |
| US10304222B2 (en) | System and method for graphically displaying recommended mappings in an integration cloud service design time | |
| US20110154226A1 (en) | Chip model of an extensible plug-in architecture for enterprise mashups | |
| CN105630686A (en) | Traversal testing method and device for applications and mobile terminal | |
| KR20170048441A (en) | Method and apparatus for managing background application | |
| US8132188B2 (en) | Method and system for extension registry filtering | |
| US10142188B2 (en) | System and method for providing guiding messages in creating an integration flow in a cloud-based integration platform | |
| CN107957837B (en) | Method and device for generating shortcut of webpage application program and terminal equipment | |
| CN108804399B (en) | Form verification method and device | |
| US11546413B2 (en) | System and method for identifying capabilities and limitations of an orchestration based application integration | |
| US20210092073A1 (en) | Resource trees by management controller | |
| CN108279882B (en) | Framework generation method, device, equipment and computer readable medium | |
| CN112306471A (en) | Task scheduling method and device | |
| CN111338614A (en) | Application program interface development method, device, equipment and storage medium | |
| CN111294377A (en) | Network request sending method of dependency relationship, terminal device and storage medium | |
| US11720419B2 (en) | System and method for providing a declarative non code self-learning advisory framework for orchestration based application integration | |
| US10372773B2 (en) | System and method for providing recommended mappings for use by a mapper in an integration cloud service design time | |
| RU2716742C1 (en) | Method and apparatus for administering object of administered function | |
| CN109218259B (en) | License management method and device, APPLM functional entity and computer readable storage medium | |
| CN108809763B (en) | Network performance parameter acquisition method, terminal device and storage medium | |
| CN115858007A (en) | Loading method and device of extension assembly, storage medium and electronic device |
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 |