论文信息 - Fast set intersection and two-patterns matching

Fast set intersection and two-patterns matching

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.

Ely Porat | Hagai Cohen

[1] S. Muthukrishnan,et al. Efficient algorithms for document retrieval problems , 2002, SODA '02.

[2] Alejandro López-Ortiz,et al. Faster Adaptive Set Intersections for Text Searching , 2006, WEA.

[3] Philip Bille,et al. Fast Evaluation of Union-Intersection Expressions , 2007, ISAAC.

[4] Erik D. Demaine,et al. Adaptive set intersections, unions, and differences , 2000, SODA '00.

[5] Ricardo A. Baeza-Yates,et al. A Fast Set Intersection Algorithm for Sorted Sequences , 2004, CPM.

[6] Peter Buneman,et al. Semistructured data , 1997, PODS.

[7] N. Koudas,et al. Two-dimensional substring indexing , 2001, PODS '01.

[8] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[9] Rasmus Pagh. Faster deterministic dictionaries , 2000, SODA '00.