Skip to search formSkip to main contentSkip to account menu

Prefix hash tree

Known as: PHT, Prefix Hash Table 
A prefix hash tree (PHT) is a distributed data structure that enables more sophisticated queries over a distributed hash table (DHT). The prefix hash… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Uniform resource locator (URL) filtering is a fundamental technology for intrusion detection, HTTP proxies, content distribution… 
2011
2011
This paper presents a novel offset encoding scheme for memory-efficient IP address lookup, called Offset Encoded Trie (OET). Each… 
2011
2011
Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications over Peer-to-Peer networks. A… 
2009
2009
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for… 
2009
2009
In this paper we introduce an efficient strategy for discovering Web usage mining is the application of data mining techniques to… 
2008
2008
In this paper, we propose an efficient URL lookup algorithm for URL list-based web contents filtering systems. Converting a URL… 
2007
2007
IP telephony has become one of the most successful applications of the peer-to-peer paradigm. However, providing a scalable peer… 
2004
2004
The multiple melting behavior and the associated crystalline forms of poly(hexamethylene terephthalate) (PHT) in PHT–clay… 
1998
1998
The pancake problem concerns the number of prefix reversals ("flips") needed to sort the elements of an arbitrary permutation…