Method and system for enabling data-rich interactive television using broadcast database

Information

  • Patent Grant
  • 11388451
  • Patent Number
    11,388,451
  • Date Filed
    Wednesday, November 27, 2002
    22 years ago
  • Date Issued
    Tuesday, July 12, 2022
    2 years ago
Abstract
A database is packed up for broadcast over an iTV system by packaging, compressing, and streaming the database via one or more carousels. The packing up process creates one or more data modules, each including record sets, and one or more modules containing computer-readable instructions for resolving queries using the record sets. These modules, along with a table of contents module that includes descriptions of how the data modules are composed and interfaces to the modules containing the computer-readable instructions, are downloaded at a set top box in order to resolve queries from television users and/or other applications. Thereafter, the computer-readable instructions are executed to resolve the queries. When available, the results produced by executing the query may be displayed on a television. Information regarding the queries may be used to modify the packing up and/or broadcast processes.
Description
FIELD OF THE INVENTION

The present invention relates to a broadcast database, which in one embodiment serves as an architecture for enabling data-rich interactive television and similar applications.


BACKGROUND

In the past few years, home entertainment has evolved from purely one-way radio and television broadcasts to include two-way communication that encompasses interactive games, video on demand (VOD), educational fare and consumer-oriented services (e.g., interactive shopping). For the most part, these services have been offered through familiar cable and satellite television distribution systems.


Broadly speaking, there are two paradigms for using cable and satellite systems in this fashion. One is computer-centric: using an installed satellite or cable feed (perhaps with a cable or telephone network back channel) as a high-bandwidth conduit to bring on-line computing services, such as Internet access, into the home. The second is television-centric: adding interactive functions to television programming.


In general, systems deployed using the television-centric model have been grouped under the label “interactive television” or iTV. iTV is generally understood as the convergence of Internet-like interactivity and traditional television programming and delivery technology. Making television interactive involves the addition of responsive, user-controlled elements to traditional broadcast video and audio signals. By adding a computer like device (usually referred to as a set-top box) to the television set and providing a communication path back to the service provider (the back channel), the viewer can be invited to interact with the programming, exert some level of control over the experience and to provide feedback.


iTV services are usually delivered to subscribers' homes through an existing cable or satellite system, along with other free and pay-for content (e.g., movies, games, news, images, audio programming, etc.). This content is generally delivered to the television via a set-top box, and users may navigate the offered services using a remote control and on-screen navigation system or menu. The set-top box is an addressable communications unit needed to decode signals as they arrive at the television. Depending on the system used it may also need to perform functions such as the decompression of the digital signal, or the handling of communications across the back channel. Together with a (typically handheld) remote control and on-screen menu, this unit provides an interface for users to find their way through the myriad of content and services offered and communicated to their television sets by the iTV system provider.


To illustrate, consider the case of a user ordering a pay-per-view movie. Using a remote control the user can select the desired service via the on-screen menu displayed on his or her television set. This request is sent via the back channel to the service provider's control system, which locates the required content and delivers it via a cable or satellite transmission system to the set-top box for decoding and display on the user's television. Along the way, a subscriber management system may be informed of the user's selection so that the user's account can be updated to reflect any relevant charges for the selected movie.


The on-screen menu may or may not be overlaid on top of the television picture. Common examples of on-screen menus include electronic program guides (EPGs), electronic catalogs, and advertising information. Television program guides have matured rapidly in recent years. At one time the only TV program guides available were those printed in newspapers and magazines. These guides typically had a grid with list of channels, showing the programming for those channels as a function of time. They also sometimes contained synopses of movies or television shows scheduled to be aired.


The advent of cable television systems brought on-screen EPGs. The early versions consisted of a dedicated channel displaying a program guide that showed the current (and perhaps limited future) programming for most or all channels. Since there is only space to show half a dozen or so channels on the screen at a time, the display would automatically scroll through all the available channels.


Today, however, many cable companies utilize set-top boxes to provide interactive EPGs that support advanced features such as the ability to call up a program guide grid at any time, and scroll through channels and programming forward and backward in time via a remote control. Usually information on programming for some days into the future is made available. In addition, modem EPGs can display lists of channel numbers, program titles and even program durations, appearing briefly each time the channel is changed, and at other times by selecting a corresponding option on the remote control. Textual descriptions of any program listed in the program grid, or of the current program being viewed, can be called up by using the remote control, and a user can change channels automatically by clicking on a program title as it is displayed in the program grid.


All of these advanced features place demands on the set-top boxes being used. For example, tradeoffs between cost and local storage capabilities must be addressed. One option is to deploy set-top boxes with large internal storage capabilities. Then, large quantities of information (such as expanded EPGs) could be periodically downloaded to the set-top boxes and stored for later reference. However, such set-top boxes would likely be expensive and, with the industry shift towards low-cost set-top boxes, iTV middleware solutions are required to operate in a broadcast architecture with very small set-top box memory availability.


One solution to address the limited storage capabilities of set-top boxes that has been proposed is the use of a so-called broadcast file system, as described in U.S. Pat. No. 6,405,239 to Addington et al. The broadcast file system organizes data sent to a set-top box into a hierarchical file system including a directory index. The hierarchical file system is made up of various directories and subdirectories of content, which can be created, updated and/or deleted by a service provider and then broadcast to a number of set-top box clients. The set-top boxes cache the directory index portion of the file system and use it to facilitate requests for further information or content (e.g., in response to user selection or application request) from the hierarchical file system. Because the file system is continually broadcast (e.g., using a carousel), the set-top boxes need not cache the entire file system because the desired content can be downloaded from the broadcast stream in response to a user request. If the desired content is not currently part of the broadcast stream when requested, it can be added by introducing the necessary directories and subdirectories to the hierarchical file system in response to the request.


The broadcast file system solves some of the problems posed by the limited available memory at the set-top boxes, but it has several limitations. Among these limitations is the fact that relational databases are not supported in the hierarchical file system. Instead, any database must be reduced to simple tables and the tables then broadcast as if they were part of the hierarchical file system. This reduces the functionality available to a user seeking to query a service provider's offerings. For example, the user is limited to the tables selected by the service provider for broadcast and in the format defined thereby.


To understand how the tables used by the broadcast file system differ from true databases, consider the following. Early computer-based file systems allowed for record keeping in the form of tables that were made up of rows and columns. The rows were referred to as records and the columns were known as fields; in order to find a particular piece of information a user browsed through the table and then extracted the needed field or fields from the desired record.


As the volume of data stored in computer-based systems increased, more flexible storage models (databases) were created. Databases are computer-based record keeping systems that allow for the sharing of data among multiple users through manipulation of user interface tools or command line interfaces that handle the storage, retrieval and modification of the data. Of the various forms of databases available, relational databases have become perhaps the most popular.


At the core of the relational database model are the familiar tables (also known as relations) made up of records (rows or tuples) and fields (columns or attributes). A relational database stores data in separate tables rather than putting all the data in one big table. Where or how these tables are stored makes no difference, because the tables are linked by defined relations. This makes it possible to combine data from several tables on request.


Operations that manipulate (i.e., store, retrieve or modify) data in a relational database do so on the basis of the data values themselves. Thus, if a user wishes to retrieve a row from a particular table, he or she does so by comparing the value stored within a particular column for that row to some search criteria. Of course, tables of a relational database can store not only actual data, they can also be used as a means for generating meta-data (data about the table and field names which form the database structure, access privileges to the database, data validation rules, etc.). Thus, relational systems can use operations recursively in order to provide information about the database.


Relational databases are often searched using a so-called structured query language (SQL). SQL provides the structure and idioms needed to query a relational database in a platform-independent fashion. Rather than referring to data as a set of pointers, the SQL provides predefined procedures that allow users to use any value in a table to relate to other tables in a database. Most modem relational databases are SQL databases that are composed of a set of row/column-based tables, indexed by a “data dictionary”. To access data in the tables, users employ the SQL to navigate the database and produce “views” based on various search criteria defined in a query. The data dictionary is a catalog maintained by the database that includes a list of all the tables in the database and pointers to their locations in the storage medium. When an SQL query is made, the database looks up the table referred to by the query in the data dictionary in order to know where to go to execute the search. The resulting view is essentially a dynamically generated result table that contains the data retrieved from the table specified in the query according to the user-provided search criteria.


The broadcast file system discussed above does not support the type of dynamic operations that are available using databases. For example, the tables are not linked in the fashion of a relational database and dynamic queries and results of the types supported and provided by relational databases are not available. Instead, with the broadcast file system users are permitted only to extract information included in the table fields and in the format that the service provider has determined. Accordingly, what is needed is a solution other than the broadcast file system if true database functionality is to be provided in an iTV context to support EPGs and other applications.


SUMMARY OF THE INVENTION

In one embodiment, the present invention provides for downloading, from a broadcast carousel, one or more data modules composed from a database, each of the data modules including record sets, and one or more modules containing computer-readable instructions for resolving a query using one or more of the record sets. Thereafter, the computer-readable instructions are executed to resolve the query. Prior to downloading the one or more data modules, a table of contents module that includes a description of how the data modules are composed may be downloaded. The table of contents module may also include a description of types of modules containing computer-readable instructions available from the broadcast carousel. When available, the results produced by executing the query may be displayed on a television.


