STRONG TYPING FOR QUERYING INFORMATION GRAPHS
    3.
    发明申请
    STRONG TYPING FOR QUERYING INFORMATION GRAPHS 审中-公开
    查询信息格式的强力类型

    公开(公告)号:US20110320431A1

    公开(公告)日:2011-12-29

    申请号:US12823132

    申请日:2010-06-25

    IPC分类号: G06F17/30

    CPC分类号: G06F16/24534 G06F16/242

    摘要: Described herein is using type information with a graph of nodes and predicates, in which the type information may be used to determine validity of (type check) a query to be executed against the graph. In one aspect, each node has a type, and each predicate indicates a valid relationship between two types of nodes. A type checking mechanism uses the type information to determine whether a query is valid, which may be the entire query prior to query processing/compilation time, or as the query is being composed by a user. One or more valid predicates for a given node may be discovered based upon the node type, such as discovered to assist the user during query composition. Also described is using the type information to optimize the query.

    摘要翻译: 这里描述的是使用具有节点和谓词的图形的类型信息,其中可以使用类型信息来确定对图表执行的查询(类型检查)的有效性。 在一个方面,每个节点具有类型,并且每个谓词指示两种类型的节点之间的有效关系。 类型检查机制使用类型信息来确定查询是否有效,其可以是查询处理/编译时间之前的整个查询,或者由查询由用户组成。 可以基于节点类型来发现给定节点的一个或多个有效谓词,例如在查询组合期间被发现以辅助用户。 还描述了使用类型信息优化查询。

    Dynamically Encoding Types and Inhabitants in a Relational Database
    4.
    发明申请
    Dynamically Encoding Types and Inhabitants in a Relational Database 审中-公开
    关系数据库中的动态编码类型和居民

    公开(公告)号:US20100287220A1

    公开(公告)日:2010-11-11

    申请号:US12435407

    申请日:2009-05-05

    IPC分类号: G06F17/30

    CPC分类号: G06F16/284

    摘要: Described is a technology, such as for representing scientific data and information, in which a database table contains rows of type data representing types, and term data representing terms that inhabit the types. Types include composite types (e.g., that represent entities), and instances of relation types that express relationships between types, between a type and a term, or between terms. Types and/or terms may have multiple relationships with one another, and a relationship may span database tables. A new relationship may be established by adding a new row to the database table to represent a new relation term, along with one or more similar rows to represent the relation role terms associated with that relation term; relationships may be removed by removing rows. As a result, the database table may change its state rapidly, without needing to change the database schema.

    摘要翻译: 描述了一种技术,例如用于表示科学数据和信息,其中数据库表包含表示类型的类型数据的行,以及表示居住在类型中的术语的术语数据。 类型包括复合类型(例如,表示实体)和表示类型之间,类型和术语之间或术语之间的关系的关系类型的实例。 类型和/或术语可以具有彼此的多个关系,并且关系可以跨越数据库表。 可以通过向数据库表中添加新行来表示新的关系项,以及一个或多个类似的行来表示与该关系项关联的关系角色术语来建立新的关系; 可以通过删除行来删除关系。 因此,数据库表可能会快速更改其状态,而无需更改数据库模式。