Sciweavers

447 search results - page 43 / 90
» On the Distribution of Nodes in Distributed Hash Tables
Sort
View
DEXA
2004
Springer
91views Database» more  DEXA 2004»
15 years 3 months ago
Efficient Processing of Distributed Iceberg Semi-joins
The Iceberg SemiJoin (ISJ) of two datasets R and S returns the tuples in R which join with at least k tuples of S. The ISJ operator is essential in many practical applications incl...
Mohammed Kasim Imthiyaz, Dong Xiaoan, Panos Kalnis
NSDI
2004
15 years 1 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer
IPPS
1998
IEEE
15 years 4 months ago
ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets
In this paper, we present ScalParC (Scalable Parallel Classifier), a new parallel formulation of a decision tree based classification process. Like other state-of-the-art decision...
Mahesh V. Joshi, George Karypis, Vipin Kumar
PERCOM
2007
ACM
15 years 11 months ago
Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment
? Peer-to-peer is a popular distributed system. With the advancement in mobile technologies, mobile p2p has revealed its attraction. But, the resource constraints such as bandwidth...
Dewan Tanvir Ahmed, Shervin Shirmohammadi
FCSC
2007
131views more  FCSC 2007»
14 years 11 months ago
SONNET: subscription using path queries over structured overlay networks
Application-level content-based routing using XML is a key technology for decentralized publish/subscribe systems. In this paper, a new approach is proposed to support the efficien...
Weining Qian, Linhao Xu, Aoying Zhou, Minqi Zhou