Showing papers on "Table (database) published in 1986"
IBM1
TL;DR: The methodology and results of a thorough validation of the optimizer and evaluation of the performance of the experimental distributed relational database management system R*, which inherited and extended to a distributed environment the optimization algorithms of System R are presented.
Abstract: Few database query optimizer models have been validated against actual performance. This paper presents the methodology and results of a thorough validation of the optimizer and evaluation of the performance of the experimental distributed relational database management system R*, which inherited and extended to a distributed environment the optimization algorithms of System R. Optimizer estimated costs and actual R* resources consumed were written to database tables using new SQL commands, permitting automated control from SQL application programs of test data collection and reduction. A number of tests were run over a wide variety of dynamically-created test databases, SQL queries, and system parameters. The results for single-table access, sorting, and local 2-table joins are reported here. The tests confirmed the accuracy of the majority of the I/O cost model, the significant contribution of CPU cost to total cost, and the need to model CPU cost in more detail than was done in System R. The R* optimizer now retains cost components separately and estimates the number of CPU instructions, including those for applying different kinds of predicates. The sensitivity of I/O cost to buffer space motivated the development of more detailed models of buffer utilization unclustered index scans and nested-loop joins often benefit from pages remaining in the buffers, whereas concurrent scans of the data pages and the index pages for multiple tables during joins compete for buffer share. Without an index on the join column of the inner table, the optimizer correctly avoids the nested-loop join, confirming the need for merge-scan joins. When the join column of the inner is indexed, the optimizer overestimates the cost of the nested-loop join, whose actual performance is very sensitive to three parameters that are extremely difficult to estimate (1) the join (result) cardinality, (2) the outer table's cardinality, and (3) the number of buffer pages available to store the inner table. Suggestions are given for improved database statistics, prefetch and page replacement strategies for the buffer manager, and the use of temporary indexes and Bloom filters (hashed semijoins) to reduce access of unneeded data.
179 citations
Patent•
19 Sep 1986
TL;DR: In this paper, a data compression system for increasing the speed of data transmission system over a communication channel with a predefined data transmission rate is presented, where a table changer is used to select from among the encoding tables the one which minimizes the bit length of the encoded data for a preselected sample of the input data.
Abstract: A data compression system for increasing the speed of data transmission system over a communication channel with a predefined data transmission rate. The system has two data compression units--one on each end of the channel, coupled to first and second data processing systems. Input data from either data processing system is encoded using a selected one of a plurality of encoding tables, each of which defines a method of encoding data using codes whose length varies inversely with the frequency of units of data in a predefined set of data. Whenever an analysis of the encoded data indicates that the data is not being efficiently compressed, the system invokes a table changer for selecting from among the encoding tables the one which minimizes the bit length of the encoded data for a preselected sample of the input data. If a new table is selected, a table change code which corresponds to the selected table is added to the encoded data. Also, a dynamic table builder builds a new encoding table to be including in the set of available encoding tables using a preselected portion of the previously encoded input data which an analysis of the encoded data indicates that a new encoding table will enhance compression. Each data compression unit includes a data decoder for decoding encoded data sent over the channel by the other unit. Thus the data decoder uses a set of decoding tables corresponding to the encoding tables, means for selecting a new table when a table change code is received, and means for building a new decoding table when it receives a table change code which indicates that the encoded data following the table change code was encoded using a new encoding table.
147 citations
TL;DR: This paper describes a language interface for an extended NF2 model, i.e. a model which covers a much broader range of data structures than the original [17] NF’ model, and does not appropriately match further vital needs of new database applications.
97 citations
Patent•
26 May 1986TL;DR: In this article, the color density pixel data from the color conversion table memory is written in the image memory, and a color arrangement of a display image, different from that of the original image displayed by the first density image data, can be obtained.
Abstract: An image processing system has a density conversion table memory and a color conversion table memory. The density conversion table memory is addressed by first density pixel data of R, G and B components read out from an image memory, and generates second density pixel data predetermined as representative density pixel data of the first density pixel data. The color conversion table memory is addressed by the second density pixel data from the density conversion table memory, and generates color density pixel data, prepared in advance for color display, corresponding to the second density pixel data. The color density pixel data from the color conversion table memory is written in the image memory. When image display is preformed by utilizing the contents of the image memory, a color arrangement of a display image, different from that of the original image displayed by the first density image data, can be obtained.
52 citations
TL;DR: This work presents methodologies for constructing order-preserving key transforms, and illustrates them for some real-life key sets.
Abstract: File organizations based on conventional hash functions provide faster access to the stored records in comparison with tree-like file structures. Tree structures such as B+-trees and ISAM do provide for sequential processing, but require considerable storage for the indices. When sequential processing is needed a table that performs an order-preserving transformation on keys can be used. H is an order-preserving key transform if H(K1) g H(K2), for all keys K1> K2. We present methodologies for constructing such key transforms, and illustrate them for some real-life key sets. Storage requirements for the table needed to carry out the transformation are less than those needed for the indices.
41 citations
Patent•
29 Sep 1986
TL;DR: An improved bench table embodying at least five distinguishable removable parts and suitable for rapid, compact and lightweight assembling and disassembling is disclosed in this article, where a table top and at least two bench seats have smooth upper surfaces and wholly non-apertured.
Abstract: An improved bench table embodying at least five distinguishable removable parts and suitable for rapid, compact and lightweight assembling and disassembling is disclosed. A table top and at least two bench seats have smooth upper surfaces and wholly non-apertured. The improved bench table makes use of lightweight, but sturdy material to ensure convenient and effective transportation when not in use and ready for storage. By providing preferable plurality of ribbing means incorporated thereto in the various removable parts of said bench table, said parts are capable of withstanding concentrated stresses exerted thereto when in use. Also a strap member is provided for passing therethrough slot portions of the upper portion of the leg members to permit transport of the removable parts when stacked and stored away. The bottom portions of the leg members are provided with integral extending members therefrom for insertion into slot portions of opposingly located leg members for locking thereto when the removable parts are stacked and stored thereto.
37 citations
Book•
1 Jan 1986TL;DR: Applications of Data Structures to Sorting and Recursion, and some Miscellaneous Applications of Trees in Modula-2.
Abstract: ion and Problem Solving. The Stack and Queue Abstractions and Some Implementations. Applications of Stack and Queue Abstractions in Modula-2. The List (Search Table) ion and Some Implementations. Applications of List ion in Modula-2. Review of Recursion. The Tree and Some Implementations. Some Miscellaneous Applications of Trees in Modula-2. The Search Table Implemented with Binary Trees in Modula-2. The Search Table Implemented Using Hash Tables. Applications of Data Structures to Sorting. Memory Management. Appendixes. Index.
33 citations
Patent•
7 Oct 1986
TL;DR: In this article, a simulation technique for modeling the function of logic elements containing memory is described, which uses a table to represent the logical function of the devices that are being simulated.
Abstract: A simulation technique for modeling the function of logic elements containing memory is disclosed. The technique uses a table to represent the logical function of the devices that are being simulated.
26 citations
Patent•
4 Feb 1986TL;DR: In this paper, an original table, a transmission light emitting section, an erasure area specifying section for shifting the light emitted from the transmission light-emitting section to an unnecessary portion of the original to specify a portion to be erased, a memory, a first controller for causing the memory to store position data representing the portion represented by the erasure areas specifying section, a data hold request section, data holding section, having a holding medium for holding written data, which can repeatedly read out the data held in the holding medium, a second controller for reading out the position data
Abstract: The apparatus includes an original table, a transmission light emitting section, an erasure area specifying section for shifting the light emitted from the transmission light emitting section to an unnecessary portion of the original to specify a portion to be erased, a memory, a first controller for causing the memory to store position data representing the portion to be erased specified by the erasure area specifying section, a data hold request section, a data holding section, having a holding medium for holding written data, which can repeatedly read out the data held in the holding medium, a second controller for reading out the position data stored in the memory to hold it in the data holding section upon request from the data hold request section, a held data readout request section, a third controller for reading out the position data held in the data holding section so as to temporarily store the readout data in the memory upon request from the held data readout request section, an original scanning section, an image forming section, an image erasing section for selectively erasing an image to be formed by the image forming section, and a fourth controller for reading out the position data stored in the memory by the first or third controller directly or through the data holding section during an image forming operation of the image forming section to supply the readout data to the image erasing section.
25 citations
Patent•
23 Sep 1986TL;DR: In this article, an image data operation processing apparatus has a controller for transferring specified image data and generating various processing commands in accordance with an operation command input from an external unit, such as a table generator and a table memory.
Abstract: An image data operation processing apparatus having a controller for transferring specified image data and generating various processing commands in accordance with an operation command input from an external unit. The controller reads out the specified image data from a plurality of image memories for storing n-bit, image data, and outputs the readout data to an operation unit. The operation unit includes an image data processor capable of performing a linear combination operation and obtaining the absolute value of a difference, and a look up table unit. The look up table unit includes a table generator, a conversion processor for receiving image data, the total number of bits of which does not exceed a maximum of m bits (m is an integer satisfying 3n/2≦m<2n) and for performing data conversion, and a table memory. The table generator generates a table in response to a table generation command from the controller and stores it in the table memory. When image data is transferred by the controller and a linear combination command or a subtraction command is generated therefrom, the image data processor looks up the table memory in response to a data conversion command from the controller and obtains data corresponding to the input image data.
Patent•
IBM1
TL;DR: In this paper, a mechanism is disclosed for programming the order of cells for an operator to enter data in a spreadsheet, where each cell of the spreadsheet may be provided with a "next cell" attribute, and these attributes as well as other attributes for the cells are stored in a table.
Abstract: A mechanism is disclosed for programming the order of cells for an operator to enter data in a spreadsheet. Each cell of the spreadsheet may be provided with a "next cell" attribute, and these attributes as well as other attributes for the cells are stored in a table. The "next cell" attribute may be a constant, such as the name in the next cell, or it may be a logic expression so that the next cell to be edited can be different depending on some condition. When the operator presses the NEXT CELL key, the "next cell" attribute is searched by accessing the attribute table, and if a "next cell" attribute is found, it is evaluated to determine the next cell to be edited.
Patent•
11 Jun 1986
TL;DR: In this article, an address server storing the address data of all terminal stations to each local area network sub system so as to retrieve the address server is provided to attain the ease of the correction of an address list.
Abstract: PURPOSE:To attain the ease of the correction of an address list by providing an address server storing the address data of all terminal stations to each local area network sub system so as to retrieve the address server. CONSTITUTION:Plural local area network sub systems LAN1-LANn are connected via node stations N1, N2-. The sub systems LAN1-LANn are provided respectively with plural terminal stations S11-S1m,-,Sn1-Snm and address servers S1A-SnA, and each address server stores a list for sub system names belonging to all terminal stations are addresses specific to each terminal station. When the address of an opposite terminal station desired for transmission is not clear to a terminal station, the address server is retrieved and the data is transmitted after the opposite address is obtained. Thus, the memory area of each terminal station is saved and the correction jib of the address table at increase/decrease in the terminal station attended with the system change is simplified.
Patent•
8 Dec 1986
TL;DR: In this paper, a collapsible, portable tote-table is described, which can be easily manufactured with a minimum number of parts and, when assembled in a facile manner, is strong, light and completely transportable.
Abstract: A collapsible, portable tote-table is described. This table can be easily manufactured with a minimum number of parts and, when assembled in a facile manner, is strong, light and completely transportable. The system for the assembly of the aforementioned tote-table can be done by anyone of normal skill and is dominated by a novel dog system for interconnecting the various parts.
Patent•
18 Apr 1986
TL;DR: In this paper, the accesses to terms of various fields without deteriorating the access efficiency by registering a table of translation words which stores the translation words in the fields where each language for translation is used and the field discrimination codes in correspondence to each other.
Abstract: PURPOSE:To attain the accesses to terms of various fields without deteriorating the access efficiency by registering a table of translation words which stores the translation words in the fields where each language for translation is used and the field discrimination codes in correspondence to each other. CONSTITUTION:A field table production part 7 produces a field table 8 for translation according to the field priority information. When an input text is sent to a translation processing part 1, an extracted word is used as a headline to start a dictionary retrieving part 2. Then an access is given to an integrated dictionary 3 and the corresponding translation word table 21 is read out to a translation word table buffer 10. A translation word selecting part 11 initializes the index value N at 1 to a field table 8. The table 21 is retrieved to check the presence of the N-th field code. If this N-th field code exists, the corresponding translation word is obtained and informed to the part 1. If the N-th field code is not detected, 1 is added to the value N. When this value N is smaller than the size M of the table 8, the table 21 is searched for the next field code.
Patent•
30 Aug 1986
TL;DR: In this article, the priority rank is discriminated by a rank discriminating table 10 in the printing control part, stored to priority rank lists 13 and 14 in a reception control table 12, and printed and processed in the priority sequence.
Abstract: PURPOSE:To decrease the waiting time of an emergent printing job by executing the interruption priority printing after completing to print the page which is presently printed when the printing request is controlled by the priority rank and the rank job higher than the printing job during the execution is received. CONSTITUTION:For the printing request sent from a communicating control part 4, the priority rank is discriminated by a rank discriminating table 10 in the printing control part, stored to priority rank lists 13 and 14 in a reception control table 12, and printed and processed in the priority sequence. When the printing request of the priority rank higher than the printing job which is presently executed is sent, a page monitoring part 11 in a printing control part 9 detects the page completion during the printing, the printing job, which is presently executed, is once saved to a printing data buffer 8, the information is stored to a saving information storing part 15, and thereafter, the interruption printing processing is executed.
Patent•
9 Jul 1986TL;DR: In this article, the authors present a method of creating and executing a logic driven table comprising entering mnemonics corresponding to signals in the system, creating a logic table from the entered mnemonic, verifying the accuracy of the logic table and executing the logic design of the table using actual input signals to produce actual output control signals.
Abstract: The present invention is directed to a method of creating and executing a logic driven table comprising entering mnemonics corresponding to signals in the system, creating a logic table from the entered mnemonics, verifying the accuracy of the logic table and executing the logic design ofthe table using actual input signals to produce actual output control signals. During the execution of the logic table the input signals are overlayed on the mnemonics of the table and a Boolean logic equation for a basic logic element is executed for each stage within each totem in the table. The execution of the equation is repeated until all input signals and the effects of the input signals have propagated through the table.
Patent•
18 Mar 1986TL;DR: In this paper, a terminal which is capable of receiving, converting and displaying both NAPLPS and PRESTEL coded signals and which includes means for invoking NAP-LPS control and character codes, corresponding to the same, received PESTEL codes, to an in-use table from NAPlPS code look-up tables at the terminal and for separately processing, decoding and converting PPRESTEL attribute codes to produce corresponding NAPPLPS codes.
Abstract: A terminal which is capable of receiving, converting and displaying both NAPLPS and PRESTEL coded signals and which includes means for invoking NAPLPS control and character codes, corresponding to the same, received PRESTEL codes, to an in-use table from NAPLPS code look-up tables at the terminal and for separately processing, decoding and converting PRESTEL attribute codes to produce corresponding NAPLPS codes.
Patent•
23 Jan 1986
TL;DR: In this article, the authors improve the reliability of the titled analysis system by analyzing statically a produced program group and a JCL (job control language) and extracting the application form information to deliver it to a page printer.
Abstract: PURPOSE:To improve the reliability of the titled analysis system by analyzing statically a produced program group and a JCL (job control language) and extracting the application form information to deliver it to a page printer. CONSTITUTION:A JCL information analysis part 3 reads the JCL source out of a file 1 and extracts the program name, the file code and the file name defined by the JCL to store them to an asign information file 5. The file 5 is formed as an index file mainly for program names and file codes. An item process analysis part 4 first analyzes a COBOL source program PRSO and develops the file name and the file data item name defined by a COBOL data defining part on a memory table provided in the part 4. Then a COBOL source code part is analyzed and the correlation information between the file name and the file data item name is stored on the memory table and outputted to an item process correlation file 6 when the analysis is over.
Patent•
28 Nov 1986TL;DR: A document processing system for formatting document information in accordance with a format includes a disk apparatus which independently has a document file (96), an address table file (93), and a format information file (92).
Abstract: A document processing system for formatting document information in accordance with a format includes a disk apparatus which independently has a document file (96), an address table file (93), and a format information file (92) The document file stores the document information corresponding to predetermined regions The address table file stores an address table corresponding to the document information The format information file stores the format information corresponding to the document information
Patent•
14 May 1986
TL;DR: In this paper, an air drill is mounted at the arm 1 of a multi-joint robot and an appropriate drill is fitted, and a trimming program is entered in the control device of a processing robot, and the air drill 2 is driven in accordance with the program.
Abstract: PURPOSE:To eliminate necessity for any die specifically devoted for this purpose as well as facilitate processing of boring a door trim skin material by entering the trimming program in a processing robot, and trim-processing the skin material on a receipt table. CONSTITUTION:An air drill 2 is mounted at the arm 1 of a multi-joint robot, and an appropriate drill is fitted. Then a trimming program is entered in the control device of a processing robot, and the air drill 2 is driven in accordance with the program. A work to be processed 5 is placed on a receipt table 13 provided with an escape hole 14 in a form approx. the same as the product to be yielded in such a way that the skin material 7 faces the receipt table 13, and the skin material is processed by the drill 4. This constitution ensures that cutting and boring into any desired configuration is carried out without use of any exclusive die, which should lead also to shortening of the processing time.
Patent•
10 Feb 1986
TL;DR: In this paper, the index table is used to speed up the retrieving and processing of information by providing each processor with an index table categorizing information held by the processor and controlling information according to integrated categories.
Abstract: PURPOSE: To speed up the retrieving and processing of information by providing each processor with an index table categorizing information held by said processor and controlling information according to integrated categories. CONSTITUTION: It is assumed that a person in charge of some business has to financially analyze companies that his corporation invests. He inputs a preset problem analysis code, etc., regarding financial analysis from the keyboard 302 of a terminal processor 3. A file processing part 32 retrieves an analysis program suitable for solving the problem and data necessary for the analysis through the index table 35. If he can find a usable information item in the table 35, he fetches the necessary information out of memory areas 36, 37 and 38 with the aid of the function of an information service processing part 33, and deals with the problem through the keyboard 302 according to system explanation and the guidance of the analysis program. COPYRIGHT: (C)1987,JPO&Japio
Patent•
22 Aug 1986
TL;DR: In this article, the authors proposed a scheme to relieve the load of the preparation of constitution control information and to reduce the risk of double preparation error by transmitting the down load information from a host computer to a terminal in the first format and extracting the necessary part at the terminal for conversion into the second format and storing.
Abstract: PURPOSE:To relieve the load of the preparation of constitution control information and to reduce the risk of admixture of double preparation error by transmitting the down load information from a host computer to a terminal in the first format and extracting the necessary part at the terminal for conversion into the second format and storing. CONSTITUTION:The host computer 1 transmits in a down load the information concerning the terminal system constitution for host in the down load to a terminal system. A transmission control part 10 of a control program of a control device 4 transmits the information to a buffer 11. A conversion control part 20 converts the constitution information part of its own system by conversion from the information of a buffer 11 by using a conversion table 22 to produce its own constitution control information on a buffer 21. The constitution information produced on the buffer 21 is stored by a storage control part 12 on a magnetic disk device 13.
Patent•
18 Sep 1986
TL;DR: In this paper, the authors proposed a data structure having the table of plural number of stages of hierarchy to store service information based on all or a part of retrieval characters comprising plural characters.
Abstract: PURPOSE: To save a time and a trouble for the retrieval and to facilitate the addition/revision of a data to be retrieved by using a specific data structure having the table of plural number of stages of hierarchy to store service information based on all or a part of retrieval characters comprising plural characters CONSTITUTION: The combination of four characters of alphabets is adopted as a retrieval code The alphabetical retrieval code table 10 is provided as a retrieval table for the 1st character of the retrieval code A retrieval code for service information and an address to service information in pairs are stored in the alphabetical order The table 10 has alphabetical addresses representing the leading position of one and same alphabetical group as to the alphabetical order of each retrieval code shown in the table 20 An information table 30 adopts chain connection of each data of the service information at every retrieval code in the unit of lines and is referenced by the address related to each retrieval code of the table 20 moreover, the information table 30 is managed by using a line managing table 32 at every line COPYRIGHT: (C)1988,JPO&Japio
Patent•
20 Oct 1986
TL;DR: In this paper, a TV camera is installed on the upper part of the table as the photographing device and four pieces of the light 5 as the lighting device are set up so as to enable the lighting from both side faces of the multipin electronic component.
Abstract: PURPOSE:To inspect correctly the conforming and nonconforming soldering part by setting up a lighting device and photographing device at adequate position and by providing the decision means to analyze the pattern of the picture obtd. therefrom. CONSTITUTION:The table is made movable two-dimensionally in the axis x and axis y directions. The TV camera 3 for industrial use is installed on the upper part of the table as the photographing device and four pieces of the light 5 as the lighting device are set up so as to enable the lighting from both side faces of the multipin electronic component. Each light 5 is arranged to have a certain angle in the space with the substrate 1 so as to enable the lighting of the soldering part adequately. The camera 3 is connected with the control part 7 which makes a decision means and the light 5 is connected to the control part 7 via light switch 8. The control part 7 is composed by the microcomputer as well as the memory 7a storing the reference pictures, etc. of the soldering part and provides the terminal equipment with TV 9 for informing of the nonconforming soldering of the inspecting body.
Patent•
16 Jul 1986
TL;DR: In this article, a tool path data is generated by converting a shape model data of a curved surface part to plural triangular tangential plane data and checking an interference of a tool holder against each tangential point.
Abstract: PURPOSE:To exactly and automatically execute working of complicated curved surface part by converting a working surface data to plural triangular tangential plane data, checking an interference of a tool holder against each tangential plane data, and generating a tool path data. CONSTITUTION:A shape model data of a working surface, which has been inputted from an operating board 26 or a tablet 28 and has been stored in an external storage device 10 is converted to plural triangular tangential plane data by a computer 20, and a tangential plane correspondence table against an area map is generated. The computer 20 derives a prescribed tangential plane data from the area map in which an occupied area of a tool holder is included and the correspondence table, checks an interference of the tool holder and the tangential plane data, generates a tool path data which has been corrected so that the tool holder avoids the tangential plane having an interference part and stores it in the device 10. By this path data, a tool path is controlled, and working of a complicated curved surface part is executed exactly and automatically without preventing an interference of the tool holder and the working surface by worker's monitoring.
Patent•
20 Aug 1986
TL;DR: In this paper, a file information management device uses a table so as to manage files registered on a magnetic disk device and searches a file table by using the inputted file name to prevent a file from being destroyed when a data output form is designated in error by discriminating whether or not a data exists on the data file, and outputting the data to the file depending on the result.
Abstract: PURPOSE:To prevent a file from being destroyed when a data output form is designated in error by discriminating whether or not a data exists on the data file, and outputting the data to the file depending on the result. CONSTITUTION:A file information management device 14 uses a table so as to manage files registered on a magnetic disk device 15 and searches a file information table 21 by using the inputted file name. A file discriminating device 16 gives a file name to a file management device 11 as information and when it is discriminated that no data is registered, the device 16 gives a command to a data input/output device 13 so as to output the data in a new data form and when the data is already registered, the device 16 gives a request to a parameter receiving device 17 so as to allow the device 17 to receive either new data form or an additional data form as a parameter. The parameter receiving device 17 displays the parameter on a parameter display device 18, receives the parameter and gives the result to a file presence discriminating device 16.
Patent•
14 Jul 1986
TL;DR: In this article, the authors proposed to reduce the memory required for storing the connecting relation of a provisional label by storing densely the connected relation in the memory. But they did not consider the problem of storing a large number of labels connected to one label.
Abstract: PURPOSE: To reduce the memory amount required for storing the connecting relation of a provisional label, by storing densely the connecting relation in the memory. CONSTITUTION: Length of a label connection table 32 is longer than the largest number of provisional labels, and when the number of labels connected to one provisional label is large and cannot be contained in width of the label connection table 32, it is shifted to another address by an address conversion table 33, and a connecting label is stored therein. In such a way, the width of the label connection table 32 is a suitably narrow size, and when many labels connected to one label exist and cannot be contained in its width, they are stored in another address, the coordination of an address is stored in the address conversion table 33, by which a memory required for storing a label connecting relation is remarkably reduced. COPYRIGHT: (C)1988,JPO&Japio