Patents by Inventor Jean-Philippe Aubry

Jean-Philippe Aubry has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11762854
    Abstract: In a distributed computing environment comprising a frontend system with a search platform having a cache of pre-computed search results and a backend system with one or more data-bases and a validation instance, a request is received at the search platform from a client comprising one or more first key-values indicating a first data record and at least a first pre-computed search result and a second pre-computed search result for the first data record is retrieved from the cache. The validation instance evaluates a current validity of the first pre-computed search result and the second pre-computed search result retrieved from the cache and returns the first pre-computed search result to the client device, or in response to evaluating that the first pre-computed search result is invalid and the second pre-computed search result is valid, returns the second pre-computed search result to the client.
    Type: Grant
    Filed: August 28, 2020
    Date of Patent: September 19, 2023
    Assignee: AMADEUS S.A.S.
    Inventors: Gilles Aubin Bikouo Njangang, Stephane Rodriguez, Francois-Joseph Mytych, Thierry Blaszka, Jean-Philippe Aubry, Sami Gharbi
  • Patent number: 11593381
    Abstract: Pre-computed query results stored at a database server are re-computed by a computation machine. The pre-computed query results are composed of a plurality of shares. Each share includes a certain number of pre-computed query results. The computation resources of the computation machine needed to re-compute a pre-computed query result of a first share depend on whether or not other pre-computed query results of the first share are re-computed during a given time interval forming a current re-computation cycle. The computation machine receives a request to re-compute pre-computed query results of at least a first share, determines a number of pre-computed query results in the first share to be re-computed in the current re-computation cycle based on a Reinforcement Learning algorithm, and re-computes the determined number of pre-computed query results in the first share.
    Type: Grant
    Filed: January 25, 2018
    Date of Patent: February 28, 2023
    Assignee: Amadeus S.A.S.
    Inventors: Jean-Philippe Aubry, Guillaume Le Grand, Johann Marchi, Nicolas Legrand
  • Publication number: 20210073228
    Abstract: In a distributed computing environment comprising a frontend system with a search platform having a cache of pre-computed search results and a backend system with one or more data-bases and a validation instance, a request is received at the search platform from a client comprising one or more first key-values indicating a first data record and at least a first pre-computed search result and a second pre-computed search result for the first data record is retrieved from the cache. The validation instance evaluates a current validity of the first pre-computed search result and the second pre-computed search result retrieved from the cache and returns the first pre-computed search result to the client device, or in response to evaluating that the first pre-computed search result is invalid and the second pre-computed search result is valid, returns the second pre-computed search result to the client.
    Type: Application
    Filed: August 28, 2020
    Publication date: March 11, 2021
    Inventors: Gilles Aubin BIKOUO NJANGANG, Stephane RODRIGUEZ, Francois-Joseph MYTYCH, Thierry BLASZKA, Jean-Philippe AUBRY, Sami GHARBI
  • Publication number: 20190228094
    Abstract: Pre-computed query results stored at a database server are re-computed by a computation machine. The pre-computed query results are composed of a plurality of shares. Each share includes a certain number of pre-computed query results. The computation resources of the computation machine needed to re-compute a pre-computed query result of a first share depend on whether or not other pre-computed query results of the first share are re-computed during a given time interval forming a current re-computation cycle. The computation machine receives a request to re-compute pre-computed query results of at least a first share, determines a number of pre-computed query results in the first share to be re-computed in the current re-computation cycle based on a Reinforcement Learning algorithm, and re-computes the determined number of pre-computed query results in the first share.
    Type: Application
    Filed: January 25, 2018
    Publication date: July 25, 2019
    Inventors: Jean-Philippe Aubry, Guillaume Le Grand, Johann Marchi, Nicolas Legrand
  • Publication number: 20120284062
    Abstract: The method according to a preferred embodiment of the present invention allows an improved travel request service to end-users who request proposals for a trip from a Global Distribution System (GDS). This uses a new travel request which comprises a wider range for each search parameter than previous travel requests from the prior art. The new travel request includes many different ranges of parameters in the same travel request whereas the prior art travel request has to be repeated for each different requested value for each search parameter. The method according to a preferred embodiment of the present invention provides a combination of two modules, a master module and a worker module, to carry out the improved travel request service.
    Type: Application
    Filed: May 20, 2011
    Publication date: November 8, 2012
    Inventors: Jean-Philippe Aubry, Benoit Janin, Rudy Daniello, Luc Isnardy, Claudine Reynaud