Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,235,072 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Data structure
Distributed hash table
List of data structures
Radix tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
FARIS: Fast and Memory-Efficient URL Filter by Domain Specific Machine
Yuuki Takano
,
Ryosuke Miura
International Conference on IT Convergence and…
2016
Corpus ID: 16477670
Uniform resource locator (URL) filtering is a fundamental technology for intrusion detection, HTTP proxies, content distribution…
Expand
2011
2011
Offset addressing approach to memory-efficient IP address lookup
Kun Huang
,
Gaogang Xie
,
Yanbiao Li
,
A. Liu
Proceedings IEEE INFOCOM
2011
Corpus ID: 3619283
This paper presents a novel offset encoding scheme for memory-efficient IP address lookup, called Offset Encoded Trie (OET). Each…
Expand
2011
2011
A Tabu Based Cache to Improve Latency and Load Balancing on Prefix Trees
Nicolás Hidalgo
,
L. Arantes
,
Pierre Sens
,
Xavier Bonnaire
IEEE 17th International Conference on Parallel…
2011
Corpus ID: 14665351
Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications over Peer-to-Peer networks. A…
Expand
2009
2009
DHT-Based Range Query Processing for Web Service Discovery
Yiming Zhang
,
Ling Liu
,
Dongsheng Li
,
Feng Liu
,
Xicheng Lu
IEEE International Conference on Web Services
2009
Corpus ID: 15772260
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for…
Expand
2009
2009
Mining Constraint-based Multidimensional Frequent Sequential Pattern in Web Logs
S. Vijayalakshmi
,
V. Mohan
,
S. Raja
2009
Corpus ID: 6896009
In this paper we introduce an efficient strategy for discovering Web usage mining is the application of data mining techniques to…
Expand
2008
2008
Fast URL Lookup Using URL Prefix Hash Tree
C. Park
,
Sun-Young Hwang
2008
Corpus ID: 63084318
In this paper, we propose an efficient URL lookup algorithm for URL list-based web contents filtering systems. Converting a URL…
Expand
2008
2008
Pancake Flipping with Two Spatulas
Mahfuza Sharmin
,
Rukhsana Yeasmin
,
M. Hasan
,
Atif Rahman
,
Mohammad Sohel Rahman
Electron. Notes Discret. Math.
2008
Corpus ID: 14756710
2007
2007
Extended Prefix Hash Trees for a distributed phone book application
Fabian Stäber
,
Gerald Kunzmann
,
J. Müller
International Conference on Parallel and…
2007
Corpus ID: 13874697
IP telephony has become one of the most successful applications of the peer-to-peer paradigm. However, providing a scalable peer…
Expand
2004
2004
Effects of layered silicates on the confined crystalline morphology of poly(hexamethylene terephthalate)
A. Ghosh
,
E. Woo
2004
Corpus ID: 55367492
The multiple melting behavior and the associated crystalline forms of poly(hexamethylene terephthalate) (PHT) in PHT–clay…
Expand
1998
1998
Pancake problems with restricted prefix reversals and some corresponding Cayley networks
D. Bass
,
I. H. Sudborough
Proceedings of the International Conference on…
1998
Corpus ID: 262570282
The pancake problem concerns the number of prefix reversals ("flips") needed to sort the elements of an arbitrary permutation…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE