Faster Set Intersection Algorithms for Text Searching ? University of Waterloo Technical Report CS-2007-13

Abstract

The intersection of large ordered sets is a common problem in the context of the evaluation of boolean queries to a search engine. In this paper we propose several improved algorithms for computing the intersection of sorted arrays, and in particular for searching sorted arrays in the intersection context. We perform an experimental comparison with the… (More)

18 Figures and Tables

Topics

  • Presentations referencing similar topics