Retrieval result data organization method and device, equipment and medium

Abstract

The invention relates to the technical field of computers, and provides a retrieval result data organization method and device, equipment and a medium. The method comprises the following steps: acquiring a retrieval result set obtained by retrieval from a database; traversing each node in the retrieval result set to obtain a target node set with a corresponding father-child node relationship, and obtaining a corresponding supplementary result set from a database based on the father-child node relationship contained in the target node set; and constructing a tree-shaped retrieval result based on the retrieval result set and the supplementary result set. According to the scheme, missing nodes in the retrieval result are supplemented, the problem that the superior-subordinate relation in the retrieval result is not clear is avoided, the structural disorder of the retrieval result is avoided, and the user experience is improved.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method, device, equipment and medium for organizing search result data. Background Art

[0002] Tree retrieval is a database indexing method that manages and queries data by building a tree structure. The establishment of a tree index allows the database to quickly locate the location of data without traversing the entire dataset, making data search much more convenient.

[0003] The tree-structured data retrieval in the existing technology cannot directly construct a complete tree-structured retrieval result. If such a result is directly returned to the user, the missing of certain nodes will lead to unclear hierarchical relationships in the retrieval results, resulting in a chaotic structure of the retrieval results and a reduced user experience. Summary of the Invention

[0004] In view of this, and in response to the problems existing in the prior art, the present disclosure provides a method, apparatus, device and medium for organizing search result data.

[0005] According to a first aspect of the present invention, a method for organizing search result data is provided, comprising: Obtaining a search result set from a database; Traversing each node in the search result set to obtain a target node set having a corresponding parent-child node relationship, and obtaining a corresponding supplementary result set from the database based on the parent-child node relationship contained in the target node set; A tree-shaped search result is constructed based on the search result set and the supplementary result set.

[0006] In some embodiments, the step of traversing each node in the search result set to obtain a target node set having a corresponding parent-child node relationship includes: Traverse the parent node ID and child node list corresponding to each node in the search result set; Determining that the node has a corresponding parent-child node relationship based on the parent node ID corresponding to the node being non-empty and / or the child node list being non-empty; All nodes in the search result set that have corresponding parent-child node relationships are obtained to obtain a target node set.

[0007] In some embodiments, the step of constructing a tree-shaped search result based on the search result set and the supplementary result set includes: A tree-shaped search result is constructed for the search result set and the supplementary result set based on the hierarchical relationship and the parent-child node relationship corresponding to each node in the search result set and the supplementary result set.

[0008] In some embodiments, the step of constructing a tree-shaped search result for the search result set and the supplementary result set based on the hierarchical relationship and parent-child node relationship corresponding to each node in the search result set and the supplementary result set includes: Obtaining any node in the search result set and the supplementary result set as a comparison node, and comparing the level value of the comparison node with the level comparison value; Determine the latest value of the hierarchical comparison value based on the comparison result and obtain all nodes of the same hierarchical level whose hierarchical values ​​are the latest value in the search result set and the supplementary result set; obtaining any other node in the search result set and the supplemented result set as a new comparison node and using the latest value of the level comparison value as a new level comparison value, returning to the step of comparing the level value of the comparison node with the level comparison value until the search result set and the supplemented result set are traversed; A tree-shaped search result is constructed based on all the nodes at the same level and their corresponding parent-child node relationships.

[0009] In some embodiments, the step of obtaining any node in the search result set and the supplementary result set as a comparison node and comparing the level value of the comparison node with the level comparison value includes: Setting the initial value of the level comparison value to the maximum level threshold; Any node in the search result set and the supplementary result set is obtained as a comparison node, and the level value of the comparison node is compared with the level comparison value.

[0010] In some embodiments, the step of determining the latest value of the hierarchical comparison value based on the comparison result and obtaining all nodes of the same hierarchical level in the search result set and the supplementary result set whose hierarchical values ​​are the latest value includes: determining a latest value of the level comparison value based on a smaller level value between the level comparison value and the level value of any one of the nodes; Each node in the search result set and the supplemented result set is traversed to obtain nodes at the same level whose level value is the latest value.

[0011] In some embodiments, the step of traversing the search result set and the supplemented result set comprises: In response to all nodes in the search result set and the supplementary result set being divided into corresponding levels, the nodes respectively contained in each level are obtained.

