Jump to content

Hash array mapped trie

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jrw@pobox.com (talk | contribs) at 19:38, 1 December 2007 (←Created page with 'An '''hash array mapped trie'''<ref>Bagwell, P. (2001) [http://lampwww.epfl.ch/papers/idealhashtrees.pdf Ideal Hash Trees]. Technical Report, 2001.</ref> is an impl...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

An hash array mapped trie[1] is an implementation of an associative array that combines the characteristics of a hash table and a trie.

References

  1. ^ Bagwell, P. (2001) Ideal Hash Trees. Technical Report, 2001.
Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Hash_array_mapped_trie&oldid=175111079"