专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2012123523A1 SYSTEM AND METHOD FOR PROCESSING COMPLEX QUERIES 审中-公开
标题翻译：用于处理复杂查询的系统和方法
公开(公告)号：WO2012123523A1
公开(公告)日：2012-09-20
申请号：PCT/EP2012/054520
申请日：2012-03-15
申请人： AMADEUS s.a.s. , PAUCHET, David , JANIN, Benoît , DANIELLO, Rudy , DUFRESNE, Thierry , PATOUREAUX, Marc
发明人： PAUCHET, David , JANIN, Benoît , DANIELLO, Rudy , DUFRESNE, Thierry , PATOUREAUX, Marc
IPC分类号： G06F17/30
CPC分类号： G06F17/30861 , G06F17/30427 , G06Q10/025
摘要： The invention relates to a method and system for processing complex queries each corresponding to a plurality of components to be combined. Elements corresponding to these components are searched. The elements are of different element types and are originally described by definition data having heterogeneous data structures. A conversion step transforms the heterogeneous definition data into converted definition data of one single format. An engine then retrieves elements and builds associations of elements matching the query parameters based on the converted definition data, thereby providing with a reply to the query in an optimized manner.
摘要翻译：本发明涉及一种用于处理复杂查询的方法和系统，每个复数查询对应于要组合的多个组件。搜索与这些组件对应的元素。元素具有不同的元素类型，并且最初由具有异构数据结构的定义数据描述。转换步骤将异构定义数据转换为一种单一格式的转换定义数据。然后，引擎基于转换的定义数据检索元素并构建与查询参数匹配的元素的关联，从而以优化的方式提供对查询的回复。

2. 发明申请

WO2010133447A1 METHOD AND SYSTEM FOR DETERMINING AN OPTIMAL LOW FARE FOR A TRIP 审中-公开
标题翻译：用于确定最佳低价位的方法和系统
公开(公告)号：WO2010133447A1
公开(公告)日：2010-11-25
申请号：PCT/EP2010/056015
申请日：2010-05-04
申请人： AMADEUS S.A.S. , PATOUREAUX, Marc , DUFRESNE, Thierry , PAUCHET, David
发明人： PATOUREAUX, Marc , DUFRESNE, Thierry , PAUCHET, David
IPC分类号： G06Q10/00 , G06Q30/00 , G06Q50/00
CPC分类号： G06Q30/0206 , G06Q10/02 , G06Q30/02 , G06Q50/14 , G06Q50/30
摘要： A method for determining an optimal fare for a trip comprising a departure location, an arrival location, the method comprises the following steps: sending a request for the trip wherein the request comprises a departure location, an arrival location and a corresponding fare for the trip; automatically modifying the request by searching in a predetermined database to determine a set of additional requests wherein each comprises at least one of the departure location, the arrival location or one or more additional locations which may form at least a part of the requested route wherein the predetermined database comprises said additional requests and a corresponding fare for each additional request; selecting one or more additional requests to form one or more alternative requests which include at least on of the departure location or the arrival location as the request; calculating the up to date fares for each alternative request in order to determine a resulting fare for each alternative request; comparing the fare and the resulting fares in order to determine the lowest resulting fare for the trip.
摘要翻译：一种用于确定旅行的最佳票价的方法，包括出发地点，到达地点，方法包括以下步骤：发送旅行请求，其中请求包括出发地点，到达地点和旅行的相应票价 ; 通过在预定数据库中搜索来确定一组附加请求来自动修改请求，其中每个附加请求包括出发位置，到达位置或可形成所请求路线的至少一部分的一个或多个附加位置中的至少一个，其中，预定数据库包括所述附加请求和每个附加请求的对应票价; 选择一个或多个附加请求以形成一个或多个备选请求，其至少包括作为请求的出发地点或到达位置; 计算每个备用请求的最新费用，以确定每个替代请求的结果票价; 比较票价和结果票价，以确定旅行结果最低的票价。

3. 发明申请

