摘要:
The present invention relates to apparatus for displaying information contained in a data base comprising storage means for storing the data base information, display apparatus for displaying icons relating to the data base, and a control system for controlling the display of icons on the display apparatus. According to the invention the apparatus is characterised in that the control system comprises means for constructing an icon (200) representing a selected item of data stored in the storage means and representing certain attributes (210 - 224) of the selected data, and means for displaying the constructed icon. According to another aspect of the invention the apparatus is characterised in that the control system comprises means for modifying a selected item of data by accessing the item of data through the constructed icon representing the item of data.
摘要:
An information management system having a hypermedia file that works with the X Window System and Xt Intrinsics is disclosed. The disclosd arrangement generates and uses a hypermedia information management system, which includes a windowing system and, responsive to a set of intrinsics, generates a set of widgets. A hypermedia file, which includes a hierarchical ordering of objects, such as hypermedia lines and hypermedia segments among the hypermedia lines, is generated. A specially encoded function with parameters for defining items sends a file to be included in a window, the location and size of the window in a display of the file, and a label for identifying the generated segment is used for controlling the display of information, whether pictorial, graphic, text, et cetera, or the execution of another program from the hypermedia file. A specially encoded function is also used for notifying a user of information from the hyperfile, the information being correlated to the particular detected one of the specially encoded functions.
摘要:
A prefix index tree structure for locating data records stored through keys related to information stored in data records. Each node includes a prefix field for a prefix string of length p of the longest string of key characters shared by all subtrees of the node and a data record field for a reference to a data record whose key is completed by the prefix string. A node may include one or more branch fields when the prefix string is a prefix of keys stored in at least one subtree of the node, with a branch field for each distinct p+1 st key character in the keys, wherein each p+1 st key character is a branch character. Each branch field includes a branch character and a branch pointer field for a reference to a node containing at least one key whose p+1 st character is the branch character. Each node further includes a field for storing the number of key characters in the prefix string and a field for storing the number of branch fields in the node. Also disclosed are methods for constructing and searching a prefix index tree of the present invention, and for inserting nodes into the tree and deleting nodes from the tree.
摘要:
A user describes a tree or a set of trees in a table, and a system generates a data structure corresponding to the tree or the set of trees on memory in accordance with the description. The table has one or more columns in which for each node, attributes given to the node are entered. The system interprets the table; allocates a memory area to each of the nodes, sets data on the attributes given to the node; and generates pointer data indicating the connections of the memory areas. The hierarchy of the nodes and the sequence of nodes linked immediately below the same node are determined on the basis of the sequence of rows corresponding to the nodes and levels assigned to the nodes in the table.
摘要:
A data base management system encodes information (such as the field values of a database record, or the words of a text document) so that the original information may be efficiently searched by a computer. An information object is encoded into a small "signature" or codeword. A base or "leaf" signature is computed by a known technique such as hashing. The logical intersection (AND) of each possible combination of pairs of bits of the base signature is computed, and the result is stored as one bit of a longer combinatorial signature. The bitwise logical union (bit-OR) of the combinatorial signatures of a group of records produces a second-level combinatorial signature representing particular field values present among those records. Higher-level combinatorial signatures are computed similarly. These combinatorial signatures avoid a "saturation" problem which occurs when signatures are grouped together, and a "combinatorial error" problem which falsely indicates the existence of non-existent records, thereby significantly improving the ability to reject data not relevant to a given query. When the combinatorial signatures are stored in a hierarchical data structure, such as a B- tree index of a database management system, they provide means for more efficiently searching database records or document text by eliminating large amounts of non-matching data from further consideration.
摘要:
A method for allowing weak-searchers of a B+-tree avoid locks that serialize access to the B+-tree structure. The update technique used to achieve this ensures that the B+-tree is always in a correct state on secondary storage so that repair is not necessary after a system failure. The assumption is made that the readers will complete their reading within a specified period but sometimes will need to be restarted because they have not completed their reading within a predetermined time period.
摘要:
A method and apparatus for displaying structured information such as information that is stored in plural interrelated tables (110, 120, 130, 140, 150, 160, 170, 180). A structural map (13) that describes that pathing between the interrelated tables (110, 120, 130, 140, 150, 160, 170, 180, 190) is defined. The structural map (13) may be a computer representation of a multiple index multipartite graph which defines that structure of the structured information (12). A display map (14) is defined for describing how to display the information. The display map (14) describes where the information from the tables is to be displayed, and where, rather than displaying information from the tables, information concerning the structural interrelationship of the tables (110, 120, 130, 140, 150, 160, 170, 180, 190) is to be displayed. In response to a query based interaction with an operator (20), either information from the plural tables is displayed or an indication of further structure is displayed. When information is displayed it is filtered by the previous level of structure indexed by the information targeted by the operator (20) such that only information of concern to the operator's query is displayed. The display may be in the form of pop-down windows (17) and those windows may contain mixed data and structural information (16a, 16b), or the display may be in the form of graphs having nodes and paths (13, 14). Displayed information may be modified and the modifications are traced through the structured information (12) so as to allow dynamic display of modified data (15).
摘要:
An entity-relation database is disclosed to include a plurality of entity fields containing arrays of data elements, the data elements being related to each other in predefined sets, with each predefined set including data elements in at least two of the entity fields. At least one linked list defines the relationship between data elements between each of the predefined sets and provides a means for retrieving all of the elements of any selected predefined set from the two entity fields. The linked list consists of two distinct portions, namely, a head portion associated with each member of one entity field and a continuation portion associated with each member of another entity field, while each entry consists of a pair of addresses thereby forming a doubly linked list.
摘要:
L'invention est relative à un procédé qui permet de calculer automatiquement, et de façon exacte, les probabilités associées à une fonction booléenne. Selon l'invention, la probabilité d'un événement représenté par une fonction booléenne (f) est déterminée en constituant le diagramme de décision binaire de cette fonction et en effectuant des parcours récursifs au travers de ce diagramme.
摘要:
An entity-relation database is disclosed to include a plurality of entity fields containing arrays of data elements, the data elements being related to each other in predefined sets, with each predefined set including data elements in at least two of the entity fields. At least one linked list defines the relationship between data elements between each of the predefined sets and provides a means for retrieving all of the elements of any selected predefined set from the two entity fields. The linked list consists of two distinct portions, namely, a head portion associated with each member of one entity field and a continuation portion associated with each member of another entity field, while each entry consists of a pair of addresses thereby forming a doubly linked list.