The data modules are composed from the database during a packaging process that includes optimization procedures for broadcasting the data modules via the broadcast carousel. Different optimization procedures may be used, including staggering those data modules needed for the query in a broadcast data stream with other data modules not needed for the query, broadcasting multiple copies of those data modules needed for the query in a broadcast data stream, and broadcasting one or more of those data modules needed for the query via a broadcast carousel different from that used for different data modules. Further, the packaging process may provide for compressing the data modules prior to transmission.


In a further embodiment, database modules are compressed, formatted, and sequenced for transmission in a television broadcast system based on bandwidth availability; and then transmitted to a receiver. Compressing and formatting the database modules may include subdividing data from a source database into tables and splitting the tables into the database modules. Sequencing the database modules may include repeating selected ones of the database modules in a broadcast data stream, staggering selected ones of the database modules with respect to one another in a broadcast data stream, and/or transmitting selected ones of the database modules in different broadcast data streams.


Yet another embodiment provides for formatting, at a set top box, a query for information included in one or more modules which represent components of an original data source; and downloading through a television broadcast stream those of the one or more modules which are not currently located at the set-top box, wherein the one or more modules include data modules and/or modules of computer readable instructions for use when executing queries on the data modules, each of the data modules formed as a result of formatting and compressing at least portions of the original data source. The query may be executed by performing actions designated by the computer-readable instructions to retrieve the information. Thereafter, the information may be displayed on a television.


In some embodiments, information regarding the queries may be provided as feedback to the server so that the packaging and/or broadcasting methods employed with respect to the data and/or code modules may be modified to provide improved usability.


Still another embodiment provides a server component configured to broadcast via a broadcast stream a database as a set of modules including data modules that contain record sets, code modules that include computer-readable instructions for resolving queries using one or more of the data modules, and a table of contents module that contains information regarding the data modules and the code modules; and a client component that includes a query interface configured to retrieve from the broadcast stream those data modules and code modules not currently residing in memory at the client component as are needed to resolve a request made through the query interface. The server component may be configured to optimize the set of modules for broadcast via the broadcast stream by staggering those data modules needed to resolve the request in the broadcast data stream with other data modules not needed to resolve the request, by broadcasting multiple copies of those data modules needed to resolve the request in the broadcast data stream, and/or by using a different broadcast data stream for different data modules.





BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example, and not limitation, in the figures of the accompanying drawings, in which:



FIG. 1 illustrates the use of a broadcast database in an iTV environment, in accordance with one embodiment of the present invention.



FIG. 2 illustrates a process for downloading data and code modules of a broadcast database at a set top box to resolve a query in accordance with an embodiment of the present invention.



FIG. 3 illustrates aspects of a broadcast database packaging operation configured in accordance with an embodiment of the present invention.



FIGS. 4A, 4B and 4C illustrate examples of broadcast optimization techniques for use in broadcasting modules of a broadcast database in accordance with an embodiment of the present invention.





DETAILED DESCRIPTION

In one embodiment, the present invention provides a method for packaging, compressing, streaming, and/or querying a database via broadcast delivery. The database may be a relational database, an object oriented database, an ISAM (index sequence access method) database or any other form of database. In this context, the terms packaging and compressing refer to a process for compressing data into a defined, organized, structure that may easily be queried for application use. Streaming refers to a method for streaming a packaged database. A query is a method for retrieving stored data efficiently from the streamed database.


Some of the materials below describe algorithmic operations performed by computer-based systems and devices as part of the present invention. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared and otherwise manipulated.


It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers or the like. It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise, it will be appreciated that throughout the description of the present invention, use of terms such as “processing”, “computing”, “calculating”, “determining”, “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.


One implementation of the present invention may be realized in computer software (i.e., computer-readable instructions for execution by computer-based systems and devices). Such software may be embodied on one or more computer readable media, for example hard drives, floppy discs, read-only memory, read-write memory or other media. The software may be distributed on such media or it may be provided via the Internet or other networks in the form of downloadable modules or other formats. In operation, the functionality provided by such software may be distributed among various servers and client devices, such as set-top boxes.


When referring to the modules that make up elements of the present broadcast database, the term module refers to a modular data or code resource that is formatted and compressed for broadcast. Moreover, a table, as that term is used below, can be any data structure. With these concepts in mind, we turn now to a more detailed discussion of the broadcast database that is an embodiment of the present invention.


As indicated above, broadcasting iTV services generally requires that much more than just television video and audio signals be transmitted to the end-user. To accommodate the additional data, the present invention makes use of a broadcast database. This includes a method of compressing, formatting, and sequencing data for use in a broadcast system based on bandwidth availability/limitations. The goal of these compression/formatting/sequencing methods is to decrease the needed bandwidth for data on the broadcast and to optimize the speed of data look-ups and searches.


Referring now to FIG. 1, a functional view of the infrastructure supporting the broadcast database systems and methods is presented. At a broadcast center 100, information from data source (database) 102 is packaged up according to a packing up process 104 to produce broadcast modules 106. These broadcast modules 106 include a table of contents module 108, a number of data modules 110 and code modules 112. The table of contents 108 includes information regarding the sizes and structures of the data modules 110 as well as information regarding interfaces for the code modules 112. The data modules 110 are made up of various record sets of information from the original data source 102. The code modules 112 include computer-readable instructions for resolving queries using the various record sets contained in the data modules 110.


The broadcast modules 106 are broadcast over a conventional broadcast delivery network 114 (e.g., in one or more carousels) and subsequently downloaded by a set top box 116. This downloading is performed in response to a user or application request 118 made through a query interface 120 that is part of the firmware or operating system of the set top box 116. In order to resolve the query, and using information from the table of contents 108, the set top box downloads the necessary data modules and code modules (requested modules 122) from the broadcast carousel. Using the code modules so downloaded, the query engine executes the query to extract relevant data from the downloaded data modules and provides the results in response to the original request.


This use of a broadcast database provides some fundamental distinctions over prior methods of accessing databases to resolve queries. For example, the use of a broadcast database allows queries to be resolved locally at the set top box. In prior client-server architectures (and here the broadcast center may be regarded as a server and the set top box as a client), the database was maintained at the server and queries from the client were transmitted across a network to be resolved at the server. Results were then returned via the network to the client for display to a user.


Further, the use of a broadcast database provides advantages over the use of a broadcast file system. For example, in the broadcast file system model, users were limited to the tables and layouts provided by the broadcaster. The concept of individual queries being resolved against the broadcaster's entire database of information was not supported. Instead, users were limited in the types of queries that could be made and in the format of responses thereto. With the present broadcast database, however, individual user queries are supported and results can be customized to each such inquiry.


An example will help to explain this distinction. Suppose a user is interested in searching for a list of movies starring a certain actor. In the prior broadcast file system model, whether or not such a query could even be executed would depend on whether or not the broadcaster has chosen to include a table of movies for each actor as part of the hierarchy. Only then could the user download that table and scroll through the list of available movies.


In the present broadcast database system, however, the user simply provides a query for such a list of movies and in response the set top box downloads the relevant modules from the broadcast carousel as well as the computer-readable instructions necessary to execute the query against these tables. These instructions are run and the results displayed. In this model the broadcaster need not provide separate tables of all movies for each actor as part of the broadcast carousel. Instead, relational modules (perhaps a movies table and an actors table with some form of defined relationship(s) between them) are broadcast along with the computer-readable instructions necessary to extract the requested data from these modules. With this approach, the bandwidth required by the broadcast database is far less than that which would be required by the broadcast file system to provide the same sort of functionality to the end user.



FIG. 2 further illustrates the query process 200 used in interacting with the broadcast database. At step 202, a query is received via the query interface of the set top box. The query may come from a person viewing the television or it may come from another application executing at the set top box. In response to the query, the set top box checks to see whether the master table of contents module is resident in memory (step 204). It will often be the case that the table of contents module is downloaded and resident in the set top box before a query is received. However, in some cases this will not be true and the table of contents module will need to be downloaded upon receipt of a query at step 206.


The table of contents module is used by the set top box to obtain the table structure and sorting method definitions used in the data and code modules. These will vary depending upon the packaging method used by the broadcast center. As discussed further below, the goal of the packaging method is to ensure that for any given query, the master table of contents and all the data modules that are required to resolve a specific query will be able to be accommodated within the available set top box memory.


By way of example, suppose the query in question seeks a list of theatres in a certain city. The table structure definitions specified by the set top box may report the following:

    • Theater={ID, Name, Address, CityID}
    • Theatre_Table=a list of type Theatre
    • Theatre_Table_Size=the number of type Theatre in Theatre_Table


These definitions indicate that a Theatre record includes several data items, specifically an identifier for the theatre (ID), the name of the theatre (Name), its street address (Address) and the city in which the theatre is located (CityID). This last data item could be reported in an encoded format which would require the use of a City table to decode (i.e., the CityID could simply be a number and the City table could provide a mapping between that number and the actual city name). These Theater records are all included in a table called Theatre_Table. That is, the Theatre_Table contains a list of theatres, with each theatre reported according to the record type Theatre. Finally, the Theatre_Table_Size definition reports the number of individual Theatre records in the Theatre_Table.


