会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • EXECUTION OF SEMANTIC QUERIES USING RULE EXPANSION
    • 使用规则扩展的语义查询的执行
    • US20100250576A1
    • 2010-09-30
    • US12416103
    • 2009-03-31
    • Stuart M. BowersChris Demetrios KarkaniasDavid B. Wecker
    • Stuart M. BowersChris Demetrios KarkaniasDavid B. Wecker
    • G06F17/30G06F7/00
    • G06F17/30427G06F17/30407
    • A semantic query may refer to a logical rule, where the rule is defined in terms of constituent expressions. In order to execute the semantic query efficiently, occurrences of the rule may be expanded by replacing the rule with its constituent expressions. Expansion may be performed repeatedly, until only grounded expressions remain. Expressions are grounded when they refer to tables or views that are represented in an underlying database. Once the rule has been reduced to grounded expressions, the semantic query processor may formulate a relational query in terms of the grounded expressions. If the relational query takes into account the various grounded expressions to which the rule reduces, then the portion of the semantic query that refers to the rule may be processed without an excessive number of round trips to the relational database.
    • 语义查询可以指逻辑规则,其中规则是根据组成表达式定义的。 为了有效执行语义查询,可以通过用其组成表达式替换规则来扩展规则的出现。 可以重复执行扩展,直到只剩下接地的表达。 当表达式引用在基础数据库中表示的表或视图时,表达式是基础的。 一旦将规则减少到接地表达式,语义查询处理器可以根据接地表达式制定关系查询。 如果关系查询考虑了规则减少的各种接地表达式,则可以处理引用规则的语义查询的部分,而不会对关系数据库进行过多的往返次数。
    • 2. 发明授权
    • Execution of semantic queries using rule expansion
    • 使用规则扩展执行语义查询
    • US08032525B2
    • 2011-10-04
    • US12416103
    • 2009-03-31
    • Stuart M. BowersChris Demetrios KarkaniasDavid B. Wecker
    • Stuart M. BowersChris Demetrios KarkaniasDavid B. Wecker
    • G06F17/30
    • G06F17/30427G06F17/30407
    • A semantic query may refer to a logical rule, where the rule is defined in terms of constituent expressions. In order to execute the semantic query efficiently, occurrences of the rule may be expanded by replacing the rule with its constituent expressions. Expansion may be performed repeatedly, until only grounded expressions remain. Expressions are grounded when they refer to tables or views that are represented in an underlying database. Once the rule has been reduced to grounded expressions, the semantic query processor may formulate a relational query in terms of the grounded expressions. If the relational query takes into account the various grounded expressions to which the rule reduces, then the portion of the semantic query that refers to the rule may be processed without an excessive number of round trips to the relational database.
    • 语义查询可以指逻辑规则,其中规则是根据组成表达式定义的。 为了有效执行语义查询,可以通过用其组成表达式替换规则来扩展规则的出现。 可以重复执行扩展,直到只剩下接地的表达。 当表达式引用在基础数据库中表示的表或视图时,表达式是基础的。 一旦将规则减少到接地表达式,语义查询处理器可以根据接地表达式制定关系查询。 如果关系查询考虑了规则减少的各种接地表达式,则可以处理引用规则的语义查询的部分,而不会对关系数据库进行过多的往返次数。
    • 10. 发明申请
    • GRAPH QUERIES OF INFORMATION IN RELATIONAL DATABASE
    • 关系数据库中信息的图形查询
    • US20100241644A1
    • 2010-09-23
    • US12407767
    • 2009-03-19
    • Thomas E. JacksonChris Demetrios KarkaniasDavid G. CampbellStuart M. Bowers
    • Thomas E. JacksonChris Demetrios KarkaniasDavid G. CampbellStuart M. Bowers
    • G06F17/30G06F7/00
    • G06F16/288G06F16/2423G06F16/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.
    • 在一个示例中,信息可以存储在关系数据库中。 数据库中的信息可以定义图形,在这种意义上,信息可以定义一组实体和实体之间的关系。 用户可能希望使用基于图形的查询语言查询信息。 图形查询引擎可以接收查询,并且可以将查询转换成关系查询语言,以便由关系数据库执行。 关系数据库可以计算底层表的视图。 每个视图对应于特定关系,并且每个视图中的行是该关系应用于的实体对。 由于视图非常接近于图形的规范,所以基于图的查询可以被转换成关系查询,其对视图执行关系代数操作,以便回答基于图的查询。