Skip to search formSkip to main contentSkip to account menu

Trie

Known as: B-trie, Digital tree, Tree (disambiguation) 
In computer science, a trie, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is a kind of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Aho–Corasick algorithmAuxiliary memoryB-treeBinary search algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Constraint-Based Measures for DNA Sequence Mining using Group Search Optimization Algorithm
In this paper, we propose a 3-step DNA sequence mining algorithm, called 3s-DNASM, incorporating prefix span, length and width… 
Highly Cited
2014
Highly Cited
2014
On Adding Bloom Filters to Longest Prefix Matching Algorithms
High-speed IP address lookup is essential to achieve wire-speed packet forwarding in Internet routers. Ternary content… 
Highly Cited
2012
Highly Cited
2012
PDDRA: A new pre-fetching based dynamic data replication algorithm in data grids
2008
2008
Cooperative XPath caching
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching… 
Highly Cited
2007
Highly Cited
2007
Cache-conscious frequent pattern mining on modern and emerging processors
Algorithms are typically designed to exploit the current state of the art in processor technology. However, as processor… 
Highly Cited
2006
Highly Cited
2006
Chisel: A Storage-efficient, Collision-free Hash-based Network Processing Architecture
Longest prefix matching (LPM) is a fundamental part of various network processing tasks. Previously proposed approaches for LPM… 
Highly Cited
2004
Highly Cited
2004
Floating-point multiply-add-fused with reduced latency
We propose architecture for the computation of the double-precision floating-point multiply-add-fused (MAP) operation A + (B /spl… 
Highly Cited
2003
Highly Cited
2003
Ascending frequency ordered prefix-tree: efficient mining of frequent patterns
Mining frequent patterns is a fundamental and important problem in many data mining applications. Many of the algorithms adopt… 
Highly Cited
2003
Highly Cited
2003
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding… 
Highly Cited
1981
Highly Cited
1981
Listric Normal Faults
The importance of listric normal faults in the formation of sedimentary basins is becoming increasingly more obvious. Based on… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)