[0012] According to a second aspect of the present invention, there is provided a device for organizing search result data, the device comprising: The first module is used to obtain a search result set obtained by searching from a database; The second module is configured to traverse each node in the search result set to obtain a target node set having a corresponding parent-child node relationship, and obtain a corresponding supplementary result set from the database based on the parent-child node relationship contained in the target node set; The third module is used to construct a tree-shaped search result based on the search result set and the supplementary result set.

[0013] According to a third aspect of the present invention, there is further provided an electronic device, comprising: at least one processor; and The memory stores a computer program that can be run on the processor, and the processor executes the above-mentioned search result data organization method when executing the program.

[0014] According to a fourth aspect of the present invention, a computer-readable storage medium is further provided. The computer-readable storage medium stores a computer program. When the computer program is executed by a processor, the aforementioned search result data organizing method is executed.

[0015] The above-mentioned search result data organization method traverses a search result set obtained from a database based on search conditions, obtains a target node set with corresponding parent-child node relationships, and retrieves a corresponding supplementary result set from the database based on the contained parent-child node relationships. A tree-shaped search result is constructed based on the search result set and the supplementary result set. This method constructs a complete tree-structured search result for the search results, supplements missing nodes in the search results, avoids unclear hierarchical relationships in the search results, and reduces structural clutter in the search results, thereby improving the user experience.

[0016] In addition, the present invention also provides a retrieval result data organization device, an electronic device and a computer-readable storage medium, which can also achieve the above-mentioned technical effects and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other embodiments can be obtained based on these drawings without paying any creative work.

[0018] Figure 1 A flowchart of a method for organizing search result data provided by one embodiment of the present invention; Figure 2 A schematic diagram of a front-end inputting search-related parameters is provided for another embodiment of the present invention; Figure 3 A schematic structural diagram of a search result data organizing device provided by another embodiment of the present invention; Figure 4 is a diagram showing the internal structure of an electronic device according to another embodiment of the present invention; Figure 5 This is a structural diagram of a computer-readable storage medium in another embodiment of the present invention. DETAILED DESCRIPTION

[0019] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the embodiments of the present invention are further described in detail below in conjunction with specific embodiments and with reference to the accompanying drawings.

[0020] It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are for distinguishing two non-identical entities with the same name or non-identical parameters. It can be seen that "first" and "second" are only for the convenience of expression and should not be understood as limitations on the embodiments of the present invention. Subsequent embodiments will not explain this one by one.

[0021] In one embodiment, please refer to Figure 1 As shown, the present invention provides a method 100 for organizing search result data, specifically comprising the following steps: Step 101, obtaining a search result set from a database; Step 102: traverse each node in the search result set to obtain a target node set having a corresponding parent-child node relationship, and obtain a corresponding supplementary result set from the database based on the parent-child node relationship contained in the target node set; Step 103: construct a tree-shaped search result based on the search result set and the supplementary result set.

[0022] Among them, users input relevant parameters through the front end. Figure 2 A schematic diagram of a front-end input retrieval related parameter is provided for another embodiment of the present invention, such as Figure 2 As shown, select the field to be searched through the drop-down box, the search value entered in the input box, the conditions for sorting the search results, etc., and construct the corresponding search conditions based on the search-related parameters and condition constructor passed in from the front end. Based on the constructed search conditions, the corresponding search results are retrieved from the database.

[0023] The above-mentioned search result data organization method realizes the construction of a complete tree-structured search result for the search results, supplements the missing nodes in the search results, avoids the problem of unclear superior-subordinate relationships in the search results, avoids structural confusion of the search results, and improves user experience.

[0024] According to several embodiments of the present invention, the step of traversing each node in a search result set to obtain a target node set having a corresponding parent-child node relationship includes: traversing the parent node ID and child node list corresponding to each node in the search result set; determining that a node has a corresponding parent-child node relationship based on whether the parent node ID and / or child node list corresponding to the node are non-empty; and obtaining all nodes in the search result set having a corresponding parent-child node relationship to obtain a target node set. Separating the target node set having a parent-child node relationship from the search result set and further supplementing the corresponding parent node or child node based on the parent-child node relationship of the target node provides strong support for the integrity of the tree-shaped search result construction. Furthermore, this method of obtaining the target node set is simple and helps improve the efficiency of the tree-shaped search result construction.

