Abstract: This paper describes the concepts used in the implementation of DBDSGN, an experimental physical design tool for relational databases developed at the IBM San Jose Research Laboratory. Given a workload for System R (consisting of a set of SQL statements and their execution frequencies), DBDSGN suggests physical configurations for efficient performance. Each configuration consists of a set of indices and an ordering for each table. Workload statements are evaluated only for atomic configurations of indices, which have only one index per table. Costs for any configuration can be obtained from those of the atomic configurations. DBDSGN uses information supplied by the System R optimizer both to determine which columns might be worth indexing and to obtain estimates of the cost of executing statements in different configurations. The tool finds efficient solutions to the index-selection problem; if we assume the cost estimates supplied by the optimizer are the actual execution costs, it finds the optimal solution. Optionally, heuristics can be used to reduce execution time. The approach taken by DBDSGN in solving the index-selection problem for multiple-table statements significantly reduces the complexity of the problem. DBDSGN's principles were used in the Relational Design Tool (RDT), an IBM product based on DBDSGN, which performs design for SQL/DS, a relational system based on System R. System R actually uses DBDSGN's suggested solutions as the tool expects because cost estimates and other necessary information can be obtained from System R using a new SQL statement, the EXPLAIN statement. This illustrates how a system can export a model of its internal assumptions and behavior so that other systems (such as tools) can share this model.

Abstract: In a database management system that operates according to the Structured Query Language standard, a query containing a reference to a view is processed by dynamically materializing the view through execution of the view definition. Once the view is materialized, it is treated as any other base table. To enable a query optimization plan to refer to the materialized view, a view node is introduced into the execution plan. The view node includes a subquery that results in the creation of the virtual table defined by the view. This created table is temporarily stored in a memory. The query optimizer can treat view nodes in the same manner as stored base tables, and thereby overcomes restrictions that were placed upon views by previous view decomposition approaches.

Abstract: A method for providing an occurrence level, value based security protection system including the steps of building a data security table; extracting from the request to the database information concerning the system user, his terminal location, the data he wishes to access, and the operation he wishes to perform on the data; comparing these extracted pieces of information against the permitted access rules found in the data security table; returning a violation status to the host system making the request if the compared information fails to match the permitted access rules found in the data security table and logging the violation; permitting the execution of the request if the extracted data is found to match the permitted access rules found in the data security table.

Abstract: In an editing apparatus, the data of a book edited using various element data such as text, illustration and photograph constituting one page are decomposed into data related to layout and data related to elements and are preserved. A data retrieval means comprises a data retrieval table memory means storing the titles and indexes in a hierarchical structure, an n-th hierarchical index input means for inputting an n-th hierarchical index, a data select means for selecting an (n+1)-th hierarchical data corresponding to the n-th hierarchical index from the data retrieval table memory means, a data existence determining means for determining whether the (n+1)-th hierarchical data exists in said data retrieval table memory means or not, and an element data read out means for reading the data from the element data memory means when the (n+1)-th hierarchical data does not exist.

Abstract: The wide variety of competitive analysis techniques available to managers presents a problem of choosing the most appropriate set for the objectives of an assignment. A utilization profile table evaluates 21 competitive analysis techniques along a set of 11 dimensions. Managers can use the table to examine trade-offs among the techniques, thereby selecting the most efficient and effective ones for their assignment.

Abstract: Method and apparatus for reducing call setup time for calls to Advanced 800 customers by eliminating one database query. (Toll charges for 800 calls are paid by the called customer.) In the prior art, a call to an Advanced 800 customer required accessing a Basic 800 database, then, using data obtained therefrom, accessing an Advanced 800 database. In accordance with this invention, a table of the most frequently called Advanced 800 numbers and the corresponding data normally obtained from the Basic 800 database is dynamically maintained in each roll switching system. When an 800 call is received at a toll switching system, the table is examined to see if the Advanced 800 service accessing data is stored therein. If so, the advanced 800 database is directly accessed without first accessing the Basic 800 database; if not, the call is processed as in the prior art, plus updating the table if the call is to an Advanced 800 customer. Advantageously, such an arrangement reduces call setup time to frequently called Advanced 800 customers by about 1.5 seconds.

