CN105512338B - The implementation method and device of a kind of big data quantity node navigation tree in web front-end - Google Patents
The implementation method and device of a kind of big data quantity node navigation tree in web front-end Download PDFInfo
- Publication number
- CN105512338B CN105512338B CN201511021623.8A CN201511021623A CN105512338B CN 105512338 B CN105512338 B CN 105512338B CN 201511021623 A CN201511021623 A CN 201511021623A CN 105512338 B CN105512338 B CN 105512338B
- Authority
- CN
- China
- Prior art keywords
- node
- next stage
- end equipment
- web front
- 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.)
- 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/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 present invention provides the implementation method and device of a kind of big data quantity node navigation tree, technical solutions are as follows: request is unfolded in the node that web front-end equipment receives user；If being stored with the next stage nodal information of the node in web front-end equipment, the next stage nodal information of the node is read from web front-end equipment；If the next stage nodal information of the node is not present in web front-end equipment, the next stage nodal information of the node is requested to background server and is stored in web front-end equipment；The next stage node of the node is unfolded in next stage nodal information based on the node.The present invention can be avoided makes web front-end lose the case where response is even collapsed because constructing navigation tree overlong time.
Description
Technical field
This application involves field of communication technology, in particular to realization of a kind of big data quantity node navigation tree in web front-end
Method and apparatus.
Background technique
With the development of Web technology, more and more software systems all use B/S (Browser/Server Mode) knot
Structure.But due to the processing bottleneck of web front end, there is big data quantity node (equipment, port object (po), industry when web front-end needs to construct
Be engaged in user etc.) navigation tree when, it may appear that so that web front-end is lost the case where response is even collapsed because build time is too long.
Summary of the invention
In view of this, the purpose of the present invention is to provide a kind of big data quantity node navigation trees in the realization side of web front-end
Method and device, can be avoided makes web front-end lose the case where response is even collapsed because constructing navigation tree overlong time.
To achieve the above object, technical solution provided by the invention are as follows:
A kind of implementation method of big data quantity node navigation tree is applied to web front-end equipment, comprising:
Request is unfolded in the node for receiving user；
If being stored with the next stage nodal information of the node in web front-end equipment, reading from web front-end equipment should
The next stage nodal information of node；If the next stage nodal information of the node is not present in web front-end equipment, taken to backstage
Business device is requested the next stage nodal information of the node and is stored in web front-end equipment；
The next stage node of the node is unfolded in next stage nodal information based on the node.
The implementation method of another big data quantity node navigation tree is applied to background server, comprising:
The next stage nodal information that web front-end equipment is received for a node is requested；
The next stage nodal information of the node is inquired in the database；
The next stage nodal information of the node inquired in the database is returned into web front-end equipment.
A kind of realization device of big data quantity node navigation tree, is applied to web front-end equipment, which includes: to receive list
Member, processing unit, output unit；
Request is unfolded in the receiving unit, the node for receiving user；
The processing unit, after the node expansion request that user is received for receiving unit, if in web front-end equipment
It is stored with the next stage nodal information of the node, then reads the next stage nodal information of the node from web front-end equipment；If
The next stage nodal information of the node is not present in web front-end equipment, then requests the next stage section of the node to background server
Point information is simultaneously stored in web front-end equipment；
The next stage node of the node is unfolded for the next stage nodal information based on the node in the output unit.
The realization device of another big data quantity node navigation tree, is applied to background server, which includes: to receive list
Member, query unit, transmission unit；
The receiving unit is requested for receiving web front-end equipment for the next stage nodal information of a node；
The query unit receives the next stage nodal information that web front-end equipment is directed to a node for receiving unit
After request, the next stage nodal information of the node is inquired in the database；
The next stage nodal information of the transmission unit, the node for inquiring query unit in the database returns
Back to web front-end equipment.
In conclusion in the present invention, when web front-end equipment receives the node expansion request of user, if local do not deposit
The next stage nodal information of the node is stored up, then only requests the next stage nodal information of the node to background server, relative to existing
Have and requests the nodal information in entire navigation tree in technology and carry out for the drafting of complete navigation tree, web front-end equipment and backstage
Volume of transmitted data between server is less and web front-end equipment need to only draw the next stage node of the node in navigation tree,
Volume of transmitted data and navigation tree are drawn work and are greatly reduced during this, it is thus possible to effectively avoid because constructing navigation tree time mistake
It grows and web front-end is made to lose the case where response is even collapsed.
Detailed description of the invention
Fig. 1 is the realization principle figure of big data quantity node navigation tree of the embodiment of the present invention；
Node expanded schematic diagram when Fig. 2 is next stage node of the embodiment of the present invention using dummy node as node；
Fig. 3 is the implementation method flow chart of one big data quantity node navigation tree of the embodiment of the present invention；
Fig. 4 is the implementation method flow chart of two big data quantity node navigation tree of the embodiment of the present invention；
Fig. 5 is the structural schematic diagram of the realization device of one big data quantity node navigation tree of the embodiment of the present invention；
Fig. 6 is the structural schematic diagram of the realization device of two big data quantity node navigation tree of the embodiment of the present invention.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention more comprehensible, right hereinafter, referring to the drawings and the embodiments,
Scheme of the present invention is described in further detail.
It is the realization principle figure of big data quantity node navigation tree of the embodiment of the present invention referring to Fig. 1, Fig. 1, as shown in Figure 1, main
Want the following steps are included:
Request is unfolded in the node that step 101, web front-end equipment receive user.
When representing the icon of node in user's click navigation tree, the node expansion request for the node can be triggered, it should
Node expansion request will be responded by web front-end equipment.
Step 102 judges the next stage nodal information that the node whether is stored in web front-end equipment, if it is, turning
To step 106, if not, thening follow the steps 103.
Next stage nodal information includes the information such as next stage node identification.
When being stored with the next stage nodal information of the node in web front end equipment, do not need that background server is gone to obtain again
The next stage nodal information of the node, therefore step 103 is executed, the next stage node of the not stored node in web front end equipment
When information, background server is needed to obtain the next stage nodal information of the node, therefore execute step 104.
Step 103, web front-end equipment request the next stage nodal information of the node to background server.
Under normal conditions, when user requests to be unfolded for the first time a certain node, there is no the next of the node in web front-end equipment
Grade nodal information.
Under B/S mode, data information is typically stored in background server, such as the institute of big data quantity node navigation tree
There are all nodal informations and the corresponding next stage nodal information of each node etc. in related data, including navigation tree.In this reality
It applies in example, there is no in the case where the next stage nodal information of the node in web front-end equipment, can be requested to background server
Obtain the next stage nodal information of the node.
Step 104, background server receive web front-end equipment and request for the next stage nodal information of the node, in number
According to the next stage nodal information for inquiring the node in library, the next stage nodal information of the node inquired in the database is returned
Back to web front-end equipment.
All related datas of big data quantity node navigation tree are typically stored in database, before background server receives
When end is requested for the next stage nodal information of a certain node, all next stage nodes for searching the node can be removed in database
Then query result is returned to web front-end equipment by information.
In practical applications, if the next stage node number of a node is more, background server inquires the section
These next stage nodal informations are simultaneously transferred to web front-end equipment by the next stage nodal information of point, and accordingly by web front-end equipment
The process that the node is unfolded can take a long time, this may also will lead to web front-end and lose response even collapse, in order to solve
This problem, in the present embodiment, it is also proposed that construct the concept of dummy node.
After background server inquires all next stage nodal informations an of node, if it find that the node is next
Grade node number is more, is more than preset threshold (such as 5000), then can be by all next stage node graduation of the node to more
In a set (such as N number of set, the value of N should be greater than 1 and be less than preset threshold), one then is generated virtually for each set
Node finally returns to web front-end equipment for N number of virtual node information of generation as the next stage nodal information of the node,
Simultaneously using the next stage nodal information in each set as the next stage nodal information of the dummy node generated for the set
It is stored in background server, in this way, user obtains the corresponding one group of section of the dummy node by request expansion dummy node
The next stage nodal information of point.
It is illustrated below with a specific example, it is assumed that some nodes X has 10000 next stage nodes, in advance
If the value that threshold value is 5000, N is 10, then when user requests expanding node X for the first time, web front-end equipment and background server
Treatment process it is as follows:
1) the next stage nodal information of the local not stored nodes X of web front-end equipment discovery, therefore requested to background server
The next stage nodal information of nodes X.
2) background server inquiry database determines that nodes X has 10000 next stage nodes, is more than preset threshold
5000, therefore by 10000 next stage node graduation to 10 (N value) a set, this 10 set be respectively as follows: [1 ... 1000],
[1001…2000],……,[9001…10000].Background server generates corresponding virtual section for this 10 set respectively
Point: V1, V2 ..., V10, then using dummy node V1, V2 of generation ..., V10 as nodes X next stage node return
Web front-end equipment is given, meanwhile, the next stage node by each next stage node in [1 ... 1000] as dummy node V1 is protected
There are in background server, the next stage node by each next stage node in [1001 ... 2000] as dummy node V2 is protected
There are in background server, and so on.
3) web front-end equipment receives the dummy node of background server return: V1, V2 ..., after V10, expanding node
The result of X is as shown in Figure 2.
Later, user can continue request expansion dummy node: V1, V2 ..., any of V10, such as V2, then
Background server will be using 1000 nodal informations in set [1001 ... 2000] as the next stage node of dummy node V2
Information returns to web front-end equipment.
Here, it should be noted that when user requests expansion dummy node, if the next stage node of dummy node
Number is more than preset threshold, then is also required to according to above-mentioned 3 steps, by the next stage node graduation of the dummy node to N number of set,
A dummy node is generated for each set, using N number of virtual node information of generation as the next stage section of the dummy node
Point information returns to web front-end equipment, while using the nodal information in each set as the virtual section generated for the set
The next stage nodal information of point is stored in background server.
Step 105, web front-end equipment receive the next stage nodal information for the node that background server returns and store,
Go to step 107.
Web front-end equipment, can be by the next of the node to after the next stage nodal information of background server requesting node
The storage of grade nodal information is to local, when requesting the expansion node again so as to user, directly reads the next of the node from local
Grade nodal information and the expansion operation for executing the node.
Step 106, the next stage nodal information that the node is read from web front-end equipment.
In the case where the next stage nodal information for being stored with the node in web front end equipment, the section directly is read from local
The next stage nodal information of point is operated with the expansion for executing the node, can reduce web front-end equipment and background server in this way
Between communication.
When user requests to be unfolded for the first time a certain node, web front-end equipment is under the background server request node
First nodes information is simultaneously stored, and therefore, when the non-expansion node of request for the first time of user, directly reads the node from local
Next stage nodal information.
Step 107, the next stage nodal information based on the node, are unfolded the next stage node of the node.
The next stage node of expanding node, namely draw in navigation tree the next stage node of the node.
In the embodiment of the present invention shown in Fig. 1, in the node expansion request for receiving user, do not deposited in web front-end equipment
In the case where the next stage nodal information of the node, the next stage nodal information of the node, phase are just requested to background server
Transmission in navigation tree for all nodal informations disposably is obtained from background server for web front-end equipment in the prior art
Data volume is considerably less, thus even collapses it is possible to prevente effectively from web front-end is caused to lose response because loading mass data.And
And web front-end equipment is also saved after the next stage nodal information that background server obtains node, hereafter when user asks again
When seeking the expansion node, web front-end equipment does not need to request to background server, but directly reads under the node from local
First nodes information can also reduce the communication between web front-end equipment and background server.
In practical applications, when client does not know the next stage node whether a certain node in navigation tree has hung down its concern
When, generally each node can be unfolded one by one to check, virtually both having wasted the time also increases the operating cost of front end.In order to
It allows client to understand the information of its lower next stage node hung under the premise of not expanding node, can request to carry out preview to node
It opens.
Specifically, one pre-deployment button can be set for node in advance, when the user clicks the pre-deployment button of node
When triggering node pre-deployment request, web front-end equipment receive node pre-deployment request after, can to background server request obtain
The next stage node identification (such as display Name) for taking the node, so that web front-end equipment can be defeated in the form of tip in front end
The character string assembled by the next stage node identification of the node out.
Since pre-deployment operation only delivers the drafting of the next stage node for identifying and not being related to node of node,
To be much better than node expansion operation in efficiency.
Schematic illustration has been carried out to the realization of big data quantity node navigation tree of the present invention above, based on the above principles, this
Invention provides a kind of implementation method of big data quantity node navigation tree applied to web front-end equipment and one kind is applied to backstage
The implementation method of the big data quantity node navigation tree of server, is illustrated below in conjunction with Fig. 3, Fig. 4:
It is the implementation method flow chart of one big data quantity node navigation tree of the embodiment of the present invention referring to Fig. 3, Fig. 3, is applied to
Web front-end equipment, as shown in figure 3, method includes the following steps:
Request is unfolded in step 301, the node for receiving user.
If being stored with the next stage nodal information of the node in step 302, web front-end equipment, from web front-end equipment
The middle next stage nodal information for reading the node；If the next stage nodal information of the node is not present in web front-end equipment,
The next stage nodal information of the node is requested to background server and is stored in web front-end equipment.
Step 303, the next stage nodal information based on the node, are unfolded the next stage node of the node.
Method shown in Fig. 3 further comprises:
Receive the node pre-deployment request of user；
The next stage node identification of the node is requested to background server；
Export the character string assembled by the next stage node identification of the node.
Referring to fig. 4, Fig. 4 is the implementation method flow chart of two big data quantity node navigation tree of the embodiment of the present invention, is applied to
Background server, as shown in figure 4, this method comprises:
Step 401 receives web front-end equipment for the next stage nodal information request of a node.
Step 402, the next stage nodal information for inquiring the node in the database.
The next stage nodal information of the node inquired in the database is returned to web front-end equipment by step 403.
In method shown in Fig. 4,
It is inquired after the next stage nodal information of the node in the database, by the node inquired in the database
Before next stage nodal information returns to web front-end equipment, further comprise: if the next stage number of nodes of the node does not surpass
Cross preset threshold；If the next stage number of nodes of the node is more than preset threshold, by the next stage node graduation of the node
To N number of set, a dummy node is generated for each set, using N number of virtual node information as the next stage section of the node
Point information returns to web front-end equipment, while using the nodal information in each set as the virtual section generated for the set
The next stage nodal information of point is stored in background server.
Method shown in Fig. 4 may further comprise:
The next stage node identification that web front-end equipment is received for a node is requested；
The next stage node identification of the node is inquired in the database；
The next stage node identification of the node inquired in the database is returned into web front-end equipment.
The present invention also provides a kind of realization devices and one of big data quantity node navigation tree applied to web front-end equipment
Kind is applied to the realization device of the big data quantity node navigation tree of background server, is illustrated below in conjunction with Fig. 5, Fig. 6:
It is the structural schematic diagram of the realization device of one big data quantity node navigation tree of the embodiment of the present invention referring to Fig. 5, Fig. 5,
Applied to web front-end equipment, as shown in figure 5, the device includes: receiving unit 501, processing unit 502, output unit 503；Its
In,
Request is unfolded in receiving unit 501, the node for receiving user；
Processing unit 502, after the node expansion request that user is received for receiving unit 501, if web front-end equipment
In be stored with the next stage nodal information of the node, then the next stage nodal information of the node is read from web front-end equipment；Such as
The next stage nodal information of the node is not present in fruit web front-end equipment, then requests the next stage of the node to background server
Nodal information is simultaneously stored in web front-end equipment；
The next stage node of the node is unfolded for the next stage nodal information based on the node in output unit 503.
In Fig. 5 shown device,
The receiving unit 501 further receives the node pre-deployment request of user；
The processing unit 502, after being further used for the node pre-deployment request that receiving unit 501 receives user, to
Background server requests the next stage node identification of the node；
The output unit 503, for exporting the character string assembled by the next stage node identification of the node.
It is the structural schematic diagram of the realization device of two big data quantity node navigation tree of the embodiment of the present invention referring to Fig. 6, Fig. 6,
Applied to background server, as shown in fig. 6, the device includes: receiving unit 601, query unit 602, transmission unit 603；Its
In,
Receiving unit 601 is requested for receiving web front-end equipment for the next stage nodal information of a node；
Query unit 602 receives web front-end equipment for receiving unit 601 and believes for the next stage node of a node
After breath request, the next stage nodal information of the node is inquired in the database；
Transmission unit 603, the next stage nodal information of the node for inquiring query unit 602 in the database
Return to web front-end equipment.
Fig. 6 shown device further includes processing unit 604；
The processing unit 604, query unit 602 inquire in the database the node next stage nodal information it
Afterwards, the next stage nodal information for the node that query unit 602 inquires in the database is returned to web front-end by transmission unit
It before equipment, is used for: if the next stage number of nodes of the node is less than preset threshold；If the next stage node of the node
Quantity is more than preset threshold, then by the next stage node graduation of the node to N number of set, generates one virtually for each set
N number of virtual node information is returned to web front-end equipment by node, while will be each
Next stage nodal information in set is stored in backstage as the next stage nodal information of the dummy node generated for the set
In server.
In Fig. 6 shown device,
The receiving unit 601, the next stage node identification for being further used for reception web front-end equipment for a node are asked
It asks；
The query unit 602 is further used for receiving unit 601 and receives web front-end equipment under a node
After first nodes identification request, the next stage node identification of the node is inquired in the database；
The transmission unit 603, is further used for the next of the node for inquiring query unit 602 in the database
Grade node identification returns to web front-end equipment.
The foregoing is only a preferred embodiment of the present invention, is not intended to limit the scope of the present invention.It is all
Within the spirit and principles in the present invention, any modification, equivalent replacement, improvement and so on should be included in protection of the invention
Within the scope of.
Claims (8)
1. a kind of implementation method of big data quantity node navigation tree is applied to web front-end equipment, which is characterized in that this method packet
It includes:
Request is unfolded in the node for receiving user；
If being stored with the next stage nodal information of the node in web front-end equipment, the node is read from web front-end equipment
Next stage nodal information；If the next stage nodal information of the node is not present in web front-end equipment, to background server
It requests the next stage nodal information of the node and is stored in web front-end equipment；
The next stage node of the node is unfolded in next stage nodal information based on the node；
Wherein, background server inquires the next stage section of the node when receiving the request of web front-end equipment in the database
Point information returns to the next stage node of the node if the next stage number of nodes of the node is less than preset threshold
Web front-end equipment；If the next stage number of nodes of the node is more than preset threshold, by the next stage node graduation of the node
To N number of set, a dummy node is generated for each set, using N number of virtual node information as the next stage section of the node
Point information returns to web front-end equipment, while using the nodal information in each set as the virtual section generated for the set
The next stage nodal information of point is stored in background server.
2. the method according to claim 1, wherein this method further comprises:
Receive the node pre-deployment request of user；
The next stage node identification of the node is requested to background server；
Export the character string assembled by the next stage node identification of the node.
3. a kind of implementation method of big data quantity node navigation tree is applied to background server, which is characterized in that this method packet
It includes:
The next stage nodal information that web front-end equipment is received for a node is requested；
The next stage nodal information of the node is inquired in the database；
The next stage nodal information of the node inquired in the database is returned into web front-end equipment；
Wherein, it inquires in the database after the next stage nodal information of the node, the node that will be inquired in the database
Next stage nodal information return to web front-end equipment before, further comprise: if the next stage number of nodes of the node is not
More than preset threshold, then the next stage node of the node is returned into web front-end equipment；If the next stage number of nodes of the node
Amount is more than preset threshold, then by the next stage node graduation of the node to N number of set, generates a virtual section for each set
Point returns to web front-end equipment using N number of virtual node information as the next stage nodal information of the node, while by each collection
Nodal information in conjunction is stored in background server as the next stage nodal information of the dummy node generated for the set.
4. according to the method described in claim 3, it is characterized in that, this method further include:
The next stage node identification that web front-end equipment is received for a node is requested；
The next stage node identification of the node is inquired in the database；
The next stage node identification of the node inquired in the database is returned into web front-end equipment.
5. a kind of realization device of big data quantity node navigation tree is applied to web front-end equipment, which is characterized in that the device packet
It includes: receiving unit, processing unit, output unit；
Request is unfolded in the receiving unit, the node for receiving user；
The processing unit, after the node expansion request that user is received for receiving unit, if stored in web front-end equipment
There is the next stage nodal information of the node, then reads the next stage nodal information of the node from web front-end equipment；If web
The next stage nodal information of the node is not present in headend equipment, then requests the next stage node of the node to be believed to background server
It ceases and is stored in web front-end equipment；
The next stage node of the node is unfolded for the next stage nodal information based on the node in the output unit；
Wherein, background server inquires the next stage section of the node after the request for receiving web front-end equipment in the database
Point information returns to the next stage node of the node if the next stage number of nodes of the node is less than preset threshold
Web front-end equipment；If the next stage number of nodes of the node is more than preset threshold, by the next stage node graduation of the node
To N number of set, a dummy node is generated for each set, using N number of virtual node information as the next stage section of the node
Point information returns to web front-end equipment, while using the nodal information in each set as the virtual section generated for the set
The next stage nodal information of point is stored in background server.
6. device according to claim 5, which is characterized in that
The receiving unit further receives the node pre-deployment request of user；
The processing unit, after being further used for the node pre-deployment request that receiving unit receives user, to background server
Request the next stage node identification of the node；
The output unit, for exporting the character string assembled by the next stage node identification of the node.
7. a kind of realization device of big data quantity node navigation tree is applied to background server, which is characterized in that the device packet
It includes: receiving unit, query unit, transmission unit；
The receiving unit is requested for receiving web front-end equipment for the next stage nodal information of a node；
The query unit receives web front-end equipment for receiving unit and requests for the next stage nodal information of a node
Afterwards, the next stage nodal information of the node is inquired in the database；
The next stage nodal information of the transmission unit, the node for inquiring query unit in the database returns to
Web front-end equipment；
Wherein, which further includes processing unit；
The processing unit is sent single after query unit inquires the next stage nodal information of the node in the database
Before the next stage nodal information for the node that query unit inquires in the database is returned to web front-end equipment by member, use
In: if the next stage number of nodes of the node is less than preset threshold；If the next stage number of nodes of the node is more than pre-
If threshold value, then by the next stage node graduation of the node to N number of set, a dummy node is generated for each set, it will be N number of
Virtual node information returns to web front-end equipment as the next stage nodal information of the node, while will be under in each set
First nodes information is stored in background server as the next stage nodal information of the dummy node generated for the set.
8. device according to claim 7, which is characterized in that
The receiving unit is further used for the next stage node identification request for receiving web front-end equipment for a node；
The query unit is further used for receiving unit and receives the next stage node mark that web front-end equipment is directed to a node
After knowing request, the next stage node identification of the node is inquired in the database；
The transmission unit is further used for the next stage node identification for the node for inquiring query unit in the database
Return 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 CN105512338A (en) | 2016-04-20 |
| CN105512338B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI592914B (en) * | 2016-06-28 | 2017-07-21 | Wen-Hao Liao | Chinese image 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 (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| 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 |
-
2015
- 2015-12-31 CN CN201511021623.8A patent/CN105512338B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105512338A (en) | 2016-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101019105B (en) | Method and apparatus for data storage using striping | |
| CN101408877B (en) | System and method for loading tree node | |
| CN101098248B (en) | Method and system for implementing universal network management based on configuration describing document | |
| CN110489391A (en) | A kind of data processing method and relevant device | |
| CN109408699B (en) | Method for realizing rapid retrieval of tree nodes by synchronous cache zTree | |
| CN108121511A (en) | Data processing method, device and equipment in a kind of distributed edge storage system | |
| CN104346345B (en) | The storage method and device of data | |
| CN113382282B (en) | Page resource access method and device, electronic equipment and storage medium | |
| CN102307206A (en) | Caching system and caching method for rapidly accessing virtual machine images based on cloud storage | |
| CN104539681A (en) | Distributed GIS accelerating system and GIS service processing method | |
| CN109299157A (en) | A kind of data export method and device of distributed big single table | |
| CN105337923A (en) | Data distribution method and system, data transmitting apparatus and data receiving apparatus | |
| CN107357890A (en) | A kind of web page files processing method, apparatus and system and storage device | |
| CN105512338B (en) | The implementation method and device of a kind of big data quantity node navigation tree in web front-end | |
| CN104793981B (en) | A kind of online snapshot management method and device of cluster virtual machine | |
| CN103336782A (en) | Relational distributed database system | |
| CN103207813B (en) | The method and apparatus for managing resource | |
| CN109189431A (en) | A kind of client side upgrading method, device, equipment and readable storage medium storing program for executing | |
| CN113805816B (en) | Disk space management method, device, equipment and storage medium | |
| CN100499495C (en) | A remote login implementation method based on SNMP protocol | |
| CN106534259B (en) | Web data acquisition method, Web server and web data acquisition system based on Docker | |
| CN103077174A (en) | Concurrent resource updating method and equipment | |
| WO2017000540A1 (en) | Data query method and device | |
| CN104965909B (en) | A kind of request processing method of dynamic web content | |
| CN115686811A (en) | Process management method, device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |