-
公开(公告)号:US20230127638A1
公开(公告)日:2023-04-27
申请号:US17510876
申请日:2021-10-26
Applicant: AMADEUS S.A.S.
Inventor: Yoann POULAIN , Charles Michel Pierre Guillaume CULTIEN , Grégory VALIGIANI , Luigi DI NOIA , Philippe SARCEY
IPC: G06Q20/38 , G06F16/2455 , G06F16/28
Abstract: A database system, method, and computer program product of handling purchases of products is presented, in which the database system comprises a relational database storing relational data for a plurality of products, a key-value database storing a plurality of first files and a plurality of second files, an interface module connecting the relational database with the key-value database, and a shopping engine to communicate with the key-value database. The interface module converts relational data stored in the relational database into first files and second files. The shopping engine queries the key-value database to retrieve available products in response to an availability request.
-
公开(公告)号:US20240412119A1
公开(公告)日:2024-12-12
申请号:US18741044
申请日:2024-06-12
Applicant: AMADEUS S.A.S.
Inventor: Marc TRAINA , Gregory VALIGIANI , Philippe SARCEY , Yoann POULAIN , Franck LESIEUR , Sebastien ROCHE , Vigneshwari PANDIARAJ , Aditya Vikram DUGGAL
IPC: G06Q10/02 , G06F16/23 , G06Q10/087 , G06Q30/0201 , G06Q50/12
Abstract: An aspect of the invention relates to a method for centrally updating inventory of electronic provider objects comprising: merging a plurality of object changes from a first queue by change category; for each change category, determining an impact of the merged object changes on a set of data pairs in a general database, each data pair being formed by two given attributes of an electronic provider object placing each impacted data pair in a second queue; determining, for each impacted data pair, an update of the two given attributes of an electronic provider object over a second predetermined period via a query to the general database.
-
公开(公告)号:US20200242520A1
公开(公告)日:2020-07-30
申请号:US16747996
申请日:2020-01-21
Applicant: AMADEUS S.A.S.
Inventor: Marc Andre Jerome TRAINA , Yoann POULAIN , Charles Michel Pierre Guillaume CULTIEN , Valerian Romain Emmanuel ROCHE , Fabien Xavier MOURGUES , Gregory VALIGIANI
Abstract: A computer-implemented method comprising: receiving a user-generated request comprising functional data; retrieving a list of data items and a set of dependency rules, each data item being assigned an undefined binary validity value; generating a directed graph by organizing the data items in accordance with the retrieved dependency rules; applying a filtration process to solve the directed graph comprising: calculating the validity value; propagating the validity values through the graph; and filtering the directed graph by keeping only nodes having a validity value of one; calculating, for each filtered data item, a price; and generating a list of available data items with their price. The node suppression decreases the number of data items for which a price has to be calculated, thereby saving resources and/or decreasing the time needed to resolve the user request.
-
-