In this paper we present a new problem, the fast set intersection problem, which is to preprocess a collection of sets in order to efficiently report the intersection of any two sets in the collection. In addition we suggest new solutions for the two-dimensional substring indexing problem and the document listing problem for two patterns by reduction to the fast set intersection problem.
|Number of pages||6|
|Journal||Theoretical Computer Science|
|State||Published - 6 Sep 2010|
- Set intersection
- Two patterns