CN114490658A

CN114490658A - Node display method, device, storage medium and program product

Info

Publication number: CN114490658A
Application number: CN202210108357.6A
Authority: CN
Inventors: 汪丹萍; 徐志轩; 胡赞华; 袁刚; 李保仓; 周振朝; 韩亚辉; 龚正
Original assignee: China Construction Bank Corp
Current assignee: China Construction Bank Corp
Priority date: 2022-01-28
Filing date: 2022-01-28
Publication date: 2022-05-13

Abstract

The embodiment of the specification provides a node display method, a node display device, a storage medium and a program product, which can be applied to the technical field of data storage. The method comprises the following steps: under the condition of receiving a node acquisition request sent by a client, feeding back node identifications of all candidate nodes to the client; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node; receiving a node selection instruction sent by a client; the node selection instruction comprises a node identifier of at least one target node; acquiring node path information corresponding to the target node; and sending the node path information to a client so that the client displays an extended path corresponding to the target node based on the node path information. By the method, consumed time and computing resources are reduced, the operations of searching keywords, secondary screening and the like are facilitated for a user, and the use experience of the user is improved.

Description

Node display method, device, storage medium and program product

Technical Field

Embodiments of the present disclosure relate to the field of data storage technologies, and in particular, to a node display method, apparatus, storage medium, and program product.

Background

In the process of front-end development, the data display is often involved. In many cases, in order to visually represent the corresponding relationship between data, data is often described through a hierarchical structure, for example, a certain data node includes a plurality of data branch nodes, each data branch node sequentially shows corresponding data sub-branch nodes, and finally, a corresponding tree structure is represented based on the hierarchical structure between data, so that a user can clearly and quickly obtain required data.

When a user selects a node corresponding to certain data, in order to obtain a better display effect, nodes on a path from a root node to the selected node in the tree structure are often displayed at one time, and other nodes are hidden. However, currently, when the path is obtained, it is often necessary to perform recursive traversal on all nodes in the tree to determine whether the node needs to be exposed or hidden. The traversal operation often consumes a lot of computing resources and time, and the traversal operation needs to be repeated every time a user selects a node, obviously consuming a lot of unnecessary time when the node is displayed. Therefore, a method for quickly and efficiently displaying a corresponding node based on a selection operation of a user is needed.

Disclosure of Invention

An object of the embodiments of the present specification is to provide a node display method, an apparatus, a storage medium, and a program product, so as to solve a problem of how to quickly and efficiently display a node.

In order to solve the foregoing technical problem, an embodiment of the present specification provides a node display method, including: under the condition of receiving a node acquisition request sent by a client, feeding back node identifications of all candidate nodes to the client; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node; receiving a node selection instruction sent by a client; the node selection instruction comprises a node identifier of at least one candidate node; the node identification of the at least one candidate node is used for marking a target node selected by a user; acquiring node path information corresponding to the target node; the node path information is used for describing a node extending path from a root node to a target node corresponding to the tree structure; and sending the node path information to a client so that the client displays an extended path corresponding to the target node based on the node path information.

An embodiment of the present specification provides a node display method, including: sending a node acquisition request to a server so that the server feeds back node identifications of all candidate nodes; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node; displaying node identifications of all candidate nodes; under the condition that an operation instruction of a node identifier of a target node selected by a user is received, generating a node selection instruction according to the node identifier of the target node; sending the node selection instruction to a server so that the server acquires node path information corresponding to the target node; the node path information is used for describing a node extending path from a root node to a target node corresponding to the tree structure; and under the condition that the node path information of the target node is received, showing an extended path corresponding to the target node.

An embodiment of the present specification further provides a node display apparatus, including: the node identification feedback module is used for feeding back the node identifications of all candidate nodes to the client under the condition of receiving a node acquisition request sent by the client; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node; the node selection instruction receiving module is used for receiving a node selection instruction sent by a client; the node selection instruction comprises a node identifier of at least one candidate node; the node identification of the at least one candidate node is used for marking a target node selected by a user; a node path information obtaining module, configured to obtain node path information corresponding to the target node; the node path information is used for describing a node extending path from a root node to a target node corresponding to the tree structure; and the node path information sending module is used for sending the node path information to the client so that the client displays an extended path corresponding to the target node based on the node path information.