WO2011072885A1 MULTI-DESTINATION TRIP SELECTION 审中-公开
标题翻译：多目的地选择
公开(公告)号：WO2011072885A1
公开(公告)日：2011-06-23
申请号：PCT/EP2010/055391
申请日：2010-04-22
申请人： AMADEUS S.A.S. , JIANG, Donghua , DUFRESNE, Thierry , PATOUREAUX, Marc
发明人： JIANG, Donghua , DUFRESNE, Thierry , PATOUREAUX, Marc
IPC分类号： G06Q10/00
CPC分类号： G06Q10/00 , G06Q10/025
摘要： A method of selecting at least one trip from a plurality of possible trips, each of the plurality of possible trips being for travel from an origin location and comprising stops at a plurality of destinations. The method is performed in computer apparatus configured to execute the method. The method comprises: determining a fare for each of a plurality of different leg options for each leg, each leg being between one of: the origin location and a destination; and two destinations; selecting a plurality of candidate leg options for each leg based on comparative amounts of the determined fares, the plurality of candidate leg options being fewer in number than the plurality of different leg options; and determining at least one trip based on the plurality of candidate leg options for each leg.
摘要翻译：一种从多个可能的行程中选择至少一个行程的方法，所述多个可能的行程中的每一个行进是从原点位置行进并且包括在多个目的地的停止。该方法在被配置为执行该方法的计算机装置中执行。该方法包括：为每个腿确定多个不同腿部选项中的每一个的票价，每个腿部位于以下之一之一：原点位置和目的地之间; 和两个目的地; 基于确定的票价的比较量来选择每个腿的多个候选腿选项，所述多个候选腿选项的数量少于所述多个不同的腿选项; 以及基于每个腿的多个候选腿选项来确定至少一个行程。

4. 发明申请

WO2011082853A1 IMPROVEMENTS IN OR RELATING TO A SEARCH ENGINE AND ASSOCIATED METHOD 审中-公开
标题翻译：搜索引擎或相关方法的改进或相关
公开(公告)号：WO2011082853A1
公开(公告)日：2011-07-14
申请号：PCT/EP2010/066038
申请日：2010-10-25
申请人： Amadeus S.A.S. , MELET, Pierre-Etienne , DUFRESNE, Thierry , DOURTHE, Cédric , PATOUREAUX, Marc
发明人： MELET, Pierre-Etienne , DUFRESNE, Thierry , DOURTHE, Cédric , PATOUREAUX, Marc
IPC分类号： G06Q10/00
CPC分类号： G06Q50/14 , G06Q10/00 , G06Q10/04
摘要： A method of searching for a entity amongst a plurality of entities, wherein all the entities are linked by at least one criterion in common and have a plurality of data formats, wherein each entity comprises a set of data which can be searched by means of criteria entered by a user; and wherein each entity has a data format; and further wherein a specific one of the data formats defines a standard record format; the method comprising the steps of: determining the data format of an entity; if the data format of the entity does not match the standard record format, passing the entity to a pre-processing engine; if the data format of the entity does match the standard record format, passing standard record format data of the entity to a main processing engine; in the pre-processing engine comparing the entity data format to the standard record format and applying a conversion to the entity set of data; converting the entity set of data to the standard record format based on the conversion to form a converted set of data; passing the converted set of data to the main processing engine; in the main processing engine receiving the standard record format entity set of data and the converted set of data; and producing a set of results combining the converted set of data and the standard record format data for selection by a user of a preferred entity.
摘要翻译：一种在多个实体之间搜索实体的方法，其中所有实体通过至少一个共同标准链接并具有多个数据格式，其中每个实体包括可以通过标准搜索的一组数据由用户输入; 并且其中每个实体具有数据格式; 并且其中特定的数据格式定义了标准记录格式; 该方法包括以下步骤：确定实体的数据格式; 如果实体的数据格式与标准记录格式不符，则将实体传递给预处理引擎; 如果实体的数据格式符合标准记录格式，则将实体的标准记录格式数据传递给主处理引擎; 在预处理引擎中将实体数据格式与标准记录格式进行比较，并将转换应用于实体数据集; 基于转换将实体数据集转换为标准记录格式以形成转换的数据集; 将转换的数据集传递给主处理引擎; 在主处理引擎中接收标准记录格式实体数据集和转换后的数据集; 并且产生一组结合转换的数据集合和标准记录格式数据的结果，以供优选实体的用户选择。

5. 发明申请

