Providing travel information using a layered cache

• US 20080168093A1
• Filed: 01/05/2007
• Published: 07/10/2008
• Est. Priority Date: 01/05/2007
• Status: Abandoned Application

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google LLC (Alphabet Inc.)
• Inventors: De Marcken, Carl
• Application Number:
  US11/650,342
• Publication Number:
  US 20080168093A1
• Time in Patent Office: Days
• US Class Current: 707/104.1
• CPC Class Codes: G06F 16/24539 using cached or materialised query results
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events

Abstract

Systems and techniques for configuring a database are described. Cached results provided from querying a travel planning system are stored with travel queries specifying travel parameters of trips. Data from the cached results are stored in records in the database that include fields corresponding to predefined categories of the schedule and fare information. A super-category of at least two of the predefined categories is defined such that the super-category includes at least a portion of schedule and fare information from the at least two of the predefined categories. The records are indexed by the super-category.

Claims

1. A method for configuring a database, the method comprising:

storing cached results provided from querying a travel planning system with travel queries specifying travel parameters of trips, the cached results including schedule and fare information;

storing data from the cached results in records in the database, the records including fields corresponding to predefined categories of the schedule and fare information;

defining a super-category of at least two of the predefined categories, the super-category including at least a portion of schedule and fare information from the at least two of the predefined categories; and

indexing the records by the super-category.

2. The method of claim 1, wherein one of the predetermined categories is a departure date specifying a day and a month of a scheduled departure and the new category is a departure date specifying only a month of a scheduled departure.

3. The method of claim 1, wherein one of the predetermined categories is an origin airport and the new category is a city in which the origin airport is located.

4. The method of claim 1, wherein one of the predetermined categories is an origin airport and the new category is a country in which the origin airport is located.

5. The method of claim 1, further comprising deleting the fields corresponding to a first category from the records.

6. The method of claim 1, further comprising:

computing pricing solutions for the records;

determining a cheapest pricing solution from the computed pricing solutions; and

storing in a data structure, an identifier of the new category and the cheapest pricing solution; and

configuring the database to retrieve the cheapest pricing solution in response to receiving a travel query specifying a parameter that matches the new category and that is broader than a first category.

7. The method of claim 6, further comprising updating the cheapest pricing solution satisfying the travel parameters.

8. The method of claim 1, further comprising assigning timestamps to the records, the timestamps indicating a time at which the data from the cached results is stored.

9. The method of claim 8, further comprising constructing a plot of pricing information as a function of time using the timestamps.

20. The method of claim 1, wherein the query answers are associated with one-way trips and the first pricing solution is associated with a trip comprising the one-way trips.

21. The method of claim 1, wherein the query answers correspond to cheapest fares.

22. The method of claim 1, further comprising:

computing taxes associated with the first pricing solution; and

computing a final price of a ticket associated with the first pricing solution, the final price including the taxes.

23. The method of claim 1, further comprising constructing a second pricing solution using the first pricing solution.

24. The method of claim 1, wherein constructing the first pricing solution comprises combining the one-way trips to produce a round trip.

25. The method of claim 1, wherein constructing the first pricing solution comprises combining the one-way trips to produce an open jaw trip.

10. A system for storing cached results for travel planning, the system comprising:

a database storing cached results provided from querying a travel planning system with travel queries specifying travel parameters of trips, the cached results including schedule and fare information; and

a processor configured to;

store data from the cached results in records in the database, the records including fields corresponding to predefined categories of the schedule and fare information;

define a super-category of at least two of the predefined categories, the super-category including at least a portion of schedule and fare information from the at least two of the predefined categories; and

index the records by the super-category.

11. The system of claim 10, wherein one of the predetermined categories is a departure date specifying a day and a month of a scheduled departure, and the new category is a departure date specifying only a month of a scheduled departure.

12. The system of claim 10, wherein one of the predetermined categories is an origin airport and the new category is a city in which the origin airport is located.

13. The system of claim 10, wherein one of the predetermined categories is an origin airport and the new category is a country in which the origin airport is located.

14. The system of claim 10, wherein the processor is configured to delete the fields corresponding to a first category from the records.

15. The system of claim 10, wherein the processor is further configured to:

compute pricing solutions for the records;

determine a cheapest pricing solution from the computed pricing solutions; and

store in a data structure, an identifier of the new category and the cheapest pricing solution; and

wherein the database is further configured to retrieve the cheapest pricing solution in response to receiving a travel query specifying a parameter that matches the new category and that is broader than a first category.

16. The system of claim 15, wherein the processor is further configured to update the cheapest pricing solution satisfying the travel parameters.

