首页>
外国专利>
Adaptive greedy method for ordering intersecting of a group of lists into a left-deep AND-tree
Adaptive greedy method for ordering intersecting of a group of lists into a left-deep AND-tree
展开▼
机译:用于将一组列表相交成左深AND树的自适应贪婪方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
The embodiments of the invention provide a method of ordering an intersecting of a group of lists into a left-deep AND-tree. The method begins by performing a first selecting process including selecting a top list, corresponding to a top leaf of the left-deep AND-tree, from the group of lists to leave remaining lists of the group of 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.
展开▼