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.

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…

2011

The research goal is to present the importance of cross-border cooperation in 21st century Europe. Highlighting the fact that…

2010

My bachelor´s work is called Piano work Ludwig van Beethoven in 1802-1812. These years are interesting because from 1802 he…

2008

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

1998

IP address lookup is becoming critical because of increasing routing table size, speed, and traffic in the Internet. Our paper…

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…