Fast Set Intersection and Two Patterns Matching

Details Fast Set Intersection and Two Patterns Matching Fast Set Intersection and Two Patterns Matching

2009-09-28

arxiv.org/abs/0909.5146v3

Computer Science

Data Structures and Algorithms

9 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fast Set Intersection and Two Patterns Matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Set Intersection and Two Patterns Matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Set Intersection and Two Patterns Matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-235556