 | The topic of this article may not meet Misplaced Pages's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted. Find sources: "Prefix hash tree" – news · newspapers · books · scholar · JSTOR (August 2013) (Learn how and when to remove this message) |
A prefix hash tree (PHT) is a distributed data structure that enables more sophisticated queries over a distributed hash table (DHT). 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).
References
- "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
- 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
 | This algorithms or data structures-related article is a stub. You can help Misplaced Pages by expanding it. |