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.

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2020

Packet classification is a essential process in network processors. In this process, the incoming packets are matched against a…

2017

Name-based forwarding is a core component in information-centric networks. Designing scalable name-based forwarding solutions is…

2016

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…

2014

In an internet routers packet classification is one of the challenging factors, which involve a multi-dimensional, search that to…

2014

Computing the frequency of small subgraphs on a large network is a computationally hard task. This is, however, an important…

2013

Packet classification is one of the most important enabling functions for network services. The previous trie-based hierarchical…

2008

The reduced implicate trie, introduced in [10], is a data structure that may be used as a target language for knowledge…

1995

1995

Let N records be stored in an M-dimensional trie (M-d trie). It is shown that under the symmetric Bernoulli model the variance of…