[0025] In a specific example, a search is performed in the database based on the search parameters passed in by the front-end and the corresponding search conditions obtained by the condition builder, resulting in a search result set. Because the result set does not have a complete tree structure, it is missing relevant nodes that do not belong to the search results. An all-node set (allDatas) is constructed and all nodes in the search result set are added to it. Then, all nodes in the search result set (treeDataList) are traversed to obtain the target node set in the search result set that has corresponding parent-child node relationships. Among them, the specific steps for obtaining the target node set with corresponding parent-child node relationship in the search result set are: traversing the ID (IdentityDocument) field of each node in the search result set, and determining whether the node being traversed has a corresponding parent node based on whether the corresponding parent node ID of the ID field is empty. If the corresponding parent node ID of the ID field of the node being traversed is empty, it means that the node being traversed has no corresponding parent node; if the corresponding parent node ID of the ID field of the node being traversed is not empty, it means that the node being traversed has a corresponding parent node, then its corresponding parent node is added to all node sets, and its corresponding parent node ID is recorded in the supplementary node ID set (needNewId), so that the corresponding supplementary result set can be retrieved directly from the database based on the supplementary node ID set. Traverse the child node list in the object of each node in the search result set, and determine whether the node being traversed has a corresponding child node based on whether the child node list is empty. If the child node list corresponding to the node being traversed is not empty, it means that the node being traversed has a corresponding child node, then its corresponding child node is added to the set of all nodes, and its corresponding child node ID is recorded in the supplementary node ID set (needNewId), so that the corresponding supplementary result set can be retrieved from the database directly based on the supplementary node ID set. It can be understood that there may be multiple child nodes for the node being traversed, but if it has a corresponding parent node, there will only be one corresponding parent node. Among them, the specific steps of obtaining the corresponding result set based on the supplementary node ID set are: based on the parent node ID and / or child node ID corresponding to each target node in the target node set, the corresponding supplementary result set is retrieved from the database. Specifically, all IDs in the supplementary node ID set are used as new search conditions to retrieve the corresponding supplementary result set from the database.

[0026] According to several embodiments of the present invention, the step of constructing a tree-shaped search result based on a search result set and a supplementary result set includes: constructing a tree-shaped search result for the search result set and the supplementary result set based on the hierarchical relationship and parent-child node relationship corresponding to each node in the search result set and the supplementary result set. Constructing the tree-shaped search result based on the search result set and the supplementary result set ensures a complete tree structure of the search result, and at the same time, clarifies the hierarchical relationship in the search result, thereby avoiding confusion in the search result.

[0027] In a specific example, a complete tree structure is constructed based on the node's own attribute information, parent-child node information, hierarchical information, etc., wherein the main structure of the tree structure is shown in Table 1. Table 1

[0028] The relevant structure of parent node information is shown in Table 2: Table 2

[0029] According to several embodiments of the present invention, the step of constructing a tree-shaped search result for the search result set and the supplementary result set based on the hierarchical relationship and parent-child node relationship corresponding to each node in the search result set and the supplementary result set includes: obtaining any node in the search result set and the supplementary result set as a comparison node, comparing the hierarchical value of the comparison node with the hierarchical comparison value; determining the latest value of the hierarchical comparison value based on the comparison result and obtaining all nodes at the same level in the search result set and the supplementary result set whose hierarchical values ​​are the latest values; obtaining any other node in the search result set and the supplementary result set as a new comparison node and using the latest value of the hierarchical comparison value as the new hierarchical comparison value, returning to the step of comparing the hierarchical value of the comparison node with the hierarchical comparison value until the search result set and the supplementary result set are traversed; and constructing a tree-shaped search result based on all nodes at the same level and their corresponding parent-child node relationships. A hierarchical comparison value is set as a benchmark for comparing the hierarchical values, and nodes consistent with the latest value of the hierarchical comparison value are obtained from the search result set and the supplementary result set as nodes at the same level, thereby ensuring the integrity of the corresponding hierarchical relationships in the construction of the tree-shaped search result.

[0030] According to some embodiments of the present invention, the steps of obtaining any node in the retrieval result set and the supplementary result set as a comparison node, and comparing the level value of the comparison node with the level comparison value include: setting the initial value of the level comparison value to the maximum level threshold; obtaining any node in the retrieval result set and the supplementary result set as a comparison node, and comparing the level value of the comparison node with the level comparison value. In a specific example, the integer maximum value can be used as the initial value of the level comparison value, and all node sets refer to the retrieval result set and the supplementary result set, each of which has a corresponding level value and ID. Using the maximum level threshold as the initial value of the level comparison ensures that each node in the retrieval result set and the supplementary result set can be assigned to the corresponding level, avoiding the problem of nodes not being assigned to the corresponding level.

