Prefix hash tree
From HandWiki
A prefix hash tree (PHT) is a distributed data structure that enables more sophisticated queries over a distributed hash table (DHT).[citation needed] The prefix hash tree uses the lookup interface of a DHT to construct a trie-based data structure that is both efficient (updates are doubly logarithmic in the size of the domain being indexed), and resilient (the failure of any given node in a prefix hash tree does not affect the availability of data stored at other nodes).[1][2]
References
- ↑ "Solucionador de Puzzles usando Árboles Trie (Trie Trees o Prefix Trees)". 2016-09-16. http://www.tecnohobby.net/ppal/index.php/programacion/java/35-solucionador-de-puzzles-usando-arboles-trie-trie-trees-o-prefix-trees.
- ↑ Sabir, Essaid; García Armada, Ana; Ghogho, Mounir; Debbah, Mérouane (2017-11-07) (in en). Ubiquitous Networking: Third International Symposium, UNet 2017, Casablanca, Morocco, May 9-12, 2017, Revised Selected Papers. Springer. ISBN 978-3-319-68179-5. https://books.google.com/books?id=9Yw9DwAAQBAJ&dq=Prefix+hash+tree&pg=PA311.
External links
- https://www.eecs.berkeley.edu/~sylvia/papers/pht.pdf - Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables
- http://pier.cs.berkeley.edu - PHT was developed as part of work on the PIER project.
See also
- Prefix tree
- P-Grid
 |  |