An embodiment of the present specification further provides a node display apparatus, including: the node acquisition request sending module is used for sending a node acquisition request to the server so as to enable the server to feed back node identifications of all candidate nodes; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node; the node identifier display module is used for displaying the node identifiers of all the candidate nodes; the node selection instruction generation module is used for generating a node selection instruction according to the node identification of the target node under the condition of receiving an operation instruction of the node identification of the target node selected by a user; the node selection instruction sending module is used for sending the node selection instruction to a server so as to enable the server to obtain node path information corresponding to the target node; the node path information is used for describing a node extending path from a root node to a target node corresponding to the tree structure; and the extended path display module is used for displaying the extended path corresponding to the target node under the condition of receiving the node path information of the target node.

Embodiments of the present specification also provide a computer-readable storage medium on which a computer program/instruction is stored, where the computer program/instruction, when executed by a processor, implements the above node exhibition method.

Embodiments of the present specification further provide a computer program product, which includes a computer program/instruction, and when executed by a processor, the computer program/instruction implements the node exhibition method described above.

As can be seen from the technical solutions provided by the embodiments of the present specification, in the embodiments of the present specification, when a node is displayed, node path information corresponding to a target node is directly obtained according to selection of a user for the target node in displayed candidate nodes, and the node path information is fed back to a client, so that the client can directly display an extended path of the target node in a tree structure according to the node path information, and thus, the user can intuitively obtain a data hierarchy structure corresponding to the target node. By the method, when the extended path of the node is displayed, the tree corresponding to the node does not need to be sequentially traversed, consumed time and computing resources are reduced, the operation of searching keywords and performing secondary screening and the like by a user is facilitated, and the use experience of the user is improved.

Drawings

In order to more clearly illustrate the embodiments of the present specification or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the description below are only some embodiments described in the present specification, and other drawings can be obtained by those skilled in the art without creative efforts.

Fig. 1 is a structural diagram of a node display system according to an embodiment of the present disclosure;

fig. 2 is a flowchart of a node display method according to an embodiment of the present disclosure;

FIG. 3 is a diagram illustrating node identifiers of candidate nodes according to an embodiment of the present disclosure;

FIG. 4 is a diagram illustrating node identifiers of candidate nodes according to an embodiment of the present disclosure;

FIG. 5 is a diagram illustrating an extended path of a target node according to an embodiment of the present disclosure;

FIG. 6 is a schematic diagram illustrating an extended path of a secondary screening node according to an embodiment of the present disclosure;

FIG. 7 is a flowchart illustrating a node display method according to an embodiment of the present disclosure;

FIG. 8 is a flowchart illustrating a node display method according to an embodiment of the present disclosure;

FIG. 9 is a block diagram of a node display apparatus according to an embodiment of the present disclosure;

fig. 10 is a structural diagram of a node display apparatus according to an embodiment of the present disclosure.

Detailed Description

The technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present specification without any creative effort shall fall within the protection scope of the present specification.

In order to better understand the inventive concept of the present application, a node exhibition system according to an embodiment of the present specification is first introduced. As shown in fig. 1, the node exposure system 100 includes a server 110 and a client 120.

The server 110 may communicate with the client 120 and execute corresponding program logic upon request by the client 120. The server 110 may store corresponding data and node information corresponding to the data in the tree structure based on its own storage module or a corresponding storage system, and may also store a hierarchical relationship structure between the data, for example, may directly store corresponding information of the tree structure. The server 110 further has a data retrieval function, and can search corresponding data based on the corresponding retrieval instruction and based on the keyword or the node identifier.

The client 120 may communicate with the server 110. The client 120 may also interact with the user. Specifically, the client 120 may present data to a user, and receive an input instruction of the user, for example, obtain a voice instruction of the user by means of mouse click, screen touch, voice recognition, and the like. The client 120 may be preset with corresponding processing logic, and based on a corresponding instruction, the corresponding processing logic may be triggered to implement data processing or communicate with the server 110.

Specifically, the client may be a PC, an intelligent mobile communication device, a wearable intelligent device, and the like, which is not limited thereto.

It should be noted that, in the embodiment of the present disclosure, the description is only performed in order to better distinguish the functions implemented by different devices, and further, the interaction between the server and the client is taken. In practical application, the functional modules of the server can be integrated on the client, and the interaction and data processing between the client and the user are realized only through the client, and the interaction between the client and other devices is not involved. In this case, the communication process between the server and the client in the following description may be embodied on the communication exchange between the modules inside the client.