WO2007014870A2 METHOD AND SYSTEM OF BUILDING ACTUAL TRAVEL FARES 审中-公开
标题翻译：建立实际旅游业的方法与制度
公开(公告)号：WO2007014870A2
公开(公告)日：2007-02-08
申请号：PCT/EP2006/064497
申请日：2006-07-21
申请人： AMADEUS S.A.S. , PATOUREAUX, Marc , DUFRESNE, Thierry , CHAUMONT, Gilles , DOURTHE, Cédric , BLASZKA, Thierry
发明人： PATOUREAUX, Marc , DUFRESNE, Thierry , CHAUMONT, Gilles , DOURTHE, Cédric , BLASZKA, Thierry
IPC分类号： G06Q10/00
CPC分类号： G06Q10/02 , G06Q10/047
摘要： A method of building actual travel fares in a computer, from fare databases, is disclosed. A graph of nodes representing travel destinations is built which comprises edges connecting pairs of nodes. Each edge references a lowest travel fare. Also, a tree of fares is built for each graph edge. Trees comprise at least a root node holding the lowest travel fare of the corresponding graph edge. They possibly include more nodes comprising a context key and an associated travel fare. Trees are organized to have children nodes holding a travel fare equal to or larger than travel fare of a parent node. Thus, less expensive fare paths can efficiently be extracted since graph edges, included in the fare paths, reference the associated trees of fares and are gone through in ascending order of their lowest fare values. A learning entity is used to build and update the trees of fares. It gathers its data from processes aimed at building travel solutions for the end-users. A system implementing the method of extracting fare paths according to the invention is made capable of handling many destinations in the elapsed time of a computer transaction thus, can propose thematic travel options to end-users who are not required to choose a particular destination to start planning a trip.
摘要翻译：披露了一种从票价数据库中建立计算机实际旅行票价的方法。建立表示旅行目的地的节点图，其中包括连接节点对的边缘。每个边缘参考最低旅行票价。此外，为每个图形边缘构建一个票价树。至少包括一个保存相应图形边缘最低旅行票价的根节点。它们可能包括更多节点，包括上下文密钥和相关的旅行票价。组织树木，使儿童节点持有旅行票价等于或大于父节点的旅行票价。因此，可以有效地提取价格便宜的路径，因为包括在票价路径中的图形边缘引用相关的票价树，并以其最低票价值的升序排列。一个学习实体被用来建立和更新票价树。它收集来自旨在为最终用户建立旅行解决方案的流程的数据。实现根据本发明的提取票价路径的方法的系统能够在计算机交易的经过时间内处理许多目的地，从而可以向不需要选择特定目的地的终端用户提出主题旅行选项以开始计划旅行

6. 发明申请

WO2007115895A2 IMPROVED GLOBAL DISTRIBUTION SYSTEM FOR SEARCHING BEST TRAVEL DEALS 审中-公开
标题翻译：改进的全球分发系统，用于搜索最佳旅行优惠
公开(公告)号：WO2007115895A2
公开(公告)日：2007-10-18
申请号：PCT/EP2007/052469
申请日：2007-03-15
申请人： AMADEUS S.A.S. , CHAUMONT, Gilles , DUFRESNES, Thierry , DOURTHE, Cédric , PATOUREAUX, Marc
发明人： CHAUMONT, Gilles , DUFRESNES, Thierry , DOURTHE, Cédric , PATOUREAUX, Marc
IPC分类号： G06Q10/00
CPC分类号： G06Q30/06 , G06Q10/02 , G06Q30/0601

7. 发明申请

WO2009037081A1 AUTOMATED SPLIT TICKETING 审中-公开
标题翻译：自动分配托盘
公开(公告)号：WO2009037081A1
公开(公告)日：2009-03-26
申请号：PCT/EP2008/061249
申请日：2008-08-27
申请人： AMADEUS S.A.A. , PATOUREAUX, Marc , DOURTHE, Cédric , DUFRESNE, Thierry
发明人： PATOUREAUX, Marc , DOURTHE, Cédric , DUFRESNE, Thierry
IPC分类号： G06Q10/00 , G06Q50/00 , G06F17/30
CPC分类号： G06Q30/06 , G06F17/30961 , G06Q10/02 , G06Q10/04 , G06Q50/14
摘要： An enhanced travel search tool aimed at providing travel opportunities is described. The travel search tool includes a ticket splitter operating from a list of flight connections provided by a front-end flight search engine. The ticket splitter comprises a means for valuating all ticket partitions generated from the provided list of connection flights and a tree of split criteria updated in a cache for determining the partitions and attributing to each partition a probability value of obtaining a split-ticket solution. The ticket splitter also includes a means for selecting those of the valuated partitions that have a probability value higher than a defined threshold and provides a sorted list of recommended partitions to a back-end fare search engine to price all the selected partitions including a reference single-ticket solution. Travel search tool offering of travel opportunities is enhanced by automatically including multi-ticket travel solutions.
摘要翻译：描述了一种旨在提供旅行机会的强化旅行搜索工具。旅行搜索工具包括从前端飞行搜索引擎提供的飞行连接列表操作的分票器。票分割器包括用于评估从所提供的连接航班列表产生的所有票单分区和在高速缓存中更新的用于确定分区的分割标准树的装置，并且将每个分区归因于获得分机解决方案的概率值。票分割器还包括用于选择具有高于定义阈值的概率值的评估分区的装置，并将推荐分区的排序列表提供给后端票价搜索引擎以对所有选定的分区进行定价，包括参考单 ticket解决方案提供旅行机会的旅游搜索工具可以通过自动包含多机票旅行方案得到加强。

8. 发明申请

