CN103530379A - Tree structure data display method and device - Google Patents

Tree structure data display method and device Download PDF

Info

Publication number
CN103530379A
CN103530379A CN201310486384.8A CN201310486384A CN103530379A CN 103530379 A CN103530379 A CN 103530379A CN 201310486384 A CN201310486384 A CN 201310486384A CN 103530379 A CN103530379 A CN 103530379A
Authority
CN
China
Prior art keywords
node
data
tree
user
encapsulation
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
Application number
CN201310486384.8A
Other languages
Chinese (zh)
Other versions
CN103530379B (en
Inventor
陈明远
林利炜
陈敏
鲁峰
侯伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
FUJIAN RONGJI SOFTWARE Co Ltd
Original Assignee
FUJIAN RONGJI SOFTWARE Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by FUJIAN RONGJI SOFTWARE Co Ltd filed Critical FUJIAN RONGJI SOFTWARE Co Ltd
Priority to CN201310486384.8A priority Critical patent/CN103530379B/en
Publication of CN103530379A publication Critical patent/CN103530379A/en
Application granted granted Critical
Publication of CN103530379B publication Critical patent/CN103530379B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/904Browsing; Visualisation therefor

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention aims to provide a tree structure data display method and device. According to the method and device, the unfolding structure of data positioning before tree structure data refreshing and the unfolding structure of data positioning after tree structure data refreshing can be simultaneously displayed. The method is different from a tree data structure unfolding mode in the prior art: when a data display request is not a data display request for the first time, acquired packaged data are compared and merged with stored data packaged in advance, data structures needing displaying in the request are kept, and data structures needing displaying in a precedent data display request are also kept. Through tree structure positioning showing optimization, local refreshing of tree structure page data can be achieved, the coexistence of old data and new data is guaranteed, and users can conveniently look for data. Through local refreshing of tree structure point location showing, the response speed of a front-end interface is optimized, and showing performance is improved.

Description

Tree structure data display packing and device
Technical field
The present invention relates to the technical field that computer data content shows, relate in particular to tree form data structure and show field.
Background technology
Tree structure is a kind of of data structure.Data structure refers to the relation existing between each data element in same data element class.The data structure of broad sense is divided into the computing of logical organization, storage organization (physical arrangement) and data.The logical organization of data is the descriptions to relation between data, and in this instructions, alleged data structure is the logical organization of data.
Data structure has four class basic structures: set, linear structure, tree structure, figure shape structure (reticulate texture).Tree structure and graphic structure full name are nonlinear organization.Data element in collecting structure is except belonging to one type, not without other relation.In linear structure, between element, there is one-one relationship, in tree structure, between element, have many-one relationship, in graphic structure, between element, have many-to-many relationship.In graphic structure, forerunner's nodal point number of each node and follow-up nodal point number can be any number of.
Because tree structure hierarchical relationship is clear, be convenient to management, therefore in computing machine, network field widespread use, for example a lot of OA(Office Automation are office automation) storage mode of task data is stored with tree form data structure exactly in software, and show with tree-like display interface, because in tree-like display interface, the logical relation between each task is very clear, and is convenient to the management maintenances such as interpolation, deletion.
We often can run into the Search and Orientation for tree structure data in daily use, as: the level of file is shown.In tree structure, carry out certain node data locating display, conventionally we can refresh rear demonstration to whole tree structure, when again locating other node datas, by refreshing tree construction, show, can cause so former data to reappear, need to again relocate or search.
Summary of the invention
The object of the invention is to, a kind of tree structure data display packing and device are provided, the method can show the tree structure data deployed configuration that two secondary data are located before and after refreshing with device simultaneously.
For achieving the above object
A display packing, comprises the following steps:
Receive and show data structure request, the request of described demonstration data structure is: the position with visual tree-like structural interface display-object tree node in data structure, the solicited message of demonstration data structure comprises ID and the path of goal tree node, and described goal tree node is the node of its position in data structure to display;
Load the data structure table corresponding with data structure to display;
According to the traversal path data structure table of goal tree node, obtain encapsulation of data storage, described encapsulation of data comprises the node data of tree node and the topological structure between tree node, described tree node comprises: the brotgher of node of root node, goal tree node, goal tree node, the goal tree node brotgher of node to the father nodes at different levels between root node and goal tree node to the father nodes at different levels between root node, and described node data comprises node ID and nodename;
Resolve encapsulation of data, and show;
Receive the request of new demonstration data, and obtain new encapsulation of data;
The encapsulation of data that the request of twice demonstration data structure is obtained is compared, and merges, and obtains merging encapsulation of data, and described merging encapsulation of data comprises the topological structure between the node data territory tree node of twice corresponding tree node of demonstration data structure request;
Resolve and merge encapsulation of data, and show.
Preferably, during demonstration, goal tree node shows by the display effect that is different from other tree nodes.
Preferably, described reception shows that data structure request is to choose default form or content: link or instant message.
Preferably, the solicited message of demonstration data structure also comprises the title of goal tree node.
Preferably, the node ID of data in each encapsulation of data relatively during merging, rejects the corresponding node data of node ID repeating, and the topological structure encapsulation by between unduplicated node data and tree node, obtains merging encapsulation of data.
Preferably, described encapsulation of data is stored with XML file, described in to resolve to XML document analysis be html file.
Preferably, resolve to merge encapsulation of data, and to take the corresponding goal tree node of request of new demonstration data while showing be that reference position shows.
Preferably, the solicited message that shows data structure also comprises that this asks corresponding reader territory;
Described encapsulation of data comprises the node data of tree node and the topological structure between tree node, described tree node comprises that this asks corresponding reader territory visible: the brotgher of node of root node, goal tree node, goal tree node, the goal tree node brotgher of node to the father nodes at different levels between root node and goal tree node to the father nodes at different levels between root node, described node data comprises node ID and nodename.
The present invention also provides a kind of tree structure data display device, comprises with lower module:
Display module, for showing data structure;
Memory module;
Receiver module, be used for receiving the request of demonstration data structure, the request of described demonstration data structure is: the position with visual tree-like structural interface display-object tree node in data structure, the solicited message of demonstration data structure comprises ID and the path of goal tree node, and described goal tree node is the node of its position in data structure to display;
Record module, for loading the data structure table corresponding with data structure to display;
Package module, for obtaining encapsulation of data and be stored in memory module according to the traversal path data structure table of goal tree node, described encapsulation of data comprises the node data of tree node and the topological structure between tree node, described tree node comprises: the brotgher of node of root node, goal tree node, goal tree node, the goal tree node brotgher of node to the father nodes at different levels between root node and goal tree node to the father nodes at different levels between root node, and described node data comprises node ID and nodename;
Parsing module, for resolving encapsulation of data, and delivers to display module demonstration;
Comparing module, for the encapsulation of data that the request of twice demonstration data structure is obtained, compare, merge, obtain merging encapsulation of data, described merging encapsulation of data comprises the topological structure between the node data territory tree node of twice corresponding tree node of demonstration data structure request;
Preferably, display module is for showing goal tree node by the display effect that is different from other tree nodes.
Preferably, described receiving trap is for detection of to default form or the link of content or choosing of instant message.
The tree form data structure expansion mode that is different from prior art, the present invention is when showing that the request of data is non-while showing request of data first, the present invention compares the formerly encapsulation of data of the encapsulation of data obtaining and storage, merge, both retained this and asked data structure to display, and retained again and formerly shown the data structure that request of data is shown simultaneously.
Accompanying drawing explanation
Fig. 1 is tree structure data schematic diagram described in the specific embodiment of the invention;
Fig. 2 be by user X1, ask described in the specific embodiment of the invention show for the first time the tree form data structure that data structure request is shown;
Fig. 3 be by user X1, ask described in the specific embodiment of the invention show for the second time the tree form data structure that data structure request is shown;
Fig. 4 be by user Z1, ask described in the specific embodiment of the invention show for the first time the tree form data structure that data structure request is shown;
Fig. 5 be by user Z1, ask described in the specific embodiment of the invention show for the second time the tree form data structure that data structure request is shown;
Fig. 6 is the schematic flow sheet of tree structure data display packing described in the specific embodiment of the invention;
Fig. 7 is office system interface schematic diagram one described in the specific embodiment of the invention;
Fig. 8 is office system interface schematic diagram two described in the specific embodiment of the invention.
Label declaration:
710: office system front-end interface
711: message window
712: cursor
713: check button one
810: office system front-end interface
811: message window
812: cursor
813: check button one
814: check button two
Embodiment
By describing technology contents of the present invention, structural attitude in detail, being realized object and effect, below in conjunction with embodiment and coordinate accompanying drawing to be explained in detail.
Refer to Fig. 1, the present embodiment provides a kind of tree structure data display packing,
In certain embodiment, this data structure is as shown in Fig. 1 and table 1, and Fig. 1 is that the tree structure of the data recorded of table 1 is shown.
Table 1:
Node ID Nodename Node path Reader territory
01 Node O /01 USER-X、USER-Y、USER-Z
02 Node A /01/02 USER-X、USER-Y、USER-Z
03 Node A1 /01/02/03 USER-X、USER-Y、USER-Z
04 Node A2 /01/02/04 USER-X、USER-Z
05 Node B /01/05 USER-X、USER-Y、USER-Z
06 Node B 1 /01/05/06 USER-X、USER-Z
07 Node B 11 /01/05/06/07 USER-X、USER-Z
08 Node B 12 /01/05/06/08 USER-X、USER-Z
09 Node B 2 /01/05/09 USER-X、USER-Y、USER-Z
10 Node B 21 /01/05/09/10 USER-X、USER-Y、USER-Z
11 Node B 22 /01/05/09/11 USER-X、USER-Y、USER-Z
12 Node B 23 /01/05/09/12 USER-X、USER-Y、USER-Z
13 Node B 3 /01/05/13 USER-X、USER-Z
14 Node C /01/14 USER-Z
15 Node D /01/15 USER-X、USER-Y、USER-Z
16 Node D1 /01/15/16 USER-X、USER-Y、USER-Z
17 Node D11 /01/15/16/17 USER-Y、USER-Z
18 Node D12 /01/15/16/18 USER-X、USER-Y、USER-Z
19 Node D13 /01/15/16/19 USER-X、USER-Z
20 Node D2 /01/15/20 USER-Y、USER-Z
21 Node D3 /01/15/21 USER-X、USER-Y、USER-Z
22 Node D31 /01/15/21/22 USER-X、USER-Y、USER-Z
23 Node D32 /01/15/21/23 USER-X、USER-Y、USER-Z
The step of the present embodiment is as follows:
S601 detects user X1 and logs in, and X1 belongs to reader territory USER-X;
S602 receives and shows data structure request, the request of described demonstration data structure is: the position with visual tree-like structural interface display-object tree node in data structure, the solicited message that shows data structure comprises that the ID, path of goal tree node and this ask corresponding reader territory, also comprise in certain embodiments the title of goal tree node, if do not comprise goal tree nodename, can be in subsequent step read this information during reading out data structural table.Described goal tree node is the node of its position in data structure to display, and in the embodiment of this request, goal tree node ID is 18, and name is called " node D12 ";
In different embodiment, the form that shows the request of data structure can be varied, can be for example link or the content of choosing default form, described default link or content be for example: open the office message of receiving in office system OA, Twitter message, communication message, can be also the link in webpage, can be at link entrance of Application Program Interface etc.In the present embodiment, interface as shown in Figure 7, one office system front-end interface 710, when user receives a new task, display message window 711 in office system front-end interface 710 " new task 1 ", prompting user X1 has new task, if user moves cursor, 712 clicks check that button 1 " shows " in Task Tree, and system is considered as receiving the request that shows data structure.
S603 loads the data structure table corresponding with data structure to display and reader territory, in the present embodiment, loads data structure table as shown in table 2;
Table 2:
Node ID Nodename Node path Reader territory
01 Node O /01 USER-X、USER-Y、USER-Z
02 Node A /01/02 USER-X、USER-Y、USER-Z
03 Node A1 /01/02/03 USER-X、USER-Y、USER-Z
04 Node A2 /01/02/04 USER-X、USER-Z
05 Node B /01/05 USER-X、USER-Y、USER-Z
06 Node B 1 /01/05/06 USER-X、USER-Z
07 Node B 11 /01/05/06/07 USER-X、USER-Z
08 Node B 12 /01/05/06/08 USER-X、USER-Z
09 Node B 2 /01/05/09 USER-X、USER-Y、USER-Z
10 Node B 21 /01/05/09/10 USER-X、USER-Y、USER-Z
11 Node B 22 /01/05/09/11 USER-X、USER-Y、USER-Z
12 Node B 23 /01/05/09/12 USER-X、USER-Y、USER-Z
13 Node B 3 /01/05/13 USER-X、USER-Z
15 Node D /01/15 USER-X、USER-Y、USER-Z
16 Node D1 /01/15/16 USER-X、USER-Y、USER-Z
18 Node D12 /01/15/16/18 USER-X、USER-Y、USER-Z
19 Node D13 /01/15/16/19 USER-X、USER-Z
21 Node D3 /01/15/21 USER-X、USER-Y、USER-Z
22 Node D31 /01/15/21/22 USER-X、USER-Y、USER-Z
23 Node D32 /01/15/21/23 USER-X、USER-Y、USER-Z
In table 2, do not comprise the sightless node C of reader territory USER-X, node D11 and node D2.
S604 obtains encapsulation of data the storage of XML form according to the traversal path data structure table of goal tree node, storage mode can be stored in buffer memory, also can be stored in the medium of hard disk or other longer-term storage.
Described encapsulation of data comprises the node data of tree node and the topological structure between tree node, described tree node comprises that this asks corresponding reader territory visible: the brotgher of node of root node, goal tree node, goal tree node, the goal tree node brotgher of node to the father nodes at different levels between root node and goal tree node to the father nodes at different levels between root node, and described node data comprises node ID and nodename;
Corresponding to goal tree node ID, be 18, name is called " node D12 ", and described tree node is as shown in table 3:
Table 3:
Node ID Nodename Node path Reader territory
01 Node O /01 USER-X、USER-Y、USER-Z
02 Node A /01/02 USER-X、USER-Y、USER-Z
05 Node B /01/05 USER-X、USER-Y、USER-Z
15 Node D /01/15 USER-X、USER-Y、USER-Z
16 Node D1 /01/15/16 USER-X、USER-Y、USER-Z
18 Node D12 /01/15/16/18 USER-X、USER-Y、USER-Z
19 Node D13 /01/15/16/19 USER-X、USER-Z
21 Node D3 /01/15/21 USER-X、USER-Y、USER-Z
Wherein, node O is root node, node D12 is goal tree node, node D13 is the brotgher of node of goal tree node, node D1 is the father node of goal tree node, node D3 is the brotgher of node of the father node of goal tree node, and node D is the father node of node D1, and node A, Node B are the brotgher of node of node D.
Correspondence loads total data in step S603 in certain embodiments, and corresponding to table 1 illustrated embodiment, data shown in load table 1, in step S604, obtain encapsulation of data storage according to the traversal path data structure table of reader territory and goal tree node.Namely according to the visible range in reader territory, in data structure table, travel through, obtain encapsulation of data.Can obtain equally this and ask the visible tree node in corresponding reader territory.
In certain embodiments, encapsulation of data can be encapsulated as to extended formatting, such as: JSON etc.
S605 is html file by XML encapsulation of data document analysis, and shows at front end graphical interfaces; Display effect as shown in Figure 2.During demonstration, goal tree node " node D12 " shows by the display effect that is different from other tree nodes.Such as different colors, font, shading or highlighted demonstration etc., is convenient to user's quickly positioning target tree node.
S606 receives the request of new demonstration data, and for example in the embodiment of new request, goal tree node ID is 07, and name is called " Node B 11 ";
In an embodiment, as shown in Figure 8, in office system, receive new task message: " new task 2 ", in office system front-end interface 810, when user receives a new task again, display message window 811 in office system front-end interface 810, prompting user X1 has again new task, now, owing to checking before tree-like task image as shown in Figure 2 under visualization interface, therefore, system is to 2 kinds of selections of user, as shown in Figure 8, in message window, there are 2 and check button, respectively: check that button 2 813 " shows separately " in Task Tree, check that button 3 814 " shows in the lump with previous tasks " in Task Tree.If need not reappear current task when user wants to relocate new task node, mobile cursor 812 is clicked and is checked that button 2 813 " shows separately " in Task Tree, system refreshes Task Tree by reproduction, show new tree construction, if user thinks two subtasks and shows on interface in the lump, check new task and the position of existing task in tree construction simultaneously, mobile cursor 812 is clicked and is checked that button 3 814 " shows in the lump with previous tasks " in Task Tree, system is considered as receiving the request of new demonstration data, and two subtasks need to be shown in the lump in tree structure, carry out following steps:
S607 is similar to step S603 and loads the data structure table corresponding with data structure to display and reader territory, corresponding to the present embodiment, loads data structure table as shown in table 2.
S608 is similar to step S604 and according to the traversal path data structure table of goal tree node, obtains new encapsulation of data the storage of XML form,
Corresponding to goal tree node ID, be 07, name is called " Node B 11 ", shown in tree node as shown in table 4:
Table 4:
Node ID Nodename Node path Reader territory
01 Node O /01 USER-X、USER-Y、USER-Z
02 Node A /01/02 USER-X、USER-Y、USER-Z
05 Node B /01/05 USER-X、USER-Y、USER-Z
06 Node B 1 /01/05/06 USER-X、USER-Z
07 Node B 11 /01/05/06/07 USER-X、USER-Z
08 Node B 12 /01/05/06/08 USER-X、USER-Z
09 Node B 2 /01/05/09 USER-X、USER-Y、USER-Z
13 Node B 3 /01/05/13 USER-X、USER-Z
15 Node D /01/15 USER-X、USER-Y、USER-Z
Wherein, node O is root node, Node B 11 is goal tree node, Node B 12 is the brotgher of node of goal tree node, Node B 1 is the father node of goal tree node, Node B 2, B3 are the brotgher of node of the father node B1 of goal tree node, and Node B is the father node of Node B 1, the brotgher of node that node A, node D are Node B.
S609 reads previously stored encapsulation of data, the encapsulation of data that the request of twice demonstration data structure is obtained is compared, merge, with XML form encapsulation, obtain merging encapsulation of data, described merging encapsulation of data comprises the topological structure between the node data territory tree node of twice corresponding tree node of demonstration data structure request;
Corresponding to the corresponding tree node of the Twice requests shown in table 3, table 4, merge encapsulation of data and comprise node as shown in table 5:
Table 5:
Node ID Nodename Node path Reader territory
01 Node O /01 USER-X、USER-Y、USER-Z
02 Node A /01/02 USER-X、USER-Y、USER-Z
05 Node B /01/05 USER-X、USER-Y、USER-Z
06 Node B 1 /01/05/06 USER-X、USER-Z
07 Node B 11 /01/05/06/07 USER-X、USER-Z
08 Node B 12 /01/05/06/08 USER-X、USER-Z
09 Node B 2 /01/05/09 USER-X、USER-Y、USER-Z
13 Node B 3 /01/05/13 USER-X、USER-Z
15 Node D /01/15 USER-X、USER-Y、USER-Z
16 Node D1 /01/15/16 USER-X、USER-Y、USER-Z
18 Node D12 /01/15/16/18 USER-X、USER-Y、USER-Z
19 Node D13 /01/15/16/19 USER-X、USER-Z
21 Node D3 /01/15/21 USER-X、USER-Y、USER-Z
The node ID of data in each encapsulation of data relatively during merging, rejects the corresponding node data of node ID repeating, and the topological structure encapsulation by between unduplicated node data and tree node, obtains merging encapsulation of data.
S610 resolves to html file by the merging encapsulation of data of XML form, and shows.As shown in Figure 3, during demonstration, goal tree node " Node B 11 " shows by the display effect that is different from other tree nodes with " node D12 ".Such as different colors, font, shading or highlighted demonstration etc., is convenient to user's quickly positioning target tree node.In certain embodiments, for the ease of user, locate more in time new goal tree node, resolve to merge encapsulation of data, and to take the corresponding goal tree node of request of new demonstration data while showing be that reference position shows.For example, the tree construction after merging has exceeded page length, need to just can browse All Trees structure by mobile scroll bar.System will automatically be take view interface the center that new goal tree node " Node B 12 " be view height, also display frame of location.
At some, do not relate in the embodiment in reader territory, while loading data structure table or ergodic data structural table, user has the authority of consulting of any node, or in certain super authority user's login, for example, corresponding in the data structure table shown in table 1, the user who belongs to reader territory USER-Z is such reader, the user in this reader territory, can consult any node, therefore, successively show data structure request 2 times, request shows that goal tree node " node D12 " is with " Node B 11 " during the position in data structure respectively, while carrying out the step operation of above-described embodiment, the tree structure of its demonstration is as Fig. 4, shown in Fig. 5.
The various embodiments described above, in display effect, during data structure request, are equivalent to not change the formerly display frame of tree construction after being presented at, and just new tree construction are shown to the tree node local expansion that request is corresponding.Picture changes not quite like this, changes smoothly, and display effect is better.
The present embodiment, by the optimization to the locating display of tree structure, can be realized the part of tree structure page data and refresh, and has guaranteed legacy data and new data and has deposited, and facilitates user to inquire about.By the part that tree structure point position is shown, refresh, optimized the response speed of front-end interface, promoted display performance.
For realizing said method, we provide a kind of embodiment of tree structure data display device, comprise with lower module:
Display module, for showing data structure;
Memory module;
Receiver module, be used for receiving the request of demonstration data structure, the request of described demonstration data structure is: the position with visual tree-like structural interface display-object tree node in data structure, the solicited message of demonstration data structure comprises ID and the path of goal tree node, and described goal tree node is the node of its position in data structure to display;
Record module, for loading the data structure table corresponding with data structure to display;
Package module, for obtaining encapsulation of data and be stored in memory module according to the traversal path data structure table of goal tree node, described encapsulation of data comprises the node data of tree node and the topological structure between tree node, described tree node comprises: the brotgher of node of root node, goal tree node, goal tree node, the goal tree node brotgher of node to the father nodes at different levels between root node and goal tree node to the father nodes at different levels between root node, and described node data comprises node ID and nodename;
Parsing module, for resolving encapsulation of data, and delivers to display module demonstration;
Comparing module, for the encapsulation of data that the request of twice demonstration data structure is obtained, compare, merge, obtain merging encapsulation of data, described merging encapsulation of data comprises the topological structure between the node data territory tree node of twice corresponding tree node of demonstration data structure request;
Display module is for showing goal tree node by the display effect that is different from other tree nodes.
Described receiving trap is for detection of to default form or the link of content or choosing of instant message.
The tree form data structure expansion mode that is different from prior art, the present invention is when showing that the request of data is non-while showing request of data first, the present invention compares the formerly encapsulation of data of the encapsulation of data obtaining and storage, merge, both retained this and asked data structure to display, and retained again and formerly shown the data structure that request of data is shown simultaneously.
The foregoing is only embodiments of the invention; not thereby limit the scope of the claims of the present invention; every equivalent structure or conversion of equivalent flow process that utilizes instructions of the present invention and accompanying drawing content to do; or be directly or indirectly used in other relevant technical fields, be all in like manner included in scope of patent protection of the present invention.

Claims (11)

1. a tree structure data display packing, comprises the following steps:
Receive and show data structure request, the request of described demonstration data structure is: the position with visual tree-like structural interface display-object tree node in data structure, the solicited message of demonstration data structure comprises ID and the path of goal tree node, and described goal tree node is the node of its position in data structure to display;
Load the data structure table corresponding with data structure to display;
According to the traversal path data structure table of goal tree node, obtain encapsulation of data storage, described encapsulation of data comprises the node data of tree node and the topological structure between tree node, described tree node comprises: the brotgher of node of root node, goal tree node, goal tree node, the goal tree node brotgher of node to the father nodes at different levels between root node and goal tree node to the father nodes at different levels between root node, and described node data comprises node ID and nodename;
Resolve encapsulation of data, and show;
Receive the request of new demonstration data, and obtain new encapsulation of data;
The encapsulation of data that the request of twice demonstration data structure is obtained is compared, and merges, and obtains merging encapsulation of data, and described merging encapsulation of data comprises the topological structure between the node data territory tree node of twice corresponding tree node of demonstration data structure request;
Resolve and merge encapsulation of data, and show.
2. tree structure data display packing according to claim 1, is characterized in that, during demonstration, goal tree node shows by the display effect that is different from other tree nodes.
3. tree structure data display packing according to claim 1, is characterized in that, described reception shows that data structure request is to choose default form or content: link or instant message.
4. tree structure data display packing according to claim 1, is characterized in that, the solicited message of demonstration data structure also comprises the title of goal tree node.
5. tree structure data display packing according to claim 1, is characterized in that, the described encapsulation of data that the request of twice demonstration data structure is obtained is compared, and merges, and obtains merging encapsulation of data and is specially:
The node ID of data in each encapsulation of data relatively during merging, rejects the corresponding node data of node ID repeating, and the topological structure encapsulation by between unduplicated node data and tree node, obtains merging encapsulation of data.
6. tree structure data display packing according to claim 1, is characterized in that, described encapsulation of data is stored with XML file, described in to resolve to XML document analysis be html file.
7. tree structure data display packing according to claim 1, is characterized in that, resolve to merge encapsulation of data, and to take the corresponding goal tree node of request of new demonstration data while showing be that reference position shows.
8. according to the tree structure data display packing described in claim 1 to 7 any one, it is characterized in that, the solicited message that shows data structure also comprises that this asks corresponding reader territory;
Described encapsulation of data comprises the node data of tree node and the topological structure between tree node, described tree node comprises that this asks corresponding reader territory visible: the brotgher of node of root node, goal tree node, goal tree node, the goal tree node brotgher of node to the father nodes at different levels between root node and goal tree node to the father nodes at different levels between root node, described node data comprises node ID and nodename.
9. a tree structure data display device, comprises with lower module:
Display module, for showing data structure;
Memory module;
Receiver module, be used for receiving the request of demonstration data structure, the request of described demonstration data structure is: the position with visual tree-like structural interface display-object tree node in data structure, the solicited message of demonstration data structure comprises ID and the path of goal tree node, and described goal tree node is the node of its position in data structure to display;
Record module, for loading the data structure table corresponding with data structure to display;
Package module, for obtaining encapsulation of data and be stored in memory module according to the traversal path data structure table of goal tree node, described encapsulation of data comprises the node data of tree node and the topological structure between tree node, described tree node comprises: the brotgher of node of root node, goal tree node, goal tree node, the goal tree node brotgher of node to the father nodes at different levels between root node and goal tree node to the father nodes at different levels between root node, and described node data comprises node ID and nodename;
Parsing module, for resolving encapsulation of data, and delivers to display module demonstration;
Comparing module, for the encapsulation of data that the request of twice demonstration data structure is obtained, compare, merge, obtain merging encapsulation of data, described merging encapsulation of data comprises the topological structure between the node data territory tree node of twice corresponding tree node of demonstration data structure request.
10. tree structure data display device according to claim 9, is characterized in that, display module is for showing goal tree node by the display effect that is different from other tree nodes.
11. tree structure data display device according to claim 9, is characterized in that, described receiving trap is for detection of to default form or the link of content or choosing of instant message.
CN201310486384.8A 2013-10-15 2013-10-15 tree structure data display method and device Active CN103530379B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310486384.8A CN103530379B (en) 2013-10-15 2013-10-15 tree structure data display method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310486384.8A CN103530379B (en) 2013-10-15 2013-10-15 tree structure data display method and device

Publications (2)

Publication Number Publication Date
CN103530379A true CN103530379A (en) 2014-01-22
CN103530379B CN103530379B (en) 2017-01-04

Family

ID=49932388

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310486384.8A Active CN103530379B (en) 2013-10-15 2013-10-15 tree structure data display method and device

Country Status (1)

Country Link
CN (1) CN103530379B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103955533A (en) * 2014-05-13 2014-07-30 中国工商银行股份有限公司 Device and method for acquiring page tree data based on buffering queue
CN105095246A (en) * 2014-05-04 2015-11-25 腾讯科技(北京)有限公司 Method and apparatus for displaying data
CN105608213A (en) * 2015-12-30 2016-05-25 南京国电南自电网自动化有限公司 Interval copy method for tree structure object in intelligent substation configuration
CN105786829A (en) * 2014-12-19 2016-07-20 深圳云之家网络有限公司 Tree-form data structure display method and device
CN106293928A (en) * 2015-06-05 2017-01-04 阿里巴巴集团控股有限公司 A kind of overall situation task node dependence method for visualizing, device and system
CN107402882A (en) * 2017-07-21 2017-11-28 杭州迪普科技股份有限公司 Web page method of testing and device
CN109508413A (en) * 2018-10-22 2019-03-22 中国银行股份有限公司 Job scheduling methods of exhibiting and device, storage medium and electronic equipment
CN111813467A (en) * 2019-04-10 2020-10-23 阿里巴巴集团控股有限公司 Interface refreshing method and device and readable storage medium
CN116049588A (en) * 2022-12-30 2023-05-02 格兰菲智能科技有限公司 Page loading method, device, computer equipment and storage medium

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020107893A1 (en) * 2001-02-02 2002-08-08 Hitachi, Ltd. Method and system for displaying data with tree structure
CN101162466A (en) * 2007-11-16 2008-04-16 浪潮集团山东通用软件有限公司 Method for checking tree structures node repeat
CN101436195A (en) * 2008-10-30 2009-05-20 东软集团股份有限公司 Method and system for generating resource access entrance in Web user interface
CN101751399A (en) * 2008-12-12 2010-06-23 中国移动通信集团河北有限公司 Decision tree optimization method and optimization system
CN101799753B (en) * 2009-12-17 2013-01-16 中国电力科学研究院 Method and device for realizing tree structure
CN102945262A (en) * 2012-10-19 2013-02-27 大唐移动通信设备有限公司 Comparing method and device for RNC (Radio Network Controller) configuration data
CN103324763A (en) * 2013-07-18 2013-09-25 北京金和软件股份有限公司 Presenting method for tree-form data structure of mobile phone terminal

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020107893A1 (en) * 2001-02-02 2002-08-08 Hitachi, Ltd. Method and system for displaying data with tree structure
CN101162466A (en) * 2007-11-16 2008-04-16 浪潮集团山东通用软件有限公司 Method for checking tree structures node repeat
CN101436195A (en) * 2008-10-30 2009-05-20 东软集团股份有限公司 Method and system for generating resource access entrance in Web user interface
CN101751399A (en) * 2008-12-12 2010-06-23 中国移动通信集团河北有限公司 Decision tree optimization method and optimization system
CN101799753B (en) * 2009-12-17 2013-01-16 中国电力科学研究院 Method and device for realizing tree structure
CN102945262A (en) * 2012-10-19 2013-02-27 大唐移动通信设备有限公司 Comparing method and device for RNC (Radio Network Controller) configuration data
CN103324763A (en) * 2013-07-18 2013-09-25 北京金和软件股份有限公司 Presenting method for tree-form data structure of mobile phone terminal

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105095246A (en) * 2014-05-04 2015-11-25 腾讯科技(北京)有限公司 Method and apparatus for displaying data
CN105095246B (en) * 2014-05-04 2020-01-10 腾讯科技(北京)有限公司 Method and device for displaying data
CN103955533B (en) * 2014-05-13 2017-03-08 中国工商银行股份有限公司 A kind of page tree data acquisition device based on buffer queue and method
CN103955533A (en) * 2014-05-13 2014-07-30 中国工商银行股份有限公司 Device and method for acquiring page tree data based on buffering queue
CN105786829A (en) * 2014-12-19 2016-07-20 深圳云之家网络有限公司 Tree-form data structure display method and device
CN106293928B (en) * 2015-06-05 2020-04-14 阿里巴巴集团控股有限公司 Global task node dependency relationship visualization method, device and system
CN106293928A (en) * 2015-06-05 2017-01-04 阿里巴巴集团控股有限公司 A kind of overall situation task node dependence method for visualizing, device and system
CN105608213A (en) * 2015-12-30 2016-05-25 南京国电南自电网自动化有限公司 Interval copy method for tree structure object in intelligent substation configuration
CN107402882A (en) * 2017-07-21 2017-11-28 杭州迪普科技股份有限公司 Web page method of testing and device
CN109508413A (en) * 2018-10-22 2019-03-22 中国银行股份有限公司 Job scheduling methods of exhibiting and device, storage medium and electronic equipment
CN111813467A (en) * 2019-04-10 2020-10-23 阿里巴巴集团控股有限公司 Interface refreshing method and device and readable storage medium
CN111813467B (en) * 2019-04-10 2024-07-02 阿里巴巴集团控股有限公司 Interface refreshing method and device and readable storage medium
CN116049588A (en) * 2022-12-30 2023-05-02 格兰菲智能科技有限公司 Page loading method, device, computer equipment and storage medium

Also Published As

Publication number Publication date
CN103530379B (en) 2017-01-04

Similar Documents

Publication Publication Date Title
CN103530379A (en) Tree structure data display method and device
US10671692B2 (en) Uniquely identifying and tracking selectable web page objects
CN106897361B (en) Label page grouping management system and method based on tree structure
US11037342B1 (en) Visualization modules for use within a framework for displaying interactive visualizations of event data
CN106909372B (en) Method and system for calculating purchase path of mobile terminal user
US20200019549A1 (en) Interactive parallel coordinates visualizations
CN107402995A (en) A kind of distributed newSQL Database Systems and method
CN102891765B (en) A kind of method realizing web network topology based on SNMP and HTML5
CN101488151B (en) System and method for gathering website contents
CN106354786A (en) Visual analysis method and system
CN103729337B (en) report conversion method and device
CN110795476B (en) Data writing method and device of ontology library
CN111428177A (en) Method and system for WEB content generation
CN106649805B (en) Efficient detection system and method for cross-browser layout compatibility of Web application
CN103809975A (en) Method for achieving intelligent cloud forms
CN102662666B (en) A kind of creation method of interface menu and device
CN109388791A (en) Chart Dynamic Display method, apparatus, computer equipment and storage medium
CN106874337A (en) The statistical query method and device of flow guiding relation
CN104090769B (en) The figure methods of exhibiting and device of a kind of business datum
WO2013186638A2 (en) Analyzing user interaction
CN109002334A (en) A kind of operation platform and its data processing method
CN110825382A (en) Front-end big data tree structure display method
CN104636394A (en) Displaying method, system and device for user generated content information
CA2955672A1 (en) Database grid search methods and systems
CN108572817B (en) Method, apparatus and medium for dynamic resource configuration based on business modeling

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant