Sciweavers

15 search results - page 2 / 3
» Continuous multi-way joins over distributed hash tables
Sort
View
AINA
2007
IEEE
13 years 11 months ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...
INFOCOM
2006
IEEE
13 years 10 months ago
SmartSeer: Using a DHT to Process Continuous Queries Over Peer-to-Peer Networks
— As the academic world moves away from physical journals and proceedings towards online document repositories, the ability to efficiently locate work of interest among the torr...
Jayanthkumar Kannan, Beverly Yang, Scott Shenker, ...
PERCOM
2006
ACM
14 years 4 months ago
Performance Analysis of Stealth DHT with Mobile Nodes
The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes co...
Andrew MacQuire, Andrew Brampton, Idris A. Rai, La...
GLOBECOM
2010
IEEE
13 years 2 months ago
Analysis of Messaging Load in a P2PP Overlay Network under Churn
We analyze the performance of a DHT-based P2P overlay network in resource access and overlay maintenance activities. We use a cross-platform implementation of the protocol called P...
Otso Kassinen, Erkki Harjula, Mika Ylianttila
SIGMOD
2004
ACM
95views Database» more  SIGMOD 2004»
14 years 4 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...