首页> 外国专利> ADAPTIVE GREEDY METHOD FOR FAST LIST INTERSECTION VIA SAMPLING

ADAPTIVE GREEDY METHOD FOR FAST LIST INTERSECTION VIA SAMPLING

机译:通过采样的快速列表相交的自适应贪心方法

摘要

The embodiments of the invention provide a method of intersecting a group of lists. The method begins by performing a first selecting process including selecting a top list from the group of lists to leave remaining lists. The top list can be the smallest list of the group of lists. The method can also select a pair of lists from the group of lists, such that the pair of lists has the smallest intersection size relative to other pairs of lists of the group of lists. Next, the method estimates intersections of the remaining lists with the top list by estimating an amount of intersection between the remaining lists and the top list. This involves sampling a portion of the remaining lists. The method also includes identifying larger list pairs having smaller intersections sizes when compared to smaller list pairs having larger intersections sizes.
机译:本发明的实施例提供了一种与一组列表相交的方法。该方法开始于执行第一选择过程,该第一选择过程包括从列表组中选择顶部列表以留下剩余列表。顶部列表可以是列表组中最小的列表。该方法还可以从列表组中选择一对列表,使得该对列表相对于该列表组中的其他列表对具有最小的交集大小。接下来,该方法通过估计剩余列表与顶层列表之间的交集量来估计剩余列表与顶层列表的交集。这涉及对其余列表的一部分进行采样。该方法还包括当与具有较大交叉点尺寸的较小列表对相比时,识别具有较小交叉点尺寸的较大列表对。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号