Based on the node display system, an embodiment of the present specification provides a node display method. The execution subject of the node display method is the node display system. As shown in fig. 2, the node presentation method may include the following implementation steps.

S210: the client sends a node acquisition request to the server.

The node acquisition request is used for requesting to acquire candidate nodes to be displayed. The request can be that after a user inputs a corresponding instruction to a client, the client triggers a corresponding program logic based on the instruction to generate the node acquisition request; the node acquisition request may also be generated by the client itself triggering the corresponding execution logic based on an instruction in the program during the program execution process. In practical application, the generation mode of the node acquisition request is not limited.

In the embodiment of the present specification, each candidate node corresponds to each item of data, and the data corresponding to the candidate node may be data containing text, numbers, symbols, and the like. The candidate nodes and the relation among the candidate nodes are stored in the server, and when the client needs to show the information corresponding to the candidate nodes to the user, the client sends a node obtaining request to the server to obtain the candidate nodes for showing.

In some embodiments, the node acquisition request may further include a search keyword. The search keywords are used for defining nodes required by the user. Specifically, under the condition that the node acquisition request includes the search keyword, the data corresponding to the node that the user desires to be displayed includes the search keyword, so that the displayed node can be limited according to the user requirement. The specific processing manner of the node acquisition request including the search keyword is further detailed in the subsequent steps.

S220: and the server feeds back the node identifications of all the candidate nodes to the client.

And after receiving the node acquisition request, the server calls node identifications of all candidate nodes stored in a self storage module or a corresponding database and feeds back the node identifications to the client.

The candidate nodes may be all nodes contained in the tree structure. In the tree structure, the parent-child node relationship corresponding to the candidate node may be associated with the reference relationship between the data. For example, the primary data a1 includes the secondary data B1, the secondary data B2, and the secondary data B3, and the candidate node corresponding to the primary data a1 is the parent node of the candidate node corresponding to each of the secondary data B1, the secondary data B2, and the secondary data B3, and accordingly, the tree structure has an extending relationship from top to bottom.

The candidate nodes may include a root node, and the root node is a root node in the tree structure. All nodes of the tree structure are corresponding to extension paths from the root node to the nodes of the tree structure. Under the corresponding data relationship, the data corresponding to all the candidate nodes are contained in the data large class corresponding to the root node. In some cases, in order to facilitate management of each independent data set, the root node may be a null node, and data corresponding to the root node has no practical significance, and the role of the root node is mainly to perform comprehensive management on all data so as to improve the rationality of node hierarchical distribution in the tree structure.

The candidate nodes are actually expression forms of data serving as nodes in the tree, data corresponding to the candidate nodes are directly fed back to the client, and the display effect can be influenced due to the fact that the data size is too large and the data sizes corresponding to different nodes are not consistent, so that only node identifications of the candidate nodes can be fed back. The node identification is mainly used for carrying out general description on the node data. In order to ensure that a user can know the approximate condition of the data corresponding to the candidate node according to the node identifier, the node identifier may be additionally set information for describing the data corresponding to the candidate node, or may be keyword information extracted from the data corresponding to the candidate node. In practical applications, the node identifier may be generated in other ways, so that the node identifier plays a role in identifying the node data.

In practical application, in order to avoid the situation that different nodes have the same node identifier, the length and the format of the node identifier can be limited in advance, and the repeatability among the node identifiers is avoided under the situation that the node identifier display is not influenced, so that a user can select the node identifiers effectively.

In some embodiments, the data stored by the server may be in the form of a forest, i.e., all candidate nodes are each constructed with a different tree. In this case, when the server sends the candidate node, the identifier of the tree where the candidate node is located may be marked, so that the client can better display the node data according to the structure of each tree in the forest.

Based on the implementation manner in step S210, in the case that the node acquisition request includes a search keyword, the server further needs to search, as a keyword node, a node including the search keyword from the candidate nodes. Correspondingly, when the node identification is fed back, only the node identification of the keyword node is fed back.

Under the condition that the candidate nodes correspond to the node data, the process of searching the keyword nodes can be to adopt a traversing mode to sequentially search the node data of each candidate node for whether the search keyword exists or not so as to determine the keyword nodes; or analyzing the relevance between the search keyword and the node identifier of each candidate node, and judging whether the corresponding node data contains the search keyword or not aiming at the candidate nodes with the relevance larger than a certain degree so as to improve the search efficiency.

