Method and apparatus for presenting query result, and device and medium

Abstract

Provided are a method and apparatus for presenting a query result, and a device and a medium. One method comprises: in response to receiving a query request from a user, determining a query intent of the user; on the basis of the query intent, determining a data structure used for presenting a query result for the query request; on the basis of the query request and the data structure, acquiring a group of data items from the query result; and on the basis of the data structure, presenting the group of data items. By using the exemplary implementation of the present disclosure, a presentation manner of a query result can be customized on the basis of an intent of a user, and the query result is presented by means of rich-media structured data, such that the query result is presented in a manner that is easier for the user to understand.

Description

Methods, apparatus, devices, and media for presenting query results Technical Field

[0001] Exemplary implementations of this disclosure generally relate to the field of computers, and more particularly to methods, apparatus, devices, and computer-readable storage media for presenting query results in response to a query request. Background Technology

[0002] With the rapid development of computer technology, applications can provide users with various services. For example, applications can provide query services. An application can obtain query requests from users (such as the query text entered by the user, i.e., the "question") and provide query results corresponding to that question based on the query request. However, the query results provided by existing applications may not meet the user's needs. Users may need to perform multiple queries or manually organize the query results to obtain the expected answer. Therefore, there is a need for a more efficient way to determine and present query results.

[0003] Summary of the Invention

[0004] In a first aspect of this disclosure, a method for presenting query results is provided. In this method, in response to receiving a query request from a user, the user's query intent is determined. Based on the query intent, a data structure for presenting the query results in response to the query request is determined. Based on the query request and the data structure, a set of data items from the query results is obtained. The set of data items is then presented based on the data structure.

[0005] In a second aspect of this disclosure, an apparatus for presenting query results is provided. The apparatus includes: an intent determination module configured to determine a user's query intent in response to receiving a query request from a user; a structure determination module configured to determine a data structure for presenting query results for the query request based on the query intent; an acquisition module configured to acquire a set of data items from the query results based on the query request and the data structure; and a presentation module configured to present the set of data items based on the data structure.

[0006] In a third aspect of this disclosure, an electronic device is provided. The electronic device includes: at least one processing unit; and at least one memory 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 a first aspect of this disclosure when executed by the at least one processing unit.

[0007] In a fourth aspect of this disclosure, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, causes the processor to implement the method according to a first aspect of this disclosure.

[0008] In a fifth aspect of this disclosure, a computer program product is provided, comprising a computer program that, when executed by a processor, implements the method according to a first aspect of this disclosure.

[0009] It should be understood that the content described in this content section is not intended to limit the key or essential features of the implementation of this disclosure, nor is it intended to restrict the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0010] The above and other features, advantages, and aspects of the various implementations of this disclosure will become more apparent in the following detailed description, taken in conjunction with the accompanying drawings. In the drawings, the same or similar reference numerals denote the same or similar elements, wherein:

[0011] Figure 1 shows a block diagram of an application environment according to an exemplary implementation of the present disclosure;

[0012] Figure 2 shows a block diagram for presenting query results according to some implementations of this disclosure;

[0013] Figure 3 shows a block diagram of a data structure for presenting query results according to some implementations of this disclosure;

[0014] Figure 4 shows a block diagram of the page displaying query results according to some implementations of this disclosure;

[0015] Figure 5 shows a block diagram of the page displaying query results according to some implementations of this disclosure;

[0016] Figure 6 shows a block diagram of the page displaying query results according to some implementations of this disclosure;

[0017] Figure 7 shows a flowchart of a method for presenting query results according to some implementations of this disclosure;

[0018] Figure 8 shows a block diagram of an apparatus for presenting query results according to some implementations of the present disclosure; and

[0019] Figure 9 shows a block diagram of a device capable of implementing various implementations of the present disclosure. Detailed Implementation

[0020] Implementations of this disclosure will now be described in more detail with reference to the accompanying drawings. While some implementations of this disclosure are shown in the drawings, it should be understood that this disclosure can be implemented in various forms and should not be construed as limited to the implementations set forth herein. Rather, these implementations are provided to provide a more thorough and complete understanding of this disclosure. It should be understood that the accompanying drawings and implementations of this disclosure are for illustrative purposes only and are not intended to limit the scope of protection of this disclosure.

