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

Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (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.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings
EditorsVeli Mäkinen, Simon J. Puglisi, Leena Salmela
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783319445427
Publication statusPublished - 2016
Event27th International Workshop on Combinatorial Algorithms, IWOCA 2016 - Helsinki, Finland
Duration: Aug 17 2016Aug 19 2016

Publication series

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


Other27th International Workshop on Combinatorial Algorithms, IWOCA 2016

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Packed compact tries: A fast and efficient data structure for online string processing'. Together they form a unique fingerprint.

Cite this