In addition to these data structure definitions, the table of contents also reports the definition of the sorting method used in the database. For example, the table of contents might report the following sorting method definition applicable to the theatre information:

    • Sort_By_City(Theatre_Table, City)


This indicates that if a query seeking the theatres in a given city is to be executed, a sort of the data contained in Theatre_Table according to the above definition is required. The sort may return a list according to the type Theatre_Table.


Originally we indicated that the query being posed sought a list of theatres for a given city. The query itself may have been input through a graphical user interface displayed on the television set using a remote control (or perhaps a wireless keyboard or similar device). The query interface in the set top box, however, will translate this human-readable request to a more structured query in the syntax of the broadcast database. For example, the query may be translated to:

    • SELECT*from Theatre_Table where CityID=5


In this example, the CityID “5” identifies the city for which the list of theatres is desired. This value may have been pulled from a lookup table at the set top box or it may have been returned in repose to an application query seeking the corresponding CityID number for a particular city name as input by the viewer.


Thus, with the query in place and the table of contents indicating the data tables and code modules necessary to execute the query, process 200 proceeds to step 208 to determine whether the needed data modules and code modules are already resident in the set top box's memory. If not, this information is downloaded from the broadcast carousel.


In the present example then, according to the table of contents the theatre information is going to be contained in the Theatre_Table, so if the corresponding data module(s) is/are not already resident in memory it/they will be downloaded. Likewise, the table of contents indicates that in order to perform a query for theatres in a certain city the Sort_By_City code module is needed. So, if this code module is not already resident n memory it will be downloaded from the carousel.


If new data and/or code modules are downloaded, the set top box query interface manages the local memory to ensure that sufficient space for these new items exists. This may involve deleting older data and/or code modules. Such memory management operations are well known in the art and are similar to those used by caches for other types of information.


Finally, at step 212, the query is executed. This is accomplished by the query interface dynamically linking the Sort_By_City code module and executing the computer-readable instructions contained therein to run the query over the data in the Theatr_Table. The results are returned in a list of type Theatre_Table, so that the Theatre records for theatres in the selected city (CityID=5) are displayed to the viewer (step 214).


Turning now to FIG. 3, further details of the packaging operations are illustrated. At the broadcast center 300, the original representation of the application data is provided from the source database 302 to the broadcast database packaging process 304. The first step in this process involves topology transformation 306 of the source database.


Using factors such as broadcast bandwidth, available client memory, and query speed (primary keys), the broadcast database packaging process 304 analyzes the source data to decide how to best to subdivide it into tables. This subdivision is referred to as a database topology has been determined, further algorithms decide how to split the resulting tables into data modules. A single data module may consist of one database table, multiple database tables, or a subdivision of one database table.


By the way of example, consider a scenario for broadcasting tables containing movie schedules and times data, with a set-top client requirement to query and display movies and times for a given theatre. There are two relevant tables that may be assembled from the data source:

    • a. Movie Schedule Table, which includes fields for theatre identifiers (TheatreID), movie identifiers (MovieID) and time identifiers (TimeID), which are show time groupings. An example of the Movie Schedule Table might be:












Movie Schedule Table









TheatreID
MovieID
TimeID





1
A
1


2
B
2


3
C
1











    •  The Movie Schedule table may be 100 Kbytes of data in total.

    • b. Times Table, which maps the TimeIDs to individual showing times. An example of the Times Table might be:















Times Table










TimeID
Show times







1
9:00 pm, 10:00 pm, 11:00 pm, 12:00 am



2
5:00 pm, 6:00 pm, 7:00 pm, 8:00 pm












    •  The Times Table may be 20 Kbytes of data in total.





Assume now that the target set-top box has an available 50 Kbytes of memory to execute a query seeking the movie schedules for a theatre. An example of such a query might be:

    • Select from MovieSchedule, Times
      • Where TheatreId=<ID>
      • And MovieSchedule.TimeId=Times.TimeId


Based on knowledge of the client query requirements and available resources, the entire Times Table (20 Kbytes) can be carouseled to the set-top box as a single data module, while the Movie Schedule Table needs to be segmented so that the query can run in the available memory. In other words the Movie Schedule Table will be partitioned by primary search key TheatreId and packaged, for example, into approximately 20 Kbyte chunks, together with an index-mapping table (perhaps as part of the Table of Contents or as a separate data module) that provides a mapping between a TheatreId and its segment.


Once the topology operations have been completed, further domain specific optimizations 308 and data optimizations 310 may be performed. The present invention makes use of optimizations 308 that allow for the bandwidth reductions discussed above. For example, in some embodiments, the present invention allows for:

    • a. Analyzing database table fields to determine the most efficient storage type for that data. For example, phone numbers may be best represented as an integer or as a string.
    • b. Using common offset subtraction for numeric fields so that the maximum field value fits into the smallest number of bytes.


In addition to optimizing the storage options, the present invention also provides optimal data structures for such storage. In one embodiment, this is accomplished at process 310 by ordering the internal structure of the table fields to minimize the byte size of each record (e.g., using word alignment). This may be done automatically once a table database topology is established.


In each instance, the optimizations 308 and/or 310 are a response to human inputs regarding the various queries needed by the target applications at the set top box, as well as information regarding the available memory of those units. Such parameters change over time, for example as new client devices are deployed and/or as new information is retained in the original data store 302 and/or as new code modules (supporting new query types) are developed.


The present invention also allows for compression of an entire module after construction, to reduce broadcast size. Such compression is performed at process 312, and may include proprietary and/or conventional compression algorithms to provide bandwidth savings.


One the data optimizations and compression have been performed, broadcast optimizations 314 to address data sequencing and multiplexing may be undertaken. This aspect of the present invention allows for the intelligent sequencing and multiplexing of data into the broadcast stream such that the most frequently accessed data is most easily accessible and fastest to load. The present invention allows for predicting the types of queries that are currently being run or are likely to be run against the broadcast database and optimizing the sequence and frequency of popular data segments.


Several different forms of broadcast optimization may be undertaken. For example, FIG. 4A illustrates an optimization process 410 used to decrease the latency of a query. Suppose data modules “A”, “B” and “C” are required for a given query and data modules “X” and “Y” are needed for a different query. Typically, there is a minor processing delay at the set top box after a data module 402 has been acquired. This is necessary for memory storage operations, etc. So, when the first query is actually executed, the set top box acquires data module A, does some processing, acquires data module B, does some processing and then acquires data module C. Likewise, for the second query, the set top box will acquire data module X, perform some processing, then acquire data module Y and perform additional processing.


If data module B were transmitted immediately following data module A in the broadcast carousel 404, the set top box might miss data module B as it was processing data module A. Consequently, the set top box would have to wait for the entire carousel to repeat before it could acquire data module B, with all of the intervening time being wasted.


The broadcast optimization process 410 avoids this latency be inserting one or more data modules not required by the first query in the broadcast stream between data modules so required. In the illustrated example, data module X is inserted between data modules A and B and data module Y is inserted between data modules B and C. Thus, the data modules for particular queries are staggered within the broadcast stream (rather than being transmitted serially one after the other) so that the set top boxes are afforded time to complete the local processing operations as each data module for the query is downloaded.



FIG. 4B illustrates a second broadcast optimization process 412 that may be used. In this example, any data modules needed for a high-speed query are broadcast more often as compared to other data modules transmitted using the same data carousel 404. Thus, in this example, data module Q (which is needed for a high-speed query) is broadcast multiple times and more often than data module R (which is not needed for the same high-speed query). This way, it is more likely that the set-top box needing data model Q will not have to wait long for that module in the broadcast stream.


Yet another broadcast optimization process 414 is illustrated in FIG. 4C. In this example, multiple broadcast carousels 404, 408 and 409, perhaps each with different broadcast bandwidths, are used. The use of multiple broadcast carousels allows the data modules 402 to be divided up according to bandwidth needs, with more or larger modules being transmitted across high bandwidth broadcast carousels to adjust for network latencies. It should be noted that any or all of the broadcast optimization techniques might be used in combination with one another and/or with other optimization processes.


Returning to FIG. 3, following the broadcast optimization procedures 314, the optimized broadcast database modules are transmitted using the broadcast delivery network 316 of the service provider. For this broadcast phase, the subject database is a collection of modules or packages, which are organized (e.g., as database tables in C or another programming languages) resource structures that are compressed and transmitted. As indicated above, these broadcast packages are then repeated and inserted into a broadcast stream that is multiplexed and staggered in ways that optimize the accessibility of the most frequently accessed data. The frequency of accessed data may be predicted by analysis of past queries issued to the broadcast database. In addition, in some cases, the compressed data stream may be converted to another format, for example MPEG 2 transport streams, by conventional methods for transmission with other data streams.


The packaging process 304 creates 3 types of modules:

    • a. Table of Contents Module 318: This module contains information on the number, size, and contents of the data modules 320 and the methods that are contained in the code module 322. This module is the first module downloaded by the client 326 and describes the entire database broadcast structure. There is only one table of contents module 318 per each broadcast application. There can be more than one table of contents module in the broadcast stream, but only one will be seen per application depending on PID.
    • b. Data Table Modules 320: These modules contain data represented in table format. Each table is an array of a record type. The ID of the record is the index into the array. There can be an unlimited number of data modules 320, depending on necessary data and carousel size. Each module is a table to increase modularity of the module and to decrease the need to join tables together.
    • c. Code Modules 322: These modules contain the computer-based implementations for downloadable and dynamically linkable/executable methods. The code modules 322 are implemented algorithms ready for execution by the client 326. They are created in advance but dynamically downloaded on an as needed basis. The idea is that a specific query comes with a specific piece of code to execute the query, which can be downloaded and run by the client 326 without having to keep all these different queries on the set top box.324.