[0021] In the description of the implementation methods disclosed herein, the term "comprising" and similar terms should be understood as open inclusion, i.e., "including but not limited to". The term "based on" should be understood as "at least partially based on". The term "one implementation" or "the implementation" should be understood as "at least one implementation". The term "some implementations" should be understood as "at least some implementations". Other explicit and implicit definitions may also be included below. As used herein, the term "model" can represent the relationships between various data. For example, the aforementioned relationships can be obtained based on various currently known and / or future-developed technical solutions.

[0022] It is understood 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 related provisions.

[0023] It is understood that before using the technical solutions disclosed in the various embodiments of this disclosure, users should be informed of the types, scope of use, and usage scenarios of the personal information involved in this disclosure through appropriate means in accordance with relevant laws and regulations, and user authorization should be obtained.

[0024] For example, upon receiving a user's active request, a prompt message is sent to the user to explicitly inform them that the requested operation will require the acquisition and use of the user's personal information. This allows the user to independently choose whether to provide personal information to the software or hardware, such as the electronic device, application, server, or storage medium performing the operations of this disclosed technical solution, based on the prompt message.

[0025] As an optional but non-restrictive implementation, in response to a user's active request, a prompt message can be sent to the user, for example, via a pop-up window, where the prompt message can be presented in text format. Furthermore, the pop-up window can also include a selection control allowing the user to choose whether to "agree" or "disagree" to provide personal information to the electronic device.

[0026] It is understood that the above notification and user authorization process are merely illustrative and do not constitute a limitation on the implementation of this disclosure. Other methods that comply with relevant laws and regulations may also be applied to the implementation of this disclosure.

[0027] 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 subsequent actions performed in response to such event or condition is not necessarily strongly correlated with the time when the event occurs or the condition is met. For example, in some cases, subsequent actions may be performed immediately upon the occurrence of the event or the fulfillment of the condition; while in others, they may be performed some time after the occurrence of the event or the fulfillment of the condition.

[0028] Example Environment

[0029] The application can provide query services to users. The application can obtain query requests from users (e.g., query text entered by the user, i.e., a "question") and provide query results corresponding to the question based on the query request. Refer to Figure 1 for an application environment illustrating some implementations of this disclosure. Figure 1 shows a block diagram 100 of an application environment according to an exemplary implementation of this disclosure. As shown in Figure 1, a query request 120 from a user can be received on the user page 110; for example, the user can enter "City A Tourism".

[0030] User page 110 can provide query results 130 obtained in different ways. For example, a search can be performed based on query request 120 to find multiple data sources 132, 134 (e.g., web pages, etc.) introducing tourism in city A, and so on. Alternatively, user page 110 can provide generative results, such as using the capabilities of machine learning models to generate information 136 about tourism resources in city A.

[0031] However, existing applications may provide query results that do not meet user needs, requiring users to continuously adjust their query requests and execute multiple queries. Furthermore, query results may involve multimodal data, necessitating manual processing by users to obtain the expected answers. Therefore, it is desirable to determine and present query results in a more efficient manner.

[0032] Presenting a summary of the query results

[0033] To at least partially address the shortcomings of the prior art, a method for presenting query results is proposed according to an exemplary implementation of this disclosure. Referring to Figure 2, which describes an overview of an exemplary implementation of this disclosure, Figure 2 illustrates a block diagram 200 for presenting query results according to some implementations of this disclosure.

[0034] As shown in Figure 2, a query request 120 from a user can be received, and the user's query intent 210 can be determined. Then, based on the query intent 220, a data structure 220 for presenting the query results 239 in response to the query request 120 can be determined. Here, the data structure 220 can describe the layout format for presenting the query results, thereby presenting the query results to the user in a more easily understandable way. Based on the query request 120 and the data structure 220, a set of data items (e.g., data items 232, ..., and 234) from the query results 230 can be obtained, and then the set of data items 232, ..., and 234 can be presented based on the data structure 220.

[0035] For example, for the query request "travel to city A", the query intent 210 can be determined as obtaining travel guides. In this case, data structure 220 can specify that the query results are presented in chronological order, specifically, using "days" as the time unit to describe the specific itinerary for a day. The presentation page 240 generated according to data structure 220 can then include the itinerary for the first day, the itinerary for the second day, and so on. Alternatively and / or additionally, data structure 220 can specify that the query results are presented in other ways, such as presenting travel guides according to their spatial location within city A, etc.

