Greedy List Intersection

  title={Greedy List Intersection},
  author={Robert Krauthgamer and Aranyak Mehta and Vijayshankar Raman and Atri Rudra},
  journal={2008 IEEE 24th International Conference on Data Engineering},
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting row- id lists, via an AND-tree. The performance of this technique depends crucially on the order of lists in this tree: it is important to compute early the intersections that will produce small results. But this optimization is hard to do when the data or predicates have correlation. We present a new algorithm for ordering… CONTINUE READING


Publications referenced by this paper.

Consistent selectivity estimation using maximum entropy

  • V. Markl
  • The VLDB Journal, vol. 16, .
  • 2007
1 Excerpt

Greedy list intersection

  • R. Krauthgamer, A. Mehta, V. Raman, A. Rudra
  • Department of Computer Science and Engineering…
  • 2007
3 Excerpts

Lazy adaptive rid-list intersection and application to starjoins

  • V. Raman, L. Qiao
  • SIGMOD, .
  • 2007

Similar Papers

Loading similar papers…