[0031] According to some embodiments of the present invention, the steps of determining the latest value of the level comparison value based on the comparison result and obtaining all nodes of the same level whose level values ​​are the latest values ​​in the retrieval result set and the supplementary result set include: determining the latest value of the level comparison value based on the smaller level value between the level comparison value and the level value of any node; traversing each node in the retrieval result set and the supplementary result set to obtain nodes of the same level whose level values ​​are the latest values. Since the maximum level threshold is used as the initial value of the level comparison value, any node in the retrieval result set and the supplementary result set is compared with it to determine the latest value, and based on the latest value, the nodes in the retrieval result set and the supplementary result set that are consistent with the latest value are filtered out and used as nodes of the same level to avoid the problem of missing nodes corresponding to each level.

[0032] According to several embodiments of the present invention, the steps of traversing the search result set and the supplementary result set until the traversal is completed include: in response to all nodes in the search result set and the supplementary result set being divided into corresponding levels, obtaining the nodes contained in each level. Since the nodes contained in each level represent a clear hierarchical relationship, and at the same time, for nodes with a parent-child node relationship, their corresponding parent-child node relationship is also clear, a complete tree-structured search result can be constructed based on the nodes contained in each level and the corresponding parent-child node relationship, thereby avoiding structural confusion in the search results and improving the user experience.

[0033] In a specific example, starting with the initial value of the level comparison value, any one node is selected from all node sets and the corresponding level value and ID are obtained. The level value corresponding to this selected node is compared with the initial value of the level comparison value. If the level value corresponding to this selected node is less than the initial value of the level comparison value, the level comparison value is updated with the level value corresponding to this selected node as the latest value of the level comparison value. At the same time, all nodes in the node set are traversed to obtain nodes whose level values ​​are consistent with the latest value of the level comparison value to obtain nodes of the same level. The obtained nodes of the same level are deleted from all node sets. If all nodes in all node sets are nodes of the same level, they are set as leaf nodes, indicating that there are no nodes at the next level. According to the steps of obtaining nodes of the same level, continue to select a node from all node sets and obtain the corresponding level value and ID, compare it with the latest value of the level comparison value, if the level value corresponding to this selected node is less than the latest value of the level comparison value, then update the level comparison value with the level value corresponding to this selected node, as the new latest value of the level comparison value, and at the same time traverse the nodes in all node sets to obtain nodes whose level values ​​are consistent with the new latest value of the level comparison value. The above steps are repeated until all nodes in all node sets are divided into corresponding levels, and the nodes contained in each level are obtained, so as to construct a tree-shaped search result based on the nodes contained in each level and their corresponding parent-child node relationships. Furthermore, if the user provides a condition for sorting the nodes through the front end in the initial search condition, the tree-shaped search constructed by the nodes contained in each level and their corresponding parent-child node relationships needs to be sorted based on the sorting condition input by the front end, so that the display of the tree-shaped search result is clearer.

[0034] In some embodiments, please refer to Figure 3 As shown, the present invention also provides a search result data organization device 200, which includes: The first module 201 is used to obtain a search result set from a database; The second module 202 is configured to traverse each node in the search result set to obtain a target node set having a corresponding parent-child node relationship, and obtain a corresponding supplementary result set from the database based on the parent-child node relationship contained in the target node set; The third module 203 is used to construct a tree-shaped search result based on the search result set and the supplementary result set.

[0035] It should be noted that each module in the above-mentioned search result data organization device can be implemented in whole or in part through software, hardware, or a combination thereof. Each of the above-mentioned modules can be embedded in or independent of the processor of the electronic device in the form of hardware, or can be stored in the memory of the electronic device in the form of software, so that the processor can call and execute the corresponding operations of each of the above modules.

[0036] According to another aspect of the present invention, an electronic device is provided. The electronic device may be a server. Figure 4 As shown. The electronic device includes a processor, a memory, a network interface and a database connected via a system bus. The processor of the electronic device is used to provide computing and control capabilities. The memory of the electronic device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The database of the electronic device is used to store data. The network interface of the electronic device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, the retrieval result data organization method described above is implemented.

