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

1. 发明授权

US08812333B2 Automated split ticketing 有权
标题翻译：自动拆分票务
公开(公告)号：US08812333B2
公开(公告)日：2014-08-19
申请号：US11856091
申请日：2007-09-17
申请人： Marc Patoureaux , Cédric Dourthe , Thierry Dufresne
发明人： Marc Patoureaux , Cédric Dourthe , Thierry Dufresne
IPC分类号： G06Q10/00 , G06Q50/14 , G06Q30/06 , G06Q10/04 , G06Q10/02 , G06F17/30
CPC分类号： G06Q30/06 , G06F17/30961 , G06Q10/02 , G06Q10/04 , G06Q50/14
摘要： An enhanced travel search tool aimed at providing travel opportunities includes a ticket splitter operating from a list of flight connections provided by a front-end flight search engine. The ticket splitter comprises a unit 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 unit 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解决方案提供旅行机会的旅游搜索工具可以通过自动包含多机票旅行方案得到加强。

2. 发明申请

US20100131553A1 GLOBAL DISTRIBUTION SYSTEM FOR SEARCHING BEST TRAVEL DEALS 审中-公开
标题翻译：全球分配系统，用于搜索最佳旅行优惠
公开(公告)号：US20100131553A1
公开(公告)日：2010-05-27
申请号：US12296160
申请日：2007-03-15
申请人： Gilles Chaumont , Thierry Dufresne , Cédric Dourthe , Marc Patoureaux
发明人： Gilles Chaumont , Thierry Dufresne , Cédric Dourthe , Marc Patoureaux
IPC分类号： G06F17/30 , G06Q30/00 , G06Q50/00
CPC分类号： G06Q30/06 , G06Q10/02 , G06Q30/0601
摘要： A global distribution system (GDS) organized for searching travel deals from a plurality of travel vendor fare databases (250) accessible by the GDS (200), includes: a travel multi-vendor search engine (TMVSE) operating on any database of the plurality of travel vendor fare databases; and a travel deal tracker (TDT) associated to the TMVSE (240), the TDT (270) providing directions to the TMVSE to limit the number of required transactions needed to obtain the searched travel deals.
摘要翻译：组织用于从GDS（200）可访问的多个旅行供应商票价数据库（250）中搜索旅行交易的全球分配系统（GDS）包括：在多个的任何数据库上操作的旅行多供应商搜索引擎（TMVSE）的旅游供应商票价数据库; 和与TMVSE（240）相关联的旅行交易跟踪器（TDT），TDT（270）向TMVSE提供指示以限制获得搜索的旅行交易所需的交易数量。

3. 发明授权

US08468039B2 Method for handling large amounts of standard data 有权
标题翻译：处理大量标准数据的方法
公开(公告)号：US08468039B2
公开(公告)日：2013-06-18
申请号：US11599381
申请日：2006-11-15
申请人： Cédric Dourthe , Thierry Dufresne , Pierre Etienne Melet , Gilles Chaumont
发明人： Cédric Dourthe , Thierry Dufresne , Pierre Etienne Melet , Gilles Chaumont
IPC分类号： G06Q10/00
CPC分类号： G06F17/30489 , G06Q50/14
摘要： A method for handling large amounts of standard data contained in one or more databases conforming to a standard data model is described. When large amounts of standard data are needed to answer requests of end-users of a software application, the method assumes that a significantly reduced amount of metadata useable by the software application are first built out of the large amounts of standard data. The metadata are stored in an intermediate database of metadata and delivered to the software application through a metadata engine in lieu of the large amounts of standard data. The invention allows software application to consider much larger amounts of standard data to better answer end-user requests in an acceptable elapsed time.
摘要翻译：描述了一种处理包含在符合标准数据模型的一个或多个数据库中的大量标准数据的方法。当需要大量标准数据来回答软件应用程序的最终用户的请求时，该方法假设由大量的标准数据首先构建出由软件应用程序可用的大量减少的元数据。元数据存储在元数据的中间数据库中，并通过元数据引擎代替大量的标准数据传送到软件应用程序。本发明允许软件应用考虑更大量的标准数据，以在可接受的经过时间内更好地回答最终用户请求。

