利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

17 条记录 (耗时 0.032 秒)

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

    公开(公告)号：US20110320431A1

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

    申请号：US12823132

    申请日：2010-06-25

    申请人： Thomas E. Jackson ,  Stuart M. Bowers ,  Brian S. Aust ,  Chris D. Karkanias ,  Allen L. Brown, JR. ,  David G. Campbell

    发明人： Thomas E. Jackson ,  Stuart M. Bowers ,  Brian S. Aust ,  Chris D. Karkanias ,  Allen L. Brown, JR. ,  David G. Campbell

    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

    申请人： Brian S. Aust ,  Allen L. Brown, JR. ,  Chris D. Karkanias ,  David G. Campbell

    发明人： Brian S. Aust ,  Allen L. Brown, JR. ,  Chris D. Karkanias ,  David G. Campbell

    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.

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

    GRAPH QUERIES OF INFORMATION IN RELATIONAL DATABASE
    9.
    发明申请
    GRAPH QUERIES OF INFORMATION IN RELATIONAL DATABASE 审中-公开
    关系数据库中信息的图形查询

    公开(公告)号：US20100241644A1

    公开(公告)日：2010-09-23

    申请号：US12407767

    申请日：2009-03-19

    申请人： Thomas E. Jackson ,  Chris Demetrios Karkanias ,  David G. Campbell ,  Stuart M. Bowers

    发明人： Thomas E. Jackson ,  Chris Demetrios Karkanias ,  David G. Campbell ,  Stuart M. Bowers

    IPC分类号： G06F17/30 ,  G06F7/00

    CPC分类号： G06F16/288 ,  G06F16/2423 ,  G06F16/2452

    摘要： In one example, information may be stored in a relational database. The information in the database may define a graph, in the sense that the information may define a set of entities and relations between the entities. A user may want to query the information using a graph-based query language. A graph query engine may receive the query, and may convert the query into a relational query language, for execution by the relational database. The relational database may calculate views of the underlying tables. Each view corresponds to a particular relation, and the rows in each view are pairs of entities to which the relation applies. Since the views correspond very closely to the specification of a graph, the graph-based query may be translated into a relational query that performs relational algebraic operations on the views in order to answer the graph-based query.

    摘要翻译： 在一个示例中，信息可以存储在关系数据库中。 数据库中的信息可以定义图形，在这种意义上，信息可以定义一组实体和实体之间的关系。 用户可能希望使用基于图形的查询语言查询信息。 图形查询引擎可以接收查询，并且可以将查询转换成关系查询语言，以便由关系数据库执行。 关系数据库可以计算底层表的视图。 每个视图对应于特定关系，并且每个视图中的行是该关系应用于的实体对。 由于视图非常接近于图形的规范，所以基于图的查询可以被转换成关系查询，其对视图执行关系代数操作，以便回答基于图的查询。