Pricing graph representation for sets of pricing solutions for travel planning system
First Claim
1. A computer storage medium storing a data structure that represents pricing solutions for use with a travel planning software program comprises:
- a first plurality of choice nodes that represent exclusive pricing solutions;
a second plurality of combining nodes that represent collective pricing solutions; and
a third plurality of terminal nodes that represent pricing objects.
4 Assignments
0 Petitions
Accused Products
Abstract
An airline travel planning system is described. The system includes a server computer executing a server process including a search process to search for set of pricing solutions in accordance with at least one destination and at least one origin. The search process represents the set of pricing solutions in the form of a directed acyclic graph. The system also includes a client computer executing a client process on the set of pricing solutions. The client process has a manipulation process that manipulates the set of pricing solutions in response to user preferences. Several processes are described including a process responsive to user preferences and to set of pricing solutions that provides pricing solutions sorted by said user preference, a process that sorts set of pricing solutions to produce a subset of said set of pricing solutions in accordance with user specified preferences, and a process that prunes from the directed acyclic graph nodes that are no longer contained within the subset of set of pricing solutions.
-
Citations
49 Claims
-
1. A computer storage medium storing a data structure that represents pricing solutions for use with a travel planning software program comprises:
-
a first plurality of choice nodes that represent exclusive pricing solutions;
a second plurality of combining nodes that represent collective pricing solutions; and
a third plurality of terminal nodes that represent pricing objects. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24)
each node having a field if containing a first value invalidates the node preventing the node from contributing to forming the enumerated pricing solution components or a second value to validate the node permitting the node to contribute to forming the enumerated pricing solution components.
-
-
14. The computer storage medium of claim 1 wherein the exclusive nodes include value fields corresponding to a minimum possible inner value, minimum possible outer value and minimum possible total value.
-
15. The computer storage medium of claim 1 wherein the combining nodes include value fields corresponding to a minimum possible inner value, minimum possible outer value and minimum possible total value.
-
16. The computer storage medium of claim 1 wherein the terminal nodes include value fields corresponding to a minimum possible inner value, minimum possible outer value and minimum possible total value.
-
17. The computer storage medium of claim 1 wherein at least some of the nodes include value fields corresponding to at least one of a minimum possible inner value, minimum possible outer value and minimum possible total value.
-
18. The computer storage medium of claim 1 wherein a first portion of the first plurality of exclusive nodes refer to subsequent combining nodes.
-
19. The computer storage medium of claim 9 wherein a second portion of said first plurality of exclusive nodes refer to terminal nodes.
-
20. The computer storage medium of claim 1 wherein a first portion of said second plurality of combining nodes refer to subsequent combining nodes.
-
21. The computer storage medium of claim 20 wherein a second portion of said second plurality of combining nodes refer to terminal nodes.
-
22. The computer storage medium of claim 1 wherein exclusive nodes include a pointing field pointing a child node having a least positive inner-value.
-
23. The computer storage medium of claim 21 wherein the value fields are used by algorithms to extract pricing solution components from the data structure.
-
24. The computer storage medium of claim 21 wherein the value fields are used by algorithms to return values in response to a query presented by an algorithm.
-
25. A computer storage medium storing a data structure that represents pricing solutions for use with a travel planning software program comprises:
-
a first plurality of choice nodes that represent exclusive pricing solutions;
a second plurality of combining nodes that represent collective pricing solutions;
a third plurality of terminal nodes that represent pricing objects; and
wherein said nodes are logically combined according to rules to enumerate a plurality of pricing solutions, with the number of said pricing solutions being substantially greater than the number of nodes. - View Dependent Claims (26, 27, 28, 29)
-
-
30. A method executed in a computer system for producing a pricing graph data structure from a plurality of data strictures used to represent information and operations involved in forming pricing solutions, for use with a travel planning software application comprises:
-
assigning a type to each of the plurality of data structures, said type requiring a corresponding data structure to be combinable with others of the plurality of data structures or exclusive to others of the plurality of data structures;
listing fields in the corresponding data structure that contribute to a node in the pricing graph data structure;
converting fields of the data structure into the assigned type; and
placing converted fields from the data structure in a node in the pricing graph data structure. - View Dependent Claims (31, 32, 33, 34, 35, 36, 37, 38)
-
-
39. A method executed on a computer system in a travel planning system for manipulating a pricing graph data structure having a plurality of nodes that represent pricing solutions, the data structure for use with a travel planning software application, the method comprising:
-
selecting a value function based on a user input and which initializes the value function;
applying the selected value function to the pricing graph data structure to extract from the pricing graph, a pricing solution component that satisfies the specified input to the value function. - View Dependent Claims (40, 41, 42, 43, 44, 45, 46, 47, 48, 49)
applying a value function to the pricing graph data structure; and
returning a numerical value from one of the value fields in validated nodes which are nodes that can be used to rank the pricing solution components.
-
-
47. The method of claim 46 wherein the value function returns a fare for a set of pricing solutions from one of the fields in the nodes.
-
48. The method of claim 46 wherein the value function returns a value determined from at least two attributes of a set of pricing solution components from two of the fields in the nodes.
-
49. The method of claim 46 wherein the value function enumerates a plurality of pricing solutions by sorting the nodes in accordance with a user preference and returns values from one of the fields in the sorted nodes.
Specification