Showing papers on "Table (database) published in 2001"
TL;DR: GGEbiplot as mentioned in this paper is a Windows application that performs biplot analysis of two-way MET data analysis, and it also produces an WHAT IS A GGE BIPLOT? interactive show of the data.
Abstract: facilitate the application of the GGE biplot methodology in MET data analysis and in analyses of other types Plant breeding trials produce quantities of data and finding the of two-way data, a Windows application, the GGEbiplot useful information within that data has historically been a major challenge of plant breeding. A recently developed graphical data software, was developed. This paper describes the funcsummary, called GGEbiplot, can aid in data exploration. GGEbiplot tions built in this software and exemplifies their use in is a Windows application that performs biplot analysis of two-way MET data analysis. data that assume an entry tester structure. GGEbiplot analyzes the data and outputs the results as an image, and it also produces an WHAT IS A GGE BIPLOT? interactive show of the data. It allows interactive visualization of the biplot from various perspectives. A multienvironment trial data set, The Concept of Biplot in which cultivars are entries and environments are testers, was used The concept of biplot was first proposed by Gabriel to demonstrate the functions of GGEbiplot. These include but are not limited to: (i) ranking the cultivars based on their performance (1971). The main ideas follow. Any two-way table or in any given environment, (ii) ranking the environments based on matrix X that contains n rows and m columns can be the relative performance of any given cultivar, (iii) comparing the regarded as the product of two matrices: A with n rows performance of any pair of cultivars in different environments, (iv) and r columns and B with r rows and m columns. Thereidentifying the best cultivar in each environment, (v) grouping the fore, Matrix X can always be decomposed to its two environments based on the best cultivars, (vi) evaluating the cultivars component matrices, A and B. If r happens to be 2, based on both average yield and stability, (vii) evaluating the environ- Matrix X is referred to as a rank-two matrix. Each row ments based on both discriminating ability and representativeness, in Matrix A has two values, which define a point in a and (viii) visualizing all of these aspects for a subset of the data by two-dimensional plot. Similarly, each column in Matrix removing some of the cultivars or environments. GGEbiplot has been
1,268 citations
01 Oct 2001-International Journal of Human-computer Studies \/ International Journal of Man-machine Studies
TL;DR: This paper notes the importance of usable systems and promotes the process of human-centred design as a way to achieve them by adopting the framework of ISO 13407 along with a set of usability methods to support it.
Abstract: This paper notes the importance of usable systems and promotes the process of human-centred design as a way to achieve them. Adopting the framework of ISO 13407, each of the main processes in the human-centred design cycle is considered in turn along with a set of usability methods to support it. These methods are briefly described with references to further information. Each set of methods is also presented in a table format to enable the reader to compare and select them for different design situations.
1,212 citations
Patent•
29 Mar 2001TL;DR: In this article, a table is used to provide session-specific product recommendations to users that are based on the products viewed by the user during the current browsing session, and the table can also be used to supplement product detail pages with lists of related products.
Abstract: Various methods are disclosed for monitoring user browsing activities that indicate user interests in particular products or other items, and for using such information to identify items that are related to one another. In one embodiment, relationships between products within an online catalog are determined by identifying products that are frequently viewed by users within the same browsing session (e.g., products A and B are related because a significant portion of those who viewed A also viewed B). The resulting item relatedness data is preferably stored in a table that maps items to sets of related items. The table may be used to provide personalized product recommendations to users, and/or to supplement product detail pages with lists of related products. In one embodiment, the table is used to provide session-specific product recommendations to users that are based on the products viewed by the user during the current browsing session.
548 citations
Patent•
29 Nov 2001
TL;DR: In this article, a reference table has columns associated with data attributes and rows containing related words assigned to those attributes in a collection of data, those words coming from different data tables having independent numbers of records.
Abstract: A reference table has columns associated with data attributes and rows containing related words assigned to those attributes in a collection of data, those words coming from different data tables having independent numbers of records. The stored data include word thesauruses associated with the attributes, and reference table row identifier lists respectively associated with thesaurus entries. Each word thesaurus associated with an attribute has a respective entry for each word assigned to this data attribute in the collection of data. The reference table, which may be a virtual table, defines a unified algebraic framework for the entries of all the thesauruses. Query criteria can be examined with reference to the relevant thesauruses to obtain a row-ID list or bitmap vector which represents all the reference table rows matching the query criteria, if any. The results can then be delivered through the original data tables, or preferably, by means of the thesauruses.
247 citations
Patent•
5 Apr 2001
TL;DR: In this paper, a conventionally coded application conversion system for streamed delivery and execution converts locally installable applications into a data set suitable for streaming over a network, where registry modifications are monitored and the modification data are recorded when the installation program writes to the registry of the local computer system.
Abstract: A conventionally coded application conversion system for streamed delivery and execution converts locally installable applications into a data set suitable for streaming over a network. The invention monitors two classes of information during an application installation on a local computer system. System registry modifications are monitored and the modification data are recorded when the installation program writes to the registry of the local computer system. File modification data are logged each time an installation program modifies a file on the system. This data is used to create an initialization data set which is the first set of data to be streamed from the server to the client and contains the information captured needed by the client to prepare the client machine for streaming a particular application. A runtime data set is also created that contains the rest of the data that is streamed to the client once the client machine is initialized for a particular application. A versioning table contains a list of root file numbers and version numbers which are used to track application patches and upgrades. The invention monitors a running application that is being configured for a particular working environment on the local computer system. The data acquired are used to duplicate the same configuration on multiple client machines.
229 citations
Patent•
4 Apr 2001
TL;DR: In this paper, the authors present methods for accessing relevant data from data sources for presentation, and computer readable media for the same are provided, where the data sources are accessed through an abstraction layer, which performs the operations of transferring portions of the relevant information to a data structure and displaying the selected portions of relevant information.
Abstract: Methods for accessing relevant data from data sources for presentation, and computer readable media for the same are provided. One exemplary method defines multiple dimensions. Then data sources are identified that contain relevant information for the dimensions. Next the data sources are accessed through an abstraction layer. The abstraction layer performs the operations of transferring portions of the relevant information to a data structure and displaying the selected portions of the relevant information. Some notable advantages of the discussed methods include the ability to create virtual dimensions by building a hierarchical table structure from data in a flat file. The use of an abstraction layer allows for ease of modification and efficiency in presentation, since only the user requested data is presented. In addition, the customer is provided dynamic reports in real-time, thereby allowing for time sensitive and mission critical business decisions to be made with current data.
223 citations
Patent•
29 Nov 2001TL;DR: In this article, the SQL compiler and SQL executor are extended to process queries requiring streaming mode processing of data stored in a table, and a scan operator performs table access functions during execution of the streaming mode query.
Abstract: The SQL compiler and SQL executor in a database management system are extended to process queries requiring streaming mode processing of data stored in a table. A scan operator performs table access functions during execution of the streaming mode query. The scan operator first performs an initial scan to access rows in a specified database table, and then performs a delta scan to access new rows added to the table, as well as rows modified by other queries. The scan operator continues to process new data added to the table until the initiating user or application closes the associated cursor. A set of data structures are provided to keep track of active scan operators, including a session control block that includes fields for keeping track of whether the scan operator is performing an initial scan or a delta scan. The session control block also includes, for streaming mode scan operators, a delta scan list of new and modified rows to be processed in the delta scan. When a transaction terminates, any streaming mode scan operators whose operation was suspended because of rows locked by the transaction are automatically rescheduled for execution.
174 citations
Patent•
21 May 2001
TL;DR: In this paper, the authors present a method for recovering data from user or application errors by selectively targeting and undoing only those transactions that caused data corruption, which has the further advantage of minimizing the number of transactions that are lost after recovery.
Abstract: Most commercial database systems provide a recovery mechanism that is used to restore data integrity in the event of a hardware or software failure. Many of these systems restore the database from the most recent backup file by rolling forward all transactions from the most recent undamaged transaction log. The present invention discloses a novel system and method for recovering data from user or application errors. Embodiments of the present invention selectively target and undo only those transactions that caused data corruption. In this way, the present invention is able to recover fine-grained database objects such as a table or a row within a table. The present invention has the further advantage of minimizing the number of transactions that are lost after recovery.
167 citations
Patent•
24 Apr 2001TL;DR: In this article, the authors propose a system and infrastructure that allow an application to run with specified versions of assemblies bound thereto, while allowing the application author, assembly publisher and/or an administrator to change the originally-specified version as desired.
Abstract: A method, system and infrastructure that allow an application to run with specified versions of assemblies bound thereto, while allowing the application author, assembly publisher and/or an administrator to change the originally-specified version as desired. Each assembly may exist and run side-by-side on the system with other versions of the same assembly being used by other applications. An application manifest specifies any desired assembly versions, which may be redirected to another version (overridden) by an application configuration. A publisher configuration provided by an assembly publisher can similarly override the specified version. Lastly, an administrator configuration is capable of overriding other configuration versioning information. A table built from the manifest and any configuration redirection may be accessed during execution to quickly locate the appropriate version. The various configuration data structures themselves may be wrapped as assemblies, thereby enabling versioning of configurations.
162 citations
Patent•
IBM1
TL;DR: In this article, a method, an apparatus, a system, a computer program product, and a program are disclosed for maintaining consistency of object content and metadata related to the object in a loose transaction model, preferably using SQL Mediated Object Manipulation (SMOM), for object and meta-data updates.
Abstract: A method, an apparatus, a system, a computer program product, and a computer program are disclosed for maintaining consistency of object content (252) and metadata (204) related to the object (252) in a loose transaction model, preferably using SQL Mediated Object Manipulation (SMOM), for object and meta-data updates. The related meta-data (204) and a reference to the object (252) are stored in a table of a database. The object is stored externally to the database in an object store. The reference is used to obtain a handle for directly accessing or manipulating the external object. A version number embedded in the handle is then obtained. The embedded version number is then compared with a version number of a latest committed version of the externally stored object to determine if the handle refers to a current version of the externally stored object. Next, the last modification timestamp of the file is compared with the last modification timestamp of the latest committed version, in order to detect uncommitted updates. A mismatch indicates that stale data is being referenced, and in that situation an appropriate error is returned.
156 citations
Patent•
9 Mar 2001TL;DR: In this paper, a table searching system for high speed linear searching of a table of information by a plurality of searching agents is provided, which includes: a memory unit for storing a table, including data entries, each having data contents; a search agents each being communicatively coupled with the memory unit, and having a port for receiving an associated search key value; and a memory controller unit providing a centralized interface between memory unit and each of the agents, the controller unit being operative to control memory unit to provide the contents of a current one of the table entries to each of
Abstract: A table searching system for facilitating high speed linear searching of a table of information by a plurality of searching agents is provided. The system includes: a memory unit for storing a table of information including a plurality of data entries each having data contents; a plurality of searching agents each being communicatively coupled with the memory unit, and having a port for receiving an associated search key value; and a memory controller unit providing a centralized interface between the memory unit and each of the agents, the controller unit being operative to control the memory unit to provide the contents of a current one of the table entries to each of the agents during each of a plurality of cycles of operation. Each of the searching agents is operative to determine an associated best matching one of the data entries based on comparisons between the associated key value and the contents of the data entries provided by the memory unit.
Patent•
6 Aug 2001TL;DR: In this paper, a progressive game system with a plurality of table games is described, where a server is connected to the network for managing the plurality of progressive games and the server is operable to assign at least one of the awards to a player at a corresponding one of these table games in response to a corresponding event.
Abstract: A progressive gaming system is described having multiple progressive games associated with a plurality of table games. The system includes a plurality of network nodes, each of which is associated with one of the plurality of table games and is operable to transmit first information relating to game activity corresponding to the associated table game. A network interconnects the plurality of network nodes. A server is connected to the network for managing the plurality of progressive games. The server is operable to use the first information from the network nodes to control a plurality of awards associated with the plurality of progressive games. The server is also operable to assign at least one of the awards to a player at a corresponding one of the table games in response to a corresponding event.
Patent•
19 Nov 2001TL;DR: In this paper, a computer implemented method and apparatus for an attribute-oriented routing update is described, where the attributes are stored in an attribute table as a portion of the routing table and the attributes do not include the conventional network prefixes.
Abstract: A computer implemented method and apparatus for an attribute-oriented routing update is described. The method comprises selecting an updated set of attributes in a routing table before selecting a set of updated destinations associated with the selected set of attributes, wherein the attributes are stored in an attribute table as a portion of the routing table and the attributes do not include the conventional network prefixes. An update message that includes the set of updated destinations for the set of attributes is then generated. The method is also extended to extraction of unreachable destinations by using a dummy attribute in the routing table, wherein the dummy attribute is selected first, followed by extracting the unreachable destinations.
Patent•
1 Feb 2001
TL;DR: In this article, the authors propose a method for providing personalized application search results in a mobile device, which comprises the steps of receiving a search request from a user, the search request including at least one search keyword and a user identifier, searching an application registry database for a first set of matching applications based on the search keyword, search an application selection table for a second set of applying applications, and sending the response to the user.
Abstract: An exemplary method for providing personalized application search results in a mobile device comprises the steps of receiving a search request from a user, the search request including at least one search keyword and a user identifier, searching an application registry database for a first set of matching applications based on the search keyword, searching an application selection table for a second set of matching applications based on the search keyword and the user identifier, ordering the second set of matching applications based on frequency of use parameters in the application selection table to obtain an ordered second set of matching applications, appending a set of application in the first set of matching applications but not in the second set of matching applications to the end of the ordered second set of matching applications, generating a response to the search request based on the third set of matching applications, and sending the response to the user.
Journal Article•
TL;DR: A rule discovery process that is based on rough set theory is discussed, using a slope-collapse database as an example showing how rules can be discovered from a large, real-life database.
Abstract: The knowledge discovery from real-life databases is a multi-phase process consisting of numerous steps, including attribute selection, discretization of realvalued attributes, and rule induction. In the paper, we discuss a rule discovery process that is based on rough set theory. The core of the process is a soft hybrid induction system called the Generalized Distribution Table and Rough Set System (GDT-RS) for discovering classification rules from databases with uncertain and incomplete data. The system is based on a combination of Generalization Distribution Table (GDT) and the Rough Set methodologies. In the preprocessing, two modules, i.e. Rough Sets with Heuristics (RSH) and Rough Sets with Boolean Reasoning (RSBR), are used for attribute selection and discretization of real-valued attributes, respectively. We use a slope-collapse database as an example showing how rules can be discovered from a large, real-life database.
Patent•
[...]
16 Feb 2001
TL;DR: In this paper, the authors present methods and systems consistent with the present invention that provide a means for searching numerical data across networks such as the Internet, and removing the middle layer of query engines or servers used by conventional systems in retrieving data from relational databases over the Internet.
Abstract: Methods and systems consistent with the present invention provide a means for searching numerical data across networks such as the Internet, and removing the middle layer of query engines or servers used by conventional systems in retrieving data from relational databases over the Internet. The methods and systems in accordance with the present invention also provide a means for tying millions of computers together into a single database, thereby a query introduced to the system returns a table of data as a single database is capable of providing. Furthermore, the methods and systems consistent with the present invention provide the means for performing navigational, line item (or record-level), semantic, numerical, transformational, arithmetic, time-dependent, and cost based queries on numerical data. In addition, a user may also conduct select queries between unrelated databases.
Patent•
IBM1
TL;DR: In this article, a method, system, and program for maintaining workflow related information is presented, where at least one table is provided in a database storing workflow related data and a plurality of methods are associated with one stored procedure call.
Abstract: Provided is a method, system, and program for maintaining workflow related information. At least one table is provided in a database storing workflow related data. A plurality of methods are provided, wherein each method specifies an operation to perform on the workflow related data in the at least one table, and wherein each method is associated with one stored procedure call. One stored procedure is provided in the database for each stored procedure call and corresponding method, wherein the stored procedure includes a plurality of database statements to perform the method operation. One stored procedure is executed in the database to perform the corresponding method operation on workflow related data in one table.
Patent•
23 Jan 2001
TL;DR: In this paper, the authors propose a data processing method and system including a plurality of databases linked by at least one communication channels, a synchronizer for each database which controls and monitors the synchronization between databases and accesses a local database to which the synchronizer is connected.
Abstract: A data processing method and system including a plurality of databases linked by at least one communication channels, a synchronization set which defines the objects or records to be synchronized between the plurality of databases, and a synchronizer for each database which controls and monitors the synchronization between databases and accesses a local database to which the synchronizer is connected. Each synchronizer includes a communications module which monitors and controls the communication with other databases and at least one table synchronizer which controls and monitors the synchronization of the local database and access to the local database. Each table synchronizer includes a table synchronizer engine which handle the synchronization management for its table synchronizer, a plug-in which handle the generic database communication for its table synchronizer, and a driver which controls communication with the local database. The data processing method synchronizes data records of a source database and a destination database. The method includes defining a synchronization set for data records existing in the source database, synchronizing the source database and the destination database based on the synchronization set, and changing the definition of the synchronization set while synchronizing the source database and the destination database.
Patent•
12 Oct 2001
TL;DR: In this paper, an enhanced mechanism for faster collection of statistics regarding at least one attribute (or column) of a table in a database system is proposed. But the mechanism is not suitable for the automatic collection of attributes.
Abstract: Statistics regarding at least one attribute (or column) of a table in a database system are collected using an enhanced mechanism for faster collection. The statistics collection is based on scanning a sample of rows of a given table, with the sample being less than all the rows of the table. The percentage of rows to be read is specified in a statement submitted to the database system. The database system then uses the specified percentage to read the sample rows from the table for collecting statistics on the at least one attribute.
Patent•
19 Mar 2001
TL;DR: In this article, the required component list is used to compare the information in the list with the software components already installed at the computer to obtain the required software components required to process the content data.
Abstract: Updating software components that are required to appropriately process content data included in a data file. A computer having installed thereon certain software components obtains a data file that includes a required component list identifying the required software components and required versions thereof needed for processing the content data. The computer compares the information in the list with the software components already installed at the computer. The computer obtains an update table identifying network locations from which the required software components can be obtained. If the required component list includes software components not already installed at the computer, these required components are requested from the network locations identified in the update table. If the required component list includes new versions of required software components and only previous versions of the required software components are already, these new versions are requested from the network locations. In this manner, the computer obtains the software components required to process the content data. As a result software providing new functionality and other software upgrades can be efficiently distributed to a large number of users.
1 Sep 2001
TL;DR: This paper summarizes the core idea of the T-Recs table recognition system, an integrated system covering block-segmentation, table location and a model-free structural analysis of tables, and proposes a quality evaluation measure that reflects the bottom-up strategy of either T-recs or T- Recs++.
Abstract: This paper summarizes the core idea of the T-Recs table recognition system, an integrated system covering block-segmentation, table location and a model-free structural analysis of tables. T-Recs works on the output of commercial OCR systems that provide the word bounding box geometry together with the text itself (e.g. Xerox ScanWorX). While T-Recs performs well on a number of document categories, business letters still remained a challenging domain because the T-Recs location heuristics are mislead by their header or footer resulting in a low recognition precision. Business letters such as invoices are a very interesting domain for industrial applications due to the large amount of documents to be analyzed and the importance of the data carried within their tables. Hence, we developed a more restrictive approach which is implemented in the T-Recs++ prototype. This paper describes the ideas of the T-Recs++ location and also proposes a quality evaluation measure that reflects the bottom-up strategy of either T-Recs or T-Recs++. Finally, some results comparing both systems on a collection of business letters are given.
Patent•
19 Jul 2001
TL;DR: In this paper, a multilingual user interface system and method that allows for easily and immediately switching between available languages, without interrupting application program operation, and easily adding and editing a wide array of languages and language-specific user interface attributes, without modifying the application program and without requiring significant, if any, programming skills, is described.
Abstract: A multilingual user interface system and method that allows for easily and immediately switching between available languages, without interrupting application program operation, and easily adding and editing a wide array of languages and language-specific user interface attributes, without modifying the application program and without requiring significant, if any, programming skills, is described. A table of user interface attributes confers language specificity.
Patent•
7 Jun 2001
TL;DR: In this article, a relational database is provided with a plurality of data entries stored in the database, and a hierarchical level identifier is assigned to each of the data entries wherein the hierarchical level identifiers equal the number of non-zero digits in the outline number.
Abstract: A relational database is provided with a plurality of data entries stored in the database. The data entries have a hierarchical relationship. The data entries are assigned an item identifier that uniquely identifies each of the data items. A multiple digit outline number is assigned to each of the data entries wherein the digits of the outline number correspond to the hierarchical levels of the data entries. A hierarchical level identifier is assigned to each of the data entries wherein the hierarchical level identifier equal the number of non-zero digits in the outline number. An organizational table is created wherein the table includes a row for each of the data entries and the table includes multiple columns. The columns comprise a column for the item identifier, a plurality of outline number columns where each outline number column comprises one digit of the outline number such that each of the digits is stored in a separate column, and a hierarchical level column comprising the level identifier.
Patent•
25 Jan 2001
TL;DR: In this article, a system server (110) for a channel-based network including one or more Internet sites and oneor more user terminals is described. But the system server identifies each user terminal requesting service by comparing transmitted identification information with authorized user information stored in the network database and notifies each requesting user terminal when updated channel table information is available.
Abstract: A system server (110) for a channel-based network including one or more Internet sites and one or more user terminals. The system server includes a channel table database (414) storing a master channel table that includes a list of channel numbers, each channel number having an associated Internet address and an associated Internet site name. The system server includes a network database (416) and an update manager database (418). The system server identifies each user terminal requesting service by comparing transmitted identification information with authorized user information stored in the network database. The system server also compares a channel table version number from the requesting user terminal with a version number stored in the update manager database that is associated with the master channel table, and notifies each requesting user terminal when updated channel table information is available. At each user terminal, a user reads the channel numbers and associated Internet site names from a menu and enters the channel number associated with a selected Internet site name.
1 Jan 2001
TL;DR: An automatic table groundtruth generation system which can efficiently generate a large amount of accurate table ground truth suitable for the development of table detection algorithms and an X-Y cut table decomposition algorithm are described.
Abstract: We first describe an automatic table ground truth generation system which can efficiently generate a large amount of accurate table ground truth suitable for the development of table detection algorithms. Then a novel background analysis-based, coarse-to-fine table identification algorithm and an X-Y cut table decomposition algorithm are described. We discuss an experimental protocol to evaluate the table detection algorithms. For a total of 1,125 document pages having 518 table entities and a total of 10,941 cell entities, our table detection algorithm takes line, word segmentation results as input and obtains around 90% cell correct detection rates.
Patent•
26 Jun 2001
TL;DR: In this paper, a decision engine comprising a core kernel and a plurality of user-selectable plug-in components and a schema defining table and data structures is compiled into an application.
Abstract: A high performance decision engine comprising a core kernel and a plurality of user-selectable plug-in components and a schema defining table and data structures, all of which are compiled into an application. Tables within the compiled application are linked to other tables in a manner such that deterministic queries are rapidly processed by the decision engine according to a traversal scheme defined by the links between tables.
Patent•
17 Sep 2001
TL;DR: In this paper, a video poker machine is provided with an auto hold feature that can be selectively turned on or off by the player to play against a first pay table which has a first theoretical game return.
Abstract: A video poker machine is provided with an auto hold feature that can be selectively turned on or off by the player. When the player uses the auto hold feature, the player plays against a first pay table which has a first theoretical game return. If the player does not use the auto hold feature, then the player plays against a second pay table with a slighter better theoretical game return than the first pay table.
Patent•
24 Aug 2001TL;DR: In this paper, a method and mechanism for pipelined table functions is described, in which the set of work operated upon by a table function is sub-divided into smaller portions that are assigned to a plurality of table function slaves.
Abstract: A method and mechanism for pipelined table functions is disclosed. With pipelining, data from a first table function does not have to be materialized into a complete collection before it is consumed by a succeeding table function. Instead, a producer of data creates a stream of data that is immediately utilized by a consumer of that data. Also disclosed is a method and mechanism for parallel processing of table functions, in which the set of work operated upon by a table function is sub-divided into smaller portions that are assigned to a plurality of table function slaves. Also disclosed is an integration between pipelining and parallelized execution for table functions.
Patent•
26 Mar 2001TL;DR: In this paper, the first and second data items are integrated in a virtual table in accordance with a predetermined business rule, and then returned as an integration result to the query request.
Abstract: The present invention provides techniques for answering a user's query to a database system. An embodiment provides a database querying method in which a first data item is obtained from a Data Base Management System (DBMS) database table in response to a query request. A second data item is obtained by referencing a DBMS updated log file, having log data associated with the first data item, for example a timestamp. The first and second data items are then integrated and returned as an integration result to the query request. In one embodiment the first and second data items are integrated in a virtual table in accordance with a predetermined business rule.
Patent•
22 Aug 2001TL;DR: In this article, a filtering table lists identifying parameters representing the various data types which are to be stored and processed by the broadcast receiver, and the filtering table is scalable by a control unit to an optimum size, which is the minimum size necessary to store all necessary parameters.
Abstract: A broadcast receiver includes an input unit, a receiving unit, a control unit, a main memory, a demultiplexer unit, and a decoding unit. A transport stream of digital packetized data includes various data types identified by various parameters within the packet header. A filtering table lists select identifying parameters representing the various data types which are to be stored and processed. Data packets which do not have a select parameter found within the filtering table are ignored by the broadcast receiver. The filtering table is scalable by a control unit to an optimum size, which is the minimum size necessary to store all necessary parameters. A control unit determines the number of parameters required in the filtering table, and scales the filtering table to accommodate that number of parameters.