Abstract: A method for providing a travel reservation process to a consumer over a communications network is disclosed. The method includes receiving from a consumer first fare search parameters, performing a search for fare records in the attached database that match the first fare search parameters, evaluating rules from the first matching fare records against attributes from the consumer profile, displaying for the consumer the fare price of the first matching fare records, receiving from the consumer at a later time second fare search parameters substantially identical to the first fare search parameters, performing a search and, for each second matching fare record, if a seat is currently available, if the fare price of the second matching fare record is greater than the fare price of the first matching fare record, and if a time-period has not passed, then displaying the fare price of the first matching fare record.

Abstract: A method for providing an in flight merchandising process to a consumer is disclosed. The method includes storing a flight record that includes at least a unique identifier, a destination identifier and a current flight status, and storing an offer record that includes at least an offer for a good or service. The method further includes reading a unique identifier associated with the flight, and accessing a particular flight record associated with the unique identifier. The method further includes identifying offer records that correspond to the particular flight record by executing offer rules that define offer records that correspond to a destination identifier and current flight status of the particular flight record, and transmitting each of the offers for a good or service from the offer records that were identified, wherein each of the offers for a good or service are formatted for in flight display for the consumer.

Abstract: A method for facilitating access to a large data store is disclosed. The method includes reading the large data store, allocating a heap of at least 100 megabytes in a first memory, and storing the data store in the heap, wherein a memory address is associated with each memory element in the heap, and wherein each memory address comprises a base address unique to the first memory and an offset value from the base address. A second server allocates space in a second memory and stores a particular group of memory elements from the first memory in the second memory. Next, a graphics processing unit calculates new memory addresses for each of the memory elements in the particular group by adding a new base address, unique to the second memory, to the offset value of each memory address, and transmits the new memory addresses to the second memory.