C-trie

A C-trie is a compressed trie data structure. It achieves lower memory and query time requirements at the expense of reduced flexibility.
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2017
02419762017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
With recent advances in high-throughput cell biology, the amount of cellular biological data has grown drastically. Such data is… (More)
  • figure 1
  • figure 3
  • table 1
  • figure 2
  • figure 4
Is this relevant?
2017
2017
Name-based forwarding is a core component in information-centric networks. Designing scalable name-based forwarding solutions is… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 3
Is this relevant?
2016
2016
In this paper, we present a new data structure called the packed compact trie (packed c-trie) which stores a set S of k strings… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
2015
2015
With recent advances in highthroughput cell biology the amount of cellular biological data has grown drastically. Such data is… (More)
  • figure 1
  • table I
  • figure 2
  • figure 5
  • figure 3
Is this relevant?
2015
2015
Constraint solution reuse is an effective approach to save the time of constraint solving in symbolic execution. Most of the… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2015
2015
Trie tree, is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2009
2009
Knowledge bases can be represented as propositional Formulas. A query of such a theory typically has the form, Is a clause an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
We focus on the recently introduced nearest neighbor based entropy estimator from Kraskov, Stögbauer and Grassberger (KSG) [10… (More)
Is this relevant?
1997
1997
IP address lookup is becoming critical because of increasing routing table size, speed, and traac in the Internet. Our paper… (More)
Is this relevant?
1976
1976
This paper presents a new data structure, called a compressed trie or C-trie, to be used in information retrieval systems. It has… (More)
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?