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

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
 
Is this relevant?
2017
2017
Name-based forwarding is a core component in information-centric networks. Designing scalable name-based forwarding solutions is… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 3
Is this relevant?
2016
2016
We present a new data structure called the packed compact trie (packed c-trie) which stores a set S of k strings of total length… Expand
Is this relevant?
2014
2014
A wide range of applications require efficient management of sorted data on external storage. Recently, trie-based data… Expand
Is this relevant?
2014
2014
In an internet routers packet classification is one of the challenging factors, which involve a multi-dimensional, search that to… Expand
Is this relevant?
Review
2012
Review
2012
The IP address lookup has been a major challenge for Internet routers. This is accompanied with a background of advances in link… Expand
  • figure 1
  • figure 2
  • table I
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
IP address lookup is becoming critical because of increasing routing table size, speed, and traffic in the Internet. Our paper… Expand
  • table I
  • figure 1
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
1995
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… Expand
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?