Color-distance oracles and snippets

Tsvi Kopelowitz; Robert Krauthgamer

doi:10.4230/LIPIcs.CPM.2016.24

Color-distance oracles and snippets

Tsvi Kopelowitz, Robert Krauthgamer

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

7 Scopus citations

Abstract

In the snippets problem we are interested in preprocessing a text T so that given two pattern queries P₁ and P₂, one can quickly locate the occurrences of the patterns in T that are the closest to each other. A closely related problem is that of constructing a color-distance oracle, where the goal is to preprocess a set of points from some metric space, in which every point is associated with a set of colors, so that given two colors one can quickly locate two points associated with those colors, that are as close as possible to each other. We introduce efficient data structures for both color-distance oracles and the snippets problem. Moreover, we prove conditional lower bounds for these problems from both the 3SUM conjecture and the Combinatorial Boolean Matrix Multiplication conjecture.

Original language	English
Title of host publication	27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
Editors	Roberto Grossi, Moshe Lewenstein
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages	24.1-24.10
ISBN (Electronic)	9783959770125
DOIs	https://doi.org/10.4230/LIPIcs.CPM.2016.24
State	Published - 1 Jun 2016
Externally published	Yes
Event	27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 - Tel Aviv, Israel Duration: 27 Jun 2016 → 29 Jun 2016

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	54
ISSN (Print)	1868-8969

Conference

Conference	27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
Country/Territory	Israel
City	Tel Aviv
Period	27/06/16 → 29/06/16

Bibliographical note

Publisher Copyright:
© Tsvi Kopelowitz Robert Krauthgamer.

Funding

Work supported in part by NSF grants CCF-1217338, CNS-1318294, and CCF-1514383. Work supported in part by an Israel Science Foundation grant #897/13. We thank Sharma Thankachan for suggesting to consider range predecessor data structures, thereby significantly simplifying our earlier, more complicated, solution.

Funders	Funder number
Sharma Thankachan
National Science Foundation	CCF-1217338, CNS-1318294, CCF-1514383
Israel Science Foundation	897/13

Keywords

Distance oracles
Near neighbor search
Snippets
Text indexing

Access to Document

10.4230/LIPIcs.CPM.2016.24

Cite this

Kopelowitz, T., & Krauthgamer, R. (2016). Color-distance oracles and snippets. In R. Grossi, & M. Lewenstein (Eds.), 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 (pp. 24.1-24.10). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 54). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2016.24

@inproceedings{604f8794f4804046913f632e29213fb0,

title = "Color-distance oracles and snippets",

abstract = "In the snippets problem we are interested in preprocessing a text T so that given two pattern queries P1 and P2, one can quickly locate the occurrences of the patterns in T that are the closest to each other. A closely related problem is that of constructing a color-distance oracle, where the goal is to preprocess a set of points from some metric space, in which every point is associated with a set of colors, so that given two colors one can quickly locate two points associated with those colors, that are as close as possible to each other. We introduce efficient data structures for both color-distance oracles and the snippets problem. Moreover, we prove conditional lower bounds for these problems from both the 3SUM conjecture and the Combinatorial Boolean Matrix Multiplication conjecture.",

keywords = "Distance oracles, Near neighbor search, Snippets, Text indexing",

author = "Tsvi Kopelowitz and Robert Krauthgamer",

note = "Publisher Copyright: {\textcopyright} Tsvi Kopelowitz Robert Krauthgamer.; 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 ; Conference date: 27-06-2016 Through 29-06-2016",

year = "2016",

month = jun,

day = "1",

doi = "10.4230/LIPIcs.CPM.2016.24",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

pages = "24.1--24.10",

editor = "Roberto Grossi and Moshe Lewenstein",

booktitle = "27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016",

address = "גרמניה",

}

Kopelowitz, T & Krauthgamer, R 2016, Color-distance oracles and snippets. in R Grossi & M Lewenstein (eds), 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Leibniz International Proceedings in Informatics, LIPIcs, vol. 54, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 24.1-24.10, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, Israel, 27/06/16. https://doi.org/10.4230/LIPIcs.CPM.2016.24

Color-distance oracles and snippets. / Kopelowitz, Tsvi; Krauthgamer, Robert.
27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. ed. / Roberto Grossi; Moshe Lewenstein. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. p. 24.1-24.10 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 54).

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

TY - GEN

T1 - Color-distance oracles and snippets

AU - Kopelowitz, Tsvi

AU - Krauthgamer, Robert

PY - 2016/6/1

Y1 - 2016/6/1

N2 - In the snippets problem we are interested in preprocessing a text T so that given two pattern queries P1 and P2, one can quickly locate the occurrences of the patterns in T that are the closest to each other. A closely related problem is that of constructing a color-distance oracle, where the goal is to preprocess a set of points from some metric space, in which every point is associated with a set of colors, so that given two colors one can quickly locate two points associated with those colors, that are as close as possible to each other. We introduce efficient data structures for both color-distance oracles and the snippets problem. Moreover, we prove conditional lower bounds for these problems from both the 3SUM conjecture and the Combinatorial Boolean Matrix Multiplication conjecture.

AB - In the snippets problem we are interested in preprocessing a text T so that given two pattern queries P1 and P2, one can quickly locate the occurrences of the patterns in T that are the closest to each other. A closely related problem is that of constructing a color-distance oracle, where the goal is to preprocess a set of points from some metric space, in which every point is associated with a set of colors, so that given two colors one can quickly locate two points associated with those colors, that are as close as possible to each other. We introduce efficient data structures for both color-distance oracles and the snippets problem. Moreover, we prove conditional lower bounds for these problems from both the 3SUM conjecture and the Combinatorial Boolean Matrix Multiplication conjecture.

KW - Distance oracles

KW - Near neighbor search

KW - Snippets

KW - Text indexing

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

U2 - 10.4230/LIPIcs.CPM.2016.24

DO - 10.4230/LIPIcs.CPM.2016.24

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

AN - SCOPUS:85012031766

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 24.1-24.10

BT - 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016

A2 - Grossi, Roberto

A2 - Lewenstein, Moshe

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016

Y2 - 27 June 2016 through 29 June 2016

ER -

Color-distance oracles and snippets

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this