# US 12,596,719 B2 · Search request processing > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,596,719 B2 - Document ID: US12596719B2 - Status: Granted - Kind: B2 - Application number: 18/937,913 - Filed: 2024-11-05 - Published: 2025-05-08 - Granted: 2026-04-07 - Earliest claimed: 2023-11-06 - Assignees: Amadeus S.A.S. - Applicants: Amadeus S.A.S. - Inventors: Xavier Vellay; Yannick Devaux; Mickael Coat - Web page: https://patentgrep.com/patent/US12596719B2 ## CPC - G06F 16/2425: {Iterative querying; Query formulation based on the results of a preceding query} - G06F 16/24564: {Applying rules; Deductive queries} - G06F 16/252: {between a Database Management System and a front-end application} - G06F 16/953: Querying, e.g. by the use of web search engines - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract A search engine receives a search request and determines a number of initial search results. The initial search results comprise at least one essential data piece and omit at least one non-essential data piece. Later on, a follow-up search request from the client is received which indicates at least one of the initial search results. The search engine computes at least one non-essential data piece for each initial search result indicated in the follow-up search request based on a number of dynamic computation rules and returns the computed at least one non-essential data piece for each initial search result to the client. ## Claims ### Claim 1 A method for processing search requests, the method comprising: receiving, at a computing platform, a search request from a client, the search request indicating at least one search parameter; determining, at the computing platform, a number of initial search results, wherein each of the initial search results comprise at least one respective essential data piece which corresponds to the at least one search parameter and omit at least one respective non-essential data piece associated with the at least one respective essential data piece; returning, by the computing platform, at least a subset of the initial search results to the client, wherein each search result of the subset of the initial search results includes the at least one respective essential data piece and omits the at least one respective non-essential data piece; receiving a follow-up search request from the client indicating at least one of the initial search results in the subset of the initial search results; computing at least one non-essential data piece for each of the at least one initial search results, in the subset of the initial search results, indicated in the follow-up search request, based on a number of dynamic computation rules; and returning the computed at least one non-essential data piece for each of the at least one initial search results, in the subset of the initial search results, to the client, wherein one or more of: computing the at least non-essential data piece requires an amount of computation resources above a given threshold; and the at least one non-essential data piece is omitted from the initial search results based on a current state of the computing platform. ### Claim 2 (depends on 1) The method of claim 1, wherein the current state of the computing platform comprises one or more of a number of search requests received within a given time interval, an amount of computation resources recently spent, a number or ratio of external data sources recently contacted, an amount of memory currently utilized, a current network load measure. ### Claim 3 (depends on 1) The method of claim 1, wherein the initial search results returned to the client include an indication that the at least one non-essential data piece omitted in the initial search results are available in response to the follow-up search request. ### Claim 4 (depends on 1) The method of claim 1, wherein computing the at least one non-essential data piece for each initial search result indicated in the follow-up search request based on a number of dynamic computation rules at least partly occurs in a time after returning the initial search results to the client and before receiving the follow-up search request. ### Claim 5 (depends on 1) The method of claim 1, further comprising: providing, to the client, the number of dynamic computation rules to enable to client to compute the at least one dynamic data piece for each initial search result. ### Claim 6 (depends on 1) The method of claim 1, further comprising: determining the at least one non-essential data piece to be omitted from the initial search results based on previous follow-up search requests. ### Claim 7 (depends on 1) The method of claim 1, wherein computing the at least one dynamic data piece for each initial search result indicated in the follow-up search request is performed by a further computing platform outsourced from the search engine. ### Claim 8 (depends on 1) The method of claim 1, wherein the follow-up search request includes an identifier per at least one of the initial search results in the subset of the initial search results, and the method further comprises: storing at least the returned subset of the initial search results in a memory; retrieving, using the identifier, the initial search results indicated in the follow-up request from the memory; computing the at least one dynamic data piece for each initial search result indicated in the follow-up search request based on the respective at least one essential data piece of the initial search results retrieved from the memory. ### Claim 9 (depends on 1) The method of claim 1, wherein essential data pieces are designated as mandatory to return to the client in response to the search request, and non-essential data piece pieces are designated as optional to return to the client in response to the search request. ### Claim 10 (depends on 1) A computing system comprising a client device and a computing machine implementing a search engine, wherein the computing machine implementing the search engine is configured to perform the method according to claim 1. ### Claim 11 (depends on 1) A computer program product comprising a non-transitory computer-readable medium storing program code which, when executed by a computer, causes the computer to execute the method of claim 1. ### Claim 12 (depends on 1) A computer comprising: at least one processor; and a non-transitory computer-readable storage medium having stored thereon program instructions that, when executed by the at least one processor, causes the at least one processor to perform a set of operations comprising the method of claim 1.