Abstract: A method, system, method and computer program product for retrieving data. Records are retrieved from a hierarchical database. The records are categorized into a plurality of record types. Each record comprises a unique identifier field. A record map contains zero or more entries. Each entry comprises an identifying value, data from at least one record and a set of Boolean flags. Each flag corresponds to a record type. A computer iterates over the retrieved records. Data from each record is stored at an entry in the record map having an identifying value equal to the value included in the unique identifier field of the record. Moreover, the flag in this entry which corresponds to the record type of the record is set. Inner joins and outer joins are then performed using the contents of the record map.

Abstract: Techniques for replicating modified data to a hierarchical database. A first list comprises records included in a set of records before at least one modification thereto. A second list comprises records included in the set of records after the at least one modification thereto. For each pre-modification record included in the first list and each post-modification record included in the second list having equal identifying values, a target record at the database and having a matching identifying value is modified. Specifically, if both records include corresponding indexes, information about a structure pointed to by the pre-modification record is removed from an index included in the target record, and information about a structure pointed to by the post-modification record is added to the index. If neither record includes an index, the target record is modified to contain at least one changed value included in the post-modification record.

Abstract: Techniques for replicating modified data to a hierarchical database. A first list comprises records included in a set of records before at least one modification thereto. A second list comprises records included in the set of records after the at least one modification thereto. For each pre-modification record included in the first list and each post-modification record included in the second list having equal identifying values, a target record at the database and having a matching identifying value is modified. Specifically, if both records include corresponding indexes, information about a structure pointed to by the pre-modification record is removed from an index included in the target record, and information about a structure pointed to by the post-modification record is added to the index. If neither record includes an index, the target record is modified to contain at least one changed value included in the post-modification record.

Abstract: A method, system, method and computer program product for retrieving data. Records are retrieved from a hierarchical database. The records are categorized into a plurality of record types. Each record comprises a unique identifier field. A record map contains zero or more entries. Each entry comprises an identifying value, data from at least one record and a set of Boolean flags. Each flag corresponds to a record type. A computer iterates over the retrieved records. Data from each record is stored at an entry in the record map having an identifying value equal to the value included in the unique identifier field of the record. Moreover, the flag in this entry which corresponds to the record type of the record is set. Inner joins and outer joins are then performed using the contents of the record map.

Abstract: A plurality of batch lists are maintained by a channel in order to improve the efficiency of the channel in performing messaging between a sender and a receiver. For example, a Next Batch list is used to prefetch messages to be sent to the receiver from the sender; a Current Batch list includes the messages currently being transmitted to the receiver or waiting confirmation; and an Acknowledged Batch List includes the messages confirmed by the receiver. This allows the functions of prefetching messages, sending messages and deleting confirmed messages to be performed in parallel.

Abstract: A method for triggering message queue applications, comprising performing a first trigger process, the first trigger process including: a first application evaluating a queue for a trigger message; the first application determining whether a second trigger process is already being performed for the queue; and the first application invoking a second application where the invoking is in response to the trigger message.

Abstract: A plurality of batch lists are maintained by a channel in order to improve the efficiency of the channel in performing messaging between a sender and a receiver. For example, a Next Batch list is used to prefetch messages to be sent to the receiver from the sender; a Current Batch list includes the messages currently being transmitted to the receiver or waiting confirmation; and an Acknowledged Batch List includes the messages confirmed by the receiver. This allows the functions of prefetching messages, sending messages and deleting confirmed messages to be performed in parallel.

Abstract: A plurality of batch lists are maintained by a channel in order to improve the efficiency of the channel in performing messaging between a sender and a receiver. For example, a Next Batch list is used to prefetch messages to be sent to the receiver from the sender; a Current Batch list includes the messages currently being transmitted to the receiver or waiting confirmation; and an Acknowledged Batch List includes the messages confirmed by the receiver. This allows the functions of prefetching messages, sending messages and deleting confirmed messages to be performed in parallel.

Abstract: A highly available, high-performance memory queue. Locking of the queue is minimized in order to provide a highly available queue and to improve performance of the queue. Multiple updates of the queue can occur under a single lock. Further, messages of the queue are persistent. A time-initiated checkpointing process, as well as the storing of message information on a recovery log, ensures the persistence of the queue messages.