Abstract: A method is disclosed for deferring enforcement of referential constraints in large-scale data base operations such as the population or loading of relational tables 10, 12. First, the new rows are loaded in a Data Load phase 24 into the tables, and information on the new rows and their constraints is extracted and sorted 26 into a sorted key data set 68. Any primary indexes 22 required for constraint checking are then updated 28 using the sorted key data set. The new rows are then checked 70 for constraint violations, such violations are rectified 72 to restore the table's referential integrity, and a deletion data set 80 is produced. The deletion data set is merged and sorted 86 with row information 53 stored during loading, and the result is used to copy 88 the new rows violating referential constraints to a separate discard data set 48 where they can be corrected and reloaded into the table. Finally, an error summary report 36 is generated for use in correcting the discard data set.

Abstract: A bill of material for a product is automatically created from a query session on the product structure. The user is first queried on functional product structure. A top down approach, rather than a focus on design details, is encouraged. As the query occurs, a hierarchical tree structure is created on the screen for the user to view. Within a relational database, the structure data is kept in a table which is accessed by item number. Once the product structure is established, the user can see the hierarchical tree and check it for correctness. From the tree structure, which has been captured in the relational database, the indented bill of material is built.

Abstract: A moving table apparatus includes a base, two guide rails laid on the base and extending in a direction Y, a first table capable of moving on rails, in direction Y, two guide rails laid on the first table and extending a direction X, and a second table capable of moving on the guide rails laid on the first table, in direction X. The first table has a main table located on the side of the base, a support table supporting the second table, and a pin supporting the support table what is rotatable relative to the main table. Before the main and support tables are fastened together by means of screws, the support table is rotated around the pin, thereby adjusting the angle between two straight lines extending in directions X and Y, respectively.

Abstract: *SQL in a Nutshel *Creating Databases and Table *Querying Tables: The Select Statemen *The Select Statement More on The Select Statemen *Writing Report *Updating Table *Optimising Statement *View *User and Data Securit *Catalog Table *Applications Developments with SQ *Database Desig *An Overview of Thirteen SQL Implementation *Expected Extensions to SQL

Abstract: Summary An expert table tennis player was required to perform attacking forehand drives under two ball velocity conditions with normal binocular vision. Under the faster condition he also performed monocularly. Film analysis results suggest that under binocular conditions two sources of information were used for timing the initiation of the drive, viz. ball location and time to frontal eye plane (FEP) - the time period that would elapse between the moment of movement initiation and the moment the ball would cross the frontal plane through the eyes. Under the monocular condition, in which localization of the ball is supposed to be more difficult, the subject tended to slow down his movements. Moreover, while under the binocular conditions the subject was shown to execute a consistent drive, under the monocular condition he adapted his drive to the very slight variations in time to FEP. It is tentatively concluded that under normal (binocular) Conditions the player simply runs off a standard 'motor programme', while under the more uncertain (monocular) condition 'programme parameters' are adaptively varied to match the changes in environmental information.

Abstract: A self-contained, collapsible demonstration table with a backboard, for use in product demonstrations and displays. The structure can be conveniently changed manually between a closed, suitcase-like structure which is easily stored and carried and an open table with a large table top and an upstanding display background.

Abstract: In an image processor system, a processor includes a first two-dimensional look-up table for receiving first and second digital data as an address, a second two-dimensional look-up table for receiving an output digital data of the first two-dimensional look-up table and a third digital signal as an address, and a latch circuit for temporarily storing the output digital data of the second look-up table. The processor is flexible and the functions thereof can be varied by changing the contents of the look-up tables.

Abstract: A data name standardizing/unifying system for standardizing the names of data belonging to data items having different names and transferred or compared among data files so as to be unified for programs. For standardizing the data names, names of data items assumed to have same contents are gathered and a table indicating data names to be replaced are generated to be displayed together with prompting for entry of the standard data name to replace. From this table, standardization for data names is accomplished by this replacement of the data name in the programs. For identifying the standardized data names created for the different files, different file names or different and upper file names are added to a division of program which refers to the files.

Abstract: In knowledge translation of data base in an expert system which draws inference based on knowledge, a table for defining a correspondence relationship between the knowledge and the data base, data base/knowledge translator for reading data necessary for the inference directly from the data base by using the correspondence relation table and translating it to knowledge form, and knowledge/data base translator for translating the knowledge prepared by the inference to data base form by using the correspondence relation table and storing it are provided.

Abstract: A method is described for applying roofing paper to a roof by first heating the roofing paper before the paper is applied to the roof, and then applying the heated roofing paper to the roof for final assembly. The applicator consists of a flat table bed and a cradle at one end for holding a roll of roofing paper and a handle at the other end for pulling the applicator. Located on the flat table is a plurality of infrared heaters that form an oven over the flat table and which are pivotally attached to the handle for allowing the roofing paper to pass over the table and through the oven. The paper is drawn from the roll through the oven and under a pair of rollers that support the applicator.

