### 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.

Original language | English |
---|---|

Title of host publication | Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings |

Editors | Veli Mäkinen, Simon J. Puglisi, Leena Salmela |

Publisher | Springer Verlag |

Pages | 213-225 |

Number of pages | 13 |

ISBN (Print) | 9783319445427 |

DOIs | |

Publication status | Published - Jan 1 2016 |

Event | 27th International Workshop on Combinatorial Algorithms, IWOCA 2016 - Helsinki, Finland Duration: Aug 17 2016 → Aug 19 2016 |

### Publication series

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

Volume | 9843 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 27th International Workshop on Combinatorial Algorithms, IWOCA 2016 |
---|---|

Country | Finland |

City | Helsinki |

Period | 8/17/16 → 8/19/16 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*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); Vol. 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.

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

*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), vol. 9843 LNCS, Springer Verlag, pp. 213-225, 27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Helsinki, Finland, 8/17/16. https://doi.org/10.1007/978-3-319-44543-4_17

}

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

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 -