Apparatus for graphically displaying information contained in a data base
    21.
    发明公开
    Apparatus for graphically displaying information contained in a data base 失效
    Gerätzur graphischen Anzuzeigen von Informationen einer Datenbank。

    公开(公告)号:EP0546801A2

    公开(公告)日:1993-06-16

    申请号:EP92311179.3

    申请日:1992-12-08

    IPC分类号: G06F15/403 G06F15/419

    CPC分类号: G06F17/30554

    摘要: 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.

    摘要翻译: 本发明涉及用于显示包含在数据库中的信息的装置,包括用于存储数据库信息的存储装置,用于显示与数据库相关的图标的显示装置,以及用于控制显示装置上的图标显示的控制系统。 根据本发明,该装置的特征在于控制系统包括用于构建表示存储在存储装置中的所选择的数据项并表示所选数据的某些属性(210-224)的图标(200)的装置,以及用于 显示构建的图标。 根据本发明的另一方面,该装置的特征在于,控制系统包括用于通过通过构成的表示数据项目的图标访问数据项来修改所选择的数据项的装置。

    Hypermedia arrangement using a window system and layered intrinsics
    22.
    发明公开
    Hypermedia arrangement using a window system and layered intrinsics 失效
    使用窗口系统和分层内置的超音速布置

    公开(公告)号:EP0467591A3

    公开(公告)日:1993-06-16

    申请号:EP91306290.7

    申请日:1991-07-11

    申请人: AT&T Corp.

    IPC分类号: G06F15/40 G06F15/419 G06F9/44

    CPC分类号: G06F17/30014

    摘要: 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.

    Prefix search tree with partial key branching
    23.
    发明公开
    Prefix search tree with partial key branching 失效
    前缀搜索树与部分关键分支

    公开(公告)号:EP0419889A3

    公开(公告)日:1993-04-21

    申请号:EP90116841.9

    申请日:1990-09-03

    发明人: Nickel, Steven P.

    IPC分类号: G06F15/413 G06F15/419

    摘要: 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.

    System for and method of generating a data structure
    24.
    发明公开
    System for and method of generating a data structure 失效
    Gerätfürund Verfahren zum Herstellen von Datenstrukturen。

    公开(公告)号:EP0501753A2

    公开(公告)日:1992-09-02

    申请号:EP92301578.8

    申请日:1992-02-25

    IPC分类号: G06F15/419 G06F15/403

    CPC分类号: G06F17/30625

    摘要: 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.

    摘要翻译: 用户描述表中的树或一组树,并且系统根据描述在存储器上生成对应于树或树组的数据结构。 该表具有一个或多个列,其中为每个节点输入给予该节点的属性。 系统解释表; 为每个节点分配一个内存区域,设置给予该节点的属性的数据; 并产生指示存储区域的连接的指针数据。 基于与分配给表中的节点的节点和级别相对应的行的序列来确定节点的层次结构和紧邻同一节点之下链接的节点的序列。

    Coded signature indexed databases
    25.
    发明公开
    Coded signature indexed databases 失效
    米德·科迪亚

    公开(公告)号:EP0380240A2

    公开(公告)日:1990-08-01

    申请号:EP90300544.5

    申请日:1990-01-18

    摘要: 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.

    摘要翻译: 数据库管理系统对信息(例如数据库记录的字段值或文本文档的字)进行编码,以便可以由计算机有效地搜索原始信息。 信息对象被编码成小的“签名”或代码字。 基础或“叶”签名通过诸如散列的已知技术来计算。 计算基本签名的比特对的每个可能组合的逻辑交集(AND),并将结果存储为较长组合签名的一位。 一组记录的组合签名的逐位逻辑联合(位或)产生表示存在于这些记录中的特定字段值的二级组合签名。 类似地计算高级组合签名。 这些组合签名避免了当签名分组在一起时发生的“饱和”问题,以及错误地指示不存在的记录的存在的“组合错误”问题,从而显着提高拒绝与给定查询无关的数据的能力。 当组合签名存储在诸如数据库管理系统的B-树索引的分层数据结构中时,它们提供了通过从进一步考虑中消除大量不匹配数据来更有效地搜索数据库记录或文档文本的手段。

    Method for obtaining access to data structures without locking
    26.
    发明公开
    Method for obtaining access to data structures without locking 失效
    Verfahren zur Gewinnung von Verriegelungsfreiem Zugriff zu Datenstrukturen。

    公开(公告)号:EP0362709A2

    公开(公告)日:1990-04-11

    申请号:EP89118049.9

    申请日:1989-09-29

    IPC分类号: G06F15/403 G06F15/419

    CPC分类号: G06F17/30091

    摘要: 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.

    摘要翻译: 允许B +树的弱搜索者的方法避免了对B +树结构进行序列化访问的锁。 用于实现这一点的更新技术确保了B +树在二级存储上总是处于正确的状态,因此在系统发生故障后不需要修复。 假设读者将在指定时间内完成阅读,但有时需要重新启动,因为他们在预定的时间内没有完成阅读。

    METHOD AND APPARATUS FOR DISPLAYING AND UPDATING STRUCTURED INFORMATION.
    27.
    发明公开
    METHOD AND APPARATUS FOR DISPLAYING AND UPDATING STRUCTURED INFORMATION. 失效
    方法和设备显示和更新结构化信息。

    公开(公告)号:EP0679277A4

    公开(公告)日:1995-07-05

    申请号:EP93918553

    申请日:1993-07-26

    CPC分类号: G06F17/30595 G06F17/30958

    摘要: 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).

    Entity-relation database
    28.
    发明公开
    Entity-relation database 失效
    实体关系数据库

    公开(公告)号:EP0583108A3

    公开(公告)日:1994-06-08

    申请号:EP93305969.3

    申请日:1993-07-28

    CPC分类号: G06F17/30604

    摘要: 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.

    Procédé de détermination automatique des probabilités associées à une fonction booléenne
    29.
    发明公开
    Procédé de détermination automatique des probabilités associées à une fonction booléenne 失效
    一种用于自动确定布尔Fuktion相关联的概率的方法。

    公开(公告)号:EP0595719A1

    公开(公告)日:1994-05-04

    申请号:EP93402638.6

    申请日:1993-10-27

    申请人: BULL S.A.

    CPC分类号: G06F17/18 G06F17/504

    摘要: 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.

    摘要翻译: 本发明涉及一种允许与布尔函数相关联的概率的自动和精确计算的过程。 。根据本发明,通过一个布尔函数(f)所示的事件的概率是确定性通过构造该函数的二元决策图和通过这个图表使得递归行程开采。

    Entity-relation database
    30.
    发明公开
    Entity-relation database 失效
    Sachrelationsdatenbank。

    公开(公告)号:EP0583108A2

    公开(公告)日:1994-02-16

    申请号:EP93305969.3

    申请日:1993-07-28

    CPC分类号: G06F17/30604

    摘要: 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.

    摘要翻译: 公开了实体关系数据库以包括包含数据元素数组的多个实体字段,数据元素在预定义集合中彼此相关,每个预定义集合包括至少两个实体字段中的数据元素。 至少一个链表定义了每个预定义集合之间的数据元素之间的关系,并且提供了用于从两个实体字段中检索任何所选择的预定义集合的所有元素的装置。 链表包括两个不同部分,即与一个实体字段的每个成员相关联的头部分和与另一个实体字段的每个成员相关联的继续部分,而每个条目由一对地址组成,从而形成双向链表 。