In one example, the keyword nodes corresponding to the search keywords may be queried based on a string context fuzzy matching algorithm. Based on the fuzzy matching algorithm before and after the character strings, the final required keyword nodes are mainly determined according to the matching degree between the character strings. The specific process of implementing the fuzzy matching algorithm before and after the character string can be set based on the actual scene, and is not described herein again.

In practical application, the corresponding manner of screening the keyword nodes may be selected according to requirements, which is not described herein again.

In some embodiments, if no candidate node containing the search keyword is found after the search keyword is received, search failure information may be fed back to the client. And the search failure information is used for indicating that no candidate node containing the search keyword exists currently. After receiving the search failure information, the client can display corresponding prompt information to the user to remind the user that the candidate node containing the search keyword is not found, and the search keyword can be input again or the display process is finished.

In some embodiments, to better show the candidate node, the server may also send node relationship information corresponding to the candidate node to the client. The node relationship information is used to describe the relationship of candidate nodes in the corresponding tree structure, for example, the node relationship information may include the correspondence between each parent node and child node. After receiving the node relation information, the client can display the candidate nodes according to the hierarchical relation among the node data based on the node relation information so as to obtain a better display effect.

S230: and the client displays the node identifications of all the candidate nodes.

After receiving the node identifiers of the candidate nodes, the client may display the node identifiers of the candidate nodes. In practical applications, the client may include a display device such as a display or an electronic display screen, and the client may display the node identifier of the candidate node through the output device of the type, specifically, the node identifier may be presented on the display device for the user to view.

The node identifiers may be arranged at will or based on a certain rule. For example, based on the example in the above steps, when the node obtaining request includes node relation information, presentation may be performed based on the correspondence of the candidate nodes in the tree structure, so that the user can more clearly grasp the positions of different candidate nodes in the tree structure.

Fig. 3 is a schematic diagram showing node identifiers of all candidate nodes according to the foregoing embodiment. The first-level node, the second-level node and the third-level node respectively represent candidate nodes of different levels. The primary node a1 includes two child nodes, i.e., a secondary node B1 and a secondary node B2, and the secondary node B1 includes two child nodes, i.e., a tertiary node C1 and a tertiary node C2. The primary node A2 includes a child node that is a secondary node B3, and the secondary node B3 also includes a child node that is a tertiary node C3. Through the way of illustration in the example of fig. 2, the hierarchical structure and arrangement between different nodes can be clearly known, which is convenient for the user to view.

However, the node acquisition request includes a search keyword, so that when the server feeds back keyword nodes including the search keyword, the keyword nodes may not have a direct data hierarchy corresponding relationship, and if the keyword nodes are still displayed based on the node relationship information, normal representation of the relationship between data may be affected, and user experience may be affected.

Therefore, in this embodiment and other application scenarios, the corresponding candidate nodes may also be directly presented, and the arrangement order of the candidate nodes may be associated with only the attributes of the candidate nodes, such as the modification time or the user acquisition times.

Fig. 4 is a schematic diagram showing node identifiers of candidate nodes according to the foregoing embodiment, in which keyword nodes including search keywords are shown. The keyword nodes of different levels do not distinguish the level relation, and a user can directly select the nodes which are desired to be further viewed by viewing the displayed node identifiers.

In practical application, other types of display modes can be selected according to application requirements to adapt to different display requirements, and the display mode is not limited to the above examples.

The node identifier displayed by the client can be selected by a user to trigger a corresponding instruction, specifically, a point can be embedded in a front-end display page in advance, a corresponding node identifier is determined based on a click operation of the user, and the node identifier is used as the node identifier selected by the user to execute subsequent processing steps.

S240: and the client generates a node selection instruction according to the node identification of the target node under the condition of receiving an operation instruction of the node identification of the target node selected by the user.

When the node identifiers of the candidate nodes are displayed, the user can execute selection operation to select corresponding nodes from the displayed candidate nodes according to the requirement of the user. The selected node is the target node. Specifically, the operation instruction for selecting the node identifier of the target node may be an operation of directly clicking a corresponding target node on the screen, or a selection operation of moving a mouse to select a corresponding target node, and the corresponding format of the operation instruction may be set according to a requirement in an actual application, which is not limited to the above example.