17. The system of claim 10, wherein the database is further configured to assign timestamps to the records, the timestamps indicating a time at which the data from the cached results is stored in the database.

18. The system of claim 17, wherein the processor is further configured to construct a plot of pricing information as a function of time using the timestamps.

19. A method for travel planning, the method comprising;

storing query answers received from a travel planning system, the query answers including schedule and fare information satisfying parameters of previous travel queries;

receiving a travel query specifying travel parameters of a trip of interest for a user; and

constructing a first pricing solution according to the travel parameters of the trip of interest, from a combination of the query answers.

26. A system for travel planning, the system comprising;

a database configured to store query answers received from a travel planning system, the query answers including schedule and fare information satisfying parameters of previous travel queries; and

a processor configured to;

receive a travel query specifying travel parameters of a trip of interest for a user; and

construct a first pricing solution according to the travel parameters of the trip of interest, from a combination of the query answers.

27. The system of claim 26, wherein the query answers are associated with one-way trips and the first pricing solution is associated with a trip comprising the one-way trips.

28. The system of claim 26, wherein the query answers correspond to cheapest fares.

29. The system of claim 26, wherein the processor is further configured to:

compute taxes associated with the first pricing solution; and

compute a final price of a ticket associated with the first pricing solution, the final price including the taxes.

30. The system of claim 26, wherein the processor is further configured to construct a second pricing solution using the first pricing solution.

31. The system of claim 26, wherein the processor is further configured to combine the one-way trips to produce a round trip.

32. The system of claim 26, wherein the processor is further configured to combine the one-way trips to produce an open jaw trip.

33. A computer program product for configuring a database, the computer program product being tangibly stored on machine readable media, comprising instructions operable to cause one or more processors to:

store cached results provided from querying a travel planning system with travel queries specifying travel parameters of trips, the cached results including schedule and fare information;

store data from the cached results in records in the database, the records including fields corresponding to predefined categories of the schedule and fare information;

define a super-category of at least two of the predefined categories, the super-category including at least a portion of schedule and fare information from the at least two of the predefined categories; and

index the records by the super-category.

34. The product of claim 33, wherein one of the predetermined categories is a departure date specifying a day and a month of a scheduled departure and the new category is a departure date specifying only a month of a scheduled departure.

35. The product of claim 33, wherein one of the predetermined categories is an origin airport and the new category is a city in which the origin airport is located.

36. The product of claim 33, wherein one of the predetermined categories is an origin airport and the new category is a country in which the origin airport is located.

37. The product of claim 33, further comprising instructions to delete the fields corresponding to a first category from the records.

38. The product of claim 33, further comprising instructions to:

compute pricing solutions for the records;

determine a cheapest pricing solution from the computed pricing solutions; and

store in a data structure, an identifier of the new category and the cheapest pricing solution; and

configure the database to retrieve the cheapest pricing solution in response to receiving a travel query specifying a parameter that matches the new category and that is broader than a first category.

39. The product of claim 33, further comprising instructions to update the cheapest pricing solution satisfying the travel parameters.

40. The product of claim 33, further comprising instructions to assign timestamps to the records, the timestamps indicating a time at which the data from the cached results is stored.

41. The product of claim 33, further comprising instructions to construct a plot of pricing information as a function of time using the timestamps.

storing query answers received from a travel planning system, the query answers including schedule and fare information satisfying parameters of previous travel queries;

receiving a travel query specifying travel parameters of a trip of interest for a user; and

constructing a first pricing solution according to the travel parameters of the trip of interest, from a combination of the query answers.

42. A computer program product for travel planning, the computer program product being tangibly stored on machine readable media, comprising instructions operable to cause one or more processors to

store query answers received from a travel planning system, the query answers including schedule and fare information satisfying parameters of previous travel queries;

receive a travel query specifying travel parameters of a trip of interest for a user; and

construct a first pricing solution according to the travel parameters of the trip of interest, from a combination of the query answers.

43. The product of claim 42, wherein the query answers are associated with one-way trips and the first pricing solution is associated with a trip comprising the one-way trips.

44. The product of claim 42, wherein the query answers correspond to cheapest fares.

45. The product of claim 42, further comprising instructions to:

computing taxes associated with the first pricing solution; and

computing a final price of a ticket associated with the first pricing solution, the final price including the taxes.

46. The product of claim 42, further comprising instructions to construct a second pricing solution using the first pricing solution.

47. The product of claim 42, further comprising instructions to combining the one-way trips to produce a round trip.

48. The product of claim 42, further comprising instructions to combine the one-way trips to produce an open jaw trip.