Abstract: An assist bar is provided for facilitating a standing chiropractor in the manipulative treatment of a prone patient's spine while the patient is supported on a leg support section of a chiropractic table of the type having a body support section for the patient's body pivotally interconnected with the leg support section. The assist bar includes a connector at one end for securing the bar to the leg support section remote from the pivotal interconnection of the section with the main body support section. The assist bar extends outwardly of the leg support section and a handle is provided adjacent an outer end portion for facilitating a chiropractor in manipulating the patient's lower body up and down or side to side while making adjustments in the patient's spine with the other hand on the patient's body on the body support section.

Abstract: The initial relational database model is based on tables that are completely independent one from another: a row can be inserted or deleted in a table without consideration of any other table; joins may be expressed on any columns of compatible syntactic types. In other words, the initial model has very little notion of semantics. In the last decade, many authors have emphasized the need for more semantics ( see /HK87/ fo r a survey). The reasons for doing so vary, but the common underlying justification is that, once the system becomes aware of semantic properties, it can make the user's task easier, increase the level of confidence in the data, and even improve performance.

Abstract: An expert system, VIRGO, for planning switching sequences in substations has been developed. A substation model has been developed on a knowledge database, and, based on this model, the expertise of the operator has been described in terms of production rules. These rules must be layered as metarules to reflect the understanding of the domain expert. VIRGO comprises four functions: it makes specific commands by which any equipment involved should be operated; it makes a switching sequence table in accordance with these commands by reasoning from production rules: it converts the table into an easily readable format: and it simulates the substation model with the sequences on a color CRT screen. VIRGO has been implemented in the knowledge description language, KDL, on the VAX workstation. >

Abstract: In a method for editing and executing a program in a processing apparatus, the program is subdivided into modules which are units for validating correction thereof. A control table is provided having a flag for each module to indicate whether or not an edited program associated therewith has been corrected. Each time a program is corrected, the correction thereof is registered to the table, thereby only permitting the execution of a program module for which the pertinent flag of the table indicates the program correction.

Abstract: Multiple station modular office furniture including a primary table top partitioned to be shared privately by four users and coordinated with two lateral table tops partitioned to be shared by said four users so that each user has a primary table portion and a lateral table portion, vertical panels assembled with said tops utilizing slots in said panels and tops to provide a balanced, stable, strong structure.

Abstract: A table setting display guide for coordinating table settings and dinnerware plate patterns. The table setting display guide includes a first page which illustrates at least one table setting having an opening at the position where a dinnerware plate would be set. A second page is provided which illustrates a plurality of dinnerware plate patterns, which patterns are sized to correspond to the size of the opening in the first page. The opening in the first page is selectively positionable on the second page to permit viewing of each dinnerware plate pattern in conjunction with the table setting.

Abstract: PURPOSE: To protect the existing concentration data by checking the matching properties of each logical data at reception of data and therefore deleting the wrong data before registration to the accumulated information. CONSTITUTION: A reception means 11 receives the data including plural pieces of logical data from other computer systems. A check means 12 receives the supply of data from the means 11 and checks the matching properties of each logical data. A check result storing means 15 shows the matching/unmatching results of data to be supplied. An accumulation processing means 16 accumulates data to the logical data whose matching properties are confirmed. Then a control information table means 13 which replaces the received information against the control information in terms of the logical data whose matching properties are confirmed by the means 15. In such a constitution, the title system is possible to delete the wrong data and to protect the precious accumulation data. Furthermore the contents of the received data can be easily confirmed via the retrieval of a control information file. COPYRIGHT: (C)1990,JPO&Japio

Abstract: PURPOSE: To facilitate a charge processing by reducing the amount of charge information and to effectively use an external memory device by providing a frequency table to define frequency at every size and specification of a packet. CONSTITUTION: A user data length frequency table to define the frequency at every user data length and a packet specification frequency table to define the frequency at every packet specification are housed in a frequency counting mechanism 20 as data. The frequency counting mechanism 20 indexes a frequency definition table with the user data length and the packet specification for the packet transmitted to data terminal equipment, and counts the frequency in a charge information area 51 in a call control memory 50 provided at every logical channel. In such a way, since the frequency by which a communication rate can be calculated by multiplying a unit price is calculated even in the case of performing the discount of a long packet, charge on every packet specification, and time discount, etc., the amount of charge information can be reduced, and also, the external memory device 60 can be used effectively. COPYRIGHT: (C)1990,JPO&Japio