And under the condition of acquiring the operation instruction of the user, generating a node selection instruction according to the node identifier of the target node. The node selection instruction may directly include the node identifier of the target node, or may include other types of identification information, so that the server can acquire the target node corresponding to the target node in the subsequent display process.

S250: and the client sends the node selection instruction to the server.

After generating the node selection instruction, the client may send the node selection instruction to the server, so that the server performs subsequent steps based on the node selection instruction.

S260: the server acquires node path information corresponding to the target node.

After the server parses the node selection instruction to determine a target node, the server may obtain node path information corresponding to the target node. The node path information is used to describe a node extension path corresponding to the tree structure from the root node to the target node. And under the condition that all candidate nodes form a tree by taking the root node as an ancestor node, each candidate node corresponds to an extension path from the root node to the candidate node. The node path information is information describing the extended path.

In some embodiments, the node path information includes node identifications of all candidate nodes on the node extension path, and an order of the node identifications of the candidate nodes in the node path information corresponds to an extension order of the candidate nodes in the node extension path.

To illustrate by using a specific example, assuming that the node selected by the user is node X, the node id of node X is 01010900, and an extended path from the root node to node X sequentially includes root node, node Y, node Z and node X, and the corresponding node ids are 01, 0101, 010109 and 01010900, respectively, the node path information may be "01/0101/010109/01010900". The client may obtain each node on the extended path from the root node to the target node by parsing the node path.

In some embodiments, before the node path information is obtained, it may be further determined whether the target node is an empty node. If the target node is a null node, corresponding node data does not exist, and the target node does not have actual reference significance correspondingly. And under the condition that the target node is not a null node, acquiring node path information corresponding to the target node. And under the condition that the target node is an empty node, empty node prompt information can be fed back to the client to remind a user that the target node is an empty node, and the empty node prompt information does not have actual reference significance.

S270: and the server sends the node path information to the client.

After the node path information is acquired, the server may send the node path information to the client, so that the client performs subsequent node display steps based on the node path information.

S280: and the client displays an extended path corresponding to the target node based on the node path information.

After the client acquires the node path information, the client can acquire the extended path information corresponding to the target node in the tree structure by analyzing the node path information. Correspondingly, the extension path corresponding to the target node can be effectively displayed according to the preset format, so that a user can intuitively and effectively know the distribution condition of the target node in the tree structure.

Fig. 5 is a schematic diagram showing an extended path corresponding to a target node. In this example, the target nodes selected by the user are the third-level node C1 and the third-level node C2, and then the node path information corresponding to the third-level node C1 and the third-level node C2 are obtained and fed back to the client. The client side respectively obtains the extended paths corresponding to the target nodes based on the node path information, and displays the extended paths on the display device, wherein the final display effect is as shown in fig. 5. The user can clearly and intuitively acquire the hierarchical structure and the corresponding relation between the nodes according to the displayed extension path.

In some embodiments, after presenting the extended path, the user may also perform a secondary screening. Specifically, the user may input the secondary screening keyword, so as to perform further screening on the basis of the target node obtained by the current screening.

After receiving the secondary screening keywords, the client may generate a secondary screening instruction, where the secondary screening instruction includes the secondary screening keywords.

And after the client sends the secondary screening instruction to the server, the server further searches in the determined keyword nodes, determines the secondary screening nodes containing the secondary screening keywords in the keyword nodes, acquires node path information corresponding to the secondary screening nodes and sends the node path information to the client.

And after receiving the node path information of the secondary screening node, the client displays an extension path corresponding to the secondary screening node. The specific analysis and display process may refer to the introduction of the process of displaying the target node in the foregoing steps, and will not be described herein again.

A specific example is used for illustration, in this example, the keyword nodes obtained after the user inputs the search keyword are the third-level node C1 and the third-level node C2; after the user inputs the secondary screening keywords, the server searches the secondary screening keywords in the tertiary node C1 and the tertiary node C2, and determines that only the node data of the tertiary node C1 contains the secondary screening keywords. The server determines that the tertiary node C1 is a secondary screening node, and obtains corresponding node path information to feed back to the client, and the effect of the presented extended path is as shown in fig. 6.

