Abstract: A computer-implemented method of resizing a data structure includes storing a first hash index comprising x elements, wherein x is a positive integer greater than two, determining that the first hash index needs to expand, allocating a second hash index, wherein the second index contains at least x+1 elements, attempting, by a first thread, to advance a first pointer from the first hash index to the second hash index, attempting, by a second thread, to advance the first pointer from the first hash index to the second hash index, where only one of the first thread or the second thread will advance the first pointer based on an atomic operation.

Abstract: A computer-implemented method of resizing a data structure includes storing a first hash index comprising x elements, wherein x is a positive integer greater than two, determining that the first hash index needs to expand, allocating a second hash index, wherein the second index contains at least x+1 elements, attempting, by a first thread, to advance a first pointer from the first hash index to the second hash index, attempting, by a second thread, to advance the first pointer from the first hash index to the second hash index, where only one of the first thread or the second thread will advance the first pointer based on an atomic operation.

Abstract: Systems and methods of queuing data for multiple readers and writers are provided. Enqueuing operations are disclosed that can process write functionality and can determine whether ring buffers have potentially filled, and dynamically declare a new ring buffer at a multiple of capacity of the current ring. Dequeuing operations are disclosed that can process read functionality for advancing control and determining whether and when to free ring buffers from memory.

Abstract: A system and method for creating a travel itinerary. An itinerary creation engine may receive a request for a travel itinerary, identify one or more midpoints between the requested origin and destination (or proximate locations), and generate an itinerary that includes a route between the one or more midpoints and the origin or the destination (or proximate locations).

Abstract: A system and method operable to cache and retrieve flight availability data. System components are a cache database for storing flight availability data, an airline cache control for configuring the cache database for a plurality of airlines, a subscriber cache control for configuring the cache database for a plurality of subscribers, and a cache query utility for interacting with the cache database. Additional system components are a data display utility for displaying flight availability data stored in the cache database, a success rate utility for tracking statistics associated with use of the cache database, and a dual mode processing utility that allows access to flight availability data from either the cache database or a real-time response. The system is provided as an intermediary between the subscribers and a plurality of airline servers.

Abstract: A system and method operable to cache and retrieve flight availability data. System components are a cache database for storing flight availability data, an airline cache control for configuring the cache database for a plurality of airlines, a subscriber cache control for configuring the cache database for a plurality of subscribers, and a cache query utility for interacting with the cache database. Additional system components are a data display utility for displaying flight availability data stored in the cache database, a success rate utility for tracking statistics associated with use of the cache database, and a dual mode processing utility that allows access to flight availability data from either the cache database or a real-time response. The system is provided as an intermediary between the subscribers and a plurality of airline servers.