[0037] According to another aspect of the present invention, a computer readable storage medium is provided. Figure 5 As shown, a computer program is stored thereon, and when the computer program is executed by a processor, the above-mentioned retrieval result data organization method is implemented.

[0038] Those skilled in the art will understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0039] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0040] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that a person skilled in the art could make various modifications and improvements without departing from the spirit of the present application, all of which fall within the scope of protection of the present application. Therefore, the scope of protection of the present patent application shall be determined by the appended claims.

Claims

1. A method for organizing search result data, It is characterized in that The method comprises: Obtaining a search result set obtained by searching from a database; Traversing each node in the search result set to obtain a target node set having a corresponding parent-child node relationship, and obtaining a corresponding supplementary result set from the database based on the parent-child node relationship contained in the target node set; A tree-shaped search result is constructed based on the search result set and the supplementary result set.

2. The method for organizing search result data according to claim 1, It is characterized in that The step of traversing each node in the search result set to obtain a target node set having a corresponding parent-child node relationship includes: Traverse the parent node ID and child node list corresponding to each node in the search result set; Determining that the node has a corresponding parent-child node relationship based on the parent node ID corresponding to the node being non-empty and / or the child node list being non-empty; All nodes in the search result set that have corresponding parent-child node relationships are obtained to obtain a target node set.

3. The method for organizing search result data according to claim 1, It is characterized in that The step of constructing a tree-shaped search result based on the search result set and the supplementary result set includes: A tree-shaped search result is constructed for the search result set and the supplementary result set based on the hierarchical relationship and the parent-child node relationship corresponding to each node in the search result set and the supplementary result set.

4. The method for organizing search result data according to claim 3, It is characterized in that The step of constructing a tree-shaped search result for the search result set and the supplementary result set based on the hierarchical relationship and the parent-child node relationship corresponding to each node in the search result set and the supplementary result set comprises: Obtaining any node in the search result set and the supplementary result set as a comparison node, and comparing the level value of the comparison node with the level comparison value; Determine the latest value of the level comparison value based on the comparison result and obtain all nodes of the same level whose level values ​​in the search result set and the supplementary result set are the latest value; Obtain any other node in the search result set and the supplementary result set as a new comparison node and use the latest value of the level comparison value as a new level comparison value, and return to the step of comparing the level value of the comparison node with the level comparison value until the search result set and the supplementary result set are traversed; A tree-shaped search result is constructed based on all the nodes at the same level and their corresponding parent-child node relationships.

5. The method for organizing search result data according to claim 4, It is characterized in that The step of obtaining any node in the search result set and the supplementary result set as a comparison node, and comparing the level value of the comparison node with the level comparison value comprises: Setting the initial value of the level comparison value to the maximum level threshold; Any node in the search result set and the supplementary result set is obtained as a comparison node, and the level value of the comparison node is compared with the level comparison value.

6. The method for organizing search result data according to claim 5, It is characterized in that The step of determining the latest value of the hierarchical comparison value based on the comparison result and obtaining all nodes of the same hierarchical level whose hierarchical values ​​are the latest value in the search result set and the supplementary result set comprises: determining a latest value of the level comparison value based on a smaller value between the level comparison value and the level value of any one of the nodes; Each node in the search result set and the supplementary result set is traversed to obtain nodes at the same level whose level value is the latest value.

7. The method for organizing search result data according to claim 4, It is characterized in that The step of traversing the search result set and the supplementary result set comprises: In response to all nodes in the search result set and the supplementary result set being divided into corresponding levels, the nodes respectively contained in each level are obtained.

8. A search result data organizing device, It is characterized in that The device comprises: The first module is used to obtain a search result set obtained by searching from a database; The second module is used to traverse each node in the search result set to obtain a target node set having a corresponding parent-child node relationship, and obtain a corresponding supplementary result set from the database based on the parent-child node relationship contained in the target node set; The third module is used to construct a tree-shaped search result based on the search result set and the supplementary result set.

9. An electronic device, It is characterized in that include: at least one processor; as well as A memory storing a computer program executable in the processor, wherein the processor executes the method for organizing retrieval result data according to any one of claims 1 to 7 when executing the program.

10. A computer-readable storage medium storing a computer program. It is characterized in that When the computer program is executed by a processor, the retrieval result data organizing method according to any one of claims 1 to 7 is performed.

Images