[0036] Using the exemplary implementation of this disclosure, the presentation of query results can be customized according to user intent, and the query results can be displayed as rich media structured data, thereby presenting the query results in a way that is easier for users to understand.

[0037] Detailed process of presenting query results

[0038] Having outlined some implementations according to this disclosure, further details regarding the presentation of query results will be described below. According to some implementations of this disclosure, a pre-generated machine learning model can be used to determine the user's query intent. This machine learning model can be trained on historical data with truth labels and can reflect the correlation between query requests and query intents. Specifically, multiple pre-defined query intents can exist, such as, but not limited to: searching for travel guides, searching for news events, searching for multimedia resources, item recommendations, etc.

[0039] Based on some implementation methods of this disclosure, an intent recognition model can be constructed, and user queries can be refined in multiple vertical categories related to user queries 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 (couples' trip, parent-child trip, family trip), thereby identifying refined intents.

[0040] According to some implementations of this disclosure, the factors of interest for the user specifying the query request can be determined. Here, "factors of interest" can refer to factors that the user pays particular attention to during the query process. In this case, the query intent can be determined based on these factors of interest. For example, a query request might include: "I want to travel in city A for three days." In this case, "three days" can be determined as a factor of particular interest to the user, and therefore the determined query intent can be further refined to: searching for travel guides, and specifying the duration as three days. As another example, a query request might include: "I want to visit several major cities in country B." In this case, "major cities" can be determined as a factor of particular interest to the user, and therefore the determined query intent can be further refined to: searching for travel guides, and specifying "major cities." In this way, user needs can be refined, and query results can be presented in a manner that better meets user needs.

[0041] According to some implementations of this disclosure, if the query request content is too limited and cannot accurately determine the user's query intent, the user can be further advised to refine their requirements. Specifically, in response to determining that the query request does not specify the user's areas of interest, a message can be sent to the user to suggest refining their query request. For example, if the query request only includes "City A," the user can be asked which aspects of City A they are more interested in, such as: What aspects of City A would you like to know about, 1) attractions; 2) transportation; 3) accommodation; etc. Specifically, a more detailed query request can be gradually obtained through one or more rounds of questioning, thereby improving the accuracy of the query.

[0042] According to some implementations of this disclosure, corresponding data structures can be set for various predetermined query intentions. For example, for searching 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 by time periods. As another example, for searching news events, the data structure can be organized according to the development sequence of the event at various points in time, that is, the data structure can include multiple nodes divided by time points. Yet another example, for item recommendations, the data structure can be organized according to a comparison method, that is, the data structure can include multiple nodes divided by various parameters of the item.

[0043] See Figure 3 for further details, which illustrates a block diagram 300 of a data structure for presenting query results according to some implementations of this disclosure. As shown in Figure 3, data structure 220 may include a set of nodes (e.g., nodes 310, ..., and 320). Furthermore, in determining the data structure based on query intent, a set of nodes can be specified based on factors of interest. Specifically, in response to determining that the factor of interest is time-related, a set of nodes is specified according to time. In this case, each node in the set specifies the type of data presented within it. For example, for searching travel guides, the nodes can be divided by time period. In this way, nodes can be specified based on the user's most important factors of interest, allowing the user to directly determine relevant search results for each time period.

[0044] Continuing the example above, suppose a user wants to search for a three-day travel itinerary for city A. In this case, node 310 can specify the relevant tourist destinations to be presented on the first day, and so on, and node 320 can specify the relevant tourist destinations to be presented on the third day. In this way, users do not need to manually sift through a large amount of travel information and determine their daily itinerary, but can instead have their three-day itinerary information for city A presented to them in a structured manner.

[0045] Alternatively and / or additionally, a node may further include more granular child nodes. For example, node 310 may include child nodes 312, ..., 314. Here, each child node may specify the type of data presented in that node. For example, child node 312 may specify that it presents activities related to the morning of the first day, ..., child node 314 may specify that it presents activities related to the evening of the first day, and so on. Using the example implementation of this disclosure, hierarchical levels can be divided in a structured manner according to different granularities, thereby presenting query results in a way that better meets user expectations.

