Prefix hash tree

<h2 id="external-links">External links</h2>
<ul><li><a href="https://www.eecs.berkeley.edu/~sylvia/papers/pht.pdf">https://www.eecs.berkeley.edu/~sylvia/papers/pht.pdf</a> - Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables</li>
<li><a href="http://pier.cs.berkeley.edu">http://pier.cs.berkeley.edu</a> - PHT was developed as part of work on the PIER project.</li></ul>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Prefix_tree/cXNr0ScT">Prefix tree</a></li>
<li><a href="/facts/P-Grid/8TvXaMsU">P-Grid</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>"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. <a href="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" target="_blank">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</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>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. <a href="978-3-319-68179-5" target="_blank">978-3-319-68179-5</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

Prefix hash tree open-in-new

Prefix hash tree