Showing papers on "Table (database) published in 1996"
Patent•
21 May 1996TL;DR: In this article, a database server with a shared nothing architecture has multiple nodes, each having its own central processing unit, primary and secondary memory for storing database tables and other data structures, and communication channels for communication with other ones of the nodes.
Abstract: A database server with a 'shared nothing' system architecture has multiple nodes, each having its own central processing unit, primary and secondary memory for storing database tables and other data structures, and communication channels for communication with other ones of the nodes. The nodes are divided into at least two groups that share no resources, including power supply and cooling system. Each database table in the system is divided into fragments distributed for storage purposes over all the nodes in the system. To ensure continued data availability after a node failure, a 'primary replica' and a 'standby replica' of each fragment are each stored on nodes in different ones of the groups. Database transactions are performed using the primary fragment replicas, and the standby replicas are updated using transaction log records. Every node of the system includes a data dictionary that stores information indicating where each primary and standby fragment replica is stored among the system's nodes. The records of each dtabase table are allocated as evenly as possible among the table fragments, for example, by hashing a primary key value for each record with a predefined hash function and using the resulting value to select one of the database table fragments. A transaction manager on each node responds to database queries by determining which fragment of a database is being accessed by the query and then forwarding the database query to the node processor on which the primary replica of that fragment is stored. Upon failure of any one of the data processors in the system, each node updates the information in its data dictionary accordingly. In addition, the fragment replicas made unavailable by the node failure are regenerated and stored on the remaining available nodes in the same node group as the failed node.
259 citations
Patent•
12 Apr 1996
TL;DR: In this article, four online data definition procedures allow the structure of a database table to be altered while the database table remains available to execution of transactions, with minimal impact of the availability of the database tables for transaction execution.
Abstract: A database computer system includes memory, residing in a plurality of interconnected computer nodes, for storing database tables. Each database table has a plurality of columns, a primary key index based on a specified subset of the columns, and an associated table schema. At least a subset of the database tables are partitioned into a plurality of partitions, each partition storing records having primary key values in a primary key range distinct from the other partitions. A transaction manager generates and stores an audit trail, each audit entry denoting a database table record event, such as an addition, deletion or alteration of a specified database table record in a specified one of said database tables. Four online data definition procedures allow the structure of a database table to be altered while the database table remains available to execution of transactions, with minimal impact of the availability of the database table for transaction execution. The four online data definition procedures are a move partition procedure, a split partition procedure, a move partition boundary procedure, and a create new index procedure. Each of these online procedures has three or four phases of execution. In a first phase, records of a table partition or the entire table are accessed using read only access, so as to generate a new partition, move records between two partitions, or to create a new index. In a second phase, audit trail entries are used to clean up the data structures created during the first phase. In a third phase, access to the database table is briefly locked while audit trail entries created after the second phase are used to make final changes to the data structures created during the first phase, and while the database table schema is updated to reflect the changes to the database table produced.
232 citations
Patent•
1 Feb 1996TL;DR: The information management and database system of the present invention comprises a flexible, self-referential table that stores data as discussed by the authors, which can store any type of data, both structured and unstructured, and provides an interface to other application programs.
Abstract: The information management and database system of the present invention comprises a flexible, self-referential table that stores data. The table of the present invention may store any type of data, both structured and unstructured, and provides an interface to other application programs. The table of the present invention comprises a plurality of rows and columns. Each row has an object identification number (OID) and each column also has an OID. A row corresponds to a record and a column corresponds to a field such that the intersection of a row and a column comprises a cell that may contain data for a particular record related to a particular field, a cell may also point to another record. To enhance searching and to provide for synchronization between columns, columns are entered as rows in the table and the record corresponding to a column contains various information about the column. The table includes an index structure for extended queries.
227 citations
Patent•
8 Aug 1996
TL;DR: In this article, a system tracks information indicative of operations of one or more gaming tables, a dealer, a floor manager or a player, and an electronic input device is placed at each table and receives the information.
Abstract: A system tracks information indicative of operations of one or more gaming tables, a dealer, a floor manager or a player. An electronic input device is placed at each table and receives the information.
225 citations
Patent•
3 Sep 1996TL;DR: In this article, an optical reading apparatus adapted to scan and decode data in accordance with the enabled ones of the parameters stored in a parameter table is presented, equipped with random access and erasable read only memories, and a processor having a menuing program that allows the contents of the parameter table to be changed by user presented menu symbols.
Abstract: An optical reading apparatus adapted to scan and decode data in accordance with the enabled ones of the parameters stored in a parameter table. The reader is equipped with random access and erasable read only memories, and with a processor having a menuing program that allows the contents of the parameter table to be changed by user presented menu symbols. The processor is programmed to respond to a reprogram command, generated by a data source external thereto, by allowing that external data source to change any one or more of the parameter table and the menuing program.
200 citations
1 Nov 1996
TL;DR: FOCUS supports data exploration by a combination of a focus+context or fisheye technique, a hierarchical outliner for large attribute sets, and a general and easy-to-use dynamic query mechanism where the user simply clicks on desired values found in the table.
Abstract: FOCUS, the Feature-Oriented Catalog USer interface, is an interactive table viewer for a common kind of table, namely the object-attribute table, also called cases-by-attribute table or relational table. Typical examples of these tables are the Roll Calls in BYTE where the features and test results of a family of hardware or software products are c ompared. FOCUS supports data exploration by a combination of a focus+context or fisheye technique, a hierarchical outliner for large attribute sets, and a general and easy-to-use dynamic query mechanism where the user simply clicks on desired values found in the table. A PC/Windows implementation of FOCUS is publicly available (http://www.gmd.de/fit/projects/focus.html). It is suited for tables with up to a few hundred rows and columns, which are typically stored and maintained by spreadsheet applications. Since we use a simple data format, existing tables can be easily inspected with FOCUS. With the rapidly increasing public interest in on-line services like the W orld Wide We b we e xpect a growing d emand for access to o n-line c atalogues and d atabases. FOCUS satisfies this demand, allowing formulation of simple database queries with an interface as easy to use as a Web browser.
191 citations
Patent•
IBM1
TL;DR: In this paper, the vectorized index is used to represent values in one or more columns of a particular table in the relational database, and SQL operations are converted to a series of bitvector operations on that index, where the result of the bit-vector operations is a list of row positions in the table.
Abstract: A method, apparatus, and article of manufacture for optimizing SQL queries in a relational database management system using a vectorized index. The vectorized index represents values in one or more of the columns of a particular table in the relational database. The vectorized index is comprised of a plurality of positions, wherein each of the positions comprises a linear array that represents a value for the specified columns in a corresponding row of the particular table in the relational database. To use the vectorized index, SQL operations are converted to a series of bit-vector operations on that index, where the result of the bit-vector operations is a list of row positions in the table.
187 citations
Patent•
5 Mar 1996TL;DR: In this paper, a method for operating a processor-controlled system produces a table image including graphical display objects in each of the cell regions indirectly representing the data values in an underlying n-dimensional (nD) information data array.
Abstract: A method for operating a processor-controlled system produces a table image including graphical display objects in each of the cell regions indirectly representing the data values in an underlying n-dimensional (nD) information data array. Request signal data is received from a input signal source to present the table image in the display area of a display device connected to the processor-controlled system. In response to the request signal data, for each cell in the table image, the source data value and data type of a source data item in the nD data array is obtained, and a cell presentation type is selected using the data type. A graphical display object having at least one display feature representative of the data type of the data value is produced from the cell presentation type, and image definition data defining table image and the graphical display object for each cell is provided to a system display device for display. The underlying data in the nD data array is thus graphically and indirectly represented in the table image, facilitating the visual inspection and identification of patterns and trends in the data. In addition, for very large conventional table images that do not fit in a standard sized display area, indirect representation of the data occupies substantially less space in the display area, permitting very large tables to be entirely represented graphically in one image. A sophisticated user interface permits a system user to perform table manipulation functions, such as reordering rows and column, sorting rows or columns, and deriving new rows or column, in order to further reveal data trends and patterns in the graphical representations.
167 citations
Patent•
IBM1
TL;DR: In this paper, an object-based search engine is activated depending on the type of data object to be indexed, in accordance with the search state attribute the catalog table is created.
Abstract: The invention relates to directing one or more object-based search engines to an object store, which stores information archived according to parametric classifiers. In order for the object-based search engine to access the objects, a special index class, in the form of a SQL table is created. The index class comprises attributes of a part number, an object identification number, an item identifier, a search state attribute, and a search engine identifier, an object being assigned a corresponding value for each attribute and each object being uniquely identified by the item identifier attribute. The search engine is activated depending on the type of data object to be indexed, in accordance with the search state attribute the catalog table. A computer readable medium is provided with program code to implement the above integration.
136 citations
Patent•
26 Dec 1996TL;DR: In this paper, a predictor circuit allows advanced execution of instructions depending for their data on previous instructions by predicting such dependencies based on previous mis-speculations detected at the final stages of processing.
Abstract: A predictor circuit permits advanced execution of instructions depending for their data on previous instructions by predicting such dependencies based on previous mis-speculations detected at the final stages of processing. Synchronization of dependent instructions is provided by a table creating entries for each instance of potential dependency. Table entries are created and deleted dynamically to limit total memory requirements.
129 citations
Patent•
9 Apr 1996TL;DR: In this paper, the video data to be reproduced is stored in a file in a video title set (VTS) stored in an information recording area (28) on an optical disk (10).
Abstract: The video data to be reproduced is stored in a file in a video title set (VTS) (72) stored in an information recording area (28) on an optical disk (10). In the beginning area of the video title set (VTS), video title set information (VTSI) (94) for managing the video title set (VTS) has been written. The video title set information (VTSI) is provided with a table (VTSI_MAT) (98) for managing the video title set information (94). In the table (VTSI_MAT) (98), the attributes peculiar to the video data (VTS_V_ATR) stored in the title set (VTS) have been written. By referring to the management table (VTSI_MAT), the video data to be reproduced is set in a reproducing system.
Patent•
16 Aug 1996
TL;DR: In this article, an object inherits (derives) properties and methods from other (parent) objects via its visual containership, and the Explorer collapses object inspector and object tree functionality into a single UI (user interface) element.
Abstract: A system of the present invention includes a relational database management system (RDBMS), having an object-based, interactive visual-programming language providing programming by "visual inheritance." A user places screen objects (e.g., boxes, screen buttons, table objects, and the like) on an on-screen window or "form," visually attaches selected "properties" and "methods" to the screen objects, and then establishes an containership-based event model that dictates how and when these properties and methods will be invoked. An object inherits (derives) properties and methods from other (parent) objects via its visual containership. In this manner, the task of creating and maintaining application programs is greatly simplified. An alternative embodiment providing an "Object Explorer" is also described. The Explorer collapses object inspector and object tree functionality into a single UI (user interface) element. This allows the user to avoid switching back and forth between an inspector/property sheet user interface element on the one hand and an object tree user interface element on the other. Additionally, the imporved interface consumes less screen surface area.
Patent•
20 Mar 1996TL;DR: In this paper, a method for selecting records from a displayed database table by generating an SQL SELECT command for filtering the displayed records in accordance with cell values highlighted by user input is presented.
Abstract: A method for selecting records from a displayed database table by generating an SQL SELECT command for filtering the displayed records in accordance with cell values highlighted by user input. A presently selected set of records from a desired table (generally referred to as a record set or record source) are displayed on the user's display screen. The user selects particular values in cells (an intersection of a row and a column of the displayed table) by highlighting the values using the pointer device or keyboard of the computer system. Methods of the present invention then generate an SQL select (filter) command to selectively retrieve those records from the displayed records which match the user's highlighted values. A fully highlighted cell indicates exact equality is desired by the user, a beginning portion highlighted indicates that the user wishes to match records whose corresponding column starts with the highlighted value, and ending portion selection matches the ending portion of qualified records, and a middle portion highlighted matches any record containing the highlighted value. Values highlighted in the same row generate logically AND'd clauses in the SELECT command while the comparison generated for a row are logically OR'd with the comparisons generated for other rows. The user may indicate that the highlighted values are for selection (inclusion of qualified records) or for exclusion selection (exclusion of qualified records). A new select (filter) command may be logically AND'd with the prior filter to permit complex selection criteria to be defined by simple graphical user inputs.
Patent•
11 Oct 1996TL;DR: In this article, a method and apparatus for dynamic alteration of a color look-up table (CLUT) pallet identifier in response to one or more key codes placed in an input data stream is presented.
Abstract: A method and apparatus for dynamic alteration of a color look-up table (CLUT) pallet identifier in response to one or more key codes placed in an input data stream. An input data stream including a sequence of input data blocks is converted into a stream suitable for addressing a look-up table. The look-up table may be a 256×16 table which requires an 8-bit address to identify a particular table entry. The invention allows such a table to be addressed using 4-bit data blocks in the input data stream. For each received 4-bit data block in the input data stream, a determination is made as to whether that block corresponds to a predetermined key value. If a given input block does not correspond to the predetermined key value, the 4-bit input block is combined with a previously-stored 4-bit pallet identifier to generate an 8-bit address into the look-up table. The pallet identifier specifies one of 16 different 16-entry pallets within the 256×16 look-up table. If the given input block does correspond to the key value, a new 4-bit pallet identifier is stored. The new pallet identifier may be contained within a data block which immediately follows the key value block in the data stream. The new pallet identifier is then used in combination with subsequent 4-bit data blocks in the stream to generate 8-bit addresses into the look-up table.
Journal Article•
TL;DR: In this paper, a performance definition of high performance concrete (HPC) is presented, which consists of four durability and four strength parameters and three standard tests to evaluate performance, and Table 3 relates recommended performance to exposure conditions.
Abstract: To establish a clear understanding of high performance concrete (HPC), the FHWA is proposing to define HPC by using long-term performance criteria. The proposed definition consists of four durability and four strength parameters. This article presents the performance definition of HPC by using three tables: Table 1 gives the parameters and performance criteria. Table 2 identifies standard tests to evaluate performance, and Table 3 relates recommended performance to exposure conditions.
Patent•
28 Mar 1996TL;DR: In this article, a technique to dynamically configure a Secure Processing Unit (SPU) chip in a secure manner using a capability table, which defines the functions that an SPU can perform, is presented.
Abstract: A technique to dynamically configure a Secure Processing Unit (SPU) chip in a secure manner using a capability table, which defines the functions that an SPU can perform. The capability table employs a digital signature to ensure the authenticity of the source and contents of the table. It also contains information which identifies the SPU for which the table is intended and a time-stamp indicating the time by which the table must be loaded into an SPU.
Patent•
19 Nov 1996TL;DR: In this article, a document searching system searches for other documents having a user-specified document cited therein as its referred document to uncover the latest document associated with the user specified document.
Abstract: A document searching system searches for other documents having a user-specified document cited therein as its referred document to thereby uncover the latest document associated with the user-specified document. In related document searching method, document information is registered in a text storage region, a referred document table and a related document table are created, and referred documents associated with the user-specified document are searched for with use of the created tables.
Patent•
26 Sep 1996TL;DR: In this paper, the authors propose a dynamic versioning system for synchronizing different versions of modules in a complex multi-module software system, and maintaining a consistent view of a version of the complex system for each user having access to the system.
Abstract: A dynamic versioning system for synchronizing different versions of modules among different versions of a complex multi-module software system, and maintaining a consistent view of a version of the complex system for each user having access to the system. The dynamic versioning system grants a user read-only access to the multiple modules in a complex system, and promotes the access to write access only when a user is ready to save a modified module in the permanent non-volatile memory of the complex system. The dynamic versioning system manages the evolving versions of the complex system with a Dynamic Versioning Table (DVT) and master modules that identify the multiple slave modules associated with a particular version of the complex system. Old versions of modules are removed from the complex system's permanent non-volatile memory when the last user has terminated use of the complex system.
Patent•
23 Apr 1996
TL;DR: In this article, a method and system for efficiently performing database table aggregation is presented. But the method is not suitable for multi-level aggregations, as there are multiple grouping columns, multiple aggregated columns, and/or multiple result columns.
Abstract: A method and system for efficiently performing database table aggregation is provided. In a preferred embodiment, an aggregation facility efficiently aggregates a source table using indices on an aggregated column of the source table and a grouping column of the source table. The facility uses the index on the aggregated column to identify the contents of the aggregated column in each row of the source table. The facility further uses information derived from the index on the grouping column to identify the contents of the grouping column in each row of the source table. For each row of the source table, the facility aggregates the identified aggregated column contents into a result value for the identified grouping column contents. In a further preferred embodiment, the facility generates a relation mapping from source table row to grouping column, which the facility uses to identify the contents of the grouping column in each row of the source table. In a further preferred embodiment, the facility may be used to perform multiple-level aggregations, as well as aggregations in which there are multiple grouping columns, multiple aggregated columns, and/or multiple result columns.
Patent•
IBM1
TL;DR: In this article, the authors propose a method for replicating data stored in source database tables in a database management system implemented by a server at a remote client implemented on a client computer.
Abstract: A method, apparatus, and article of manufacture for replicating data stored in source database tables in a database management system implemented by a server at a remote client implemented on a client computer. The method comprises the steps of receiving a subscription message from the client computer, wherein the subscription message specifies a remote client database table and a data replication period, receiving a change log from the database management system at the data replication agent, generating a table of changed data by using the change log, data replication period, and source database table to reconstruct changes to the remote client database table, and transmitting the changed data table to the remote client.
Patent•
2 Jan 1996
TL;DR: In this article, the authors propose three operating modes according to application access level permission are allowed: direct read/write, shadowing and file putback for block compressed data files.
Abstract: In a block compressed data file, desired given non-compressed data is identified in a subset of a compressed data file and only the subset of the compressed data file containing the desired data is decompressed Three operating modes according to application access level permission are allowed The direct-read mode is used for application read-only permission The file shadowing mode is used for application read/write permission when it is likely that the application will only read from the file without writing to it The file putback mode is used for application read/write permission when it is likely the application will write to the file Data caching of decompressed data blocks from a file avoids repetitious decompressing of a data block requested at different times Block access of the compressed data file occurs through a table of offsets, either stored in the compressed data file itself or constructed from scratch
Patent•
12 Jan 1996TL;DR: In this paper, a modified value index has been proposed to index table buffer modifications with the same key structure as a user-defined index on the original table, and an indexing logic performs index functions on both the user defined index and modified index to provide integrated indexing of original table records and table buffer modification with the userdefined key order.
Abstract: A computer database management system has a table buffer for buffering as yet uncommitted modifications of records in an original shared database table and a look aside index for redirecting original table accesses to the modifications in the table buffer. Record modifications in the table buffer are indexed by a modified value index having a same key structure as a user-defined index on the original table. An indexing logic performs index functions on both the user-defined index and modified value index to provide integrated indexing of the original table records and table buffer modifications with the user-defined key order.
Patent•
12 Jul 1996
TL;DR: In this paper, a method, computer program product, and system for creating and displaying a categorization table is provided, where a set of data records is created and displayed by first sorting the data records according to data record fields, typically using an index.
Abstract: A method, computer program product, and system for creating and displaying a categorization table is provided. A categorization table into a set of data records is created and displayed by first sorting the data records according to data record fields, typically using an index. Next, a header table is created having a number of category columns that will hold values corresponding to a number of index columns. The combinations of values across each header row will be unique and the row will also have a count value indicating the number of data records having the unique combination of category values that can be used to quickly access the first data record in the sorted index. In this manner, all of the data records can be successively accessed knowing the count value and the location of the first data record. Additionally, header rows having no data records associated therewith are used to form the headings and subheadings of the categorization table. Finally, a processor will traverse the header table and cause the categorization table to be displayed on a display means. As part of the traversal, information contained in the header table is used to calculate a fractional position of a user's location with respect to the user's particular view of the categorization table. A plurality of user columns in the categorization table allow separate and distinct views by different users into the same set of data records and using the same header table.
Patent•
11 Jun 1996TL;DR: In this paper, a method for automatically updating a central local number portability (LNP) database shared among a plurality of central office switches is instigated when a message from a provisioning system to add a directory number is received by a central office switch.
Abstract: A method for automatically updating a central local number portability (LNP) database shared among a plurality of central office switches is instigated when a message from a provisioning system to add a directory number is received by a central office switch. In response to the message, a first central office switch accesses the central LNP database by sending a query message which contains the directory number to be added and routing data specific to the central office switch. Responsive to the query message, the LNP database searches for the directory number received from the first central office switch. If the directory number is found, the database queries a second central office switch to determine if the directory number is in use. If the number is in use, the central LNP database returns a failure message to the first central office switch. If the directory number is not found in the central LNP database or if the directory number is not being used by the second central office switch, the directory number and routing data received from the first central office switch and a transaction entry are added to a table corresponding to the first central office switch in the database.
PARC1
TL;DR: The Table Lens as discussed by the authors is a visualization for searching for patterns and outliers in multivariate data sets, which supports a lightweight form of exploratory data analysis by integrating a familiar organization, the table, with graphical representations and a small set of direct manipulation operators.
Abstract: The Table Lens is a visualization for searching for patterns and outliers in multivariate datasets. It supports a lightweight form of exploratory data analysis (EDA) by integrating a familiar organization, the table, with graphical representations and a small set of direct manipulation operators. We examine the EDA process as a special case of a generic process, which we call sensemaking. Using a GOMS methodology, we characterize a few central EDA tasks and compare performance of the Table Lens and one of the best of the more traditional graphical tools for EDA i.e. Splus. This analysis reveals that Table Lens is more or less on par with the power of Splus, while requiring the use of fewer specialized graphical representations. It essentially combines the graphical power of Splus with the direct manipulation and generic properties of spreadsheets and relational database front ends. We also propose a number of design refinements that are suggested by our task characterizations and analyses.
Proceedings Article•
1 Jan 1996TL;DR: A system, called PostGraphe, which generates a report integrating graphics and text from a single set of writer's intentions, which is given the data in tabular form as might be found in a spreadsheet.
Abstract: Graphics and text have to be well integrated in order to achieve their full potential. A picture shows but a text describes. In a statistical report, graphics show the data that is analyzed in the text. This paper describes a system, called PostGraphe, which generates a report integrating graphics and text from a single set of writer's intentions. The system is given the data in tabular form as might be found in a spreadsheet; also input is a declaration of the types of values in the columns of the table. The user chooses the intentions to be conveyed in the graphics (e.g. compare two variables, show the evolution of a set of variables ...) and the system generates a report in IgTEX with the appropriate PostScript graphic files.
Patent•
30 Aug 1996TL;DR: In this article, the paper kind sensor 18 discriminates a kind of a paper to be printed by the print section 20, and the CPU 10 selects a color-conversion table Ti out of the plurality of colorconversion tables stored in the ROM 8.
Abstract: The paper kind sensor 18 discriminates a kind of a paper to be printed by the print section 20. Receiving the paper kind information from the sensor 18, the CPU 10 selects a color-conversion table Ti out of the plurality of color-conversion tables stored in the ROM 8. The selected color-conversion table Ti corresponds to the kind of the presently-used paper. The CPU 10 then performs a color-conversion operation on print data with using the selected color-conversion table Ti. Thus color-converted print data is used in printing operation. A user will not need to consider a kind of paper to be printed, and therefore will not need to control the host computer to correct for print information before supplying the print information to the printer. It becomes possible to reduce a burden loaded on the user.
Patent•
18 Sep 1996
TL;DR: In this paper, an automated system and method for producing a work breakdown structure for a project, such as a software development project, is presented, which provides a common framework for communicating cost, scope and schedule information relating to the project.
Abstract: An automated system and method for producing a work breakdown structure for a project, such as a software development project. The resulting work breakdown structure provides a common framework for communicating cost, scope and schedule information relating to the project. The system includes a function point component list which identifies the files and tables which represent the product to be developed for the project or projects. The function point component list also contains information about the elementary transactions by which each file or table is modified or maintained. The system further includes a work breakdown structure template file, in which a list of identifiable tasks and resources required to accomplish a project is maintained. Using the function point component list and the work breakdown structure template file, the system generates an electronic work breakdown structure output file in which information about the total work required to accomplish the objectives of a project is stored. The information contained in the electronic work breakdown structure output file can be extracted in a user defined format and displayed for a user.
Patent•
27 Jun 1996
TL;DR: In this paper, a method for processing a file containing a financial statement in uncoded format such as a financial statements stored in an ASCII file is presented, where the starting locations of the various types of financial tables in the financial statement as indicated by their table titles are identified by grammar descriptors.
Abstract: A method for processing a file containing a financial statement in uncoded format such as a financial statement stored in an ASCII file. The starting locations of the various types of financial tables in the financial statement as indicated by their table titles are identified by grammar descriptors. When all the table titles in the file are identified, a table title is then selected for processing. Typically after the table title, there are the associated column headers for the table, and they are analyzed and determined. Following the column headers, there are lines of text that are separated into line items, where each line item is composed of a label and/or one or more numbers corresponding to the label. With these line items, the next task is to parse these line items to verify that these line items make up the table and to identify the components of the financial table. A financial table is comprised of line items, subtotals, and grand totals. By recognizing the mathematical structure of the table, the relationship between the line items, subtotals, and grand totals can be readily understood and categorized.