[0046] According to some implementations of this disclosure, in order to obtain a set of data items in the query results, for a node in a set of nodes, the data items in the set of data items can be determined based on the query request and the data type specified by the node. In other words, data related to each node can be obtained. Specifically, data about various attractions in city A can be obtained, and daily travel plans can be formulated according to the distance between the attractions, that is, the data items corresponding to each node can be determined. Alternatively and / or additionally, further queries can be performed based on the specific data type in the data items to further determine the data items corresponding to each node. For example, prompts such as "City A tourism, where to go on day one" can be constructed to obtain richer query results.

[0047] See Figure 4 for further details regarding the presentation of query results. Figure 4 shows a block diagram 400 of a page for presenting query results according to some implementations of this disclosure. As shown in Figure 4, daily activities can be determined in the manner described above; for example, users can be advised to visit a museum in the morning and a park in the afternoon, etc. According to some implementations of this disclosure, for each data item in a set of data items, a service entry point for accessing the data item can be provided. For example, for a museum, the service entry point could include access address 420, through which users can purchase tickets, etc. Alternatively and / or additionally, more service entry points to satisfy user intent can be provided, such as, but not limited to: ticket services, transportation services, hotel reservation services, restaurant reservation services, etc.

[0048] According to some implementations of this disclosure, in the process of presenting a set of data items based on a data structure, the layout style of a set of data items can be set based on a set of nodes, and the set of data items can be presented based on the layout style. Specifically, the layout style of each level of nodes can be specified, such as specific indentation, font, font size, font color, background color, etc. Using the example implementations of this disclosure, a more prominent visual effect can be presented, thereby making it easier for users to find the desired data.

[0049] It should be understood that although the above example only uses text format to illustrate the query results, the results can include data items in multiple modalities, such as, but not limited to, text, images, audio, video, etc. In this way, rich media information can be presented in a structured manner, thus providing richer query results.

[0050] According to some implementations of this disclosure, users can adjust various data items in the query results. Specifically, in response to receiving a user's request to adjust data items in the query results, a set of adjusted data items can be presented. For example, a user can swap the morning and afternoon itineraries for the first day; in this case, the positions of the "Museum" and "Park" information on page 410 can be swapped. Using the example implementations of this disclosure, users can easily customize their schedules based on the query results. This reduces user operational complexity and thus improves efficiency.

[0051] According to some implementations of this disclosure, presentation page 410 may further include page elements for confirming the itinerary. In response to receiving a user request for this page element, the itinerary information generated from the query results can be confirmed. Specifically, if the user specifies a specific date, various service entry points on the presentation page can be automatically accessed, and tickets for the corresponding date can be purchased, etc. For example, assuming the user specifies the start date of the trip as January 1st, then upon receiving user confirmation, museum tickets for the morning of January 1st can be automatically booked, park tickets for the afternoon of January 1st can be automatically booked, and so on. Alternatively and / or additionally, the confirmed itinerary information can be added to the user's calendar application to remind the user.

[0052] It should be understood that the above description only uses the example of determining the data structure according to time to illustrate a specific example of the page presentation. Alternatives and / or additional locations can determine the data structure in other ways. Specifically, in response to determining the focus factor as spatial, a set of nodes can be specified according to spatial characteristics. Suppose the query request includes: "I want to go to several major cities in country B." In this case, it can be determined that the user is more interested in the spatial distribution of several major cities in country B, and a set of nodes can be specified according to spatial characteristics. For example, a set of nodes can correspond to city C1, city C2, city C3, etc., and the relevant sub-nodes of city C1 can correspond to information related to hotels, attractions, and transportation in that city. At this point, corresponding prompts and / or search keywords can be constructed to determine relevant travel information for city C1, city C2, and city C3 respectively.

[0053] Figure 5 shows a block diagram 500 of the query result presentation page according to some implementations of this disclosure. As shown in Figure 5, tourism information for cities C1, C2, and C3 can be presented separately at each level according to spatial distribution. Further detailed levels can be provided to present information on hotels, attractions, and transportation within each city. This approach allows users to easily access more tourism information about each city based on spatial distribution, thus avoiding the need for users to repeatedly modify their query requests to search for more information.

[0054] Using the example implementation of this disclosure, the rich media data structure for presenting responses to users can be determined based on user intent. A dedicated rich media data structure can be designed based on user intent to comprehensively answer user questions. At this point, travel itineraries can be displayed in a time-based and / or spatial manner, for example, including maps, text descriptions, etc. Users can obtain richer search results without needing further queries.

