Update query time trade-off for dynamic suffix arrays

Amihood Amir; Itai Boneh

doi:10.4230/LIPIcs.ISAAC.2020.63

Update query time trade-off for dynamic suffix arrays

Amihood Amir, Itai Boneh

Department of Computer Science

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

3 Scopus citations

Abstract

The Suffix Array SA(S) of a string S[1 . . . n] is an array containing all the suffixes of S sorted by lexicographic order. The suffix array is one of the most well known indexing data structures, and it functions as a key tool in many string algorithms. In this paper, we present a data structure for maintaining the Suffix Array of a dynamic string. For every 1 ≤ k ≤ n, our data structure reports SA[i] in Õ(ⁿ_k) time and handles text modification in Õ(k) time. Additionally, our data structure enables the same query time for reporting iSA[i], with iSA being the Inverse Suffix Array of S[1 . . . n]. Our data structure can be used to construct sub-linear dynamic variants of static strings algorithms or data structures that are based on the Suffix Array and the Inverse Suffix Array.

Original language	English
Title of host publication	31st International Symposium on Algorithms and Computation, ISAAC 2020
Editors	Yixin Cao, Siu-Wing Cheng, Minming Li
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages	631-6316
Number of pages	5686
ISBN (Electronic)	9783959771733
DOIs	https://doi.org/10.4230/LIPIcs.ISAAC.2020.63
State	Published - Dec 2020
Event	31st International Symposium on Algorithms and Computation, ISAAC 2020 - Virtual, Hong Kong, China Duration: 14 Dec 2020 → 18 Dec 2020

Publication series

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

Conference

Conference	31st International Symposium on Algorithms and Computation, ISAAC 2020
Country/Territory	China
City	Virtual, Hong Kong
Period	14/12/20 → 18/12/20

Bibliographical note

Publisher Copyright:
© Amihood Amir and Itai Boneh.

Funding

Partly supported by ISF grant 1475/18 and BSF grant 2018141.

Funders	Funder number
United States-Israel Binational Science Foundation	2018141
Israel Science Foundation	1475/18

Keywords

Dynamic algorithms
Inverse suffix array
String algorithms
Suffix array

Access to Document

10.4230/LIPIcs.ISAAC.2020.63

Cite this

Amir, A., & Boneh, I. (2020). Update query time trade-off for dynamic suffix arrays. In Y. Cao, S.-W. Cheng, & M. Li (Eds.), 31st International Symposium on Algorithms and Computation, ISAAC 2020 (pp. 631-6316). Article 63 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 181). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2020.63

@inproceedings{19eb281c457c4059932b28cb8a79142e,

title = "Update query time trade-off for dynamic suffix arrays",

abstract = "The Suffix Array SA(S) of a string S[1 . . . n] is an array containing all the suffixes of S sorted by lexicographic order. The suffix array is one of the most well known indexing data structures, and it functions as a key tool in many string algorithms. In this paper, we present a data structure for maintaining the Suffix Array of a dynamic string. For every 1 ≤ k ≤ n, our data structure reports SA[i] in {\~O}(nk) time and handles text modification in {\~O}(k) time. Additionally, our data structure enables the same query time for reporting iSA[i], with iSA being the Inverse Suffix Array of S[1 . . . n]. Our data structure can be used to construct sub-linear dynamic variants of static strings algorithms or data structures that are based on the Suffix Array and the Inverse Suffix Array.",

keywords = "Dynamic algorithms, Inverse suffix array, String algorithms, Suffix array",

author = "Amihood Amir and Itai Boneh",

note = "Publisher Copyright: {\textcopyright} Amihood Amir and Itai Boneh.; 31st International Symposium on Algorithms and Computation, ISAAC 2020 ; Conference date: 14-12-2020 Through 18-12-2020",

year = "2020",

month = dec,

doi = "10.4230/LIPIcs.ISAAC.2020.63",

language = "אנגלית",

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

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

pages = "631--6316",

editor = "Yixin Cao and Siu-Wing Cheng and Minming Li",

booktitle = "31st International Symposium on Algorithms and Computation, ISAAC 2020",

address = "גרמניה",

}

Amir, A & Boneh, I 2020, Update query time trade-off for dynamic suffix arrays. in Y Cao, S-W Cheng & M Li (eds), 31st International Symposium on Algorithms and Computation, ISAAC 2020., 63, Leibniz International Proceedings in Informatics, LIPIcs, vol. 181, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 631-6316, 31st International Symposium on Algorithms and Computation, ISAAC 2020, Virtual, Hong Kong, China, 14/12/20. https://doi.org/10.4230/LIPIcs.ISAAC.2020.63

Update query time trade-off for dynamic suffix arrays. / Amir, Amihood; Boneh, Itai.
31st International Symposium on Algorithms and Computation, ISAAC 2020. ed. / Yixin Cao; Siu-Wing Cheng; Minming Li. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2020. p. 631-6316 63 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 181).

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

TY - GEN

T1 - Update query time trade-off for dynamic suffix arrays

AU - Amir, Amihood

AU - Boneh, Itai

N1 - Publisher Copyright: © Amihood Amir and Itai Boneh.

PY - 2020/12

Y1 - 2020/12

N2 - The Suffix Array SA(S) of a string S[1 . . . n] is an array containing all the suffixes of S sorted by lexicographic order. The suffix array is one of the most well known indexing data structures, and it functions as a key tool in many string algorithms. In this paper, we present a data structure for maintaining the Suffix Array of a dynamic string. For every 1 ≤ k ≤ n, our data structure reports SA[i] in Õ(nk) time and handles text modification in Õ(k) time. Additionally, our data structure enables the same query time for reporting iSA[i], with iSA being the Inverse Suffix Array of S[1 . . . n]. Our data structure can be used to construct sub-linear dynamic variants of static strings algorithms or data structures that are based on the Suffix Array and the Inverse Suffix Array.

AB - The Suffix Array SA(S) of a string S[1 . . . n] is an array containing all the suffixes of S sorted by lexicographic order. The suffix array is one of the most well known indexing data structures, and it functions as a key tool in many string algorithms. In this paper, we present a data structure for maintaining the Suffix Array of a dynamic string. For every 1 ≤ k ≤ n, our data structure reports SA[i] in Õ(nk) time and handles text modification in Õ(k) time. Additionally, our data structure enables the same query time for reporting iSA[i], with iSA being the Inverse Suffix Array of S[1 . . . n]. Our data structure can be used to construct sub-linear dynamic variants of static strings algorithms or data structures that are based on the Suffix Array and the Inverse Suffix Array.

KW - Dynamic algorithms

KW - Inverse suffix array

KW - String algorithms

KW - Suffix array

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

U2 - 10.4230/LIPIcs.ISAAC.2020.63

DO - 10.4230/LIPIcs.ISAAC.2020.63

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

AN - SCOPUS:85100920205

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 631

EP - 6316

BT - 31st International Symposium on Algorithms and Computation, ISAAC 2020

A2 - Cao, Yixin

A2 - Cheng, Siu-Wing

A2 - Li, Minming

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

T2 - 31st International Symposium on Algorithms and Computation, ISAAC 2020

Y2 - 14 December 2020 through 18 December 2020

ER -

Amir A, Boneh I. Update query time trade-off for dynamic suffix arrays. In Cao Y, Cheng SW, Li M, editors, 31st International Symposium on Algorithms and Computation, ISAAC 2020. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2020. p. 631-6316. 63. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.ISAAC.2020.63

Update query time trade-off for dynamic suffix arrays

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this