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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Key-value (KV) stores have become a backbone of largescale applications in today’s data centers. The data set of the store on a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Among the open problems in P2P systems, support for nontrivial search predicates, standardized query languages, distributed query… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2004
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Digital trees, also known as tries, are a general purpose flexible data structure that implements dictionaries built on sets of… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A new internal array structure, called a double-array, implementing a trie structure is presented. The double-array combines the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
1989
1989
The Trie Hashing (TH), defined by Litwin, is one of the fastest access methods for dynamic and ordered files. The hashing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1984
1984
The trie data structure has many properties which make it especially attractive for representing large files of data. These… (More)
Is this relevant?
1979
1979
A trie is a digital search tree in which leaves correspond to records in a file. Searching proceeds from the root to a leaf… (More)
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?