Fast Set Intersection and Two Patterns Matching
Data Structures and Algorithms
2010-03-12 v3
Abstract
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.
Keywords
Cite
@article{arxiv.0909.5146,
title = {Fast Set Intersection and Two Patterns Matching},
author = {Hagai Cohen and Ely Porat},
journal= {arXiv preprint arXiv:0909.5146},
year = {2010}
}
Comments
9 pages