会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • ADAPTIVE LAZY MERGING
    • 自适应LAZY MERGING
    • US20090292714A1
    • 2009-11-26
    • US12123598
    • 2008-05-20
    • Wei HanLin QiaoVijayshankar Raman
    • Wei HanLin QiaoVijayshankar Raman
    • G06F17/30
    • G06F17/30958
    • A query processing method intersects two or more unsorted lists based on a conjunction of predicates. Each list comprises a union of multiple sorted segments. The method performs lazy segment merging and an adaptive n-ary intersecting process. The lazy segment merging comprises starting with each list being a union of completely unmerged segments, such that lookups into a given list involve separate lookups into each segment of the given list. The method intersects the lists according to the predicates while performing the lazy segment merging, such that the lazy segment merging reads in only those portions of each segment that are needed for the intersecting. As the intersecting proceeds and the lookups are performed, the intersecting selectively merges the segments together, based on a cost-benefit analysis of the cost of merging compared to the benefit produced by reducing a number of lookups.
    • 查询处理方法基于谓词的连接与两个或多个未排序的列表相交。 每个列表包括多个排序段的并集。 该方法执行延迟段合并和自适应n元相交处理。 懒惰段合并包括从每个列表开始,这些列是完全未合并的段的并集,使得到给定列表中的查找涉及到给定列表的每个段的单独查找。 该方法在执行延迟段合并时根据谓词与列表相交,使得懒惰段合并仅读取相交所需的每个段的那些部分。 当相交进行和查找被执行时,相交的选择性地将段合在一起,基于与合并成本的成本效益分析相比,通过减少多个查找产生的收益。