At the set-top box 324, the query interface 326 is responsible for the following operations:

    • a. Syntax for querying the database: The query interface 326 is resident at the set top box 324, or in some cases could be a downloaded application. In one embodiment, the query interface 326 uses a query syntax similar to SQL. Thus, the set top box 324 may issue a query via the query interface 326 such as: “SELECT*from Theatres where CityID=5”. The query interface 326 parses this statement and determines which data modules 320 and code modules 322 are necessary to execute the query.
    • b. Downloading the required modules for the request: The query interface 326 then searches for the necessary modules in the set top box memory or, if not found, downloads them using the available memory. The query interface 326 also manages the caching of modules in memory until the memory is needed for other resources, bypassing the need to download a module already in memory. The query interface then links the data modules 320 and/or code modules 322 to the client in preparation for execution of the query.
    • c. Executing the query: Once the modules are in memory the query interface 326 executes the querying algorithms from the code modules 322 to retrieve the necessary data for the query.


In this way, the present broadcast database architecture enables content-rich applications in iTV systems and also allows for localization of nationally, or regionally broadcast applications.


Finally, information regarding the various queries executed at the set top boxes 324 may be provided as feedback (e.g., over a back channel) to the broadcast center 300. This information may cover such things as the types of queries being executed, the latency of the queries and other information. This information (together with business rules defined by human operators at the broadcast center 300) may be used to modify the packing up and broadcast processes. For example, based on the query feedback, the types of broadcast optimizations employed in transmitting the various modules may be changed. Alternatively, or in addition, the types of topology or other optimizations being used to package the database information may be modified to provide better usability.


Thus, a system and method for packaging, compressing, streaming, and/or querying a database via broadcast delivery has been described. In the foregoing description the present invention was illustrated by way of certain examples, but these examples should not be read as limiting the broader scope of the inventions which is more particularly described in the following claims.