It should be noted that, on the basis of the secondary screening, the user may also perform three, four or even higher-order screening, and the screening process may be performed with reference to the secondary screening process. For other situations in the screening process, for example, the situation that the corresponding node is not found, may also be processed based on the foregoing processing steps, and will not be described herein again.

Through the secondary screening process, different requirements of the user are met, multi-level node display effects are facilitated, and the use experience of the user is improved.

In some embodiments, the illustrated extended path only includes the extended path from the root node to the target node. In practical application, the target node is not a leaf node, that is, the target node also has a corresponding child node.

In this case, in order to obtain a better display effect, the node identifiers of the child nodes of the target node may also be obtained, and the node identifiers of the child nodes of the target node are sent to the client. After the client acquires the node identifier of the child node of the target node, the client can further embody an extended path from the target node to the child node in the extended path, so that a user can acquire more information.

Specifically, when the client displays the extended path, the client may also label the target node and the child node in the extended path, so as to ensure that the user does not confuse the target node and the child node corresponding to the target node. The labeling mode may be a text annotation mode, or may be embodied in different display formats, which is not limited to this.

By displaying the child nodes of the target node, more information can be presented, and the user can effectively know the hierarchical structure of the data, so that the use experience of the user is improved.

Based on the introduction of the embodiment of the node display method, it can be seen that, when the node is displayed, according to the selection of the user on the target node in the displayed candidate nodes, the method directly obtains the node path information corresponding to the target node, and feeds the node path information back to the client, so that the client can directly display the extended path of the target node in the tree structure according to the node path information, and the user can visually obtain the data hierarchy structure corresponding to the target node. By the method, when the extended path of the node is displayed, the tree corresponding to the node does not need to be sequentially traversed, consumed time and computing resources are reduced, the operation of searching keywords and performing secondary screening and the like by a user is facilitated, and the use experience of the user is improved.

Another node display method according to the embodiment of the present disclosure is introduced based on the node display method corresponding to fig. 2. The execution main body of the node display method is a server. As shown in fig. 7, the node display method includes the following specific implementation steps.

S710: under the condition of receiving a node acquisition request sent by a client, feeding back node identifications of all candidate nodes to the client; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node.

For the specific description of this step, reference may be made to the descriptions in steps S210 and S220, which are not described herein again.

S720: receiving a node selection instruction sent by a client; the node selection instruction comprises a node identifier of at least one target node; the target node belongs to the candidate node.

For the specific description of this step, reference may be made to the descriptions in steps S230, S240, and S250, which are not described herein again.

S730: acquiring node path information corresponding to the target node; the node path information is used for describing a node extension path corresponding to the tree structure from the root node to the target node.

For the specific description of this step, reference may be made to the description in step S260, and details are not described here.

S740: and sending the node path information to a client so that the client displays an extended path corresponding to the target node based on the node path information.

For the specific description of this step, reference may be made to the descriptions in steps S270 and S280, which are not described herein again.

Another node display method according to the embodiment of the present specification is introduced based on the node display method corresponding to fig. 2. The execution main body of the node display method is a client. As shown in fig. 8, the node display method includes the following specific implementation steps.

S810: sending a node acquisition request to a server so that the server feeds back node identifications of all candidate nodes; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node.

S820: and displaying the node identifications of all the candidate nodes.

For the specific description of this step, reference may be made to the description in step S230, which is not described herein again.

S830: and under the condition that an operation instruction of selecting the node identifier of the target node by a user is received, generating a node selection instruction according to the node identifier of the target node.

For the specific description of this step, reference may be made to the description in step S240, and details are not described here.

S840: sending the node selection instruction to a server so that the server acquires node path information corresponding to the target node; the node path information is used for describing a node extension path corresponding to the tree structure from the root node to the target node.

For the specific description of this step, reference may be made to the descriptions in steps S250 and S260, which are not described herein again.

S850: and under the condition that the node path information of the target node is received, showing an extended path corresponding to the target node.

For the specific description of this step, reference may be made to the descriptions in steps S270 and S280, and details are not repeated here.

A node display apparatus according to an embodiment of the present disclosure is introduced based on a node display method corresponding to fig. 7. The node showing device can be arranged on the server. As shown in fig. 9, the node exhibition apparatus includes the following modules.

A node identifier feedback module 910, configured to feed back node identifiers of all candidate nodes to a client when receiving a node acquisition request sent by the client; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node.

