13 papers:
ICEIS-v1-2014-ChinoGRTT #named #scalability- TrieMotif — A New and Efficient Method to Mine Frequent K-Motifs from Large Time Series (DYTC, RRdVG, LASR, CTJ, AJMT), pp. 60–69.
PODS-2012-GrossiO #maintenance #sequence #string- The wavelet trie: maintaining an indexed sequence of strings in compressed space (RG, GO), pp. 203–214.
ICDAR-2011-ZhuN11b #online #recognition #using- Trie-Lexicon-Driven Recognition for On-line Handwritten Japanese Disease Names Using a Time-Synchronous Method (BZ, MN), pp. 1130–1134.
VLDB-2010-WangLF #constraints #named #performance #similarity #string- Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints (JW, GL, JF), pp. 1219–1230.
CIKM-2009-WuBY #xml- Workload-aware trie indices for XML (YW, SB, HY), pp. 1425–1428.
ICLP-2009-CostaRR #logic programming #source code- A Term-Based Global Trie for Tabled Logic Programs (JC, JR, RR), pp. 205–219.
- CIKM-2006-TerrovitisPVS
- A combination of trie-trees and inverted files for the indexing of set-valued attributes (MT, SP, PV, TKS), pp. 728–737.
SIGMOD-1995-ArefBV- The Handwritten Trie: Indexing Electronic Ink (WGA, DB, PV), pp. 151–162.
- VLDB-1983-TorenvlietB #optimisation #re-engineering
- The Reconstruction and Optimization of Trie Hashing Functions (LT, PvEB), pp. 142–156.
ICALP-1982-FlajoletS #branch #polynomial #process- A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization (PF, JMS), pp. 239–251.
- SIGMOD-1981-Litwin
- Trie Hashing (WL), pp. 19–29.
- VLDB-J-1975-Burkhard76 #algorithm #retrieval
- Hashing and Trie Algorithms for Partial Match Retrieval (WAB), pp. 175–187.
STOC-1976-Burkhard #retrieval- Associative Retrieval Trie Hash-Coding (WAB), pp. 211–219.