Claims
  • 1. A method comprising: receiving, by a first computing device and via a second computing device, an indication of a query to be executed at the second computing device;determining, by the first computing device and based on the query, a portion of content listings of a plurality of stored content listings, wherein the portion of content listings is to be processed by the second computing device based on execution of the query at the second computing device;generating, by the first computing device and based on the portion of the content listings and the indication of the query, a plurality of modules configured to facilitate execution of the query at the second computing device, wherein the plurality of modules comprises: one or more data modules that comprises an indication of the portion of the content listings, anda code module that facilitates execution of the query for determination of result data; andcausing transmission, by the first computing device and to the second computing device, of the plurality of modules.
  • 2. The method of claim 1, wherein generating the plurality of modules comprises: partitioning, based on an indication of an available resource associated with the second computing device, the portion of the content listings, wherein the indication of the portion of the content listings is based on the partitioning.
  • 3. The method of claim 1, further comprising: determining a frequency of access associated with the one or more data modules;determining, based on the frequency of access, an order of transmission for the one or more data modules and one or more other data modules; andwherein causing transmission of the plurality of modules comprises causing transmission, based on the order of transmission, of the one or more data modules and the one or more other data modules.
  • 4. The method of claim 1, wherein the one or more data modules organize the indication of the portion of the content listings based on a search key associated with the query.
  • 5. The method of claim 1, wherein the plurality of modules comprises a contents module that comprises an indication that the one or more data modules and the code module facilitate execution of the query at the second computing device, and wherein causing transmission of the plurality of modules comprises causing transmission of the contents module; wherein the method further comprises receiving, from the second computing device and after causing transmission of the contents module, a request that indicates the code module and the one or more data modules; andwherein causing transmission of the plurality of modules comprises causing transmission, based on the request, of the code module and the one or more data modules.
  • 6. The method of claim 1, wherein the one or more data modules comprises a first data module and a second data module, wherein causing transmission of the one or more data modules comprises causing transmission of the first data module and causing transmission of the second data module, and wherein the method further comprises: between causing transmission of the first data module and causing transmission of the second data module, causing transmission of a third data module that is not required for execution of the query at the second computing device.
  • 7. The method of claim 1, wherein the plurality of stored content listings are stored based on a database table format, and wherein the one or more data modules are formatted to comprise the portion of the content listings in the database table format.
  • 8. The method of claim 1, wherein the query is for an indication of content show times, wherein the portion of content listings comprises data that maps content to show times, and wherein the code module comprises executable code that, when executed, causes one or more of the show times to be retrieved from the portion of content listings.
  • 9. The method of claim 1, wherein the code module comprises executable code that, when executed, causes the portion of content listings to be sorted based on execution of the query at the second computing device; wherein the plurality of modules comprises a contents module; andwherein the contents module comprises an indication that a sort of the portion of content listings is performed based on execution of the query at the second computing device.
  • 10. The method of claim 1, wherein the plurality of stored content listings is stored as part of a relational database, an object oriented database, or an index sequence access method database, and wherein the one or more data modules are formatted to comprise the portion of the content listings in an original format of the relational database, the object oriented database, or the index sequence access method database.
  • 11. The method of claim 1, wherein the one or more data modules partition the portion of the content listings into one or more data tables, wherein the one or more data tables organize, based on a search key associated with the query, the portion of the content listings.
  • 12. The method of claim 1, wherein the second computing device comprises a user device.
  • 13. The method of claim 1, wherein causing transmission comprises: causing transmission of at least a portion of the one or more data modules;causing transmission of at least a portion of one or more second data modules associated with a second query to be executed at a third computing device; andcausing transmission, after transmission of the at least the portion of one or more second data modules, of the code module.
  • 14. The method of claim 1, further comprising: selecting, based on a size of one or more of the code module or the one or more data modules, a carousel; andwherein causing transmission comprises causing transmission from the selected carousel.
  • 15. An apparatus comprising: one or more processors; andmemory storing executable instructions that, when executed by the one or more processors, cause the apparatus to: receive, via a computing device, an indication of a query to be executed at the computing device;determine, based on the query, a portion of content listings of a plurality of stored content listings, wherein the portion of content listings is to be processed by the computing device based on execution of the query at the computing device;generate, based on the portion of the content listings and the indication of the query, a plurality of modules configured to facilitate execution of the query at the computing device, wherein the plurality of modules comprises: one or more data modules that comprises an indication of the portion of the content listings, anda code module that facilitates execution of the query for determination of result data; andcause transmission, to the computing device, of the plurality of modules.
  • 16. The apparatus of claim 15, wherein the query is for an indication of content show times, wherein the portion of content listings comprises data that maps content to show times, and wherein the code module comprises executable code that, when executed, causes one or more of the show times to be retrieved from the portion of content listings.
  • 17. The apparatus of claim 15, wherein the code module comprises executable code that, when executed, causes the portion of content listings to be sorted based on execution of the query at the computing device; wherein the plurality of modules comprises a contents module; andwherein the contents module comprises an indication that a sort of the portion of content listings is performed based on execution of the query at the computing device.
  • 18. The apparatus of claim 15, wherein the plurality of stored content listings is stored as part of a relational database, an object oriented database, or an index sequence access method database, and wherein the one or more data modules are formatted to comprise the portion of the content listings in an original format of the relational database, the object oriented database, or the index sequence access method database.
  • 19. The apparatus of claim 15, wherein the executable instructions, when executed by the one or more processors, cause the apparatus to generate the plurality of modules by: partitioning, based on an indication of an available resource associated with the computing device, the portion of the content listings, wherein the indication of the portion of the content listings is based on the partitioning.
  • 20. The apparatus of claim 15, wherein the executable instructions, when executed by the one or more processors, further cause the apparatus to: determine a frequency of access associated with the one or more data modules;determine, based on the frequency of access, an order of transmission for the one or more data modules and one or more other data modules; andwherein the executable instructions, when executed by the one or more processors, cause transmission of the plurality of modules by causing transmission, based on the order of transmission, of the one or more data modules and the one or more other data modules.
  • 21. The apparatus of claim 15, wherein the one or more data modules organize the indication of the portion of the content listings based on a search key associated with the query.
  • 22. The apparatus of claim 15, wherein the plurality of modules comprises a contents module that comprises an indication that the one or more data modules and the code module facilitate execution of the query at the computing device; wherein the executable instructions, when executed by the one or more processors, cause transmission of the plurality of modules by causing transmission of the contents module; andwherein the executable instructions, when executed by the one or more processors, further cause the apparatus to receive, from the computing device and after causing transmission of the contents module, a request that indicates the code module and the one or more data modules; andwherein the executable instructions, when executed by the one or more processors, further cause the apparatus to cause transmission of the plurality of modules by causing transmission, based on the request, of the code module and the one or more data modules.
  • 23. The apparatus of claim 15, wherein the one or more data modules comprises a first data module and a second data module; wherein the executable instructions, when executed by the one or more processors, further cause the apparatus to cause transmission of the one or more data modules by causing transmission of the first data module and causing transmission of the second data module; andwherein the executable instructions, when executed by the one or more processors, further cause the apparatus to:between causing transmission of the first data module and causing transmission of the second data module, cause transmission of a third data module that is not required for execution of the query at the computing device.
  • 24. The apparatus of claim 15, wherein the plurality of stored content listings are stored based on a database table format, and wherein the one or more data modules are formatted to comprise the portion of the content listings in the database table format.
  • 25. The apparatus of claim 15, wherein the one or more data modules partition the portion of the content listings into one or more data tables, wherein the one or more data tables organize, based on a search key associated with the query, the portion of the content listings.
  • 26. The apparatus of claim 15, wherein the computing device comprises a user device.
  • 27. The apparatus of claim 15, wherein the executable instructions, when executed by the one or more processors, cause the apparatus to cause transmission of the plurality of modules by: causing transmission of at least a portion of the one or more data modules;causing transmission of at least a portion of one or more second data modules associated with a second query to be executed at a third computing device; andcausing transmission, after transmission of the at least the portion of one or more second data modules, of the code module.
  • 28. The apparatus of claim 15, wherein the executable instructions, when executed by the one or more processors, further cause the apparatus to: select, based on a size of one or more of the code module or the one or more data modules, a carousel; andwherein the executable instructions, when executed by the one or more processors, cause transmission of the plurality of modules by causing transmission from the selected carousel.
  • 29. A system comprising: a first computing device; anda second computing device;wherein the first computing devices comprises: one or more first processors; andfirst memory storing first executable instructions that, when executed by the one or more first processors, cause the first computing device to:receive, via the second computing device, an indication of a query to be executed at the second computing device;determine, based on the query, a portion of content listings of a plurality of stored content listings, wherein the portion of content listings is to be processed by the second computing device based on execution of the query at the second computing device;generate, based on the portion of the content listings and the indication of the query, a plurality of modules configured to facilitate execution of the query at the second computing device, wherein the plurality of modules comprises: one or more data modules that comprises an indication of the portion of the content listings, anda code module that facilitates execution of the query for determination of result data; andcause transmission, to the second computing device, of the plurality of modules; andwherein the second computing device comprises: one or more second processors; andsecond memory storing second executable instructions that, when executed by the one or more second processors, cause the second computing device to: receive the plurality of modules; andexecute, based on the plurality of modules, the query.
  • 30. The system of claim 29, wherein the query is for an indication of content show times, wherein the portion of content listings comprises data that maps content to show times, and wherein the code module comprises executable code that, when executed, causes one or more of the show times to be retrieved from the portion of content listings.
  • 31. The system of claim 29, wherein the code module comprises executable code that, when executed, causes the portion of content listings to be sorted based on execution of the query at the second computing device; wherein the plurality of modules comprises a contents module; andwherein the contents module comprises an indication that a sort of the portion of content listings is performed based on execution of the query at the second computing device.
  • 32. The system of claim 29, wherein the plurality of stored content listings is stored as part of a relational database, an object oriented database, or an index sequence access method database, and wherein the one or more data modules are formatted to comprise the portion of the content listings in an original format of the relational database, the object oriented database, or the index sequence access method database.
  • 33. The system of claim 29, wherein the first executable instructions, when executed by the one or more first processors, cause the first computing device to generate the plurality of modules by: partitioning, based on an indication of an available resource associated with the second computing device, the portion of the content listings, wherein the indication of the portion of the content listings is based on the partitioning.
  • 34. The system of claim 29, wherein the first executable instructions, when executed by the one or more first processors, further cause the first computing device to: determine a frequency of access associated with the one or more data modules;determine, based on the frequency of access, an order of transmission for the one or more data modules and one or more other data modules; andwherein the first executable instructions, when executed by the one or more first processors, cause transmission of the plurality of modules by causing transmission, based on the order of transmission, of the one or more data modules and the one or more other data modules.
  • 35. The system of claim 29, wherein the one or more data modules organize the indication of the portion of the content listings based on a search key associated with the query.
  • 36. The system of claim 29, wherein the plurality of modules comprises a contents module that comprises an indication that the one or more data modules and the code module facilitate execution of the query at the second computing device; wherein the first executable instructions, when executed by the one or more first processors, cause transmission of the plurality of modules by causing transmission of the contents module;wherein the first executable instructions, when executed by the one or more first processors, further cause the first computing device to receive, from the second computing device and after causing transmission of the contents module, a request that indicates the code module and the one or more data modules; andwherein the first executable instructions, when executed by the one or more first processors, further cause the first computing device to cause transmission of the plurality of modules by causing transmission, based on the request, of the code module and the one or more data modules.
  • 37. The system of claim 29, wherein the one or more data modules comprises a first data module and a second data module; wherein the first executable instructions, when executed by the one or more first processors, further cause the first computing device to cause transmission of the one or more data modules by causing transmission of the first data module and causing transmission of the second data module; andwherein the first executable instructions, when executed by the one or more first processors, further cause the first computing device to:between causing transmission of the first data module and causing transmission of the second data module, cause transmission of a third data module that is not required for execution of the query at the second computing device.
  • 38. The system of claim 29, wherein the plurality of stored content listings are stored based on a database table format, and wherein the one or more data modules are formatted to comprise the portion of the content listings in the database table format.
  • 39. The system of claim 29, wherein the one or more data modules partition the portion of the content listings into one or more data tables, wherein the one or more data tables organize, based on a search key associated with the query, the portion of the content listings.
  • 40. The system of claim 29, wherein the second computing device comprises a user device.
  • 41. The system of claim 29, wherein the first executable instructions, when executed by the one or more first processors, cause the first computing device to cause transmission of the plurality of modules by: causing transmission of at least a portion of the one or more data modules;causing transmission of at least a portion of one or more second data modules associated with a second query to be executed at a third computing device; andcausing transmission, after transmission of the at least the portion of one or more second data modules, of the code module.
  • 42. The system of claim 29, wherein the first executable instructions, when executed by the one or more first processors, further cause the first computing device to: select, based on a size of one or more of the code module or the one or more data modules, a carousel; andwherein the first executable instructions, when executed by the one or more first processors, cause transmission of the plurality of modules by causing transmission from the selected carousel.
  • 43. A non-transitory computer-readable medium storing instructions which, when executed, cause: receiving, by a first computing device and via a second computing device, an indication of a query to be executed at the second computing device;determining, by the first computing device and based on the query, a portion of content listings of a plurality of stored content listings, wherein the portion of content listings is to be processed by the second computing device based on execution of the query at the second computing device;generating, by the first computing device and based on the portion of the content listings and the indication of the query, a plurality of modules configured to facilitate execution of the query at the second computing device, wherein the plurality of modules comprises: one or more data modules that comprises an indication of the portion of the content listings, anda code module that facilitates execution of the query for determination of result data; andcausing transmission, by the first computing device and to the second computing device, of the plurality of modules.
  • 44. The non-transitory computer-readable medium of claim 43, wherein the instructions, when executed, cause generating the plurality of modules by causing: partitioning, based on an indication of an available resource associated with the second computing device, the portion of the content listings, wherein the indication of the portion of the content listings is based on the partitioning.
  • 45. The non-transitory computer-readable medium of claim 43, wherein the instructions, when executed, further cause: determining a frequency of access associated with the one or more data modules;determining, based on the frequency of access, an order of transmission for the one or more data modules and one or more other data modules; andwherein the instructions, when executed, cause the transmission of the plurality of modules by causing transmission, based on the order of transmission, of the one or more data modules and the one or more other data modules.
  • 46. The non-transitory computer-readable medium of claim 43, wherein the one or more data modules organize the indication of the portion of the content listings based on a search key associated with the query.
  • 47. The non-transitory computer-readable medium of claim 43, wherein the plurality of modules comprises a contents module that comprises an indication that the one or more data modules and the code module facilitate execution of the query at the second computing device; wherein the instructions, when executed, cause the transmission of the plurality of modules by causing transmission of the contents module; andwherein the instructions, when executed, further cause receiving, from the second computing device and after causing transmission of the contents module, a request that indicates the code module and the one or more data modules; andwherein the instructions, when executed, further cause the transmission of the plurality of modules by causing transmission, based on the request, of the code module and the one or more data modules.
  • 48. The non-transitory computer-readable medium of claim 43, wherein the one or more data modules comprises a first data module and a second data module; wherein the instructions, when executed, further cause the transmission of the one or more data modules by causing transmission of the first data module and causing transmission of the second data module; andwherein the instructions, when executed, further cause:between causing transmission of the first data module and causing transmission of the second data module, cause transmission of a third data module that is not required for execution of the query at the second computing device.
  • 49. The non-transitory computer-readable medium of claim 43, wherein the plurality of stored content listings are stored based on a database table format, and wherein the one or more data modules are formatted to comprise the portion of the content listings in the database table format.
  • 50. The non-transitory computer-readable medium of claim 43, wherein the query is for an indication of content show times, wherein the portion of content listings comprises data that maps content to show times, and wherein the code module comprises executable code that, when executed, causes one or more of the show times to be retrieved from the portion of content listings.
  • 51. The non-transitory computer-readable medium of claim 43, wherein the code module comprises executable code that, when executed, causes the portion of content listings to be sorted based on execution of the query at the second computing device; wherein the plurality of modules comprises a contents module; andwherein the contents module comprises an indication that a sort of the portion of content listings is performed based on execution of the query at the second computing device.
  • 52. The non-transitory computer-readable medium of claim 43, wherein the plurality of stored content listings is stored as part of a relational database, an object oriented database, or an index sequence access method database, and wherein the one or more data modules are formatted to comprise the portion of the content listings in an original format of the relational database, the object oriented database, or the index sequence access method database.
  • 53. The non-transitory computer-readable medium of claim 43, wherein the one or more data modules partition the portion of the content listings into one or more data tables, wherein the one or more data tables organize, based on a search key associated with the query, the portion of the content listings.
  • 54. The non-transitory computer-readable medium of claim 43, wherein the second computing device comprises a user device.
  • 55. The non-transitory computer-readable medium of claim 43, wherein the instructions, when executed, cause causing transmission of the plurality of modules by: causing transmission of at least a portion of the one or more data modules;causing transmission of at least a portion of one or more second data modules associated with a second query to be executed at a third computing device; andcausing transmission, after transmission of the at least the portion of one or more second data modules, of the code module.
  • 56. The non-transitory computer-readable medium of claim 43, wherein the instructions, when executed, further cause: selecting, based on a size of one or more of the code module or the one or more data modules, a carousel; andwherein the instructions, when executed, cause transmission of the plurality of modules by causing transmission from the selected carousel.