[0055] It should be understood that although the above only illustrates a data structure with two levels (nodes and child nodes), 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.

[0056] According to some implementations of this disclosure, to improve the speed of returning query results, the specific content of the data items to be presented at each level can be obtained step by step in a hierarchical order. For example, in the initial stage, page 510 can be returned. In response to receiving user interaction with data item 520, more information about the hotel can be obtained. For example, the hotel's address, price, access address, etc., can be presented. In this way, corresponding query results can be obtained according to increasingly refined query requests. Furthermore, 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 predetermined time intervals, thereby providing the user with the latest data.

[0057] The preceding text has already described an example of presenting query results using travel guides as an example. Alternative and / or additional locations may be included, and query requests may involve other query intents, and users' concerns may differ. According to some implementations of this disclosure, in response to determining that the concerns are of a comparison type, a set of nodes is specified according to the comparison method. For example, a query request may include: "I want to buy a new mobile phone." In this case, machine learning models can be used to refine the intent; for example, the user's needs regarding storage capacity, screen size, operating system, and intended use can be determined. When the intent is identified as primarily visual, such as taking photos or watching movies, and the focus is on comparing the parameters of various mobile phone models, a set of nodes in the data structure can be determined according to the comparison method.

[0058] Figure 6 shows a block diagram 600 of the query result presentation page according to some implementations of this disclosure. As shown in Figure 6, the presentation page 610 can adopt a comparison table format. In this case, the first row corresponds to the models of the two candidate mobile phones to be recommended, and the subsequent rows show the corresponding parameter comparisons, such as screen resolution, camera resolution, CPU model, etc. In this way, users can quickly understand the multi-faceted performance comparison of the two candidate mobile phones through the comparison table, thereby making it easier for users to choose a product that meets their needs.

[0059] According to some implementations of this disclosure, different factors of interest can lead to different parameter comparison lists. For example, if a user is more concerned with the phone's camera parameters, then various camera-related parameters can be arranged at the beginning of the list, while other parameters are arranged later. Similarly, if another user wants to run demanding games on their phone, they will be more concerned with the phone's computing performance parameters; in this case, various parameters related to computing units can be arranged at the beginning of the list, while other parameters are arranged later. In this way, the query results can utilize appropriate data structures to highlight the parameters that the user is more concerned with, thereby satisfying the user's query needs in a more accurate manner.

[0060] Alternatively and / or additionally, page 610 may further include service access points for obtaining more information about each data item. For example, it may provide shopping links for purchasing each candidate phone separately, query links for retrieving detailed information about each parameter, and so on.

[0061] Using the exemplary implementation of this disclosure, the presentation of query results can be customized according to user intent and displayed as rich media structured data, thereby presenting query results in a more user-friendly manner and avoiding further manual queries by the user.

[0062] Example process

[0063] Figure 7 illustrates a flowchart of a method 700 for presenting query results according to some implementations of this disclosure. 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 the 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 from the query results is obtained; and at block 740, the set of data items is presented based on the data structure.

[0064] According to some implementations of this disclosure, determining a user's query intent includes: in response to determining the user's interest factors in a query request, determining the query intent based on the interest factors.

[0065] According to some implementations of this disclosure, determining a user's query intent includes: in response to determining that the query request does not specify the user's concerns, sending a message to the user to suggest that the user refine the query request.

[0066] According to some implementations of this disclosure, the data structure includes a set of nodes, where each node in the set of nodes specifies the type of data presented in the node, and determining the data structure based on query intent includes specifying a set of nodes based on factors of interest.

[0067] According to some implementations of this disclosure, obtaining a set of data items in the query results includes: for a node in a set of nodes, determining the data items in the set of data items based on the query request and the data type specified by the node.

[0068] According to some implementations of this disclosure, specifying a set of nodes based on the factors of interest includes: in response to determining that the factors of interest are time-type, specifying a set of nodes according to the time method.

[0069] According to some implementations of this disclosure, specifying a set of nodes based on factors of interest includes: in response to determining that the factor of interest is a spatial type, specifying a set of nodes according to spatial method.

[0070] According to some implementations of this disclosure, specifying a set of nodes based on factors of interest includes: in response to determining that the factors of interest are comparison types, specifying a set of nodes according to the comparison method.

