Fast set intersection and two-patterns matching

Hagai Cohen; Ely Porat

doi:10.1007/978-3-642-12200-2_22

Fast set intersection and two-patterns matching

Hagai Cohen, Ely Porat

Department of Computer Science

Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 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
Title of host publication	LATIN 2010
Subtitle of host publication	Theoretical Informatics - 9th Latin American Symposium, Proceedings
Pages	234-242
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-642-12200-2_22
State	Published - 2010
Event	9th Latin American Theoretical Informatics Symposium, LATIN 2010 - Oaxaca, Mexico Duration: 19 Apr 2010 → 23 Apr 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6034 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th Latin American Theoretical Informatics Symposium, LATIN 2010
Country/Territory	Mexico
City	Oaxaca
Period	19/04/10 → 23/04/10

Access to Document

10.1007/978-3-642-12200-2_22

Cite this

Cohen, H., & Porat, E. (2010). Fast set intersection and two-patterns matching. In LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings (pp. 234-242). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6034 LNCS). https://doi.org/10.1007/978-3-642-12200-2_22

@inproceedings{fdd25d256284485cbee262e27dcb3c10,

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.",

author = "Hagai Cohen and Ely Porat",

year = "2010",

doi = "10.1007/978-3-642-12200-2_22",

language = "אנגלית",

isbn = "3642121993",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "234--242",

booktitle = "LATIN 2010",

note = "9th Latin American Theoretical Informatics Symposium, LATIN 2010 ; Conference date: 19-04-2010 Through 23-04-2010",

}

Cohen, H & Porat, E 2010, Fast set intersection and two-patterns matching. in LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6034 LNCS, pp. 234-242, 9th Latin American Theoretical Informatics Symposium, LATIN 2010, Oaxaca, Mexico, 19/04/10. https://doi.org/10.1007/978-3-642-12200-2_22

Fast set intersection and two-patterns matching. / Cohen, Hagai; Porat, Ely.
LATIN 2010: Theoretical Informatics - 9th Latin American Symposium, Proceedings. 2010. p. 234-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6034 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Fast set intersection and two-patterns matching

AU - Cohen, Hagai

AU - Porat, Ely

PY - 2010

Y1 - 2010

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.

UR - http://www.scopus.com/inward/record.url?scp=77953520719&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-12200-2_22

DO - 10.1007/978-3-642-12200-2_22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77953520719

SN - 3642121993

SN - 9783642121999

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 234

EP - 242

BT - LATIN 2010

T2 - 9th Latin American Theoretical Informatics Symposium, LATIN 2010

Y2 - 19 April 2010 through 23 April 2010

ER -

Fast set intersection and two-patterns matching

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this