Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Trie

Known as: B-trie, Digital tree, Tree (disambiguation) 
In computer science, a trie, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is a kind of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
A string similarity join finds similar pairs between two collections of strings. Many applications, e.g., data integration and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Efficient algorithms for mining frequent itemsets are crucial for mining association rules. Methods for mining frequent itemsets… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We describe an implementation of the well-known apriori algorithm for the induction of association rules [Agrawal et al. (1993… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We propose an algorithm for combinatorial optimization where an explicit check for the repetition of configurations is added to… Expand
  • figure 1
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We propose a new algorithm which allows for the identification of any stochastic deterministic regular language as well as the… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
 
  • figure 1
  • figure 2
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
  • R. Rivest
  • SIAM J. Comput.
  • 1976
  • Corpus ID: 1565261
We examine the efficiency of hash-coding and tree-search algorithms for retrieving from a file of k-letter words all words which… Expand
  • figure 1
  • table 3
  • table 4
  • table 6
  • figure 2
Is this relevant?
Highly Cited
1960
Highly Cited
1960
Trie memory is a way of storing and retrieving information. ~ It is applicable to information that consists of function-argument… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 9
Is this relevant?