[0071] According to some implementations of this disclosure, presenting a set of data items based on a data structure includes: setting a layout style for a set of data items based on a set of nodes; and presenting a set of data items based on the layout style.

[0072] According to some implementations of this disclosure, the method further includes: providing a service entry point for accessing data items in a set of data items.

[0073] Example devices and equipment

[0074] Figure 8 shows a block diagram of an apparatus 800 for presenting query results according to some implementations of the present disclosure. The apparatus includes: an intent determination module 810 configured to determine a user's query intent in response to receiving a query request from a user; a structure determination module 820 configured to determine a data structure for presenting query results for the query request based on the query intent; an acquisition module 830 configured to acquire a set of data items from the query results based on the query request and the data structure; and a presentation module 840 configured to present the set of data items based on the data structure.

[0075] According to some implementations of this disclosure, the intent determination module 810 is further configured to: determine the query intent based on the factors of interest of the user specified in the query request.

[0076] According to some implementations of this disclosure, the intent determination module 810 is further configured to: in response to determining that the query request does not specify the user's concerns, send a message to the user to suggest that the user refine the query request.

[0077] According to some implementations of this disclosure, the data structure includes a set of nodes, where each node in the set of nodes specifies the type of data presented in the node, and the structure determination module 820 is further configured to: specify a set of nodes based on factors of interest.

[0078] According to some implementations of this disclosure, the acquisition module 830 is further configured to: for a node in a set of nodes, determine a data item in a set of data items based on a query request and the type of data specified by the node.

[0079] According to some implementations of this disclosure, the structure determination module 820 is further configured to: in response to determining that the factor of interest is of time type, specify a set of nodes according to the time method.

[0080] According to some implementations of this disclosure, the structure determination module 820 is further configured to: in response to determining the factor of interest as spatial type, specify a set of nodes according to spatial manner.

[0081] According to some implementations of this disclosure, the structure determination module 820 is further configured to: in response to determining that the factor of interest is of comparison type, specify a set of nodes according to the comparison method.

[0082] According to some implementations of this disclosure, the presentation module 840 is further configured to: set a layout style for a set of data items based on a set of nodes; and present a set of data items based on the layout style.

[0083] According to some implementations of this disclosure, the presentation module 840 is further configured to: provide a service entry point for accessing data items in a set of data items.

[0084] Figure 9 shows a block diagram of a device 900 capable of implementing various implementations of the present disclosure. It should be understood that the computing device 900 shown in Figure 9 is merely exemplary and should not constitute any limitation on the functionality and scope of the implementations described herein. The computing device 900 shown in Figure 9 can be used to implement the methods described above.

[0085] As shown in Figure 9, the computing device 900 is in the form of a general-purpose computing device. Components of the computing device 900 may include, but are not limited to, one or more processors or processing units 910, memory 920, storage devices 930, one or more communication units 940, one or more input devices 950, and one or more output devices 960. The processing unit 910 may be a physical or virtual processor and is capable of performing various processes according to programs stored in the memory 920. In a multiprocessor system, multiple processing units execute computer-executable instructions in parallel to improve the parallel processing capability of the computing device 900.

[0086] Computing device 900 typically includes multiple computer storage media. Such media can be any available media accessible to computing device 900, including but not limited to volatile and non-volatile media, removable and non-removable media. Memory 920 can be volatile memory (e.g., registers, cache, random access memory (RAM)), non-volatile memory (e.g., read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory), or some combination thereof. Storage device 930 can be removable or non-removable media and can include machine-readable media, such as flash drives, disks, or any other media capable of storing information and / or data (e.g., training data for training) and accessible within computing device 900.

[0087] The computing device 900 may further include additional removable / non-removable, volatile / non-volatile storage media. Although not shown in FIG. 9, disk drives for reading from or writing to removable, non-volatile disks (e.g., "floppy disks") and optical disk drives for reading from or writing to removable, non-volatile optical disks may be provided. In these cases, each drive may be connected to a bus (not shown) via one or more data media interfaces. The memory 920 may include a computer program product 925 having one or more program modules configured to perform various methods or actions of various implementations of the present disclosure.

[0088] The communication unit 940 enables communication with other computing devices via a communication medium. Additionally, the components of the computing device 900 can function as a single computing cluster or multiple computing machines capable of communicating via communication connections. Therefore, the computing device 900 can operate in a networked environment using logical connections to one or more other servers, network personal computers (PCs), or another network node.

