Prefix_hash_tree

Prefix hash tree

Prefix hash tree

Add article description

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

  1. [1]
    "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.
  2. [2]
    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.

See also

Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.
Share this article:

This article uses material from the Wikipedia article Prefix_hash_tree, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.