Abstract: Memory resident queues are monitored at predefined time intervals. When the monitoring indicates that a particular queue is not being serviced at a desired level, then action is taken to sweep one or more messages from the queue. The sweeping of the messages frees up system resources associated with the messages, thus allowing other tasks to be serviced. If, after the sweeping, it is determined that the queue can handle additional messages, then one or more messages are placed back on the queue.

Abstract: A real-time vehicular traffic flow display system employs groups of monitor stations positioned at spaced-apart locations along vehicular roadways, to sense the speed of traffic flow on a given portion of a route. Individual section stations each serve a sequential group of different monitor stations. Each monitor station senses the speed of vehicular traffic a given road portion and transmits corresponding information to an associated section station; each section station processes the received signals, and transmits them to display stations on board vehicles in addition to sending the signals to an optional geographic area central station. The signals transmitted to vehicles present information concerning traffic speed for each monitored portion of a road in addition to identifying the road portion; traffic speed information is processed to identify predetermined ranges of average speed in selected colors.

Abstract: When a processor becomes inactive, queues resident in the memory of that processor become inaccessible. Thus, in order to access those queues, an active processor takes over ownership of one or more of the inaccessible queues. Each queue may be rebuilt prior to its take over to ensure that it has up-to-date information.

Abstract: A structure and method is provided for optimizing memory resources, by establishing a history file for recording data processing criterion. The history file is then recorded in a first memory. Information either stored in the first memory or scheduled to be stored in the first memory can then be selectively reallocated and stored in an alternate memory. All or portions of the reallocated information can then be restored back to the first memory subsequently, with reference to the history file.

Abstract: A real-time vehicular traffic flow display system employs groups of monitor stations positioned at spaced-apart locations along vehicular roadways, to sense the speed of traffic flow on a given portion of a route. Individual section stations each serve a sequential group of different monitor stations. Each monitor station senses the speed of vehicular traffic a given road portion and transmits corresponding information to an associated section station; each section station processes the received signals, and transmits them to display stations on board vehicles in addition to sending the signals to an optional geographic area central station. The signals transmitted to vehicles present information concerning traffic speed for each monitored portion of a road in addition to identifying the road portion; traffic speed information is processed to identify predetermined ranges of average speed in selected colors.

Abstract: A method for triggering message queue applications, comprising performing a first trigger process, the first trigger process including: a first application evaluating a queue for a trigger message; the first application determining whether a second trigger process is already being performed for the queue; and the first application invoking a second application where the invoking is in response to the trigger message.

Abstract: A method and apparatus for switching messages from a primary message channel to a secondary message channel in a message queuing system in which messages are placed in a first transmission queue of a local system for transmission to a remote system via a primary message channel. A local queue manager continuously checks to see whether a high water mark has been reached in the first transmission queue, indicating an apparent failure in the primary message channel. On determining such an apparent failure in the primary message channel, the queue manager determines whether the secondary message channel is associated with the first transmission queue. If so, the queue manager activates the secondary message channel to serve said first transmission queue. If, on the other hand, the secondary message channel is associated with another transmission queue, the queue manager transfers messages already in the first queue to the other queue and redirects any new messages intended for the first queue to the other queue.

Abstract: A common shared queue is provided, which includes a plurality of local queues. Each local queue is resident on a storage medium coupled to a processor. The local queues are monitored, and when it is determined that a particular local queue is being inadequately serviced, then one or more messages are moved from that local queue to one or more other local queues of the common shared queue.

Abstract: Memory resident queues are monitored at predefined time intervals. When the monitoring indicates that a particular queue is not being serviced at a desired level, then action is taken to sweep one or more messages from the queue. The sweeping of the messages frees up system resources associated with the messages, thus allowing other tasks to be serviced. If, after the sweeping, it is determined that the queue can handle additional messages, then one or more messages are placed back on the queue.

Abstract: When a processor becomes inactive, queues resident in the memory of that processor become inaccessible. Thus, in order to access those queues, an active processor takes over ownership of one or more of the inaccessible queues. Each queue may be rebuilt prior to its take over to ensure that it has up-to-date information.

Abstract: A plurality of batch lists are maintained by a channel in order to improve the efficiency of the channel in performing messaging between a sender and a receiver. For example, a Next Batch list is used to prefetch messages to be sent to the receiver from the sender; a Current Batch list includes the messages currently being transmitted to the receiver or waiting confirmation; and an Acknowledged Batch List includes the messages confirmed by the receiver. This allows the functions of prefetching messages, sending messages and deleting confirmed messages to be performed in parallel.