[0089] Input device 950 can be one or more input devices, such as a mouse, keyboard, trackball, etc. Output device 960 can be one or more output devices, such as a monitor, speaker, printer, etc. Computing device 900 can also communicate as needed with one or more external devices (not shown) via communication unit 940. These external devices, such as storage devices, display devices, etc., can communicate with one or more devices that enable user interaction with computing device 900, or with any device (e.g., network card, modem, etc.) that enables computing device 900 to communicate with one or more other computing devices. Such communication can be performed via input / output (I / O) interfaces (not shown).

[0090] According to exemplary implementations of this disclosure, a computer-readable storage medium is provided that stores computer-executable instructions thereon, wherein the computer-executable instructions are executed by a processor to implement the methods described above. According to exemplary implementations of this disclosure, a computer program product is also provided, which is tangibly stored on a non-transitory computer-readable medium and includes computer-executable instructions, which are executed by a processor to implement the methods described above. According to exemplary implementations of this disclosure, a computer program product is provided that stores a computer program thereon, which, when executed by a processor, implements the methods described above.

[0091] Various aspects of this disclosure are described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatuses, devices, and computer program products implemented according to this disclosure. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer-readable program instructions.

[0092] 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 apparatus to produce a machine such that, when executed by the processing unit of the computer or other programmable data processing apparatus, they create means for implementing the functions / actions specified in one or more blocks of the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium that causes a computer, programmable data processing apparatus, and / or other device to operate in a particular manner. Thus, the computer-readable medium storing the instructions comprises an article of manufacture that includes instructions for implementing aspects of the functions / actions specified in one or more blocks of the flowchart and / or block diagram.

[0093] Computer-readable program instructions can be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions that execute on the computer, other programmable data processing apparatus, or other device to perform the functions / actions specified in one or more boxes of a flowchart and / or block diagram.

[0094] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of an instruction, which contains one or more executable instructions for implementing the specified logical function. In some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, may be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0095] Various implementations of this disclosure have been described above. These descriptions are exemplary and not exhaustive, nor are they limited to the disclosed implementations. Many modifications and variations will be apparent to those skilled in the art without departing from the scope and spirit of the described implementations. The terminology used herein is chosen to best explain the principles, practical applications, or improvements to technology in the market, or to enable others skilled 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, determine the user's query intent; Based on the query intent, determine the data structure for presenting the query results for the query request; Based on the query request and the data structure, a set of data items in the query results are obtained; as well as The set of data items is presented based on the data structure.

2. The method of claim 1, wherein determining the user's query intent comprises: In response to determining that the query request specifies the user's points of interest, the query intent is determined based on the points of interest.

3. The method of claim 1, wherein determining the user's query intent comprises: In response to determining that the query request does not specify the user's concerns, 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, wherein each node in the set of nodes specifies the type of data presented in the node, and determining the data structure based on the query intent comprises: The set of nodes is specified based on the factors of interest.

5. The method according to claim 4, wherein obtaining the set of data items in the query result includes: For each node in the set of nodes, the data items in the set of data items are determined based on the query request and the data type specified by the node.

6. The method of claim 4, wherein specifying the set of nodes based on the factors of interest comprises: In response to determining that the factor of interest is of time type, the set of nodes is specified according to the time method.

7. The method of claim 4, wherein specifying the set of nodes based on the factors of interest comprises: In response to determining that the factor of interest is a spatial type, the set of nodes is specified according to the spatial method.

8. The method of claim 1, wherein specifying the set of nodes based on the factors of interest comprises: In response to determining that the factor of interest is a comparison type, the set of nodes is specified according to the comparison method.

9. The method of claim 1, wherein presenting the set of data items based on the data structure comprises: Set the 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 of claim 1, further comprising: For each data item in the set of data items, a service entry point is provided for accessing that data item.

11. An apparatus for presenting query results, comprising: An intent determination module is configured to determine the user's query intent in response to receiving a query request from the user; A structure determination module is configured to determine, based on the query intent, a data structure for presenting query results for the query request; The acquisition module is configured to acquire a set of data items from the query results 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, 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, the computer program causing the processor to implement the method according to any one of claims 1 to 10 when executed by a processor.

14. A computer program product comprising a computer program, wherein the computer program, when executed by a processor, implements the method according to any one of claims 1 to 10.

Images