Prefix hash tree

{{notability|date=August 2013}}

A prefix hash tree (PHT) is a distributed data structure that enables more sophisticated queries over a distributed hash table (DHT).{{cn|date=September 2022}} 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).{{Cite web |date=2016-09-16 |title=Solucionador de Puzzles usando Árboles Trie (Trie Trees o Prefix Trees) |url=http://www.tecnohobby.net/ppal/index.php/programacion/java/35-solucionador-de-puzzles-usando-arboles-trie-trie-trees-o-prefix-trees |archive-url=https://web.archive.org/web/20160916103018/http://www.tecnohobby.net/ppal/index.php/programacion/java/35-solucionador-de-puzzles-usando-arboles-trie-trie-trees-o-prefix-trees |archive-date=2016-09-16 |access-date=2022-09-12 }}{{Cite book |last1=Sabir |first1=Essaid |url=https://books.google.com/books?id=9Yw9DwAAQBAJ&dq=Prefix+hash+tree&pg=PA311 |title=Ubiquitous Networking: Third International Symposium, UNet 2017, Casablanca, Morocco, May 9-12, 2017, Revised Selected Papers |last2=García Armada|first2= Ana |author2-link=Ana García Armada |last3=Ghogho |first3=Mounir |last4=Debbah |first4=Mérouane |date=2017-11-07 |publisher=Springer |isbn=978-3-319-68179-5 |language=en}}