Live briefing
Everything about Hash trie
Index of articles associated with the same name
In computer science, hash trie can refer to:Hash tree, a trie used to map hash values to keys A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory; the name is suggested by a similarity to a closed hash table A data structure which "combines features of hash tables and LC-tries in order to perform efficient lookups and updates" Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Hash trieA 5-minute orientation
- Skim a recent paper: Joint Specifics and Consistency Hash Learning for Large-Scale Cross-Modal RetrievalInfluential work since 2022
- Pick up a classic book: An introduction to computer scienceThe most-reprinted book on the subject
- Read the landmark paper: Deep Hash Learning for Remote Sensing Image RetrievalCited 121 times
- Go sideways: Data structureA closely related topic
- Go sideways: TrieA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Deep Hash Learning for Remote Sensing Image Retrieval
Semi-Paired Discrete Hashing: Learning Latent Hash Codes for Semi-Paired Cross-View Retrieval
Hierarchical and hash based naming with Compact Trie name management scheme for Vehicular Content Centric Networks
FlashTrie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie
An enhanced dynamic hash TRIE algorithm for lexicon search
Trie hashing with controlled load
A Lock-Free Hash Trie Design for Concurrent Tabled Logic Programs
A non-collision hash trie-tree based fast IP classification algorithm
🆕 Influential since 2022
Joint Specifics and Consistency Hash Learning for Large-Scale Cross-Modal Retrieval
Asymmetric Hash Code Learning for Remote Sensing Image Retrieval
Multiple instance relation graph reasoning for cross-modal hash retrieval
Hash-Based Remote Sensing Image Retrieval
Precision medical image hash retrieval by interpretability and feature fusion
📚 Books worth reading
An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
Fundamentals of data structures in CEllis Horowitz · 1993
An introduction to data structures with applicationsJean-Paul Tremblay, Paul Gordon Sorenson · 1976
Fundamentals of data structures in CEllis Horowitz · 2008
Data Structures Using C
Oxford Higher EducationReema Thareja · 2011
Data structuresRichard F Gilberg · 2001
প্রোগ্রামিং কনটেস্টমোঃ মাহবুবুল হাসান · 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Data structure In computer science, a data structure is a way to organize and store data that is usually chosen for efficient access to data. More precisely, a data structure…
- Trie In computer science, a trie (/ˈtraɪ/, /ˈtriː/ ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store…
- Hash tree (persistent data structure) In computer science, a hash tree (or hash trie) is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables…
- Ctrie A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent…
- Hash array mapped trie A hash array mapped trie (HAMT, /ˈhæmt/) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped…
- Radix tree In computer science, a radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie…
- HAT-trie The HAT-trie is a type of radix trie that uses array nodes to collect individual key–value pairs under radix nodes and hash buckets into an associative…
- Hash table In computer science, a hash table is a data structure that implements an associative array, also called a dictionary or simply map; an associative array…