抄録
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.
| 元の言語 | 英語 |
|---|---|
| ページ（範囲） | 1785-1793 |
| ページ数 | 9 |
| ジャーナル | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| 巻 | E100A |
| 発行部数 | 9 |
| DOI | |
| 出版物ステータス | 出版済み - 9 2017 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics
これを引用
Packed compact tries : A fast and efficient data structure for online string processing. / Takagi, Takuya; Inenaga, Shunsuke; Sadakane, Kunihiko; Arimura, Hiroki.
：: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 巻 E100A, 番号 9, 09.2017, p. 1785-1793.研究成果: ジャーナルへの寄稿 › 記事
}
TY - JOUR
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 - 2017/9
Y1 - 2017/9
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=85028776679&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028776679&partnerID=8YFLogxK
U2 - 10.1587/transfun.E100.A.1785
DO - 10.1587/transfun.E100.A.1785
M3 - Article
AN - SCOPUS:85028776679
VL - E100A
SP - 1785
EP - 1793
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
SN - 0916-8508
IS - 9
ER -