<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Prefix_hash_tree</id>
	<title>Prefix hash tree - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Prefix_hash_tree"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Prefix_hash_tree&amp;action=history"/>
	<updated>2026-05-15T08:01:43Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=Prefix_hash_tree&amp;diff=6378&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;{{#seo: |title= Prefix hash tree. All about cryptocurrency - zaoniaoWiki |keywords=Prefix hash tree, hash, tree, prefix, PHT, DHT, structure, blockchain, function |description...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Prefix_hash_tree&amp;diff=6378&amp;oldid=prev"/>
		<updated>2019-06-28T09:48:44Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;{{#seo: |title= Prefix hash tree. All about cryptocurrency - zaoniaoWiki |keywords=Prefix hash tree, hash, tree, prefix, PHT, DHT, structure, blockchain, function |description...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{#seo:&lt;br /&gt;
|title= Prefix hash tree. All about cryptocurrency - zaoniaoWiki&lt;br /&gt;
|keywords=Prefix hash tree, hash, tree, prefix, PHT, DHT, structure, blockchain, function&lt;br /&gt;
|description=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.&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
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).&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
*https://www.eecs.berkeley.edu/~sylvia/papers/pht.pdf ''- Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables&lt;br /&gt;
*http://pier.cs.berkeley.edu ''- PHT was developed as part of work on the PIER project.&lt;br /&gt;
*http://www.tecnohobby.net/ppal/index.php/programacion/java/35-solucionador-de-puzzles-usando-arboles-trie-trie-trees-o-prefix-trees ''- Java implementation for searching words in a puzzle using a prefix tree.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
*[[Prefix tree]]&lt;br /&gt;
*[[P-Grid]]&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
[[Category:Data storage]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>