CN105512338A - Method and device for realizing navigation tree with large data volume nodes on web front end - Google Patents
Method and device for realizing navigation tree with large data volume nodes on web front end Download PDFInfo
- Publication number
- CN105512338A CN105512338A CN201511021623.8A CN201511021623A CN105512338A CN 105512338 A CN105512338 A CN 105512338A CN 201511021623 A CN201511021623 A CN 201511021623A CN 105512338 A CN105512338 A CN 105512338A
- Authority
- CN
- China
- Prior art keywords
- node
- next stage
- web front
- end equipment
- nodal information
- 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/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Transfer Between Computers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Navigation (AREA)
Abstract
The invention provides a method for realizing a navigation tree with large data volume nodes and a device for realizing the navigation tree with the large data volume nodes. The technical scheme is as follows: web front-end equipment receives a node expansion request of a user; the next-level node information of a node is read from the web front-end equipment if the web front-end equipment stores the next-level node information of the node; the next-level node information of the node is required from a background server, and the required next-level node information of the node is stored in the web front-end equipment if the web front-end equipment does not store the next-level node information of the node; a next-level node of the node is expanded on the basis of the next-level node information of the node. According to the method and the device provided by the invention, the situation that a web front end loses responses even breaks down due to overlong time of constructing the navigation tree can be avoided.
Description
Technical field
The application relates to communication technical field, and particularly a kind of big data quantity node navigation tree is at the implementation method of web front-end and device.
Background technology
Along with the development of Web technology, increasing software systems all have employed B/S (Browser/Server Mode) structure.But due to the process bottleneck of web front end, when web front-end needs the navigation tree that there is big data quantity node (equipment, port object (po), service-user etc.), there will be the situation because structure overlong time makes web front-end lose response even to collapse.
Summary of the invention
In view of this, the object of the present invention is to provide a kind of big data quantity node navigation tree at the implementation method of web front-end and device, the situation can avoided making web front-end lose response because structure navigation tree overlong time and even collapse.
For achieving the above object, technical scheme provided by the invention is:
An implementation method for big data quantity node navigation tree, is applied to web front-end equipment, comprises:
The node receiving user launches request;
If store the next stage nodal information of this node in web front-end equipment, then from web front-end equipment, read the next stage nodal information of this node; If there is not the next stage nodal information of this node in web front-end equipment, then to this node of background server request next stage nodal information and be stored in web front-end equipment;
Based on the next stage nodal information of this node, launch the next stage node of this node.
The implementation method of another kind of big data quantity node navigation tree, is applied to background server, comprises:
Receive the next stage nodal information request of web front-end equipment for a node;
Inquire about the next stage nodal information of this node in a database;
The next stage nodal information of this node inquired in a database is returned to web front-end equipment.
An implement device for big data quantity node navigation tree, is applied to web front-end equipment, and this device comprises: receiving element, processing unit, output unit;
Described receiving element, launches request for the node receiving user;
Described processing unit, after receiving the node expansion request of user, if store the next stage nodal information of this node in web front-end equipment, then reads the next stage nodal information of this node for receiving element from web front-end equipment; If there is not the next stage nodal information of this node in web front-end equipment, then to this node of background server request next stage nodal information and be stored in web front-end equipment;
Described output unit, for the next stage nodal information based on this node, launches the next stage node of this node.
The implement device of another kind of big data quantity node navigation tree, be applied to background server, this device comprises: receiving element, query unit, transmitting element;
Described receiving element, for receiving the next stage nodal information request of web front-end equipment for a node;
Described query unit, receives web front-end equipment for after the next stage nodal information request of a node for receiving element, inquires about the next stage nodal information of this node in a database;
Described transmitting element, the next stage nodal information for this node query unit inquired in a database returns to web front-end equipment.
In sum, in the present invention, when web front-end equipment receives the node expansion request of user, if this locality does not store the next stage nodal information of this node, then only to the next stage nodal information of this node of background server request, relative to the nodal information of asking in prior art in whole navigation tree and carry out complete navigation tree draw, less and the web front-end equipment of volume of transmitted data between web front-end equipment and background server only need draw the next stage node of this node in navigation tree, in this process, volume of transmitted data and navigation tree drawing greatly reduce, thus the situation making web front-end lose response even to collapse because structure navigation tree overlong time can effectively be avoided.
Accompanying drawing explanation
Fig. 1 be embodiment of the present invention big data quantity node navigation tree realize schematic diagram;
Node when Fig. 2 is the next stage node of the embodiment of the present invention using dummy node as node launches schematic diagram;
Fig. 3 is the implementation method process flow diagram of the embodiment of the present invention one big data quantity node navigation tree;
Fig. 4 is the implementation method process flow diagram of the embodiment of the present invention two big data quantity node navigation tree;
Fig. 5 is the structural representation of the implement device of the embodiment of the present invention one big data quantity node navigation tree;
Fig. 6 is the structural representation of the implement device of the embodiment of the present invention two big data quantity node navigation tree.
Embodiment
For making object of the present invention, technical scheme and advantage clearly understand, to develop simultaneously embodiment referring to accompanying drawing, scheme of the present invention is described in further detail.
See Fig. 1, Fig. 1 be embodiment of the present invention big data quantity node navigation tree realize schematic diagram, as shown in Figure 1, mainly comprise the following steps:
The node that step 101, web front-end equipment receive user launches request.
When user clicks the icon of representation node in navigation tree, the node that can trigger for this node launches request, and this node launches request will by web front-end device responds.
Step 102, judge the next stage nodal information whether storing this node in web front-end equipment, if so, then go to step 106, if not, then perform step 103.
Next stage nodal information comprises the information such as next stage node identification.
When storing the next stage nodal information of this node in web front end equipment, do not need to go background server to obtain the next stage nodal information of this node again, therefore step 103 is performed, when not storing the next stage nodal information of this node in web front end equipment, need background server to obtain the next stage nodal information of this node, therefore perform step 104.
Step 103, web front-end equipment are to the next stage nodal information of this node of background server request.
Under normal circumstances, when user asks to launch a certain node first, in web front-end equipment, there is not the next stage nodal information of this node.
Under B/S pattern, data message is generally stored in background server, all related datas of such as big data quantity node navigation tree, comprises all nodal informations in navigation tree and next stage nodal information etc. corresponding to each node.In the present embodiment, when there is not the next stage nodal information of this node in web front-end equipment, can to the next stage nodal information of this node of background server acquisition request.
Step 104, background server receive the next stage nodal information request of web front-end equipment for this node, inquire about the next stage nodal information of this node in a database, the next stage nodal information of this node inquired in a database is returned to web front-end equipment.
All related datas of big data quantity node navigation tree generally store in a database, when background server receives the next stage nodal information request of front end for a certain node, the all next stage nodal informations searching this node in database can be removed, then Query Result is returned to web front-end equipment.
In actual applications, if the next stage node number of a node is more, then background server inquires the next stage nodal information of this node and these next stage nodal informations is transferred to web front-end equipment, and the process launching this node accordingly by web front-end equipment can take a long time, this also may cause web front-end to lose response even collapsing, in order to address this problem, in the present embodiment, also proposed the concept of constructing virtual node.
After background server inquires all next stage nodal informations of a node, if find that the next stage node number of this node is more, exceed predetermined threshold value (such as 5000), then can by all next stage nodes graduation of this node to (such as N number of set in multiple set, the value of N should be greater than 1 and be less than predetermined threshold value), then for each set generation dummy node, the N number of virtual node information generated the most at last returns to web front-end equipment as the next stage nodal information of this node, next stage nodal information in each set is kept in background server as the next stage nodal information of the dummy node generated for this set simultaneously, like this, user launches by request the next stage nodal information that dummy node obtains one group of this node corresponding to this dummy node.
Be described with a concrete example below, suppose that some nodes X have 10000 next stage nodes, predetermined threshold value is the value of 5000, N is 10, then when user asks expanding node X first, the processing procedure of web front-end equipment and background server is as follows:
1) the next stage nodal information of the local non-memory node X of web front-end device discovery, therefore to the next stage nodal information of background server requesting node X.
2) background server Query Database determination nodes X has 10000 next stage nodes, exceed predetermined threshold value 5000, therefore by the graduation of 10000 next stage nodes in 10 (N value) individual set, these 10 set are respectively: [1 ... 1000], [1001 ... 2000] ..., [9001 ... 10000].Background server generates corresponding dummy node respectively for these 10 set: V1, V2 ..., V10, then by generate dummy node V1, V2 ..., V10 returns to web front-end equipment as the next stage node of nodes X, simultaneously, by [1 ... 1000] each next stage node in is kept in background server as the next stage node of dummy node V1, by [1001 ... 2000] each next stage node in is kept in background server as the next stage node of dummy node V2, by that analogy.
3) web front-end equipment receives the dummy node that background server returns: V1, V2 ..., after V10, the result of expanding node X as shown in Figure 2.
Afterwards, user can continue request launch dummy node: V1, V2 ..., any one in V10, such as V2, then background server will by set [1001 ... 2000] 1000 nodal informations in return to web front-end equipment as the next stage nodal information of dummy node V2.
Here, it should be noted that, when user asks to launch dummy node, if the next stage node number of dummy node exceedes predetermined threshold value, then also need according to above-mentioned 3 steps, by the next stage node graduation of this dummy node to N number of set, for each set generation dummy node, the N number of virtual node information generated is returned to web front-end equipment as the next stage nodal information of this dummy node, the next stage nodal information of the nodal information in each set as the dummy node generated for this set is kept in background server simultaneously.
Step 105, web front-end equipment receive the next stage nodal information of this node that background server returns and store, and go to step 107.
Web front-end equipment is after the next stage nodal information of background server requesting node, the next stage nodal information of this node can be stored into this locality, so that when user asks to launch this node again, directly read from this locality this node next stage nodal information and perform this node expansion operation.
Step 106, from web front-end equipment, read the next stage nodal information of this node.
When storing the next stage nodal information of this node in web front end equipment, the next stage nodal information directly reading this node from this locality, to perform the expansion operation of this node, can reduce the communication between web front-end equipment and background server like this.
When user asks to launch a certain node first, next stage nodal information from web front-end equipment to this node of background server acquisition request and store, therefore, when non-this node of expansion of request first of user, the next stage nodal information of this node is directly read from this locality.
Step 107, next stage nodal information based on this node, launch the next stage node of this node.
Namely the next stage node of expanding node, also draw the next stage node of this node in navigation tree.
In the embodiment of the present invention shown in Fig. 1, when the node receiving user launches request, when there is not the next stage nodal information of this node in web front-end equipment, just to the next stage nodal information of this node of background server request, disposablely relative to web front-end equipment in prior art obtain all nodal informations navigation tree from background server, transmitted data amount is considerably less, thus effectively can avoid causing web front-end to lose response because loading mass data and even collapse.And, web front-end equipment is also preserved after background server obtains the next stage nodal information of node, after this when user asks to launch this node again, web front-end equipment does not need to background server request, but the next stage nodal information of this node is directly read from this locality, the communication between web front-end equipment and background server can also be reduced.
In actual applications, when whether a certain node in the uncertain navigation tree of client has hung down the next stage node of its concern, generally can launch each node one by one to check, virtually both waste the operating cost that the time too increases front end.In order to the information allowing client understand its lower next stage node hung under the prerequisite of not expanding node, can ask to carry out pre-deployment to node.
Particularly, can in advance for Node configuration pre-deployment button, the trigger node pre-deployment request when user clicks the pre-deployment button of node, after web front-end equipment receives node pre-deployment request, can to the next stage node identification (such as display Name) of this node of background server acquisition request, thus web front-end equipment can export by the assembled character string of the next stage node identification of this node with the form of tip in front end.
Because pre-deployment operates the mark and the drafting not relating to the next stage node of node only delivering node, therefore to be much better than node and launch operation in efficiency.
Above schematic illustration is carried out to the realization of big data quantity node navigation tree of the present invention, based on above-mentioned principle, the invention provides and be a kind ofly applied to the implementation method of the big data quantity node navigation tree of web front-end equipment and a kind of implementation method being applied to the big data quantity node navigation tree of background server, be described below in conjunction with Fig. 3, Fig. 4:
See the implementation method process flow diagram that Fig. 3, Fig. 3 are the embodiment of the present invention one big data quantity node navigation trees, be applied to web front-end equipment, as shown in Figure 3, the method comprises the following steps:
The node of step 301, reception user launches request.
If store the next stage nodal information of this node in step 302 web front-end equipment, then from web front-end equipment, read the next stage nodal information of this node; If there is not the next stage nodal information of this node in web front-end equipment, then to this node of background server request next stage nodal information and be stored in web front-end equipment.
Step 303, next stage nodal information based on this node, launch the next stage node of this node.
Shown in Fig. 3, method comprises further:
Receive the node pre-deployment request of user;
To the next stage node identification of this node of background server request;
Export by the assembled character string of the next stage node identification of this node.
See the implementation method process flow diagram that Fig. 4, Fig. 4 are the embodiment of the present invention two big data quantity node navigation trees, be applied to background server, as shown in Figure 4, the method comprises:
Step 401, reception web front-end equipment are for the next stage nodal information request of a node.
Step 402, inquire about the next stage nodal information of this node in a database.
Step 403, the next stage nodal information of this node inquired in a database is returned to web front-end equipment.
In method shown in Fig. 4,
After inquiring about the next stage nodal information of this node in a database, before the next stage nodal information of this node inquired in a database is returned to web front-end equipment, comprise further: if the next stage number of nodes of this node does not exceed predetermined threshold value; If the next stage number of nodes of this node exceedes predetermined threshold value, then by the next stage node graduation of this node to N number of set, for each set generation dummy node, N number of virtual node information is returned to web front-end equipment as the next stage nodal information of this node, the next stage nodal information of the nodal information in each set as the dummy node generated for this set is kept in background server simultaneously.
Shown in Fig. 4, method also comprises further:
Receive the next stage node identification request of web front-end equipment for a node;
Inquire about the next stage node identification of this node in a database;
The next stage node identification of this node inquired in a database is returned to web front-end equipment.
Present invention also offers and be a kind ofly applied to the implement device of the big data quantity node navigation tree of web front-end equipment and a kind of implement device being applied to the big data quantity node navigation tree of background server, be described below in conjunction with Fig. 5, Fig. 6:
Be the structural representation of the implement device of the embodiment of the present invention one big data quantity node navigation tree see Fig. 5, Fig. 5, be applied to web front-end equipment, as shown in Figure 5, this device comprises: receiving element, processing unit, output unit; Wherein,
Receiving element, launches request for the node receiving user;
Processing unit, after receiving the node expansion request of user, if store the next stage nodal information of this node in web front-end equipment, then reads the next stage nodal information of this node for receiving element from web front-end equipment; If there is not the next stage nodal information of this node in web front-end equipment, then to this node of background server request next stage nodal information and be stored in web front-end equipment;
Output unit, for the next stage nodal information based on this node, launches the next stage node of this node.
In Fig. 5 shown device,
Described receiving element, receives the node pre-deployment request of user further;
Described processing unit, is further used for after receiving element receives the node pre-deployment request of user, to the next stage node identification of this node of background server request;
Described output unit, for exporting by the assembled character string of the next stage node identification of this node.
Be the structural representation of the implement device of the embodiment of the present invention two big data quantity node navigation tree see Fig. 6, Fig. 6, be applied to background server, as shown in Figure 6, this device comprises: receiving element, query unit, transmitting element; Wherein,
Receiving element, for receiving the next stage nodal information request of web front-end equipment for a node;
Query unit, receives web front-end equipment for after the next stage nodal information request of a node for receiving element, inquires about the next stage nodal information of this node in a database;
Transmitting element, the next stage nodal information for this node query unit inquired in a database returns to web front-end equipment.
Fig. 6 shown device also comprises processing unit;
Described processing unit, after query unit inquires the next stage nodal information of this node in a database, before the next stage nodal information of this node that query unit inquires by transmitting element in a database returns to web front-end equipment, for: if the next stage number of nodes of this node does not exceed predetermined threshold value; If the next stage number of nodes of this node exceedes predetermined threshold value, then by the next stage node graduation of this node to N number of set, for each set generation dummy node, N number of virtual node information is returned to web front-end equipment as the next stage nodal information of this node, the next stage nodal information of the next stage nodal information in each set as the dummy node generated for this set is kept in background server simultaneously.
In Fig. 6 shown device,
Described receiving element, is further used for receiving the next stage node identification request of web front-end equipment for a node;
Described query unit, is further used for receiving element and receives web front-end equipment for after the next stage node identification request of a node, inquire about the next stage node identification of this node in a database;
Described output unit, the next stage node identification being further used for this node query unit inquired in a database returns to web front-end equipment.
The above, be only preferred embodiment of the present invention, be not intended to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. an implementation method for big data quantity node navigation tree, be applied to web front-end equipment, it is characterized in that, the method comprises:
The node receiving user launches request;
If store the next stage nodal information of this node in web front-end equipment, then from web front-end equipment, read the next stage nodal information of this node; If there is not the next stage nodal information of this node in web front-end equipment, then to this node of background server request next stage nodal information and be stored in web front-end equipment;
Based on the next stage nodal information of this node, launch the next stage node of this node.
2. method according to claim 1, is characterized in that, the method comprises further:
Receive the node pre-deployment request of user;
To the next stage node identification of this node of background server request;
Export by the assembled character string of the next stage node identification of this node.
3. an implementation method for big data quantity node navigation tree, is applied to background server, it is characterized in that, the method comprises:
Receive the next stage nodal information request of web front-end equipment for a node;
Inquire about the next stage nodal information of this node in a database;
The next stage nodal information of this node inquired in a database is returned to web front-end equipment.
4. method according to claim 3, is characterized in that,
After inquiring about the next stage nodal information of this node in a database, before the next stage nodal information of this node inquired in a database is returned to web front-end equipment, comprise further: if the next stage number of nodes of this node does not exceed predetermined threshold value; If the next stage number of nodes of this node exceedes predetermined threshold value, then by the next stage node graduation of this node to N number of set, for each set generation dummy node, N number of virtual node information is returned to web front-end equipment as the next stage nodal information of this node, the next stage nodal information of the nodal information in each set as the dummy node generated for this set is kept in background server simultaneously.
5. method according to claim 3, is characterized in that, the method also comprises:
Receive the next stage node identification request of web front-end equipment for a node;
Inquire about the next stage node identification of this node in a database;
The next stage node identification of this node inquired in a database is returned to web front-end equipment.
6. an implement device for big data quantity node navigation tree, is applied to web front-end equipment, it is characterized in that, this device comprises: receiving element, processing unit, output unit;
Described receiving element, launches request for the node receiving user;
Described processing unit, after receiving the node expansion request of user, if store the next stage nodal information of this node in web front-end equipment, then reads the next stage nodal information of this node for receiving element from web front-end equipment; If there is not the next stage nodal information of this node in web front-end equipment, then to this node of background server request next stage nodal information and be stored in web front-end equipment;
Described output unit, for the next stage nodal information based on this node, launches the next stage node of this node.
7. device according to claim 6, is characterized in that,
Described receiving element, receives the node pre-deployment request of user further;
Described processing unit, is further used for after receiving element receives the node pre-deployment request of user, to the next stage node identification of this node of background server request;
Described output unit, for exporting by the assembled character string of the next stage node identification of this node.
8. an implement device for big data quantity node navigation tree, is applied to background server, it is characterized in that, this device comprises: receiving element, query unit, transmitting element;
Described receiving element, for receiving the next stage nodal information request of web front-end equipment for a node;
Described query unit, receives web front-end equipment for after the next stage nodal information request of a node for receiving element, inquires about the next stage nodal information of this node in a database;
Described transmitting element, the next stage nodal information for this node query unit inquired in a database returns to web front-end equipment.
9. device according to claim 8, is characterized in that, this device also comprises processing unit;
Described processing unit, after query unit inquires the next stage nodal information of this node in a database, before the next stage nodal information of this node that query unit inquires by transmitting element in a database returns to web front-end equipment, for: if the next stage number of nodes of this node does not exceed predetermined threshold value; If the next stage number of nodes of this node exceedes predetermined threshold value, then by the next stage node graduation of this node to N number of set, for each set generation dummy node, N number of virtual node information is returned to web front-end equipment as the next stage nodal information of this node, the next stage nodal information of the next stage nodal information in each set as the dummy node generated for this set is kept in background server simultaneously.
10. device according to claim 8, is characterized in that,
Described receiving element, is further used for receiving the next stage node identification request of web front-end equipment for a node;
Described query unit, is further used for receiving element and receives web front-end equipment for after the next stage node identification request of a node, inquire about the next stage node identification of this node in a database;
Described output unit, the next stage node identification being further used for this node query unit inquired in a database returns to web front-end equipment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511021623.8A CN105512338B (en) | 2015-12-31 | 2015-12-31 | The implementation method and device of a kind of big data quantity node navigation tree in web front-end |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201511021623.8A CN105512338B (en) | 2015-12-31 | 2015-12-31 | The implementation method and device of a kind of big data quantity node navigation tree in web front-end |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105512338A true CN105512338A (en) | 2016-04-20 |
| CN105512338B CN105512338B (en) | 2019-01-25 |
Family
ID=55720318
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201511021623.8A Active CN105512338B (en) | 2015-12-31 | 2015-12-31 | The implementation method and device of a kind of big data quantity node navigation tree in web front-end |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105512338B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107545525A (en) * | 2016-06-28 | 2018-01-05 | 廖文豪 | Chinese image and word learning system and its information processing method |
| CN113138826A (en) * | 2021-04-28 | 2021-07-20 | 深圳软牛科技有限公司 | Data loading method based on tree structure and related equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060074984A1 (en) * | 2004-09-27 | 2006-04-06 | Scott Milener | Graphical tree depicting search or browsing history |
| CN101408877A (en) * | 2007-10-10 | 2009-04-15 | 英业达股份有限公司 | System and method for loading tree node |
| CN102999608A (en) * | 2012-11-21 | 2013-03-27 | 用友软件股份有限公司 | System and method for tree table demonstration of large data |
| CN103955533A (en) * | 2014-05-13 | 2014-07-30 | 中国工商银行股份有限公司 | Device and method for acquiring page tree data based on buffering queue |
-
2015
- 2015-12-31 CN CN201511021623.8A patent/CN105512338B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060074984A1 (en) * | 2004-09-27 | 2006-04-06 | Scott Milener | Graphical tree depicting search or browsing history |
| CN101408877A (en) * | 2007-10-10 | 2009-04-15 | 英业达股份有限公司 | System and method for loading tree node |
| CN102999608A (en) * | 2012-11-21 | 2013-03-27 | 用友软件股份有限公司 | System and method for tree table demonstration of large data |
| CN103955533A (en) * | 2014-05-13 | 2014-07-30 | 中国工商银行股份有限公司 | Device and method for acquiring page tree data based on buffering queue |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107545525A (en) * | 2016-06-28 | 2018-01-05 | 廖文豪 | Chinese image and word learning system and its information processing method |
| CN113138826A (en) * | 2021-04-28 | 2021-07-20 | 深圳软牛科技有限公司 | Data loading method based on tree structure and related equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105512338B (en) | 2019-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109408699B (en) | Method for realizing rapid retrieval of tree nodes by synchronous cache zTree | |
| CN103379217B (en) | The method of input content auto-complete, device and server in a kind of handheld device | |
| CN104423982B (en) | The processing method and processing equipment of request | |
| US20100067113A1 (en) | Apparatus and Method for Displaying Hierarchical Data | |
| CN106790131B (en) | Parameter modification method and device and distributed platform | |
| CN105141672A (en) | Method, device and system for data storage | |
| CN108037967A (en) | A kind of menu loading method and electronic equipment based on more parent-child structures | |
| CN110704376A (en) | Log file saving method and device | |
| CN103955533A (en) | Device and method for acquiring page tree data based on buffering queue | |
| CN105512338A (en) | Method and device for realizing navigation tree with large data volume nodes on web front end | |
| CN107273112B (en) | Method and device for displaying gift list information | |
| CN111046106A (en) | Cache data synchronization method, device, equipment and medium | |
| CN113014510A (en) | Data caching method and device in distributed test of inertial navigation system | |
| CN102542019A (en) | Identification code storage method and identification code storage system as well as identification code indexing method and identification code indexing system | |
| CN108173948A (en) | A kind of Distributed Experiment data real-time exchange method | |
| CN103186405A (en) | Method and device for implementing unified control of equipment | |
| CN101419618B (en) | In-text information displaying method and apparatus | |
| CN106254092A (en) | A kind of method for early warning, Apparatus and system | |
| CN101741621B (en) | Method, system and device for generating resource name | |
| CN109684351A (en) | A kind of executive plan inspection method, device, server and storage medium | |
| CN103220327B (en) | user information storage method and device | |
| CN105162842A (en) | Display method and device for application in application wall | |
| CN113986828A (en) | Method and device for storing mass files, electronic equipment and storage medium | |
| CN113127490A (en) | Key name generation method and device and computer readable storage medium | |
| WO2013082787A1 (en) | Method, device, and system for deleting data in distributed storage system |
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 |