RELATED APPLICATIONS

The present application is related to, incorporates by reference and hereby claims the priority benefit of the following U.S. Provisional Patent Applications: a. Application No. 60/333,961 entitled “Broadcast Database”, filed Nov. 27, 2001.b. Application No. 60/353,799 entitled “Broadcast Database”, filed Jan. 30, 2002.

US Referenced Citations (403)
Number Name Date Kind
5287489 Nimmo et al. Feb 1994 A
5321750 Nadan Jun 1994 A
5353121 Young et al. Oct 1994 A
5485221 Banker et al. Jan 1996 A
5530939 Mansfield, Jr. Jun 1996 A
5583563 Wanderscheid et al. Dec 1996 A
5589892 Knee et al. Dec 1996 A
5592551 Lett et al. Jan 1997 A
5594509 Florin et al. Jan 1997 A
5613057 Caravel Mar 1997 A
5621456 Florin et al. Apr 1997 A
5657072 Aristides et al. Aug 1997 A
5659793 Escobar et al. Aug 1997 A
5666645 Thomas et al. Sep 1997 A
5675752 Scott et al. Oct 1997 A
5694176 Bruette et al. Dec 1997 A
5802284 Karlton et al. Sep 1998 A
5826102 Escobar et al. Oct 1998 A
5844620 Coleman et al. Dec 1998 A
5850218 LaJoie et al. Dec 1998 A
5852435 Vigneaux et al. Dec 1998 A
5860073 Ferrel et al. Jan 1999 A
5883677 Hofmann Mar 1999 A
5892902 Clark Apr 1999 A
5892905 Brandt et al. Apr 1999 A
5905492 Straub et al. May 1999 A
5929849 Kikinis Jul 1999 A
5945987 Dunn Aug 1999 A
5960194 Choy Sep 1999 A
5990890 Etheredge Nov 1999 A
5996025 Day et al. Nov 1999 A
6002394 Schein Dec 1999 A
6005561 Hawkins et al. Dec 1999 A
6008803 Rowe et al. Dec 1999 A
6008836 Bruck et al. Dec 1999 A
6016144 Blonstein et al. Jan 2000 A
6025837 Matthews, III et al. Feb 2000 A
6049823 Hwang Apr 2000 A
6061695 Slivka et al. May 2000 A
6067108 Yokote et al. May 2000 A
6088722 Herz et al. Jul 2000 A
6091411 Straub et al. Jul 2000 A
6094237 Hashimoto Jul 2000 A
6141003 Chor et al. Oct 2000 A
6148081 Szymanski Nov 2000 A
6162697 Singh et al. Dec 2000 A
6169543 Wehmeyer Jan 2001 B1
6172677 Stautner et al. Jan 2001 B1
6177931 Alexander et al. Jan 2001 B1
6191781 Chaney et al. Feb 2001 B1
6195692 Hsu Feb 2001 B1
6205582 Hoarty Mar 2001 B1
6219839 Sampsell Apr 2001 B1
6239795 Ulrich et al. May 2001 B1
6240555 Shoff et al. May 2001 B1
6281940 Sciammarella Aug 2001 B1
6292187 Gibbs et al. Sep 2001 B1
6292827 Raz Sep 2001 B1
6295057 Rosin et al. Sep 2001 B1
6314569 Chernock et al. Nov 2001 B1
6317885 Fries Nov 2001 B1
6345305 Beck et al. Feb 2002 B1
6405239 Addington et al. Jun 2002 B1
6415438 Blackketter et al. Jul 2002 B1
6421067 Kamen et al. Jul 2002 B1
6426779 Noguchi et al. Jul 2002 B1
6442755 Lemmons et al. Aug 2002 B1
6477705 Yuen et al. Nov 2002 B1
6486920 Arai et al. Nov 2002 B2
6522342 Gagnon et al. Feb 2003 B1
6529950 Lumelsky et al. Mar 2003 B1
6530082 Del Sesto et al. Mar 2003 B1
6532589 Proehl et al. Mar 2003 B1
6564263 Bergman et al. May 2003 B1
6567104 Andrew et al. May 2003 B1
6571392 Zigmond et al. May 2003 B1
6591292 Morrison et al. Jul 2003 B1
6621509 Eiref et al. Sep 2003 B1
6636887 Augeri Oct 2003 B1
6658661 Arsenault et al. Dec 2003 B1
6678891 Wilcox et al. Jan 2004 B1
6684400 Goode et al. Jan 2004 B1
6694312 Kobayashi Feb 2004 B2
6704359 Bayrakeri et al. Mar 2004 B1
6731310 Craycroft et al. May 2004 B2
6745367 Bates et al. Jun 2004 B1
6760043 Markel Jul 2004 B2
6763522 Kondo et al. Jul 2004 B1
6766526 Ellis Jul 2004 B1
6806887 Chernock et al. Oct 2004 B2
6857128 Borden, IV et al. Feb 2005 B1
6886029 Pecus et al. Apr 2005 B1
6904610 Bayrakeri et al. Jun 2005 B1
6910191 Segerberg et al. Jun 2005 B2
6918131 Rautila et al. Jul 2005 B1
6963880 Pingte et al. Nov 2005 B1
7028327 Dougherty et al. Apr 2006 B1
7065785 Shaffer et al. Jun 2006 B1
7080400 Navar Jul 2006 B1
7103904 Blackketter et al. Sep 2006 B1
7114170 Harris et al. Sep 2006 B2
7134072 Lovett et al. Nov 2006 B1
7152236 Wugofski et al. Dec 2006 B1
7162694 Venolia Jan 2007 B2
7162697 Markel Jan 2007 B2
7174512 Martin et al. Feb 2007 B2
7197715 Valeria Mar 2007 B1
7207057 Rowe Apr 2007 B1
7213005 Mourad et al. May 2007 B2
7221801 Jang et al. May 2007 B2
7237252 Billmaier Jun 2007 B2
7305696 Thomas et al. Dec 2007 B2
7337457 Pack et al. Feb 2008 B2
7360232 Mitchell Apr 2008 B2
7363612 Satuloori et al. Apr 2008 B2
7406705 Crinon Jul 2008 B2
7440967 Chidlovskii Oct 2008 B2
7464344 Carmichael et al. Dec 2008 B1
7516468 Deller et al. Apr 2009 B1
7523180 DeLuca et al. Apr 2009 B1
7587415 Gaurav et al. Sep 2009 B2
7624416 Vandermolen et al. Nov 2009 B1
7640487 Amielh-Caprioglio et al. Dec 2009 B2
7702315 Engstrom et al. Apr 2010 B2
7703116 Moreau et al. Apr 2010 B1
7721307 Hendricks et al. May 2010 B2
7743330 Hendricks et al. Jun 2010 B1
7752258 Lewin et al. Jul 2010 B2
7861259 Barone, Jr. Dec 2010 B2
7913286 Sarachik et al. Mar 2011 B2
7958528 Moreau et al. Jun 2011 B2
7975277 Jerding Jul 2011 B1
8006262 Rodriguez Aug 2011 B2
8032914 Rodriguez Oct 2011 B2
8156533 Crichton Apr 2012 B2
8220018 de Andrade et al. Jul 2012 B2
8266652 Roberts et al. Sep 2012 B2
8296805 Tabatabai et al. Oct 2012 B2
8381259 Khosla Feb 2013 B1
8448208 Moreau et al. May 2013 B2
8660545 Redford et al. Feb 2014 B1
8699862 Sharifi et al. Apr 2014 B1
8850495 Pan Sep 2014 B2
8863196 Patil et al. Oct 2014 B2
8938675 Holladay et al. Jan 2015 B2
8943533 de Andrade et al. Jan 2015 B2
8973063 Spilo et al. Mar 2015 B2
9021528 Moreau et al. Apr 2015 B2
9363560 Moreau et al. Jun 2016 B2
9473548 Chakrovorthy et al. Oct 2016 B1
9516253 De Andrade et al. Dec 2016 B2
20010014206 Artigalas et al. Aug 2001 A1
20010027563 White et al. Oct 2001 A1
20010049823 Matey Dec 2001 A1
20010056573 Kovac et al. Dec 2001 A1
20010056577 Gordon et al. Dec 2001 A1
20020010928 Sahota Jan 2002 A1
20020016969 Kimble Feb 2002 A1
20020023270 Thomas et al. Feb 2002 A1
20020026642 Augenbraun et al. Feb 2002 A1
20020032905 Sherr Mar 2002 A1
20020041104 Graf et al. Apr 2002 A1
20020042915 Kubischta et al. Apr 2002 A1
20020042920 Thomas et al. Apr 2002 A1
20020046099 Frengut et al. Apr 2002 A1
20020059094 Hosea et al. May 2002 A1
20020059586 Carney et al. May 2002 A1
20020059629 Markel May 2002 A1
20020067376 Martin et al. Jun 2002 A1
20020069407 Fagnani et al. Jun 2002 A1
20020070978 Wishoff et al. Jun 2002 A1
20020078444 Krewin et al. Jun 2002 A1
20020078449 Gordon et al. Jun 2002 A1
20020083450 Kamen et al. Jun 2002 A1
20020100041 Rosenberg et al. Jul 2002 A1
20020107973 Lennon et al. Aug 2002 A1
20020108121 Alao Aug 2002 A1
20020108122 Alao et al. Aug 2002 A1
20020120609 Lang et al. Aug 2002 A1
20020124254 Kikinis Sep 2002 A1
20020124256 Suzuka Sep 2002 A1
20020144269 Connelly Oct 2002 A1
20020144273 Reto Oct 2002 A1
20020147645 Alao Oct 2002 A1
20020152477 Goodman et al. Oct 2002 A1
20020156839 Peterson et al. Oct 2002 A1
20020156890 Carlyle et al. Oct 2002 A1
20020162120 Mitchell Oct 2002 A1
20020169885 Alao et al. Nov 2002 A1
20020170059 Hoang Nov 2002 A1
20020171691 Currans et al. Nov 2002 A1
20020171940 He et al. Nov 2002 A1
20020184629 Sie et al. Dec 2002 A1
20020188944 Noble Dec 2002 A1
20020196268 Wolff et al. Dec 2002 A1
20020199187 Gissin Dec 2002 A1
20020199190 Su Dec 2002 A1
20030001880 Holtz et al. Jan 2003 A1
20030005444 Crinon Jan 2003 A1
20030005453 Rodriguez et al. Jan 2003 A1
20030014752 Zaslavsky et al. Jan 2003 A1
20030014753 Beach et al. Jan 2003 A1
20030018755 Masterson et al. Jan 2003 A1
20030023970 Panabaker Jan 2003 A1
20030025832 Swart et al. Feb 2003 A1
20030028871 Wang et al. Feb 2003 A1
20030028873 Lemmons Feb 2003 A1
20030041104 Wingard et al. Feb 2003 A1
20030051246 Wilder et al. Mar 2003 A1
20030056216 Wugofski et al. Mar 2003 A1
20030056218 Wingard et al. Mar 2003 A1
20030058948 Kelly et al. Mar 2003 A1
20030066081 Barone et al. Apr 2003 A1
20030067554 Klarfeld et al. Apr 2003 A1
20030068046 Lindqvist Apr 2003 A1
20030070170 Lennon Apr 2003 A1
20030079226 Barrett Apr 2003 A1
20030084443 Laughlin et al. May 2003 A1
20030084444 Ullman et al. May 2003 A1
20030084449 Chane et al. May 2003 A1
20030086694 Davidsson May 2003 A1
20030093790 Logan et al. May 2003 A1
20030093792 Labeeb et al. May 2003 A1
20030097657 Zhou et al. May 2003 A1
20030110500 Rodriguez Jun 2003 A1
20030110503 Perkes Jun 2003 A1
20030115219 Chadwick Jun 2003 A1
20030115612 Mao et al. Jun 2003 A1
20030126601 Roberts et al. Jul 2003 A1
20030132971 Billmaier et al. Jul 2003 A1
20030135464 Mourad et al. Jul 2003 A1
20030140097 Schloer Jul 2003 A1
20030151621 McEvilly et al. Aug 2003 A1
20030158777 Schiff et al. Aug 2003 A1
20030172370 Satuloori et al. Sep 2003 A1
20030177501 Takahashi et al. Sep 2003 A1
20030182663 Gudorf et al. Sep 2003 A1
20030189668 Newnam et al. Oct 2003 A1
20030204814 Elo et al. Oct 2003 A1
20030204846 Breen et al. Oct 2003 A1
20030204854 Blackketter et al. Oct 2003 A1
20030207696 Willenegger et al. Nov 2003 A1
20030226141 Krasnow et al. Dec 2003 A1
20030229899 Thompson et al. Dec 2003 A1
20040003402 McKenna Jan 2004 A1
20040003404 Boston et al. Jan 2004 A1
20040019900 Knightbridge et al. Jan 2004 A1
20040019908 Williams et al. Jan 2004 A1
20040022271 Fichet Feb 2004 A1
20040024753 Chane Feb 2004 A1
20040025180 Begeja et al. Feb 2004 A1
20040031015 Ben-Romdhane et al. Feb 2004 A1
20040031058 Reisman Feb 2004 A1
20040031062 Lemmons Feb 2004 A1
20040039754 Harple Feb 2004 A1
20040073915 Dureau Apr 2004 A1
20040078814 Allen Apr 2004 A1
20040107437 Reichardt et al. Jun 2004 A1
20040107439 Hassell et al. Jun 2004 A1
20040128699 Delpuch et al. Jul 2004 A1
20040133923 Watson et al. Jul 2004 A1
20040136698 Mock Jul 2004 A1
20040168186 Rector, Jr. Aug 2004 A1
20040172648 Xu et al. Sep 2004 A1
20040189658 Dowdy Sep 2004 A1
20040194136 Finseth et al. Sep 2004 A1
20040199578 Kapczynski et al. Oct 2004 A1
20040221306 Noh Nov 2004 A1
20040224723 Farcasiu Nov 2004 A1
20040225751 Urali Nov 2004 A1
20040226051 Carney et al. Nov 2004 A1
20050005288 Novak Jan 2005 A1
20050015796 Bruckner et al. Jan 2005 A1
20050015804 LaJoie et al. Jan 2005 A1
20050028208 Ellis et al. Feb 2005 A1
20050086172 Stefik Apr 2005 A1
20050125835 Wei Jun 2005 A1
20050149972 Knudson Jul 2005 A1
20050155063 Bayrakeri et al. Jul 2005 A1
20050204385 Sull et al. Sep 2005 A1
20050259147 Nam et al. Nov 2005 A1
20050262542 DeWeese et al. Nov 2005 A1
20050283800 Ellis et al. Dec 2005 A1
20050287948 Hellwagner et al. Dec 2005 A1
20060004743 Murao et al. Jan 2006 A1
20060059525 Jerding et al. Mar 2006 A1
20060068818 Leitersdorf et al. Mar 2006 A1
20060080707 Laksono Apr 2006 A1
20060080716 Nishikawa et al. Apr 2006 A1
20060104511 Guo et al. May 2006 A1
20060125962 Shelton et al. Jun 2006 A1
20060143191 Cho et al. Jun 2006 A1
20060156336 Knudson et al. Jul 2006 A1
20060195865 Fablet Aug 2006 A1
20060206470 McIntyre Sep 2006 A1
20060206912 Klarfeld et al. Sep 2006 A1
20060233514 Weng et al. Oct 2006 A1
20060248572 Kitsukama et al. Nov 2006 A1
20070019001 Ha Jan 2007 A1
20070064715 Lloyd et al. Mar 2007 A1
20070083538 Roy et al. Apr 2007 A1
20070112761 Xu et al. May 2007 A1
20070157247 Cordray et al. Jul 2007 A1
20070220016 Estrada et al. Sep 2007 A1
20070261072 Boulet et al. Nov 2007 A1
20070271587 Rowe Nov 2007 A1
20080037722 Klassen Feb 2008 A1
20080060011 Kelts Mar 2008 A1
20080071770 Schloter et al. Mar 2008 A1
20080148317 Opaluch Jun 2008 A1
20080163304 Ellis Jul 2008 A1
20080189740 Carpenter et al. Aug 2008 A1
20080196070 White et al. Aug 2008 A1
20080235725 Hendricks Sep 2008 A1
20080276278 Krieger et al. Nov 2008 A1
20080282294 Carpenter et al. Nov 2008 A1
20080288644 Gilfix et al. Nov 2008 A1
20080301320 Morris Dec 2008 A1
20080301732 Archer et al. Dec 2008 A1
20080317233 Rey et al. Dec 2008 A1
20090019485 Ellis et al. Jan 2009 A1
20090024629 Miyauchi Jan 2009 A1
20090094632 Newnam et al. Apr 2009 A1
20090094651 Damm et al. Apr 2009 A1
20090133025 Malhotra et al. May 2009 A1
20090164904 Horowitz et al. Jun 2009 A1
20090183210 Andrade Jul 2009 A1
20090222872 Schlack Sep 2009 A1
20090228441 Sandvik Sep 2009 A1
20090249427 Dunnigan et al. Oct 2009 A1
20090271829 Larsson et al. Oct 2009 A1
20090288132 Hegde Nov 2009 A1
20090292548 Van Court Nov 2009 A1
20100077057 Godin et al. Mar 2010 A1
20100079670 Frazier et al. Apr 2010 A1
20100175084 Ellis et al. Jul 2010 A1
20100180300 Carpenter et al. Jul 2010 A1
20100223640 Reichardt et al. Sep 2010 A1
20100250190 Zhang et al. Sep 2010 A1
20100251284 Ellis et al. Sep 2010 A1
20100257548 Lee et al. Oct 2010 A1
20110058101 Earley et al. Mar 2011 A1
20110087348 Wong Apr 2011 A1
20110093909 Roberts et al. Apr 2011 A1
20110131204 Bodin et al. Jun 2011 A1
20110209180 Ellis et al. Aug 2011 A1
20110211813 Marks Sep 2011 A1
20110214143 Rits et al. Sep 2011 A1
20110219386 Hwang et al. Sep 2011 A1
20110219419 Reisman Sep 2011 A1
20110225417 Maharajh et al. Sep 2011 A1
20110246495 Mallinson Oct 2011 A1
20110247042 Mallinson Oct 2011 A1
20120002111 Sandoval et al. Jan 2012 A1
20120011550 Holland Jan 2012 A1
20120054811 Spears Mar 2012 A1
20120117151 Bill May 2012 A1
20120192226 Zimmerman et al. Jul 2012 A1
20120227073 Hosein et al. Sep 2012 A1
20120233646 Coniglio et al. Sep 2012 A1
20120295686 Lockton Nov 2012 A1
20120324002 Chen Dec 2012 A1
20120324494 Burger et al. Dec 2012 A1
20120324495 Matthews, III et al. Dec 2012 A1
20120324518 Thomas et al. Dec 2012 A1
20130014155 Clarke et al. Jan 2013 A1
20130040623 Chun et al. Feb 2013 A1
20130051770 Sargent Feb 2013 A1
20130103446 Bragdon et al. Apr 2013 A1
20130110769 Ito May 2013 A1
20130111514 Slavin et al. May 2013 A1
20130170813 Woods et al. Jul 2013 A1
20130176493 Khosla Jul 2013 A1
20130198642 Carney et al. Aug 2013 A1
20130262997 Markworth et al. Oct 2013 A1
20130298038 Spivack et al. Nov 2013 A1
20130316716 Tapia et al. Nov 2013 A1
20130326570 Cowper et al. Dec 2013 A1
20130332839 Frazier et al. Dec 2013 A1
20130347018 Limp et al. Dec 2013 A1
20130347030 Oh et al. Dec 2013 A1
20140006951 Hunter Jan 2014 A1
20140009680 Moon et al. Jan 2014 A1
20140032473 Enoki et al. Jan 2014 A1
20140068648 Green et al. Mar 2014 A1
20140075465 Petrovic et al. Mar 2014 A1
20140089423 Jackels Mar 2014 A1
20140089967 Mandalia et al. Mar 2014 A1
20140129570 Johnson May 2014 A1
20140149918 Asokan et al. May 2014 A1
20140150022 Oh et al. May 2014 A1
20140237498 Ivins Aug 2014 A1
20140267931 Gilson et al. Sep 2014 A1
20140279852 Chen Sep 2014 A1
20140280695 Sharma et al. Sep 2014 A1
20140282122 Mathur Sep 2014 A1
20140325359 Vehovsky et al. Oct 2014 A1
20140327677 Walker Nov 2014 A1
20140359662 Packard et al. Dec 2014 A1
20140365302 Walker Dec 2014 A1
20140373032 Merry et al. Dec 2014 A1
20150026743 Kim et al. Jan 2015 A1
20150263923 Kruglick Sep 2015 A1
Foreign Referenced Citations (33)
Number Date Country
0624039 Nov 1994 EP
0624039 Nov 1994 EP
0963115 Dec 1999 EP
0963115 Dec 1999 EP
1058999 Dec 2000 EP
1080582 Mar 2001 EP
1080582 Mar 2003 EP
1058999 Apr 2003 EP
2323489 Sep 1998 GB
WO 2001084830 Nov 2001 JP
9963757 Dec 1999 WO
9963757 Dec 1999 WO
0011869 Mar 2000 WO
0011869 Mar 2000 WO
0033576 Jun 2000 WO
0033576 Jun 2000 WO
0110115 Feb 2001 WO
0182613 Nov 2001 WO
0182613 Nov 2001 WO
02063426 Aug 2002 WO
02063426 Aug 2002 WO
02063471 Aug 2002 WO
02063471 Aug 2002 WO
02063851 Aug 2002 WO
02063851 Aug 2002 WO
02063878 Aug 2002 WO
02063878 Aug 2002 WO
03009126 Jan 2003 WO
03009126 Jan 2003 WO
2003026275 Mar 2003 WO
2011053271 May 2011 WO
2012094105 Jul 2012 WO
2012154541 Nov 2012 WO
Non-Patent Literature Citations (33)
Entry
Andreas Kraft and Klaus Hofrichter, “An Approach for Script-Based Broadcast Application Production”, Springer-Verlag Brling Heidelberg, pp. 74-82, 1999.
Fernando Periera, “The MPEG-4 Book”, Prentice Hall, Jul. 10, 2002.
Michael Adams, “Open Cable Architecture”, Cisco Press, Dec. 3, 1999.
Mark Riehl, “XML and Perl”, Sams, Oct. 16, 2002.
MetaTV, Inc., PCT/US02/29917 filed Sep. 19, 2002, International Search Report dated Apr. 14, 2003; ISA/US; 6 pages.
Sylvain Devillers, “Bitstream Syntax Definition Language: an Input to MPEG-21 Content Representation”, Mar. 2001, ISO, ISO/IEC JTC1/SC29/WG11 MPEG01/M7053.
U.S. Appl. No. 10/618,210, Programming contextual interactive user interface for television, filed Jul. 11, 2003.
U.S. Appl. No. 10/672,983, System and method for controlling iTV application behaviors through the use of application profile filters, filed Sep. 25, 2003.
U.S. Appl. No. 10/247,901, Interactive user interface for television applications, filed Sep. 19, 2002.
U.S. Appl. No. 10/630,815, System and method for construction, delivery and display of iTV content, filed Jul. 29, 2003.
U.S. Appl. No. 10/933,845, System and Method for Preferred Placement Programing of iTV Content, filed Sep. 2, 2004.
U.S. Appl. No. 10/635,799, User customization of user interfaces for interactive television, filed Aug. 5, 2003.
U.S. Appl. No. 10/894,740, Channel family surf control, filed Jul. 19, 2004.
U.S. Appl. No. 10/925,737, Contextual navigational control for digital television, filed Aug. 24, 2004.
U.S. Appl. No. 12/877,492, Verification of Semantic Constraints in Multimedia Data and in its Announcement, Signaling and Interchange, filed Sep. 8, 2010.
U.S. Appl. No. 13/049,948, System and Method for Construction, Delivery and Display of iTV Applications that Blend Programming Information of On-Demand and Broadcast Service Offerings, filed Mar. 17, 2011.
U.S. Appl. No. 13/161,879, System and Method for Construction, Delivery and Display of iTV Content, filed Jun. 16, 2011.
Boronat F et al: “Multimedia group and inter-stream synchronization techniques: A comparative study”, Information Systems. Pergamon Press. Oxford. GB. vol. 34. No. 1. Mar. 1, 2009 (Mar. 1, 2009). pp. 108-131. XP025644936.
Extended European Search Report—EP14159227.9—dated Sep. 3, 2014.
Canadian Office Action—CA 2,685,833—dated Jan. 22, 2015.
European Extended Search Report—EP 13192112.4—dated May 11, 2015.
Nov. 29, 2017—Canadian Office Action—CA 2,685,833.
CA Office Action—CA App 2,685,833—dated Jan. 27, 2016.
Feb. 19, 2018—European Summons to Oral Proceedings—EP 14159227.9.
CA Response to Office Action—CA Appl. 2,685,833—dated Jul. 17, 2015.
Response to European Office Action—European Appl. 13192112.4—dated Dec. 9, 2015.
CA Office Action—CA Application 2685833—dated Feb. 8, 2017.
Jul. 31, 2018—European Decision to Refuse—14159227.9.
Nov. 6, 2019—Canadian Office Action—CA 2,832,800.
Sep. 5, 2019—Canadian Office Action—CA 2,685,833.
Apr. 21, 2020—European Summons to Oral Proceedings—EP 09175979.5.
Aug. 24, 2020, Canadian Office Action, CA 2,832,800.
Mar. 9, 2018—European Office Action—EP 13192112.4.
Related Publications (1)
Number Date Country
20040024753 A1 Feb 2004 US
Provisional Applications (2)
Number Date Country
60333961 Nov 2001 US
60353799 Jan 2002 US