Skip to search formSkip to main contentSkip to account menu

Hash trie

In computer science, hash trie can refer to: * Hash tree (persistent data structure), a trie used to map hash values to keys * A space-efficient… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Computer scienceHash array mapped trieHash tableList of data structures

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Cache-Aware Lock-Free Concurrent Hash Tries
This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and… 
2017
2017
Analysis of Concurrent Lock-Free Hash Tries with Constant-Time Operations
Ctrie is a scalable concurrent non-blocking dictionary data structure, with good cache locality, and non-blocking linearizable… 
2014
2014
A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling
A critical component in the implementation of a concurrent tabling system is the design of the table space. One of the most… 
2012
2012
An enhanced dynamic hash TRIE algorithm for lexicon search
Information retrieval (IR) is essential to enterprise systems along with growing orders, customers and materials. In this article… 
2010
2010
A hash trie filter method for approximate string matching in genomic databases
In genomic databases, approximate string matching with k errors is often applied when searching genomic sequences, where k errors… 
2008
2008
A non-collision hash trie-tree based fast IP classification algorithm
With the development of network applications, routers must support such functions as firewalls, provision of QoS, traffic billing… 
Review
2006
Review
2006
Research on Multibit-Trie Tree IP Classification Algorithm
In this article, the authors survey the recent advances in the research of IP classification and introduce some of the typical… 
2004
2004
An absolute non-collision hash algorithm
In order to classify packet, a novel IP classification is proposed based the non-collision hash and jumping table trie-tree… 
2004
2004
Study on an absolute non-collision hash and jumping table IP classification algorithms
In order to classify packet, we propose a novel IP classification based the non-collision hash and jumping table trie-tree… 
2002
2002
A non-collision hash trie-tree based fast IP classification algorithm
With the development of network applications, routers must support such functions as firewalls, provision of QoS, traffic billing… 
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)