Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries

Rathish Das; Meng He; Eitan Kondratovsky; J. Ian Munro; Kaiyu Wu

doi:10.1007/978-3-031-20643-6_16

Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries

Rathish Das, Meng He, Eitan Kondratovsky, J. Ian Munro, Kaiyu Wu

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

2 Scopus citations

Abstract

We define a generalization of the prefix sum problem in which the vector can be masked by segments of a second (Boolean) vector. This problem is shown to be related to several other prefix sum, set intersection and approximate string match problems, via specific algorithms, reductions and conditional lower bounds. To our knowledge, we are the first to consider the fully internal measurement queries and prove lower bounds for them. We also discuss the hardness of the sparse variation in both static and dynamic settings. Finally, we provide a parallel algorithm to compute the answers to all possible queries when both vectors are fixed.

Original language	English
Title of host publication	String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings
Editors	Diego Arroyuelo, Diego Arroyuelo, Barbara Poblete
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	217-232
Number of pages	16
ISBN (Print)	9783031206429
DOIs	https://doi.org/10.1007/978-3-031-20643-6_16
State	Published - 2022
Externally published	Yes
Event	29th International Symposium on String Processing and Information Retrieval, SPIRE 2022 - Concepción, Chile Duration: 8 Nov 2022 → 10 Nov 2022

Publication series

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

Conference

Conference	29th International Symposium on String Processing and Information Retrieval, SPIRE 2022
Country/Territory	Chile
City	Concepción
Period	8/11/22 → 10/11/22

Bibliographical note

Publisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Access to Document

10.1007/978-3-031-20643-6_16

Cite this

Das, R., He, M., Kondratovsky, E., Munro, J. I., & Wu, K. (2022). Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. In D. Arroyuelo, D. Arroyuelo, & B. Poblete (Eds.), String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings (pp. 217-232). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13617 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-20643-6_16

Das, Rathish ; He, Meng ; Kondratovsky, Eitan et al. / Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. editor / Diego Arroyuelo ; Diego Arroyuelo ; Barbara Poblete. Springer Science and Business Media Deutschland GmbH, 2022. pp. 217-232 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c886530f7f4449569146ad8041c51c4e,

title = "Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries",

abstract = "We define a generalization of the prefix sum problem in which the vector can be masked by segments of a second (Boolean) vector. This problem is shown to be related to several other prefix sum, set intersection and approximate string match problems, via specific algorithms, reductions and conditional lower bounds. To our knowledge, we are the first to consider the fully internal measurement queries and prove lower bounds for them. We also discuss the hardness of the sparse variation in both static and dynamic settings. Finally, we provide a parallel algorithm to compute the answers to all possible queries when both vectors are fixed.",

author = "Rathish Das and Meng He and Eitan Kondratovsky and Munro, {J. Ian} and Kaiyu Wu",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022 ; Conference date: 08-11-2022 Through 10-11-2022",

year = "2022",

doi = "10.1007/978-3-031-20643-6_16",

language = "אנגלית",

isbn = "9783031206429",

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

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "217--232",

editor = "Diego Arroyuelo and Diego Arroyuelo and Barbara Poblete",

booktitle = "String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings",

address = "גרמניה",

}

Das, R, He, M, Kondratovsky, E, Munro, JI & Wu, K 2022, Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. in D Arroyuelo, D Arroyuelo & B Poblete (eds), String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13617 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 217-232, 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022, Concepción, Chile, 8/11/22. https://doi.org/10.1007/978-3-031-20643-6_16

Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. / Das, Rathish; He, Meng; Kondratovsky, Eitan et al.
String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. ed. / Diego Arroyuelo; Diego Arroyuelo; Barbara Poblete. Springer Science and Business Media Deutschland GmbH, 2022. p. 217-232 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13617 LNCS).

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

TY - GEN

T1 - Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries

AU - Das, Rathish

AU - He, Meng

AU - Kondratovsky, Eitan

AU - Munro, J. Ian

AU - Wu, Kaiyu

PY - 2022

Y1 - 2022

N2 - We define a generalization of the prefix sum problem in which the vector can be masked by segments of a second (Boolean) vector. This problem is shown to be related to several other prefix sum, set intersection and approximate string match problems, via specific algorithms, reductions and conditional lower bounds. To our knowledge, we are the first to consider the fully internal measurement queries and prove lower bounds for them. We also discuss the hardness of the sparse variation in both static and dynamic settings. Finally, we provide a parallel algorithm to compute the answers to all possible queries when both vectors are fixed.

AB - We define a generalization of the prefix sum problem in which the vector can be masked by segments of a second (Boolean) vector. This problem is shown to be related to several other prefix sum, set intersection and approximate string match problems, via specific algorithms, reductions and conditional lower bounds. To our knowledge, we are the first to consider the fully internal measurement queries and prove lower bounds for them. We also discuss the hardness of the sparse variation in both static and dynamic settings. Finally, we provide a parallel algorithm to compute the answers to all possible queries when both vectors are fixed.

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

U2 - 10.1007/978-3-031-20643-6_16

DO - 10.1007/978-3-031-20643-6_16

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

AN - SCOPUS:85142757715

SN - 9783031206429

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

SP - 217

EP - 232

BT - String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings

A2 - Arroyuelo, Diego

A2 - Poblete, Barbara

PB - Springer Science and Business Media Deutschland GmbH

T2 - 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022

Y2 - 8 November 2022 through 10 November 2022

ER -

Das R, He M, Kondratovsky E, Munro JI, Wu K. Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries. In Arroyuelo D, Arroyuelo D, Poblete B, editors, String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. Springer Science and Business Media Deutschland GmbH. 2022. p. 217-232. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-20643-6_16