会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Normalized ranking of semantic query search results
    • 语义查询搜索结果的归一化排序
    • US09229930B2
    • 2016-01-05
    • US13595125
    • 2012-08-27
    • Seema SundaraMatthew Steven PerrySouripriya DasJagannathan Srinivasan
    • Seema SundaraMatthew Steven PerrySouripriya DasJagannathan Srinivasan
    • G06F17/30
    • G06F17/30G06F17/30731G06F17/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查询中选择的不同变量的数量,并且还考虑与上述变量的绑定的总数。 为了从可能不同大小的文档中进行比较,通过考虑文档底层子图中发现的三元组的总数来实现进一步的标准化组件。
    • 6. 发明申请
    • Method and system for speeding up rebuild of user-defined indexes during partition maintenance operations in the database systems
    • 在数据库系统中的分区维护操作期间加快重建用户定义索引的方法和系统
    • US20090177622A1
    • 2009-07-09
    • US12007325
    • 2008-01-09
    • Ying HuSeema SundaraJagannathan Srinivasan
    • Ying HuSeema SundaraJagannathan Srinivasan
    • G06F17/30
    • G06F17/30336
    • A method, system, and computer program product provides improved performance for rebuild of user-defined indexes during partition maintenance operations (partition split, merge, and move). A method of maintaining a index of a partitioned database table comprises performing a partition maintenance operation on the partitioned database table wherein a plurality of rows of the partitioned database table are moved from one partition to another, storing mapping information for at least some of the plurality of moved rows, including an old mapping for each of the moved rows and a corresponding new mapping for each of the moved rows, and when rebuilding the index, replacing an old mapping in the index for each of the plurality of moved rows with the corresponding stored new mapping for each of the plurality of moved rows.
    • 方法,系统和计算机程序产品提供了在分区维护操作(分区拆分,合并和移动)期间重建用户定义索引的改进性能。 维护分区数据库表的索引的方法包括对分区数据库表执行分区维护操作,其中分区数据库表的多行被从一个分区移动到另一分区,存储多个分区数据库表中的至少一个的映射信息 移动的行,包括每个移动的行的旧映射和每个被移动的行的对应的新映射,以及当重建索引时,用对应的多个移动的行中的每一个代替索引中的旧映射 为多个移动的行中的每一个存储新的映射。
    • 7. 发明申请
    • Materialized views with user-defined aggregates
    • 具有用户定义聚合的物化视图
    • US20090019005A1
    • 2009-01-15
    • US11827796
    • 2007-07-13
    • Ying HuSeema SundaraJagannathan Srinivasan
    • Ying HuSeema SundaraJagannathan Srinivasan
    • G06F17/30
    • G06F17/30457
    • Systems, methodologies, media, and other embodiments associated with supporting materialized views with user-defined aggregates are described. One example system includes logic for exposing a set of interface actions to support a user-defined aggregate in a materialized view associated with a base table. The materialized view may store both the user-defined aggregate and a user-defined aggregate context that facilitates logically connecting the user-defined aggregate to the base table. The example system may also include logic for supporting the user-defined aggregate. The support may be based on the set of interface actions. Example systems and methods may, therefore, facilitate incremental updating of the materialized view and/or rewriting a query to access the materialized view.
    • 描述了使用用户定义的聚合来支持物化视图的系统,方法,介质和其他实施例。 一个示例系统包括用于在与基表相关联的物化视图中暴露一组接口动作以支持用户定义的聚合的逻辑。 物化视图可以存储用户定义的聚合和有助于将用户定义的聚合逻辑连接到基表的用户定义的聚合上下文。 示例系统还可以包括用于支持用户定义的聚合的逻辑。 支持可以基于一组接口动作。 因此,示例系统和方法可以促进物化视图的增量更新和/或重写查询以访问物化视图。
    • 8. 发明申请
    • Queries with hard time constraints
    • 具有困难时间限制的查询
    • US20080288473A1
    • 2008-11-20
    • US11804508
    • 2007-05-18
    • Ying HuSeema SundaraJagannathan Srinivasan
    • Ying HuSeema SundaraJagannathan Srinivasan
    • G06F17/30
    • G06F17/30522G06F17/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.
    • 描述了与支持具有硬时间约束的查询相关联的系统,方法,媒体和其他实施例。 一个示例性系统实施例包括用于接受具有硬时间约束的查询的逻辑。 示例系统还可以包括用于选择性地将具有硬时间约束的查询重写到具有行限制或样本百分比限制的查询中的逻辑。 在一个示例中,通过将估计的查询执行时间与硬时间约束重复比较来计算行限制或抽样百分比限制。 示例系统还可以包括用于建立与重写查询相关联的定时器的逻辑。