TY - GEN
T1 - Packed compact tries
T2 - 27th International Workshop on Combinatorial Algorithms, IWOCA 2016
AU - Takagi, Takuya
AU - Inenaga, Shunsuke
AU - Sadakane, Kunihiko
AU - Arimura, Hiroki
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
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
Y2 - 17 August 2016 through 19 August 2016
ER -