A node selection instruction receiving module 920, configured to receive a node selection instruction sent by a client; the node selection instruction comprises a node identifier of at least one candidate node; the node identification of the at least one candidate node is used to mark the user-selected target node.

A node path information obtaining module 930, configured to obtain node path information corresponding to the target node; the node path information is used for describing a node extension path corresponding to the tree structure from the root node to the target node.

A node path information sending module 940, configured to send the node path information to the client, so that the client displays an extended path corresponding to the target node based on the node path information.

A node display apparatus according to an embodiment of the present disclosure is introduced based on a node display method corresponding to fig. 8. The node exhibition apparatus may be provided on a client. As shown in fig. 10, the node exhibition apparatus includes the following modules.

A node obtaining request sending module 1010, configured to send a node obtaining request to a server, so that the server feeds back node identifiers of all candidate nodes; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node.

And a node identifier display module 1020, configured to display node identifiers of all candidate nodes.

The node selection instruction generating module 1030 is configured to generate a node selection instruction according to the node identifier of the target node when an operation instruction of selecting the node identifier of the target node by the user is received.

A node selection instruction sending module 1040, configured to send the node selection instruction to a server, so that the server obtains node path information corresponding to the target node; the node path information is used for describing a node extension path corresponding to the tree structure from the root node to the target node.

An extended path showing module 1050, configured to show an extended path corresponding to the target node when the node path information of the target node is received.

Based on the node display method corresponding to fig. 2, an embodiment of the present specification provides a computer-readable storage medium on which a computer program/instruction is stored. The computer-readable storage medium can be read by a processor based on an internal bus of a device, and program instructions in the computer-readable storage medium are implemented by the processor.

In this embodiment, the computer-readable storage medium may be implemented in any suitable manner. The computer-readable storage medium includes, but is not limited to, a Random Access Memory (RAM), a Read-Only Memory (ROM), a Cache (Cache), a Hard Disk Drive (HDD), a Memory Card (Memory Card), and the like. The computer storage medium stores computer program instructions. The computer program instructions, when executed, implement the program instructions or modules of the embodiments corresponding to fig. 1 of the present specification.

In this embodiment, the processor may be implemented in any suitable manner. For example, the processor may take the form of, for example, a microprocessor or processor and a computer-readable medium that stores computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, an embedded microcontroller, and so forth. In particular, the processor, when arranged on a server or a client, may perform the method steps in the embodiment corresponding to fig. 7 or the embodiment corresponding to fig. 8, respectively.

Based on the node display method corresponding to fig. 1, an embodiment of the present specification provides a computer program product including a computer program/instruction. The computer program product may be a program written in a corresponding computer program language, stored in a corresponding storage device in a programmed manner, and transmittable via a computer network. The computer program product may be executed by a processor. In the embodiments of the present specification, the computer program product, when being executed, implements the program instructions or modules of the node exhibition method according to the embodiments corresponding to fig. 7 or fig. 8.

It should be noted that the node display method, apparatus, storage medium, and program product may be applied to the technical field of data storage, and may also be applied to other technical fields except the technical field of data storage, which is not limited to the above.

While the process flows described above include operations that occur in a particular order, it should be appreciated that the processes may include more or less operations that are performed sequentially or in parallel (e.g., using parallel processors or a multi-threaded environment).

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the specification. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.

The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.

Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, tape storage, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that may be used to store information that may be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.

As will be appreciated by one skilled in the art, embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, embodiments of the present description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.

The embodiments of this specification may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The described embodiments may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment. In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of an embodiment of the specification. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.

The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims

1. A node display method is applied to a server, and comprises the following steps:

under the condition of receiving a node acquisition request sent by a client, feeding back node identifications of all candidate nodes to the client; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node;

receiving a node selection instruction sent by a client; the node selection instruction comprises a node identifier of at least one target node; the target node belongs to the candidate node;

acquiring node path information corresponding to the target node; the node path information is used for describing a node extending path from a root node to a target node corresponding to the tree structure;

and sending the node path information to a client so that the client displays an extended path corresponding to the target node based on the node path information.

2. The method according to claim 1, wherein the node path information includes node identifications of all candidate nodes on a node extension path; the rank order of the node identifications of the candidate nodes in the node path information corresponds to the extension order of the candidate nodes in the node extension path.

3. The method of claim 1, wherein the node acquisition request includes a search keyword, and the feeding back node identifiers of all candidate nodes to the client comprises:

