Prefix hash tree
 | The topic of this article may not meet Wikipedia's general notability guideline. (August 2013) |
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[edit]
- ^ "Solucionador de Puzzles usando Árboles Trie (Trie Trees o Prefix Trees)". 2016-09-16. Archived from the original on 2016-09-16. Retrieved 2022-09-12.
- ^ Sabir, Essaid; García Armada, Ana; Ghogho, Mounir; Debbah, Mérouane (2017-11-07). Ubiquitous Networking: Third International Symposium, UNet 2017, Casablanca, Morocco, May 9-12, 2017, Revised Selected Papers. Springer. ISBN 978-3-319-68179-5.
External links[edit]
- 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[edit]
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |