Ternary search tree

Known as: Ternary search trie, Ternary search tries 
In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1997-2018
012319972018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
To fast detect abrupt change from large-scale time series, we propose an improved method based on the Ternary Search Tree and… (More)
  • table 1
  • table 3
  • table 2
Is this relevant?
2014
2014
We study protected nodes in m-ary search trees, by putting them in context of generalised Pólya urns. We show that the number of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2009
2009
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2008
2008
We consider a model of random trees similar to the split trees of Devroye (SIAM J. Comput. 28(2), 409–432, 1998) in which a set… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2006
2006
This paper introduces an adaptive, language independent, and 'built-in error pattern free' spell checker. Proposed system… (More)
  • figure 3
  • figure 2
  • figure 7
  • figure 4
  • figure 8
Is this relevant?
2005
2005
A Ternary Search Trie (TST) is a highly efficient dynamic dictionary structure applicable for strings and textual data. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2005
2005
A <i>Ternary Search Trie</i> (TST) is a highly efficient dynamic dictionary structure applicable for strings and textual data… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 5
  • figure 3
Is this relevant?
2004
2004
We use Patricia tries to represent textual and spatial data, and present a range search algorithm for reporting all k-d records… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Search engines have become the primary means of accessing information on the Web. However, recent studies show misspelled words… (More)
  • figure 1
  • figure 2
  • table 1
  • table 1
  • table 2
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?