METHODS AND SYSTEMS FOR DISTRIBUTED GRAPHICAL FLIGHT SEARCH

摘要

Methods and systems for real-time graphical search for airline flight itineraries that satisfy predetermined criteria (e.g., place and time) using a distributed graph processing system are disclosed. The advantages of the graphical method include: computational work is easily split across multiple processors for parallel processing; the resulting speed is appropriate for real-time personalized search; the method naturally supports multi-segment routes up to any user-specified maximum; the method easily handles constraints or freedoms on connections between flights, such as connection time or transferring to another airport in the same metropolis; and the method is efficient due to focusing only on viable flight segments.

主权项

1. A computer-implemented method for distributed search of a graph having one or more edges, each of the one or more edges connecting a source vertex and an endpoint vertex, the method comprising:
receiving a client request including a request origin and a request destination; translating the received client request into one or more initial queries, at least one of the initial queries including the request origin and at least one of the initial queries including the request destination; distributing the one or more initial queries to one or more flight processors, each of the flight processors assigned to handle the source vertex corresponding to the request origin of the one or more initial queries; searching, via the one or more flight processors, for the one or more edges to be added to a partial itinerary, wherein a selected edge is added to the partial itinerary where the endpoint vertex of the selected edge corresponds to the request destination of the initial queries; and appending the one or more edges of the partial itinerary to form a valid itinerary.