4. 发明授权

US08805826B2 System and method for processing complex queries 有权
标题翻译：用于处理复杂查询的系统和方法
公开(公告)号：US08805826B2
公开(公告)日：2014-08-12
申请号：US13065619
申请日：2011-03-24
申请人： David Pauchet , Benoît Janin , Rudy Daniello , Thierry Dufresne , Marc Patoureaux
发明人： David Pauchet , Benoît Janin , Rudy Daniello , Thierry Dufresne , Marc Patoureaux
IPC分类号： G06F17/30 , G06Q10/02
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.
摘要翻译：本发明涉及一种用于处理复杂查询的方法和系统，每个复数查询对应于要组合的多个组件。搜索与这些组件对应的元素。元素具有不同的元素类型，并且最初由具有异构数据结构的定义数据描述。转换步骤将异构定义数据转换为一种单一格式的转换定义数据。然后，引擎基于转换的定义数据检索元素并构建与查询参数匹配的元素的关联，从而以优化的方式提供对查询的回复。

5. 发明申请

US20080270254A1 Method and System of Building Actual Travel Fares 审中-公开
标题翻译：建设实际旅行票价的方法和制度
公开(公告)号：US20080270254A1
公开(公告)日：2008-10-30
申请号：US11997164
申请日：2006-07-21
申请人： Marc Patoureaux , Thierry Dufresne , Gilles Chaumont , Cedric Dourthe , Thierry Blaszka
发明人： Marc Patoureaux , Thierry Dufresne , Gilles Chaumont , Cedric Dourthe , Thierry Blaszka
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.
摘要翻译：披露了一种从票价数据库中建立计算机实际旅行票价的方法。建立表示旅行目的地的节点图，其中包括连接节点对的边缘。每个边缘参考最低旅行票价。此外，为每个图形边缘构建一个票价树。至少包括一个保存相应图形边缘最低旅行票价的根节点。它们可能包括更多节点，包括上下文密钥和相关的旅行票价。组织树木，使儿童节点持有旅行票价等于或大于父节点的旅行票价。因此，可以有效地提取价格便宜的路径，因为包括在票价路径中的图形边缘引用相关的票价树，并以其最低票价值的升序排列。一个学习实体被用来建立和更新票价树。

6. 发明授权

US08311859B2 Method and system for determining an optimal low fare for a trip 有权
标题翻译：确定行程最佳低价的方法和系统
公开(公告)号：US08311859B2
公开(公告)日：2012-11-13
申请号：US12562116
申请日：2009-09-17
申请人： Marc Patoureaux , Thierry Dufresne , David Pauchet
发明人： Marc Patoureaux , Thierry Dufresne , David Pauchet
IPC分类号： G06Q99/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.
摘要翻译：一种用于确定旅行的最佳票价的方法，包括出发地点，到达地点，方法包括以下步骤：发送旅行请求，其中请求包括出发地点，到达地点和旅行的相应票价 ; 通过在预定数据库中搜索来确定一组附加请求来自动修改请求，其中每个附加请求包括出发位置，到达位置或可形成所请求路线的至少一部分的一个或多个附加位置中的至少一个，其中，预定数据库包括所述附加请求和每个附加请求的对应票价; 选择一个或多个附加请求以形成一个或多个替代请求，其至少包括作为请求的出发地点或到达位置; 计算每个备用请求的最新费用，以确定每个替代请求的结果票价; 比较票价和结果票价，以确定旅行结果最低的票价。

7. 发明申请

US20100293012A1 METHOD AND SYSTEM FOR DETERMINING AN OPTIMAL LOW FARE FOR A TRIP 有权
标题翻译：用于确定最佳低价位的方法和系统
公开(公告)号：US20100293012A1
公开(公告)日：2010-11-18
申请号：US12562116
申请日：2009-09-17
申请人： Marc Patoureaux , Thierry Dufresne , David Pauchet
发明人： Marc Patoureaux , Thierry Dufresne , David Pauchet
IPC分类号： G06Q50/00 , G06Q30/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.
摘要翻译：一种用于确定旅行的最佳票价的方法，包括出发地点，到达地点，方法包括以下步骤：发送旅行请求，其中请求包括出发地点，到达地点和旅行的相应票价 ; 通过在预定数据库中搜索来确定一组附加请求来自动修改请求，其中每个附加请求包括出发位置，到达位置或可形成所请求路线的至少一部分的一个或多个附加位置中的至少一个，其中，预定数据库包括所述附加请求和每个附加请求的对应票价; 选择一个或多个附加请求以形成一个或多个备选请求，其至少包括作为请求的出发地点或到达位置; 计算每个备用请求的最新费用，以确定每个替代请求的结果票价; 比较票价和结果票价，以确定旅行结果最低的票价。

