2010 | OriginalPaper | Buchkapitel
Fast Set Intersection and Two-Patterns Matching
verfasst von : Hagai Cohen, Ely Porat
Erschienen in: LATIN 2010: Theoretical Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.