screening keyword nodes containing the search keywords from all candidate nodes;

feeding back the node identification of the keyword node to the client;

correspondingly, the node selection instruction comprises a node identifier of at least one keyword node.

4. The method of claim 3, wherein the screening of all candidate nodes for keyword nodes containing the search keyword comprises:

and querying keyword nodes corresponding to the search keywords based on fuzzy matching of the character strings.

5. The method of claim 3, wherein after sending the node path information to the client to cause the client to expose the extended path corresponding to the target node based on the node path information, further comprising:

receiving a secondary screening instruction sent by a client; the secondary screening instruction comprises secondary screening keywords;

determining secondary screening nodes containing the secondary screening keywords in the keyword nodes;

acquiring node path information corresponding to the secondary screening node;

and sending the node path information of the secondary screening node to a client so that the client displays an extension path corresponding to the secondary screening node based on the node path information of the secondary screening node.

6. The method of claim 3, wherein after the screening of all candidate nodes for keyword nodes containing the search keyword, further comprising:

and if the candidate node containing the search keyword does not exist, feeding back search failure information to the client so that the client can remind a user that the candidate node containing the search keyword is not searched.

7. The method of claim 1, wherein the obtaining node path information corresponding to the target node comprises:

judging whether the target node is an empty node or not;

and under the condition that the target node is not a null node, acquiring node path information corresponding to the target node.

8. The method of claim 1, wherein after sending the node path information to a client, further comprising:

under the condition that the target node is not a leaf node in the tree structure, acquiring a node identifier of a child node of the target node;

and sending the node identification of the child node of the target node to a client so that the client displays the extending path of the target node to the child node in the tree structure.

9. A node display method is characterized by being applied to a client; the method comprises the following steps:

sending a node acquisition request to a server so that the server feeds back node identifications of all candidate nodes; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node;

displaying node identifications of all candidate nodes;

under the condition that an operation instruction of a node identifier of a target node selected by a user is received, generating a node selection instruction according to the node identifier of the target node;

sending the node selection instruction to a server so that the server acquires node path information corresponding to the target node; the node path information is used for describing a node extending path from a root node to a target node corresponding to the tree structure;

and under the condition that the node path information of the target node is received, showing an extended path corresponding to the target node.

10. The method of claim 9, wherein said presenting node identifications of all candidate nodes comprises:

and displaying the node identifications of all the candidate nodes based on the corresponding relations of all the candidate nodes in the tree structure.

11. The method of claim 9, wherein said exposing the extended path corresponding to the target node comprises:

only candidate nodes in the extended path are shown on a display device of the client.

12. A node demonstration apparatus comprising:

the node identification feedback module is used for feeding back the node identifications of all candidate nodes to the client under the condition of receiving a node acquisition request sent by the client; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node;

the node selection instruction receiving module is used for receiving a node selection instruction sent by a client; the node selection instruction comprises a node identifier of at least one candidate node; the node identification of the at least one candidate node is used for marking a target node selected by a user;

a node path information obtaining module, configured to obtain node path information corresponding to the target node; the node path information is used for describing a node extending path from a root node to a target node corresponding to the tree structure;

and the node path information sending module is used for sending the node path information to the client so that the client displays an extended path corresponding to the target node based on the node path information.

13. A node exhibition apparatus, comprising:

the node acquisition request sending module is used for sending a node acquisition request to the server so as to enable the server to feed back node identifications of all candidate nodes; the candidate nodes comprise root nodes; the candidate nodes form a tree structure based on the root node;

the node identifier display module is used for displaying the node identifiers of all the candidate nodes;

the node selection instruction generation module is used for generating a node selection instruction according to the node identification of the target node under the condition of receiving an operation instruction of the node identification of the target node selected by a user;

the node selection instruction sending module is used for sending the node selection instruction to a server so as to enable the server to obtain node path information corresponding to the target node; the node path information is used for describing a node extending path from a root node to a target node corresponding to the tree structure;

and the extended path display module is used for displaying the extended path corresponding to the target node under the condition of receiving the node path information of the target node.

14. A computer-readable storage medium, on which a computer program/instructions is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1-11.

15. A computer program product comprising computer programs/instructions, characterized in that the computer programs/instructions, when executed by a processor, implement the steps of the method according to any of claims 1-11.