Hash trie: Difference between revisions
Content deleted Content added
Citation bot (talk | contribs) Alter: template type. | You can use this bot yourself. Report bugs here. | Suggested by AManWithNoPlan | All pages linked from cached copy of User:AManWithNoPlan/sandbox3 | via #UCB_webform_linked |
SMcCandlish (talk | contribs) link 1st not 2nd occurrence; SIA tag |
||
| Line 1: | Line 1: | ||
In [[computer science]], '''hash trie''' can refer to: |
In [[computer science]], '''hash trie''' can refer to: |
||
* [[Hash tree (persistent data structure)]], a trie used to map hash values to keys |
* [[Hash tree (persistent data structure)]], a [[trie]] used to map hash values to keys |
||
* A space-efficient implementation of a sparse |
* 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]].) <ref name=Liang1983/> {{Verify source|I believe the source doesn't reference a "hash trie", only "packed tries" and "indexed tries"|date=May 2009}} |
||
* A data structure which "combines features of hash tables and LC-tries (Least Compression tries) in order to perform efficient lookups and updates" <ref name=Roshan2004/> |
* A data structure which "combines features of hash tables and LC-tries (Least Compression tries) in order to perform efficient lookups and updates" <ref name=Roshan2004/> |
||
| Line 35: | Line 35: | ||
}}</ref> |
}}</ref> |
||
</references> |
</references> |
||
{{Set index article}} |
|||
[[Category:Trees (data structures)]] |
[[Category:Trees (data structures)]] |
||
Revision as of 19:44, 22 June 2024
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 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.) [1] [verification needed]
- A data structure which "combines features of hash tables and LC-tries (Least Compression tries) in order to perform efficient lookups and updates" [2]
See also
References
- ^ Liang, Frank Mark (June 1983), Word hy-phen-a-tion by com-pu-ter (Ph.D. thesis), Stanford University, retrieved 2010-03-28
- ^ Thomas, Roshan; Mark, Brian; Johnson, Tommy; Croall, James (2004), High-speed Legitimacy-based DDoS Packet Filtering with Network Processors: A Case Study and Implementation on the Intel IXP1200 (PDF), retrieved 2009-05-03
This article includes a list of related items that share the same name (or similar names).
If an internal link incorrectly led you here, you may wish to change the link to point directly to the intended article.
If an internal link incorrectly led you here, you may wish to change the link to point directly to the intended article.