Trie Data Structures

Trie Data Structures is a tree-based data structure designed for efficient retrieval of strings, distinguished by its prefix-based organization that enables fast prefix matching and substring search operations.

189

Publications

10.3K

Citations

460

Authors

208

Institutions

Publications per year

2017–2026

17

Authors

460

  1. JA
    Jun‐ichi Aoe

    Tokushima University, Japan

    6 publications · 171 citations

    6

    h-index

  2. HL
    Hyesook Lim

    Ewha Womans University, South Korea

    6 publications · 151 citations

    6

    h-index

  3. RG
    Roberto Grossi

    University of Pisa, Italy

    5 publications · 360 citations

    5

    h-index

  4. JZ
    Justin Zobel

    RMIT University, Australia

    5 publications · 273 citations

    5

    h-index

  5. PF
    Philippe Flajolet

    Institut national de recherche en sciences et technologies du numérique, France

    4 publications · 264 citations

    4

    h-index

1–5 of 460

Venues

  1. Software Practice and Experience

    8 publications · 273 citations

    8

    h-index

  2. ACM Transactions on Database Systems

    TODS · 5 publications · 133 citations

    5

    h-index

  3. Journal of Discrete Algorithms

    4 publications · 896 citations

    4

    h-index

  4. IEEE Transactions on Computers

    4 publications · 94 citations

    4

    h-index

  5. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 4 publications · 215 citations

    4

    h-index

1–5