WO2013160721A1 DATABASE SYSTEM USING BATCH-ORIENTED COMPUTATION 审中-公开
标题翻译：使用面向对象计算的数据库系统
公开(公告)号：WO2013160721A1
公开(公告)日：2013-10-31
申请号：PCT/IB2012/002668
申请日：2012-11-06
申请人： AMADEUS S.A.S.
发明人： DANIELLO, Rudy , JANIN, Benoit , ISNARDY, Luc , REYNAUD, Claudine , AUBRY, Jean-Philippe , CIABRINI, Damien , LEGRAND, Guillaume , GOLE, Remy , MAILLOT, Nicolas , ROBELIN, Charles-Antoine , VIGUIE, Luc , GIBERGUES, Sébastien , PATOUREAUX, Marc , ISNARDON, Bénédicte
IPC分类号： G06Q10/06
CPC分类号： G06F17/30557 , G06Q10/06 , G06Q30/06
摘要： A database system comprises a computation platform and a search platform. The computation platform receives batch re-computation orders from the search platform. Each batch re-computation order instructs the computation platform to compute a plurality of database query results. The computation platform processes a batch re- computation order by computing the plurality of database query results according to a batch processing schedule within a given time frame. It returns the computed database query results resulting from the batch re-computation order to the search platform. The search platform maintains the computed database query results in a memory and makes the computed database query results available to clients which are connected to the search platform. The search platform transmits the batch re- computation orders to the computation platform.
摘要翻译：数据库系统包括计算平台和搜索平台。计算平台从搜索平台接收批量重新计算订单。每批重新计算命令指示计算平台计算多个数据库查询结果。计算平台通过根据给定时间范围内的批处理调度计算多个数据库查询结果来处理批次重新计算顺序。它将从批量重新计算顺序产生的计算数据库查询结果返回到搜索平台。搜索平台将计算的数据库查询结果维护在内存中，并使计算的数据库查询结果可用于连接到搜索平台的客户端。搜索平台将批量重新计算订单发送到计算平台。

9. 发明申请

WO2013160720A1 CATEGORIZING AND RANKING TRAVEL-RELATED SEARCH RESULTS 审中-公开
标题翻译：分类和排名旅游相关搜索结果
公开(公告)号：WO2013160720A1
公开(公告)日：2013-10-31
申请号：PCT/IB2012/002541
申请日：2012-11-12
申请人： AMADEUS S.A.S.
发明人： VIGUIE, Luc , GIBERGUES, Sébastien , PATOUREAUX, Marc , ISNARDON, Bénédicte , ROBELIN, Charles-Antoine , MAILLOT, Nicolas , PRENGERE, Alex
IPC分类号： G06Q10/00
CPC分类号： G06Q10/04 , G06Q50/30
摘要： Methods, systems,and computer program products for providing result search results. Results are retrieved from a result database. The results are classified according to multiple, distinct categories and at least one of the results for each of the multiple categories is stored and then provided to a client device upon receipt of a travel search request from an end user of the client device.
摘要翻译：用于提供结果搜索结果的方法，系统和计算机程序产品。从结果数据库中检索结果。结果根据多个不同类别分类，并且存储多个类别中的每一个的结果中的至少一个，然后在从客户端设备的最终用户接收到旅行搜索请求时将其提供给客户端设备。

10. 发明公开

EP2842085A1 DATABASE SYSTEM USING BATCH-ORIENTED COMPUTATION 有权转让
标题翻译：与面向批处理计算数据库系统
公开(公告)号：EP2842085A1
公开(公告)日：2015-03-04
申请号：EP12818563.4
申请日：2012-11-06
申请人： Amadeus S.A.S.
发明人： DANIELLO, Rudy , JANIN, Benoit , ISNARDY, Luc , REYNAUD, Claudine , AUBRY, Jean-Philippe , CIABRINI, Damien , LEGRAND, Guillaume , GOLE, Remy , MAILLOT, Nicolas , ROBELIN, Charles-Antoine , VIGUIE, Luc , GIBERGUES, Sébastien , PATOUREAUX, Marc , ISNARDON, Bénédicte
IPC分类号： G06Q10/06
CPC分类号： G06F17/30557 , G06Q10/06 , G06Q30/06
摘要： A database system comprises a computation platform and a search platform. The computation platform receives batch re-computation orders from the search platform. Each batch re-computation order instructs the computation platform to compute a plurality of database query results. The computation platform processes a batch re- computation order by computing the plurality of database query results according to a batch processing schedule within a given time frame. It returns the computed database query results resulting from the batch re-computation order to the search platform. The search platform maintains the computed database query results in a memory and makes the computed database query results available to clients which are connected to the search platform. The search platform transmits the batch re- computation orders to the computation platform.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式