A control panel or console for an electronic device which contains a digital process control computer into which there should be fed a predetermined number of data records. At the control panel there are arranged digital display elements, the number of which is equal to the number of data records. An unambiguous correlation exists between these display elements and the data records. Additionally, a further digital display element and a device for the data input are arranged at the control panel ...

An associative file design method and apparatus are used for automatically generating an integrated data base design structure, with minimal data redundancy, for use in multi-application general purpose digital computing systems. The integrated data base design structure is automatically produced by a programmed digital computer in the form of a report or graph structure which permits the data base designer to design a data base system with minimal data redundancy. The data needed by each applic...

A computer including a control unit, an arithmetic-logic unit, an input unit, an output unit, a memory unit, and circuitry interconnecting the units for transmitting, processing and storing sequences of characters, the memory unit is constituted by a plurality of stack registers each having a large storage capacity for storing expressions in the form of strings of characters, and the control unit constitutes a reduction processor operatively associated with the stack registers for determining th...

A computer method is disclosed for analyzing text by employing a model known as a paradigm, that provides all the inflectional forms of a word. A file structure is created consisting of two components, a list of words (a dictionary), each word of which is associated with a set of paradigm references, and the file of paradigms consisting of grammatical categories paired with their corresponding ending or affix portions (known as the desinence) specifying tense, mood, number, gender or other lingu...

A common data structure for access by several application programs is created from a single primitive data element or attribute data object. The attribute data objects can be extracted from node data and node data descriptors in the application program's databases. The attribute data objects are arranged in an attribute file in accordance with certain rules which impose a hierarchical organization upon the attribute data objects. Nonhierarchical relationships may also be used to represent the no...

A relational database is created and queried through the use of an outliner-style text editor which permits automatic generation of data entry forms for the creation of records. Data entry and editing are simplified and errors are minimized because changes in the outline are automatically reflected in the data entry forms and thus the automatically updated records. Data retrieval is driven through the manipulation of the outline to allow simple and complex queries without utilizing a database pr...

In the maintenance of a stored relational database, signals representing record occurrences related to a record occurrence of a starting relation are retrieved. Stored relationship attribute signals, including specification of a common relationship field, are used to generate a generic cursor defined against the destination relation record occurence is selected, values of the specified relation; the generic cursor is stored, and when a starting field are copied from it to the generic cursor to f...

A database index file is maintained by a computer system having primary random access memory and secondary memory. A record for each item added to the database is stored in a sequential file in secondary memory (disk storage) and an indexed pointer to the new record is stored in a small B-tree stored in primary random access memory. The full index file for the database is a second, large B-tree stored in secondary memory. Leaf-nodes of the full index file are stored in indexed order. Periodicall...

A method for relational database scheme design with the aid of a digital puter for a database having attributes A.sub.i, i=1 to n and relational schemes R.sub.j, j=1 to m. Each relational scheme R.sub.j is a non-empty subset of the attributes A.sub.i. The method detects any scheme that is non-acyclic in a simple manner that is easily adapted to a digital computer environment. The resulting relational database scheme design is thereby prevented from being non-acyclic.

The subject invention is directed to a database system for organizing large amounts of data to be accessed by a digital computer. More particularly, a free form type database, in the form of a summarized, multikey tree, is built from files stored on the computer. After a building operation, the user obtains specified information by using the summarized database. Information in the files is divided into three categories; that is, a dimension field which comprises data to be organized, a summary f...