Sciweavers

14 search results - page 2 / 3
» Implementing Range Queries with a Decentralized Balanced Tre...
Sort
View
SIGMOD
2004
ACM
95views Database» more  SIGMOD 2004»
14 years 5 months ago
Querying at Internet-Scale
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its comm...
Brent N. Chun, Joseph M. Hellerstein, Ryan Huebsch...
MST
2006
136views more  MST 2006»
13 years 4 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
13 years 11 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
DBISP2P
2004
Springer
162views Database» more  DBISP2P 2004»
13 years 10 months ago
CISS: An Efficient Object Clustering Framework for DHT-Based Peer-to-Peer Applications
Distributed Hash Tables (DHTs) have been widely adopted in many Internet-scale P2P systems. Emerging P2P applications such as massively multi player online games (MMOGs) and P2P ca...
Jinwon Lee, Hyonik Lee, Seungwoo Kang, Sungwon Pet...
SIGCOMM
2005
ACM
13 years 10 months ago
A case study in building layered DHT applications
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasa...