Abstract: A method includes receiving an input data stream at a processor, and for each byte sequence from a plurality of byte sequences of the input data stream, a hash is generated and compared to a hash table to determine whether a match exists. If a match exists, that byte sequence is incrementally expanded to include one or more additional adjacent bytes from the input data stream, to produce multiple expanded byte sequences. Each of the expanded byte sequences is compared to the hash table to identify a maximum-length matched byte sequence from a set that includes the byte sequence and the plurality of expanded byte sequences. A representation of the maximum-length matched byte sequence is stored in the memory. If a match does not exist, a representation of that byte sequence is stored as a byte sequence literal in the memory.

Abstract: A method includes receiving an input data stream at a processor, and for each byte sequence from a plurality of byte sequences of the input data stream, a hash is generated and compared to a hash table to determine whether a match exists. If a match exists, that byte sequence is incrementally expanded to include one or more additional adjacent bytes from the input data stream, to produce multiple expanded byte sequences. Each of the expanded byte sequences is compared to the hash table to identify a maximum-length matched byte sequence from a set that includes the byte sequence and the plurality of expanded byte sequences. A representation of the maximum-length matched byte sequence is stored in the memory. If a match does not exist, a representation of that byte sequence is stored as a byte sequence literal in the memory.

Abstract: A method includes receiving an input data stream at a processor, and for each byte sequence from a plurality of byte sequences of the input data stream, a hash is generated and compared to a hash table to determine whether a match exists. If a match exists, that byte sequence is incrementally expanded to include one or more additional adjacent bytes from the input data stream, to produce multiple expanded byte sequences. Each of the expanded byte sequences is compared to the hash table to identify a maximum-length matched byte sequence from a set that includes the byte sequence and the plurality of expanded byte sequences. A representation of the maximum-length matched byte sequence is stored in the memory. If a match does not exist, a representation of that byte sequence is stored as a byte sequence literal in the memory.

Abstract: A method for searching compressed, encrypted data includes receiving uncompressed data and identifying patterns thereof. Each pattern includes a predetermined number of bytes. Each pattern is hashed into a hash value, producing a set of hash values that is stored in a hash table. Each record of the hash table includes a hash value from the set of hash values and an associated position value. A Boolean filter is generated based on the hash table, each bit of the Boolean filter associated with a different hash value. A search string hash value is calculated based on a received search request. A location in the Boolean filter, having an address equal to the search string hash value, is inspected to determine whether a position stored at the location is true or false. If the position is true, at least a portion of the compressed data is flagged as relevant.

Abstract: A method for searching compressed, encrypted data includes receiving uncompressed data and identifying patterns thereof. Each pattern includes a predetermined number of bytes. Each pattern is hashed into a hash value, producing a set of hash values that is stored in a hash table. Each record of the hash table includes a hash value from the set of hash values and an associated position value. A Boolean filter is generated based on the hash table, each bit of the Boolean filter associated with a different hash value. A search string hash value is calculated based on a received search request. A location in the Boolean filter, having an address equal to the search string hash value, is inspected to determine whether a position stored at the location is true or false. If the position is true, at least a portion of the compressed data is flagged as relevant.

Abstract: A method for searching compressed, encrypted data includes receiving uncompressed data and identifying patterns thereof. Each pattern includes a predetermined number of bytes. Each pattern is hashed into a hash value, producing a set of hash values that is stored in a hash table. Each record of the hash table includes a hash value from the set of hash values and an associated position value. A Boolean filter is generated based on the hash table, each bit of the Boolean filter associated with a different hash value. A search string hash value is calculated based on a received search request. A location in the Boolean filter, having an address equal to the search string hash value, is inspected to determine whether a position stored at the location is true or false. If the position is true, at least a portion of the compressed data is flagged as relevant.

Abstract: A digital video apparatus provides reduced channel change times. According to an exemplary embodiment, the digital video apparatus includes at least one receiver for receiving first and second video streams representing the same program, wherein the first video stream has at least one characteristic different from the second video stream; a first signal processor for processing the first video stream to generate a first processed video stream; a second signal processor for processing the second video stream to generate a second processed video stream having a delay with respect to the first processed video stream; a renderer for rendering the second processed video stream responsive to a channel change command; and a switch for switching from the second processed video stream to the first processed video stream after the renderer begins rendering the second processed video stream, and thereby causing the renderer to begin rendering the first processed video stream.

Abstract: A digital video apparatus provides reduced channel change times. According to an exemplary embodiment, the digital video apparatus includes at least one receiver for receiving first and second video streams representing the same program, wherein the first video stream has at least one characteristic different from the second video stream; a first signal processor for processing the first video stream to generate a first processed video stream; a second signal processor for processing the second video stream to generate a second processed video stream having a delay with respect to the first processed video stream; a renderer for rendering the second processed video stream responsive to a channel change command; and a switch for switching from the second processed video stream to the first processed video stream after the renderer begins rendering the second processed video stream, and thereby causing the renderer to begin rendering the first processed video stream.

Abstract: A network information delivery system automatically determines end-user information output requirements based on predetermined data corresponding to each requesting end-user terminal. A user profile is maintained in a database either associated with a network information delivery system or with the end-user terminal and is accessed by the network information delivery device. If the network information delivery device has authority to access the end-user terminal, a program may be downloaded to the end-user terminal to determine the exact end-user terminal configuration. The program executing in the end-user terminal returns to the network information delivery device a user profile containing the end-user terminal capabilities so that the requested information may be formatted and delivered to the end-user in an optimal manner. The information to be delivered to end-users may be pre-stored in predetermined formats.