Abstract: A method for acquiring and storing schedule event information from a cyclical broadcast in an interactive television system comprising a Head end (20), transmission media (32) and a client device such as a set top box (28) and display TV (26). An request queue for particular Event Information Table (EIT) schedule sections (42) is created and serviced in optimal fashion by selecting a section from the EIT request queue with the least acquisition latency based on the current position in the EIT broadcast cycle, the set top box (28) processing speed and the sequence of EIT sections (42) requested.

Abstract: A method for managing drivers includes receiving registration information of a plurality of drivers and storing the registration information of the drivers; receiving interconnection information of the drivers and storing the interconnection information of the drivers; receiving at least a request to activate a specific driver of the drivers; searching the registration information for the specific driver; and referencing the interconnection information to determine whether the specific driver can be activated in response to the request.

Abstract: A method for acquiring and storing schedule event information in an interactive television system. The schedule event information includes events and a start time and date for each of the events. The method includes creating a window defined by a start time and date and an end time and date and receiving the schedule event information at a receiving station. The schedule event information is stored for events having a start time and date within the window. The method further includes automatically moving the window forward relative to the start time and date at a specified interval such that the end time and date of the window are always after a current time and date. A system for acquiring and storing schedule event information is also disclosed.

Abstract: A method for acquiring and storing schedule event information in an interactive television system. The schedule event information includes events and a start time and date for each of the events. The method includes creating a window defined by a start time and date and an end time and date and receiving the schedule event information at a receiving station. The schedule event information is stored for events having a start time and date within the window. The method further includes automatically moving the window forward relative to the start time and date at a specified interval such that the end time and date of the window are always after a current time and date. A system for acquiring and storing schedule event information is also disclosed.

Abstract: According to an embodiment of the present invention, a fast matching algorithm uses a memory space efficient data structure to accomplish information filtering in a system receiving information, such as a set top box used in conjunction with a television set. The data structure, according to an embodiment of the present invention, may include a node with a plurality of levels of expected values of data fields with an associated index to another node to be used when a matching identification of a particular level is not found. Additionally, according to an embodiment of the present invention, the nodes in this data structure may include a level field which identifies levels which are valid within the node.

Abstract: A method for acquiring and storing schedule event information from a cyclical broadcast in an interactive television system comprising a Head end (20), transmission media (32) and a client device such as a set top box (28) and display TV (26). An request queue for particular Event Information Table (EIT) schedule sections (42) is created and serviced in optimal fashion by selecting a section from the EIT request queue with the least acquisition latency based on the current position in the EIT broadcast cycle, the set top box (28) processing speed and the sequence of EIT sections (42) requested.

Abstract: According to an embodiment of the present invention, a section map may be used which utilizes a series of section maps, each section map including a predetermined number of bits, such as 32 bits. Each section map may include a single bit which indicates what is stored in the first 15 bits. For example, the last 16 bits of a section map may indicate whether the first 16 sections have been received. Another bit may be used to indicate what is stored in the first 15 bits. For example, the first 15 bits may indicate whether the next 15 sections have been received, or they may indicate an index pointing to the next section map.