公开(公告)号：US09953056B2

公开(公告)日：2018-04-24

申请号：US14840067

申请日：2015-08-31

Applicant: SAP SE

Inventor： Shuhao Zhang ,  Hoang Tam Vo ,  Daniel Hermann Richard Dahlmeier ,  Bingsheng He

IPC: G06F17/30

CPC classification number: G06F17/30463

Abstract: Jumbo query plans are generated by applying at least one sharing technique and combining at least two of the pattern queries. Costs of the jumbo query plans may then be estimated and used to search for an optimal query plan. The optimal query plan may then be executed on an input data stream to generate an output data stream.

公开(公告)号：US09778051B2

公开(公告)日：2017-10-03

申请号：US14840069

申请日：2015-08-31

Applicant: SAP SE

Inventor： Hoang Tam Vo ,  Peng Ni ,  Chengbin Yan

IPC: G01C21/34 ,  G01C21/36 ,  G06Q10/04

CPC classification number: G01C21/3423 ,  G01C21/3446 ,  G01C21/3453 ,  G01C21/3676 ,  G06Q10/047

Abstract: A route planner for a transportation network is disclosed. The route planner generates k suggested routes based on a user query using a diversified k shortest routes technique. The diversified k shortest routes techniques analyzes a transportation graph and suggests k routes to the user. The diversified k shortest routes can provide a user with options to take the next best route if they miss the optimal one. These options also include other preferences, such as less number of transfers, as long as they are reasonable in terms of total travel time. The suggested routes take into account travel calendars, as well as location-to-location queries which require geocoding and reverse geocoding capabilities. Transfers between different types of transportation services such as train and bus are also supported.

公开(公告)号：US09726502B2

公开(公告)日：2017-08-08

申请号：US14840064

申请日：2015-08-31

Applicant: SAP SE

Inventor： Peng Ni ,  Hoang Tam Vo ,  Daniel Hermann Richard Dahlmeier ,  Wentong Cai

IPC: G01C21/20 ,  G01C21/34 ,  G08G1/01

CPC classification number: G01C21/20 ,  G01C21/3446 ,  G01C21/3453 ,  G06Q10/04 ,  G08G1/0125

Abstract: A computer-implemented technology for planning routes is described herein. In accordance with one aspect, travel data of commuters of a transportation network are provided. Continuous distributions of travel time and waiting time are generated from the travel data. The continuous distributions of travel time and waiting time are associated to a transportation graph of the transportation network. The transportation graph includes nodes corresponding to stops of the transportation network and edges interconnecting the nodes. Travel time and waiting time are associated as costs of the edges in the transportation graph. In response to receiving input parameters, expected costs of candidate routes in the transportation graph are determined in accordance with a modified multi criteria shortest path technique. The modified multi criteria shortest path technique invokes a subroutine to retrieve accurate costs of routes based at least on the costs of the edges in the transportation graph. Route recommendations are provided based on the expected costs of the candidate routes.