利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

53 条记录 (耗时 0.036 秒)

    Method and system for presenting RDF data as a set of relational views
    33.
    发明授权
    Method and system for presenting RDF data as a set of relational views 有权
    将RDF数据呈现为一组关系视图的方法和系统

    公开(公告)号：US09098566B2

    公开(公告)日：2015-08-04

    申请号：US13114965

    申请日：2011-05-24

    申请人： Jagannathan Srinivasan ,  Yongmei Xie ,  Jayanta Banerjee

    发明人： Jagannathan Srinivasan ,  Yongmei Xie ,  Jayanta Banerjee

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30604 ,  G06F17/30292

    摘要： Disclosed is an approach for presenting RDF data as a set of relational views. By presenting the RDF data as relational views, this permits integrated access to the RDF-based data from existing relational database tools, such as by asserting SQL queries against the relational views. One or more classes are identified within the RDF data, wherein a relational view of the set of the relational views maps properties relating to a particular class.

    摘要翻译： 公开了一种将RDF数据呈现为一组关系视图的方法。 通过将RDF数据呈现为关系视图，这允许从现有关系数据库工具集成访问基于RDF的数据，例如通过针对关系视图断言SQL查询。 在RDF数据内识别一个或多个类，其中关系视图集合的关系视图映射与特定类相关的属性。

    NORMALIZED RANKING OF SEMANTIC QUERY SEARCH RESULTS
    34.
    发明申请
    NORMALIZED RANKING OF SEMANTIC QUERY SEARCH RESULTS 有权
    正则化排名的搜索结果搜索结果

    公开(公告)号：US20140059043A1

    公开(公告)日：2014-02-27

    申请号：US13595125

    申请日：2012-08-27

    申请人： Seema SUNDARA ,  Matthew S. Perry ,  Souripriya Das ,  Jagannathan Srinivasan

    发明人： Seema SUNDARA ,  Matthew S. Perry ,  Souripriya Das ,  Jagannathan Srinivasan

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30 ,  G06F17/30731 ,  G06F17/30958

    摘要： A method, system, and computer program product for normalized ranking of semantic query search results. The method commences by forming a SPARQL query, the SPARQL query specifying a collection of named RDF graphs, then executing the SPARQL query to retrieve matched documents selected from the collection of named RDF graphs. Having retrieved the matches, the method calculates an absolute normalized score for the matched document. The calculation of an absolute normalized score for a second matched document allows for relevance ranking. To enhance the relationship of the computer-calculated score to the relevance (and not solely to occurrence counts) embodiments consider the number of distinct variables selected in the SPARQL query, and also consider the total number of bindings to the aforementioned variables. For comparing from among possibly different sized documents, a further normalization component is implemented by considering the total number of triples found in the document's underlying subgraph.

    摘要翻译： 一种用于语义查询搜索结果的归一化排序的方法，系统和计算机程序产品。 该方法通过形成SPARQL查询，SPARQL查询指定一个命名RDF图的集合，然后执行SPARQL查询来检索从命名RDF图的集合中选择的匹配文档。 检索到匹配后，该方法计算匹配文档的绝对归一化分数。 对于第二匹配文档的绝对归一化分数的计算允许相关性排名。 为了增强计算机计算的分数与相关性（而不仅仅是出现次数）的关系，实施例考虑在SPARQL查询中选择的不同变量的数量，并且还考虑与上述变量的绑定的总数。 为了从可能不同大小的文档中进行比较，通过考虑文档底层子图中发现的三元组的总数来实现进一步的标准化组件。

    Representing and manipulating RDF data in a relational database management system
    35.
    发明授权
    Representing and manipulating RDF data in a relational database management system 有权
    在关系数据库管理系统中表示和操纵RDF数据

    公开(公告)号：US08078646B2

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

    申请号：US12188927

    申请日：2008-08-08

    申请人： Souripriya Das ,  Eugene Inseok Chong ,  Zhe Wu ,  Melliyal Annamalai ,  Jagannathan Srinivasan

    发明人： Souripriya Das ,  Eugene Inseok Chong ,  Zhe Wu ,  Melliyal Annamalai ,  Jagannathan Srinivasan

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30917 ,  G06F17/3033

    摘要： Techniques for generating hash values for instances of distinct data values. In the techniques, each distinct data value is mapped to hash value generation information which describes how to generate a unique hash value for instances of the distinct data value. The hash value generation information for a distinct data value is then used to generate the hash value for an instance of the distinct data value. The hash value generation information may indicate whether a collision has occurred in generating the hash values for instances of the distinct data values and if so, how the collision is to be resolved. The techniques are employed to normalize RDF triples by generating the UIDS employed in the normalization from the triples' lexical values.

    摘要翻译： 用于为不同数据值的实例生成哈希值的技术。 在这些技术中，每个不同的数据值被映射到哈希值生成信息，该信息描述如何为不同数据值的实例生成唯一的哈希值。 然后，用于不同数据值的散列值生成信息用于生成不同数据值的实例的散列值。 哈希值生成信息可以指示是否在针对不同数据值的实例生成哈希值时发生冲突，并且如果是，则如何解决冲突。 这些技术用于通过从三元组词汇值生成在归一化中使用的UIDS来标准化RDF三元组。

    Queries with hard time constraints
    36.
    发明授权
    Queries with hard time constraints 有权
    具有困难时间限制的查询

    公开(公告)号：US08015180B2

    公开(公告)日：2011-09-06

    申请号：US11804508

    申请日：2007-05-18

    申请人： Ying Hu ,  Seema Sundara ,  Jagannathan Srinivasan

    发明人： Ying Hu ,  Seema Sundara ,  Jagannathan Srinivasan

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30522 ,  G06F17/30533

    摘要： Systems, methodologies, media, and other embodiments associated with supporting queries with hard time constraints are described. One exemplary system embodiment includes logic for accepting a query having a hard time constraint. The example system may also include logic for selectively rewriting the query having the hard time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the hard time constraint. The example system may also include logic for establishing a timer(s) associated with the rewritten query.

    摘要翻译： 描述了与支持具有硬时间约束的查询相关联的系统，方法，媒体和其他实施例。 一个示例性系统实施例包括用于接受具有硬时间约束的查询的逻辑。 示例系统还可以包括用于选择性地将具有硬时间约束的查询重写到具有行限制或样本百分比限制的查询中的逻辑。 在一个示例中，通过将估计的查询执行时间与硬时间约束重复比较来计算行限制或抽样百分比限制。 示例系统还可以包括用于建立与重写查询相关联的定时器的逻辑。

    Database-based inference engine for RDFS/OWL constructs
    38.
    发明申请
    Database-based inference engine for RDFS/OWL constructs 有权
    用于RDFS / OWL构造的基于数据库的推理引擎

    公开(公告)号：US20100036788A1

    公开(公告)日：2010-02-11

    申请号：US12188267

    申请日：2008-08-08

    申请人： Zhe Wu ,  George Eadon ,  Souripriya Das ,  Eugene Inseok Chong ,  Vladimir Kolovski ,  Melliyal Annamalai ,  Jagannathan Srinivasan

    发明人： Zhe Wu ,  George Eadon ,  Souripriya Das ,  Eugene Inseok Chong ,  Vladimir Kolovski ,  Melliyal Annamalai ,  Jagannathan Srinivasan

    IPC分类号： G06N5/04

    CPC分类号： G06F17/30286

    摘要： An un-indexed, partitioned temporary table and an exchange table are used in the inferencing of semantic data in a relational database system. The exchange table has the same structure as a semantic data table storing the semantic data. In the inferencing process, a new partition is created in the semantic data table. Inference rules are executed on the semantic data table, and any newly inferred semantic data generated is added to the temporary table. Once no new data is generated, the inferred semantic data is copied from the temporary table into the exchange table. Indexes that are the same as indexes for the semantic data table are built for the exchange table. The indexed data in the exchange table is then exchanged into the new partition in the semantic data table. By use of the un-indexed, partitioned temporary table, incremental maintenance of indexes is avoided, thus allowing for greater efficiency.

    摘要翻译： 在关系数据库系统中使用未索引的分区临时表和交换表来推断语义数据。 交换表具有与存储语义数据的语义数据表相同的结构。 在推理过程中，在语义数据表中创建一个新的分区。 在语义数据表上执行推理规则，并将生成的任何新推断的语义数据添加到临时表中。 一旦没有生成新的数据，推断出的语义数据从临时表复制到交换表中。 与语义数据表的索引相同的索引是为交换表创建的。 然后将交换表中的索引数据交换到语义数据表中的新分区。 通过使用未索引的分区临时表，避免了索引的增量维护，从而提高了效率。

    System for indexing ontology-based semantic matching operators in a relational database system
    39.
    发明申请
    System for indexing ontology-based semantic matching operators in a relational database system 审中-公开
    用于在关系数据库系统中索引基于本体的语义匹配运算符的系统

    公开(公告)号：US20060036633A1

    公开(公告)日：2006-02-16

    申请号：US10916585

    申请日：2004-08-11

    申请人： Eugene Chong ,  George Eadon ,  Jagannathan Srinivasan ,  Souripriya Das

    发明人： Eugene Chong ,  George Eadon ,  Jagannathan Srinivasan ,  Souripriya Das

    IPC分类号： G06F7/00

    CPC分类号： G06F16/367

    摘要： A method for rapidly identifying terms that are associated with a given root term by a transitive relationship defined by hierarchical ontology data stored in a relational database. A transitive closure table is created that comprises a plurality of rows each of which specifies a term and an associated one of a plurality of root terms. The table is sorted and indexed by the root terms to group together rows associated with each of said root terms. The resulting transitive closure table may be consulted to rapidly identify terms associated with said given root term.

    摘要翻译： 一种用于通过存储在关系数据库中的分层本体数据定义的传递关系来快速识别与给定根词相关联的术语的方法。 创建传递闭包表，其包括多个行，每行都指定一个项和多个根项中相关联的一个。 按照根词条对表进行排序和索引，将与每个所述根词相关联的行分组。 可以参考所得到的传递闭包表以快速识别与所述给定根词相关联的术语。