Packed compact tries: A fast and efficient data structure for online string processing

Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura

研究成果: 著書/レポートタイプへの貢献会議での発言

4 引用 (Scopus)

抄録

We present a new data structure called the packed compact trie (packed c-trie) which stores a set S of k strings of total length n in n log σ + O(k log n) bits of space and supports fast pattern matching queries and updates, where σ is the alphabet size.Assume that α = logσ n letters are packed in a single machine word on the standard word RAM model, and let f(k, n) denote the query and update times of the dynamic predecessor/successor data structure of our choice which stores k integers from universe [1, n] in O(k log n) bits of space.Then, given a string of length m, our packed c-tries support pattern matching queries and insert/delete operations in O(m/α f(k, n)) worst-case time and in O(m/α +f(k, n)) expected time.Our experiments show that our packed c-tries are faster than the standard compact tries (a.k.a.Patricia trees) on real data sets.We also discuss applications of our packed c-tries.

元の言語英語
ホスト出版物のタイトルCombinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings
編集者Veli Mäkinen, Simon J. Puglisi, Leena Salmela
出版者Springer Verlag
ページ213-225
ページ数13
ISBN(印刷物)9783319445427
DOI
出版物ステータス出版済み - 1 1 2016
イベント27th International Workshop on Combinatorial Algorithms, IWOCA 2016 - Helsinki, フィンランド
継続期間: 8 17 20168 19 2016

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9843 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他27th International Workshop on Combinatorial Algorithms, IWOCA 2016
フィンランド
Helsinki
期間8/17/168/19/16

Fingerprint

Pattern matching
Data structures
Data Structures
Strings
Pattern Matching
Query
Random access storage
Processing
Update
Single Machine
Denote
Integer
Experiments
Experiment
Standards
Model

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Takagi, T., Inenaga, S., Sadakane, K., & Arimura, H. (2016). Packed compact tries: A fast and efficient data structure for online string processing. : V. Mäkinen, S. J. Puglisi, & L. Salmela (版), Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings (pp. 213-225). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 9843 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-44543-4_17

Packed compact tries : A fast and efficient data structure for online string processing. / Takagi, Takuya; Inenaga, Shunsuke; Sadakane, Kunihiko; Arimura, Hiroki.

Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings. 版 / Veli Mäkinen; Simon J. Puglisi; Leena Salmela. Springer Verlag, 2016. p. 213-225 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 9843 LNCS).

研究成果: 著書/レポートタイプへの貢献会議での発言

Takagi, T, Inenaga, S, Sadakane, K & Arimura, H 2016, Packed compact tries: A fast and efficient data structure for online string processing. : V Mäkinen, SJ Puglisi & L Salmela (版), Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 9843 LNCS, Springer Verlag, pp. 213-225, 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Helsinki, フィンランド, 8/17/16. https://doi.org/10.1007/978-3-319-44543-4_17
Takagi T, Inenaga S, Sadakane K, Arimura H. Packed compact tries: A fast and efficient data structure for online string processing. : Mäkinen V, Puglisi SJ, Salmela L, 編集者, Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings. Springer Verlag. 2016. p. 213-225. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-44543-4_17
Takagi, Takuya ; Inenaga, Shunsuke ; Sadakane, Kunihiko ; Arimura, Hiroki. / Packed compact tries : A fast and efficient data structure for online string processing. Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings. 編集者 / Veli Mäkinen ; Simon J. Puglisi ; Leena Salmela. Springer Verlag, 2016. pp. 213-225 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{54c614b9fc8741928a3d5740ce5be135,
title = "Packed compact tries: A fast and efficient data structure for online string processing",
abstract = "We present a new data structure called the packed compact trie (packed c-trie) which stores a set S of k strings of total length n in n log σ + O(k log n) bits of space and supports fast pattern matching queries and updates, where σ is the alphabet size.Assume that α = logσ n letters are packed in a single machine word on the standard word RAM model, and let f(k, n) denote the query and update times of the dynamic predecessor/successor data structure of our choice which stores k integers from universe [1, n] in O(k log n) bits of space.Then, given a string of length m, our packed c-tries support pattern matching queries and insert/delete operations in O(m/α f(k, n)) worst-case time and in O(m/α +f(k, n)) expected time.Our experiments show that our packed c-tries are faster than the standard compact tries (a.k.a.Patricia trees) on real data sets.We also discuss applications of our packed c-tries.",
author = "Takuya Takagi and Shunsuke Inenaga and Kunihiko Sadakane and Hiroki Arimura",
year = "2016",
month = "1",
day = "1",
doi = "10.1007/978-3-319-44543-4_17",
language = "English",
isbn = "9783319445427",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "213--225",
editor = "Veli M{\"a}kinen and Puglisi, {Simon J.} and Leena Salmela",
booktitle = "Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Packed compact tries

T2 - A fast and efficient data structure for online string processing

AU - Takagi, Takuya

AU - Inenaga, Shunsuke

AU - Sadakane, Kunihiko

AU - Arimura, Hiroki

PY - 2016/1/1

Y1 - 2016/1/1

N2 - We present a new data structure called the packed compact trie (packed c-trie) which stores a set S of k strings of total length n in n log σ + O(k log n) bits of space and supports fast pattern matching queries and updates, where σ is the alphabet size.Assume that α = logσ n letters are packed in a single machine word on the standard word RAM model, and let f(k, n) denote the query and update times of the dynamic predecessor/successor data structure of our choice which stores k integers from universe [1, n] in O(k log n) bits of space.Then, given a string of length m, our packed c-tries support pattern matching queries and insert/delete operations in O(m/α f(k, n)) worst-case time and in O(m/α +f(k, n)) expected time.Our experiments show that our packed c-tries are faster than the standard compact tries (a.k.a.Patricia trees) on real data sets.We also discuss applications of our packed c-tries.

AB - We present a new data structure called the packed compact trie (packed c-trie) which stores a set S of k strings of total length n in n log σ + O(k log n) bits of space and supports fast pattern matching queries and updates, where σ is the alphabet size.Assume that α = logσ n letters are packed in a single machine word on the standard word RAM model, and let f(k, n) denote the query and update times of the dynamic predecessor/successor data structure of our choice which stores k integers from universe [1, n] in O(k log n) bits of space.Then, given a string of length m, our packed c-tries support pattern matching queries and insert/delete operations in O(m/α f(k, n)) worst-case time and in O(m/α +f(k, n)) expected time.Our experiments show that our packed c-tries are faster than the standard compact tries (a.k.a.Patricia trees) on real data sets.We also discuss applications of our packed c-tries.

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

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

U2 - 10.1007/978-3-319-44543-4_17

DO - 10.1007/978-3-319-44543-4_17

M3 - Conference contribution

AN - SCOPUS:84984892494

SN - 9783319445427

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

SP - 213

EP - 225

BT - Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings

A2 - Mäkinen, Veli

A2 - Puglisi, Simon J.

A2 - Salmela, Leena

PB - Springer Verlag

ER -