Fast set intersection and two-patterns matching

Hagai Cohen; Ely Porat

doi:10.1016/j.tcs.2010.06.002

Fast set intersection and two-patterns matching

Hagai Cohen
, Ely Porat

Department of Computer Science and Artificial Intelligence

Bar-Ilan University

Research output: Contribution to journal › Article › peer-review

55 Scopus citations

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.

Original language	English
Pages (from-to)	3795-3800
Number of pages	6
Journal	Theoretical Computer Science
Volume	411
Issue number	40-42
DOIs	https://doi.org/10.1016/j.tcs.2010.06.002
State	Published - 6 Sep 2010

Keywords

Set intersection
Two patterns

Access to Document

10.1016/j.tcs.2010.06.002

Cite this

@article{69e7bbc6fce941b4918cb03dbe3da5a5,

title = "Fast set intersection and two-patterns matching",

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 = "Set intersection, Two patterns",

author = "Hagai Cohen and Ely Porat",

year = "2010",

month = sep,

day = "6",

doi = "10.1016/j.tcs.2010.06.002",

language = "אנגלית",

volume = "411",

pages = "3795--3800",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "40-42",

}

TY - JOUR

T1 - Fast set intersection and two-patterns matching

AU - Cohen, Hagai

AU - Porat, Ely

PY - 2010/9/6

Y1 - 2010/9/6

N2 - 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.

AB - 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.

KW - Set intersection

KW - Two patterns

UR - https://www.scopus.com/pages/publications/78049419042

U2 - 10.1016/j.tcs.2010.06.002

DO - 10.1016/j.tcs.2010.06.002

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:78049419042

SN - 0304-3975

VL - 411

SP - 3795

EP - 3800

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 40-42

ER -

Fast set intersection and two-patterns matching

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this