8. 发明授权

US08280870B2 Search engine and associated method 有权
标题翻译：搜索引擎及相关方法
公开(公告)号：US08280870B2
公开(公告)日：2012-10-02
申请号：US12713149
申请日：2010-02-25
申请人： Pierre-Etienne Melet , Thierry Dufresne , Cëdric Dourthe , Marc Patoureaux
发明人： Pierre-Etienne Melet , Thierry Dufresne , Cëdric Dourthe , Marc Patoureaux
IPC分类号： G06F17/30 , G06Q99/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.
摘要翻译：一种在多个实体中搜索实体的方法，其中所有实体通过至少一个共同标准链接并具有多个数据格式，其中每个实体包括可以通过标准搜索的一组数据由用户输入; 并且其中每个实体具有数据格式; 并且其中特定的数据格式定义了标准记录格式; 该方法包括以下步骤：确定实体的数据格式; 如果实体的数据格式与标准记录格式不符，则将实体传递给预处理引擎; 如果实体的数据格式符合标准记录格式，则将实体的标准记录格式数据传递给主处理引擎; 在预处理引擎中将实体数据格式与标准记录格式进行比较，并将转换应用于实体数据集; 基于转换将实体数据集合转换为标准记录格式以形成转换的数据集; 将转换的数据集传递给主处理引擎; 在主处理引擎中接收标准记录格式实体数据集和转换后的数据集; 并且产生一组结合转换的数据集合和标准记录格式数据的结果，以供优选实体的用户选择。

9. 发明申请

US20120239636A1 System and method for processing complex queries 有权
标题翻译：用于处理复杂查询的系统和方法
公开(公告)号：US20120239636A1
公开(公告)日：2012-09-20
申请号：US13065619
申请日：2011-03-24
申请人： David Pauchet , Benoît Janin , Rudy Daniello , Thierry Dufresne , Marc Patoureaux
发明人： David Pauchet , Benoît Janin , Rudy Daniello , Thierry Dufresne , Marc Patoureaux
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.
摘要翻译：本发明涉及一种用于处理复杂查询的方法和系统，每个复数查询对应于要组合的多个组件。搜索与这些组件对应的元素。元素具有不同的元素类型，并且最初由具有异构数据结构的定义数据描述。转换步骤将异构定义数据转换为一种单一格式的转换定义数据。然后，引擎基于转换的定义数据检索元素并构建与查询参数匹配的元素的关联，从而以优化的方式提供对查询的回复。

10. 发明申请

US20110145025A1 MULTI-DESTINATION TRIP SELECTION 审中-公开
标题翻译：多目的地选择
公开(公告)号：US20110145025A1
公开(公告)日：2011-06-16
申请号：US12754319
申请日：2010-04-05
申请人： Donghua Jiang , Marc Patoureaux , Thierry Dufresne
发明人： Donghua Jiang , Marc Patoureaux , Thierry Dufresne
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.
摘要翻译：一种从多个可能的行程中选择至少一个行程的方法，所述多个可能的行程中的每一个行进是从原点位置行进并且包括在多个目的地的停止。该方法在被配置为执行该方法的计算机装置中执行。该方法包括：为每个腿确定多个不同腿部选项中的每一个的票价，每个腿部位于以下之一之一：原点位置和目的地之间; 和两个目的地; 基于确定的票价的比较量来选择每个腿的多个候选腿选项，所述多个候选腿选项的数量少于所述多个不同的腿选项; 以及基于每个腿的多个候选腿选项来确定至少一个行程。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式