Method and device for presenting query result, equipment and medium
By determining the user's query intention and building an appropriate data structure, the problem that the query results in the prior art do not meet user needs is solved, rich media display is realized, user operations are simplified, and the accuracy and user experience of query results are improved.
Patent Information
- Application Number
- CN202480002190.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-06-17
- Publication Date
- 2024-11-29
AI Technical Summary
When providing query results, it is difficult for existing applications to accurately meet user needs. Users need to adjust query requests multiple times or manually organize the results to obtain the expected answers, and the multi-modality of query results leads to complex operations.
By receiving user query requests, the user's query intent is determined, and appropriate data structures are constructed based on the intent, data items in the query results are obtained and presented, and machine learning models and structured data display are used to provide rich media presentation for easy understanding.
It realizes the presentation method of customized query results according to user intentions, reduces user operation complexity, improves the accuracy and user experience of query results, and avoids the need for multiple queries and manual sorting.
Smart Images

Figure CN119053956A_ABST
Abstract
Description
Technical Field
[0001] Exemplary implementations of the present disclosure generally relate to the field of computers, and in particular, to a method, an apparatus, a device, and a computer-readable storage medium for presenting query results for a query request. Background Art
[0002] With the rapid development of computer technology, applications can provide various services to users. For example, applications can provide query services to users. Applications can obtain query requests from users (such as query text entered by users, i.e., "questions"), and provide query results corresponding to the questions based on the query requests. However, the query results provided by existing applications may not meet user needs, and users may need to perform multiple queries or manually sort out the query results in order to obtain the expected answers. At this time, it is expected that the query results can be determined and presented in a more effective manner. Summary of the invention
[0003] In a first aspect of the present disclosure, a method for presenting query results is provided. In the method, in response to receiving a query request from a user, a query intent of the user is determined. Based on the query intent, a data structure for presenting query results for the query request is determined. Based on the query request and the data structure, a set of data items in the query results is obtained. A set of data items is presented based on the data structure.
[0004] In a second aspect of the present disclosure, a device for presenting query results is provided. The device includes: an intention determination module configured to determine the user's query intention in response to receiving a query request from the user; a structure determination module configured to determine a data structure for presenting a query result for the query request based on the query intention; an acquisition module configured to acquire a set of data items in the query result based on the query request and the data structure; and a presentation module configured to present a set of data items based on the data structure.
[0005] In a third aspect of the present disclosure, an electronic device is provided. The electronic device includes: at least one processing unit; and at least one memory, the at least one memory is coupled to the at least one processing unit and stores instructions for execution by the at least one processing unit, and when the instructions are executed by the at least one processing unit, the electronic device executes the method according to the first aspect of the present disclosure.
[0006] In a fourth aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the processor implements the method according to the first aspect of the present disclosure.
[0007] In a fifth aspect of the present disclosure, a computer program product is provided, comprising a computer program, wherein the computer program implements the method according to the first aspect of the present disclosure when executed by a processor.
[0008] It should be understood that the content described in this content section is not intended to limit the key features or important features of the implementation of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easy to understand through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0009] In the following, in conjunction with the accompanying drawings and with reference to the following detailed description, the above and other features, advantages and aspects of various implementations of the present disclosure will become more apparent. In the accompanying drawings, the same or similar figure labels represent the same or similar elements, wherein:
[0010] Figure 1 A block diagram showing an application environment according to an exemplary implementation of the present disclosure is shown;
[0011] Figure 2 A block diagram for presenting query results according to some implementations of the present disclosure is shown;
[0012] Figure 3 A block diagram showing a data structure for presenting query results according to some implementations of the present disclosure;
[0013] Figure 4 A block diagram showing a presentation page of query results according to some implementations of the present disclosure is shown;
[0014] Figure 5 A block diagram showing a presentation page of query results according to some implementations of the present disclosure is shown;
[0015] Figure 6 A block diagram showing a presentation page of query results according to some implementations of the present disclosure is shown;
[0016] Figure 7 A flowchart of a method for presenting query results according to some implementations of the present disclosure is shown;
[0017] Figure 8 A block diagram showing an apparatus for presenting query results according to some implementations of the present disclosure; and
[0018] Fig. 9 A block diagram of a device capable of implementing multiple implementations of the present disclosure is shown. DETAILED DESCRIPTION
[0019] The implementation of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain implementations of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be interpreted as being limited to the implementations described herein. On the contrary, these implementations are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and implementations of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.
[0020] In the description of the implementation methods of the present disclosure, the term "including" and similar terms should be understood as open inclusion, that is, "including but not limited to". The term "based on" should be understood as "based at least in part on". The term "an implementation" or "the implementation" should be understood as "at least one implementation". The term "some implementations" should be understood as "at least some implementations". The following may also include other explicit and implicit definitions. As used herein, the term "model" can represent the association relationship between various data. For example, the above-mentioned association relationship can be obtained based on a variety of technical solutions currently known and / or to be developed in the future.
[0021] It is understandable that the data involved in this technical solution (including but not limited to the data itself, the acquisition or use of the data) shall comply with the requirements of relevant laws, regulations and relevant provisions.
[0022] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, scope of use, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.
[0023] For example, in response to receiving an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested to be performed will require obtaining and using the user's personal information. Thus, the user can autonomously choose whether to provide personal information to software or hardware such as an electronic device, application, server, or storage medium that performs the operation of the technical solution of the present disclosure according to the prompt message.
[0024] As an optional but non-limiting implementation, in response to receiving an active request from the user, the prompt information is sent to the user in a manner such as a pop-up window, in which the prompt information can be presented in text form. In addition, the pop-up window can also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device.
[0025] It is understandable that the above notification and the process of obtaining user authorization are merely illustrative and do not constitute a limitation on the implementation of the present disclosure. Other methods that meet relevant laws and regulations may also be applied to the implementation of the present disclosure.
[0026] The term "in response to" as used herein refers to a state in which a corresponding event occurs or a condition is satisfied. It will be understood that the timing of executing a subsequent action executed in response to the event or condition is not necessarily strongly related to the time when the event occurs or the condition is satisfied. For example, in some cases, the subsequent action may be executed immediately when the event occurs or the condition is satisfied; while in other cases, the subsequent action may be executed some time after the event occurs or the condition is satisfied.
[0027] Example Environment
[0028] The application can provide query services to users. The application can obtain a query request from a user (e.g., a query text entered by the user, i.e., a "question") and provide query results corresponding to the question based on the query request. Figure 1 Describe the application environment according to some implementations of the present disclosure. Figure 1 A block diagram 100 of an application environment according to an exemplary implementation of the present disclosure is shown. Figure 1 As shown, a query request 120 from a user may be received in the user page 110 , and the user may input, for example, “travel to city A”.
[0029] The user page 110 may provide query results 130 obtained in different ways. For example, a search may be performed based on the query request 120 to find multiple data sources 132, 134 (e.g., web pages, etc.) that introduce tourism in city A, etc. For another example, the user page 110 may provide a generative result, for example, the ability of a machine learning model may be called to generate an introduction 136 about tourism resources in city A.
[0030] However, the query results provided by existing applications may not meet user needs, and users may need to constantly adjust query requests and perform multiple queries. On the other hand, the query results may involve multimodal data, which requires users to manually sort the query results in order to obtain the expected answers. At this time, it is expected that the query results can be determined and presented in a more efficient manner.
[0031] Presents a summary of the query results
[0032] In order to at least partially solve the deficiencies in the prior art, according to an exemplary implementation of the present disclosure, a method for presenting query results is proposed. Figure 2 An overview of an exemplary implementation of the present disclosure is described. Figure 2 A block diagram 200 for presenting query results according to some implementations of the present disclosure is shown.
[0033] like Figure 2 As shown, a query request 120 from a user may be received, and the user's query intent 210 may be determined. Subsequently, based on the query intent 220, a data structure 220 for presenting a query result 239 for the query request 120 may be determined. Here, the data structure 220 may describe a layout format for presenting the query result, so as to present the query result to the user in a more understandable manner. Based on the query request 120 and the data structure 220, a set of data items (e.g., data items 232, ..., and 234) in the query result 230 may be obtained, and then a set of data items 232, ..., and 234 may be presented based on the data structure 220.
[0034] For example, for the query request "city A travel", it can be determined that the query intent 210 is to obtain travel guides. At this time, the data structure 220 can specify that the query results are presented in chronological order. Specifically, the specific itinerary of a day can be introduced according to the time unit of "day". At this time, the presentation page 240 generated according to the data structure 220 can include the itinerary of the first day, the itinerary of the second day, and so on. Alternatively and / or additionally, the data structure 220 can specify that the query results are presented in other ways, for example, the travel guide is presented according to the spatial location in city A, and so on.
[0035] By using the exemplary implementation of the present disclosure, the presentation of query results can be customized according to user intent, and query results can be displayed with rich media structured data, thereby presenting query results in a manner that is easier for users to understand.
[0036] Detailed process of presenting query results
[0037] An overview of some implementations of the present disclosure has been described, and more details about presenting query results will be described below. According to some implementations of the present disclosure, a pre-generated machine learning model can be used to determine the user's query intent. The machine learning model can be trained based on historical data with truth value labels, and can reflect the association relationship between the query request and the query intent. Specifically, there can be multiple predetermined query intents, for example, including but not limited to: searching for travel guides, searching for news events, searching for multimedia resources, item recommendations, and the like.
[0038] According to some implementations of the present disclosure, an intent recognition model can be constructed, and the user query can be refined in multiple vertical categories related to the user query to determine the user's query intent. For example, for travel guides, refinement can be performed in one or more of the following aspects: number of people, gender, type (couple travel, parent-child travel, family travel), and then the refined intent can be identified.
[0039] According to some implementations of the present disclosure, the focus factors of the user specified in the query request can be determined. Here, the focus factors can represent the factors that the user pays special attention to during the query process. At this time, the query intent can be determined based on the focus factors. For example, the query request may include: "I want to travel in city A for three days." At this time, it can be determined that "three days" is a factor that the user pays special attention to, and the query intent determined at this time can be further refined as: search for travel guides, time length of three days. For another example, the query request may include: "I want to go to several large cities in country B." At this time, it can be determined that "large cities" is a factor that the user pays special attention to, and the query intent determined at this time can be further refined as: search for travel guides, large cities. In this way, user needs can be refined, and then the query results can be presented in a manner that better meets user needs.
[0040] According to some implementations of the present disclosure, assuming that the query request content is too little and the user's query intention cannot be accurately determined, the user can be further advised to refine the requirements. Specifically, in response to determining that the query request does not specify the user's concern factors, a message can be sent to the user to suggest that the user refine the query request. Assuming that the query request only includes "city A", the user can be asked which aspects of city A they are more concerned about, for example: which aspects of city A do you want to know, 1) attractions; 2) transportation; 3) accommodation; and so on. Specifically, through one or more rounds of questions and answers, more refined query requests can be gradually obtained, thereby improving the accuracy of the query.
[0041] According to some implementations of the present disclosure, a corresponding data structure can be set for each predetermined query intent. For example, for searching for travel guides, the data structure can be organized according to multiple time periods (e.g., days), that is, the data structure can include multiple nodes divided according to time periods. For another example, for searching for news events, the data structure can be organized according to the development sequence of events at various time points, that is, the data structure can include multiple nodes divided according to time points. For another example, for item recommendations, the data structure can be organized in a comparative manner, that is, the data structure can include multiple nodes divided according to various parameters of the item.
[0042] See also Figure 3 Describe in more detail the Figure 3 A block diagram 300 of a data structure for presenting query results according to some implementations of the present disclosure is shown. Figure 3As shown, data structure 220 may include a group of nodes (e.g., nodes 310, ..., and 320). Further, in the process of determining the data structure based on the query intent, a group of nodes may be specified based on the focus factor. Specifically, in response to determining that the focus factor is a time type, a group of nodes is specified in a time manner. At this time, the nodes in a group of nodes specify the type of data presented in the node. For example, for searching for travel guides, each node may be divided according to time periods. In this way, nodes may be specified based on the focus factors that the user cares about most, so that the user can directly determine the relevant search results for each time period.
[0043] Continuing with the above example, assuming that the user wants to search for a three-day travel guide for City A, in this case, node 310 may specify the relevant travel destinations presented in the node on the first day, ..., and node 320 may specify the relevant travel destinations presented in the node on the third day. In this way, the user does not have to manually filter and determine the itinerary for each day from a large amount of travel information, but can directly present the three-day itinerary information of City A to the user in a structured manner.
[0044] Alternatively and / or additionally, the node may further include more fine-grained child nodes, for example, node 310 may include child nodes 312, ..., 314. Here, each child node may specify the type of data presented in the node. For example, child node 312 may specify that the relevant activities of the first morning are presented in the node, ..., and child node 314 may specify that the relevant activities of the first evening are presented in the node. And so on. Using the example implementation of the present disclosure, the levels can be divided according to different granularities in a structured manner, thereby presenting the query results in a manner that is more in line with user expectations.
[0045] According to some implementations of the present disclosure, in order to obtain a set of data items in a query result, for a node in a set of nodes, a data item in a set of data items can be determined based on the query request and the type of data specified by the node. In other words, data related to each node can be obtained. Specifically, data about various scenic spots in city A can be obtained, and a daily travel plan can be made according to the distance between each scenic spot, that is, the data item corresponding to each node is determined. Alternatively and / or additionally, further queries can be performed based on specific data types in the data items to determine the data items corresponding to each node. For example, prompt words can be constructed: "City A travel, where to go on the first day", etc., in order to obtain richer query results.
[0046] See also Figure 4 Describes more details about presenting query results. Figure 4 A block diagram 400 of a presentation page of query results according to some implementations of the present disclosure is shown. Figure 4 As shown, the daily activity content can be determined in the manner described above, for example, the user can be advised to visit a museum in the morning of the first day, visit a park in the afternoon, and so on. According to some implementations of the present disclosure, for a data item in a set of data items, a service portal for accessing the data item can be provided. For example, for a museum, the service portal may include an access address 420 so that the user can purchase tickets via the access address 420, and so on. Alternatively and / or additionally, more service portals that meet the user's intentions can be provided, for example, including but not limited to: ticket services, transportation services, hotel reservation services, restaurant reservation services, and so on.
[0047] According to some implementations of the present disclosure, in the process of presenting a group of data items based on a data structure, a layout style of a group of data items can be set based on a group of nodes, and the group of data items can be presented based on the layout style. Specifically, the layout style of the nodes of each level can be specified, for example, a specific indentation method, font, font size, font color, background color, etc. can be specified. Using the example implementation of the present disclosure, a more prominent visual effect can be presented, thereby facilitating users to find desired data.
[0048] It should be understood that although the query results are shown above in text format only as an example, the query results may include data items in multiple modalities, for example, including but not limited to text, images, audio, video, etc. In this way, rich media information can be presented in a structured manner, thereby providing richer query results.
[0049] According to some implementations of the present disclosure, the user can adjust the various data items in the query results. Specifically, in response to receiving a user's adjustment request for the data items in the query results, an adjusted set of data items can be presented. For example, the user can exchange the itinerary for the morning and afternoon of the first day. At this time, the positions of the relevant information of "museum" and "park" in the presentation page 410 can be exchanged. Using the example implementation of the present disclosure, it is convenient for users to customize their own schedules based on the query results. In this way, the complexity of user operations can be reduced and efficiency can be improved.
[0050] According to some implementations of the present disclosure, the presentation page 410 may further include a page element for confirming the itinerary. In response to receiving a user request for the page element, the itinerary information generated via the query result may be confirmed. Specifically, when the user specifies a specific date, the various service entrances in the presentation page may be automatically accessed, and tickets for the corresponding date may be purchased, and so on. For example, assuming that the user specifies that the start date of the trip is January 1, then when the user confirms, a museum ticket for the morning of January 1 may be automatically booked, a park ticket for the afternoon of January 1 may be automatically booked, and so on. Alternatively and / or additionally, the confirmed itinerary information may be added to the user's calendar application to remind the user.
[0051] It should be understood that the above only describes a specific example of presenting a page by taking the determination of the data structure in a time manner as an example. Alternatively and / or additionally, the data structure can be determined in other ways. Specifically, in response to determining that the concern factor is a spatial type, a set of nodes can be specified in a spatial manner. Assume that the query request includes: "I want to go to several large cities in country B". At this time, it can be determined that the user is more concerned about the spatial distribution of several large cities in country B, and a set of nodes can be specified in a spatial manner. For example, a set of nodes can correspond to city C1, city C2, city C3, etc., respectively, and each relevant sub-node of city C1 can correspond to the relevant information of hotels, attractions and transportation in the city. At this time, corresponding prompt words and / or search keywords can be constructed to determine the relevant tourism information of city C1, city C2, and city C3 respectively.
[0052] Figure 5 A block diagram 500 of a presentation page of query results according to some implementations of the present disclosure is shown. Figure 5 As shown, in each level, the relevant tourism information of city C1, city C2, and city C3 can be presented respectively according to the spatial distribution. The relevant information of hotels, attractions, and transportation in each city can be further presented in the detailed level. In this way, it is convenient for users to learn more tourism information of each city in a spatial distribution manner, thereby avoiding users repeatedly modifying query requests to search for more information.
[0053] By using the example implementation of the present disclosure, the rich media data structure for presenting the answer result to the user can be determined according to the user's intention. A dedicated rich media data structure is designed based on the user's intention to fully answer the user's question. At this time, the travel itinerary can be displayed in a temporal manner and / or spatial manner, for example, including a map, text introduction, etc. Without further query, the user can obtain richer query results.
[0054] It should be understood that although the above only schematically illustrates a case where the data structure includes two levels (nodes and subnodes), alternatively and / or additionally, the data structure may include more or fewer levels. Users can access nodes in each level to continuously obtain richer information.
[0055] According to some implementations of the present disclosure, in order to increase the speed of returning query results, the specific content of the data items to be presented at each level can be gradually obtained in the order of the levels. For example, the presentation page 510 can be returned in the initial stage. In response to receiving the user's interaction with the data item 520, more information about the hotel can be further obtained. For example, the address, price, access address, etc. of the hotel can be presented. In this way, the corresponding query results can be obtained according to the continuously refined query requests. Further, the real-time data in the query results can be determined. For example, for data such as hotel prices, a refresh operation can be performed at a predetermined time interval, thereby providing the latest data to the user.
[0056] An example of presenting query results has been described above by taking the determination of travel guides as an example. Alternatively and / or additionally, the query request may involve other query intentions and the user's focus factors may also be different. According to some implementations of the present disclosure, in response to determining that the focus factor is a comparison type, a set of nodes is specified in a comparison manner. For example, the query request may include: "I want to buy a new mobile phone." At this point, a machine learning model can be used to refine the intent. For example, the user's needs for storage capacity, screen size, operating system, purpose, etc. can be determined. In the case where the intent is identified as a visual intent such as mainly taking pictures, watching movies, etc. and the parameter comparison of various models of mobile phones is concerned, a set of nodes in the data structure can be determined in a comparison manner.
[0057] Figure 6 A block diagram 600 of a presentation page of query results according to some implementations of the present disclosure is shown. Figure 6 As shown, the presentation page 610 may be in the form of a comparison table. In this case, the first row corresponds to the models of the two candidate mobile phones to be recommended, and the subsequent rows respectively show the corresponding parameter comparisons, such as screen resolution, camera resolution, CPU model, etc. In this way, the user can quickly understand the multi-faceted performance comparison of the two candidate mobile phones through the comparison table, so as to facilitate the user to select a product that meets their needs.
[0058] According to some implementations of the present disclosure, different factors of concern may lead to different parameter comparison lists. For example, a user is more concerned about the camera parameters of a mobile phone. In this case, various parameters related to the camera may be arranged at the front of the list, while other parameters may be arranged at the back. For another example, another user expects to run large games on the mobile phone, and is more concerned about the computing performance parameters of the mobile phone. In this case, various parameters related to the computing unit may be arranged at the front of the list, while other parameters may be arranged at the back. In this way, in the query results, the corresponding data structure may be used to highlight the parameters that the user is more concerned about, thereby satisfying the user's query needs in a more accurate manner.
[0059] Alternatively and / or additionally, the presentation page 610 may further include a service portal for obtaining more information about each data item, such as providing a shopping address for purchasing each candidate mobile phone, providing a query address for querying detailed information about each parameter, and so on.
[0060] By using the exemplary implementation of the present disclosure, the presentation of query results can be customized according to user intent, and query results can be displayed with rich media structured data, thereby presenting query results in a way that is easier for users to understand and avoiding further manual queries by users.
[0061] Example Process
[0062] Figure 7 A flowchart of a method 700 for presenting query results according to some implementations of the present disclosure is shown. At block 710, in response to receiving a query request from a user, the user's query intent is determined; at block 720, based on the query intent, a data structure for presenting query results for the query request is determined; at block 730, based on the query request and the data structure, a set of data items in the query results is obtained; and at block 740, a set of data items is presented based on the data structure.
[0063] According to some implementations of the present disclosure, determining the query intent of the user includes: in response to determining a focus factor of the user specified in the query request, determining the query intent based on the focus factor.
[0064] According to some implementations of the present disclosure, determining the query intent of the user includes: in response to determining that the query request does not specify the user's focus factor, sending a message to the user to suggest that the user refine the query request.
[0065] According to some implementations of the present disclosure, a data structure includes a set of nodes, a node in the set of nodes specifies a type of data presented in the node, and determining the data structure based on query intent includes: specifying a set of nodes based on a focus factor.
[0066] According to some implementations of the present disclosure, obtaining a set of data items in a query result includes: for a node in a set of nodes, determining a data item in a set of data items based on a query request and a type of data specified by the node.
[0067] According to some implementations of the present disclosure, specifying a group of nodes based on the attention factor includes: in response to determining that the attention factor is of a time type, specifying a group of nodes in a time manner.
[0068] According to some implementations of the present disclosure, specifying a group of nodes based on the attention factor includes: in response to determining that the attention factor is of a spatial type, specifying a group of nodes in a spatial manner.
[0069] According to some implementations of the present disclosure, specifying a group of nodes based on the focus factor includes: in response to determining that the focus factor is a comparison type, specifying a group of nodes in a comparison manner.
[0070] According to some implementations of the present disclosure, presenting a set of data items based on a data structure includes: setting a layout style of the set of data items based on a set of nodes; and presenting the set of data items based on the layout style.
[0071] According to some implementations of the present disclosure, the method further includes: providing, for a data item in a group of data items, a service entry for accessing the data item.
[0072] Example devices and equipment
[0073] Figure 8 A block diagram of an apparatus 800 for presenting query results according to some implementations of the present disclosure is shown. The apparatus includes: an intention determination module 810, configured to determine the user's query intention in response to receiving a query request from the user; a structure determination module 820, configured to determine a data structure for presenting query results for the query request based on the query intention; an acquisition module 830, configured to acquire a set of data items in the query result based on the query request and the data structure; and a presentation module 840, configured to present a set of data items based on the data structure.
[0074] According to some implementations of the present disclosure, the intent determination module 810 is further configured to: in response to determining a focus factor of a user specified in a query request, determine the query intent based on the focus factor.
[0075] According to some implementations of the present disclosure, the intent determination module 810 is further configured to: in response to determining that the query request does not specify the user's focus factor, send a message to the user to suggest that the user refine the query request.
[0076] According to some implementations of the present disclosure, the data structure includes a set of nodes, the nodes in the set of nodes specify the type of data presented in the nodes, and the structure determination module 820 is further configured to: specify the set of nodes based on a focus factor.
[0077] According to some implementations of the present disclosure, the acquisition module 830 is further configured to: for a node in a group of nodes, determine a data item in a group of data items based on a query request and a type of data specified by the node.
[0078] According to some implementations of the present disclosure, the structure determination module 820 is further configured to: in response to determining that the concern factor is of the time type, specify a group of nodes in a time manner.
[0079] According to some implementations of the present disclosure, the structure determination module 820 is further configured to: in response to determining that the factor of interest is of a spatial type, specify a group of nodes in a spatial manner.
[0080] According to some implementations of the present disclosure, the structure determination module 820 is further configured to: in response to determining that the concern factor is a comparison type, specify a group of nodes according to a comparison method.
[0081] According to some implementations of the present disclosure, the presentation module 840 is further configured to: set a layout style of a group of data items based on a group of nodes; and present the group of data items based on the layout style.
[0082] According to some implementations of the present disclosure, the presentation module 840 is further configured to: provide a service entry for accessing a data item in a group of data items.
[0083] Fig. 9 9 is a block diagram of a device 900 capable of implementing multiple implementations of the present disclosure. It should be understood that Fig. 9 The computing device 900 shown is merely exemplary and should not constitute any limitation on the functionality and scope of the implementations described herein. Fig. 9 The computing device 900 shown may be used to implement the methods described above.
[0084] like Fig. 9As shown, computing device 900 is in the form of a general-purpose computing device. Components of computing device 900 may include, but are not limited to, one or more processors or processing units 910, memory 920, storage device 930, one or more communication units 940, one or more input devices 950, and one or more output devices 960. Processing unit 910 may be an actual or virtual processor and is capable of performing various processes according to a program stored in memory 920. In a multi-processor system, multiple processing units execute computer executable instructions in parallel to improve the parallel processing capabilities of computing device 900.
[0085] The computing device 900 typically includes a plurality of computer storage media. Such media may be any available media accessible to the computing device 900, including but not limited to volatile and non-volatile media, removable and non-removable media. The memory 920 may be a volatile memory (e.g., a register, a cache, a random access memory (RAM)), a non-volatile memory (e.g., a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), flash memory), or some combination thereof. The storage device 930 may be a removable or non-removable medium, and may include a machine-readable medium, such as a flash drive, a disk, or any other medium, which may be capable of being used to store information and / or data (e.g., training data for training) and may be accessed within the computing device 900.
[0086] The computing device 900 may further include additional removable / non-removable, volatile / non-volatile storage media. Fig. 9 As shown in , a disk drive for reading or writing from a removable, non-volatile disk (e.g., a "floppy disk") and an optical drive for reading or writing from a removable, non-volatile optical disk may be provided. In these cases, each drive may be connected to the bus (not shown) by one or more data media interfaces. Memory 920 may include a computer program product 925 having one or more program modules that are configured to perform various methods or actions of various implementations of the present disclosure.
[0087] The communication unit 940 enables communication with other computing devices via a communication medium. Additionally, the functions of the components of the computing device 900 can be implemented in a single computing cluster or multiple computing machines that can communicate via a communication connection. Therefore, the computing device 900 can operate in a networked environment using a logical connection with one or more other servers, a network personal computer (PC), or another network node.
[0088] Input device 950 may be one or more input devices, such as a mouse, keyboard, tracking ball, etc. Output device 960 may be one or more output devices, such as a display, a speaker, a printer, etc. Computing device 900 may also communicate with one or more external devices (not shown) through communication unit 940 as needed, such as storage devices, display devices, etc., communicate with one or more devices that allow a user to interact with computing device 900, or communicate with any device that allows computing device 900 to communicate with one or more other computing devices (e.g., a network card, a modem, etc.). Such communication may be performed via an input / output (I / O) interface (not shown).
[0089] According to an exemplary implementation of the present disclosure, a computer-readable storage medium is provided, on which computer-executable instructions are stored, wherein the computer-executable instructions are executed by a processor to implement the method described above. According to an exemplary implementation of the present disclosure, a computer program product is also provided, the computer program product is tangibly stored on a non-transitory computer-readable medium and includes computer-executable instructions, and the computer-executable instructions are executed by a processor to implement the method described above. According to an exemplary implementation of the present disclosure, a computer program product is provided, on which a computer program is stored, and when the program is executed by a processor, the method described above is implemented.
[0090] Various aspects of the present disclosure are described herein with reference to the flowcharts and / or block diagrams of the methods, devices, equipment, and computer program products implemented according to the present disclosure. It should be understood that each box in the flowchart and / or block diagram and the combination of each box in the flowchart and / or block diagram can be implemented by computer-readable program instructions.
[0091] These computer-readable program instructions can be provided to a processing unit of a general-purpose computer, a special-purpose computer, or other programmable data processing device, thereby producing a machine, so that when these instructions are executed by the processing unit of the computer or other programmable data processing device, a device that implements the functions / actions specified in one or more boxes in the flowchart and / or block diagram is generated. These computer-readable program instructions can also be stored in a computer-readable storage medium, and these instructions cause the computer, programmable data processing device, and / or other equipment to work in a specific manner, so that the computer-readable medium storing the instructions includes a manufactured product, which includes instructions for implementing various aspects of the functions / actions specified in one or more boxes in the flowchart and / or block diagram.
[0092] Computer-readable program instructions can be loaded onto a computer, other programmable data processing apparatus, or other device so that a series of operational steps are performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, so that the instructions executed on the computer, other programmable data processing apparatus, or other device implement the functions / actions specified in one or more boxes in the flowchart and / or block diagram.
[0093] The flow chart and block diagram in the accompanying drawings show the possible architecture, function and operation of the system, method and computer program product according to multiple implementations of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a part of a module, program segment or instruction, and a part of a module, program segment or instruction includes one or more executable instructions for realizing the logical function of the specification. In some implementations as replacements, the function marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two continuous square boxes can actually be executed substantially in parallel, and they can sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be realized by a special hardware-based system that performs the function or action of the specification, or can be realized by a combination of special hardware and computer instructions.
[0094] The above descriptions of various implementations of the present disclosure are exemplary, non-exhaustive, and not limited to the disclosed implementations. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described implementations. The selection of terms used herein is intended to best explain the principles of the implementations, practical applications, or improvements to the technology in the market, or to enable other persons of ordinary skill in the art to understand the various implementations disclosed herein.
Claims
1. A method for presenting query results, comprising: In response to receiving a query request from a user, determining the query intent of the user; Based on the query intent, determining a data structure for presenting query results for the query request; Based on the query request and the data structure, obtaining a set of data items in the query result; as well as The set of data items is presented based on the data structure.
2. The method according to claim 1, wherein determining the query intent of the user comprises: In response to determining that the query request specifies a focus factor of the user, the query intent is determined based on the focus factor.
3. The method according to claim 1, wherein determining the query intent of the user comprises: In response to determining that the query request does not specify a factor of interest to the user, a message is sent to the user to suggest that the user refine the query request.
4. The method of claim 2, wherein the data structure comprises a set of nodes, a node in the set of nodes specifies a type of data presented in the node, and determining the data structure based on the query intent comprises: The set of nodes is designated based on the factor of interest.
5. The method according to claim 4, wherein obtaining the set of data items in the query result comprises: For the node in the set of nodes, a data item in the set of data items is determined based on the query request and a type of data specified by the node.
6. The method of claim 4, wherein specifying the set of nodes based on the interest factor comprises: In response to determining that the factor of interest is of a time type, the set of nodes is specified in a time manner.
7. The method of claim 4, wherein specifying the set of nodes based on the interest factor comprises: In response to determining that the factor of interest is of a spatial type, the set of nodes is specified in a spatial manner.
8. The method of claim 1 , wherein specifying the set of nodes based on the factor of interest comprises: In response to determining that the concern factor is of a comparison type, the group of nodes is designated according to a comparison manner.
9. The method of claim 1 , wherein presenting the set of data items based on the data structure comprises: Setting a layout style of the set of data items based on the set of nodes; as well as The set of data items is presented based on the layout style.
10. The method according to claim 1, further comprising: For a data item in the set of data items, a service entry for accessing the data item is provided.
11. A device for presenting query results, comprising: an intention determination module, configured to determine the query intention of the user in response to receiving a query request from the user; A structure determination module, configured to determine a data structure for presenting a query result for the query request based on the query intent; An acquisition module, configured to acquire a set of data items in the query result based on the query request and the data structure; as well as A presentation module is configured to present the set of data items based on the data structure.
12. An electronic device comprising: at least one processing unit; as well as At least one memory, the at least one memory being coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions causing the electronic device to perform the method according to any one of claims 1 to 10 when executed by the at least one processing unit.
13. A computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the processor is caused to implement the method according to any one of claims 1 to 10.
14. A computer program product comprising a computer program, wherein the computer program implements the method according to any one of claims 1 to 10 when executed by a processor.
Citation Information
Patent Citations
Data cube based visual data display method and device
CN104462453A
Method and system for automated visualized presentation based on data structure identification
CN107169119A
Query processing method and device, electronic equipment and computer readable storage medium
CN109933672A
Search result display method and device and device for displaying search results
CN113918626A
