会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Processing overlapping continuous queries
    • 处理重复的连续查询
    • US08055653B2
    • 2011-11-08
    • US11836567
    • 2007-08-09
    • Zhen LiuSrinivasan ParthasarathyAnand RanganathanHao Yang
    • Zhen LiuSrinivasan ParthasarathyAnand RanganathanHao Yang
    • G06F17/20G06F15/16
    • G06F17/30463G06F17/3046
    • An edge-covering based greedy method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a unit price of each filter, evaluating, sequentially, each filter in order of a lowest to a highest unit price, to determine a value for each filter, and changing an ordering of the filters according to the values. An edge-covering based harmonic method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a weight of each filter, evaluating, randomly, each filter having a probability inversely proportionally to its weight, to determine a value, and changing an ordering of the filters according to the values.
    • 用于共享过滤器排序的基于边缘覆盖的贪婪方法包括接收多个查询,其中每个查询是过滤器的结合,并且每个过滤器在多个查询的多个查询之间共享,评估每个过滤器的单价,评估 顺序地按每个过滤器按最低到最高单价的顺序,确定每个过滤器的值,并根据该值改变过滤器的排序。 用于共享过滤器排序的基于边缘覆盖的谐波方法包括接收多个查询,其中每个查询是过滤器的结合,并且每个过滤器在多个查询的多个查询之间共享,评估每个过滤器的权重, 随机地,每个滤波器具有与其权重成反比的概率,以确定值,并根据该值改变滤波器的排序。
    • 8. 发明申请
    • Processing Overlapping Continuous Queries
    • 处理重叠的连续查询
    • US20090043729A1
    • 2009-02-12
    • US11836567
    • 2007-08-09
    • Zhen LiuSrinivasan ParthasarathyAnand RanganathanHao Yang
    • Zhen LiuSrinivasan ParthasarathyAnand RanganathanHao Yang
    • G06F17/30
    • G06F17/30463G06F17/3046
    • An edge-covering based greedy method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a unit price of each filter, evaluating, sequentially, each filter in order of a lowest to a highest unit price, to determine a value for each filter, and changing an ordering of the filters according to the values.An edge-covering based harmonic method for shared filter ordering includes receiving a plurality of queries, wherein each query is a conjunction of filters, and each filter is shared across multiple queries of the plurality of queries, evaluating a weight of each filter, evaluating, randomly, each filter having a probability inversely proportionally to its weight, to determine a value, and changing an ordering of the filters according to the values.
    • 用于共享过滤器排序的基于边缘覆盖的贪婪方法包括接收多个查询,其中每个查询是过滤器的结合,并且每个过滤器在多个查询的多个查询之间共享,评估每个过滤器的单价,评估 顺序地按每个过滤器按最低到最高单价的顺序,确定每个过滤器的值,并根据该值改变过滤器的排序。 用于共享过滤器排序的基于边缘覆盖的谐波方法包括接收多个查询,其中每个查询是过滤器的结合,并且每个过滤器在多个查询的多个查询之间共享,评估每个过滤器的权重, 随机地,每个滤波器具有与其权重成反比的概率,以确定值,并根据该值改变滤波器的排序。