Sciweavers

2269 search results - page 46 / 454
» Query Incentive Networks
Sort
View
ICNP
2005
IEEE
14 years 2 months ago
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While i...
Hongbo Jiang, Shudong Jin
BTW
2007
Springer
142views Database» more  BTW 2007»
14 years 3 months ago
Algebraic Query Optimization for Distributed Top-k Queries
: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient alge...
Thomas Neumann, Sebastian Michel
CIKM
2004
Springer
14 years 2 months ago
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
Farnoush Banaei Kashani, Cyrus Shahabi
IDEAS
2006
IEEE
180views Database» more  IDEAS 2006»
14 years 3 months ago
SURCH: Distributed Aggregation over Wireless Sensor Networks
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...
Xingbo Yu, Sharad Mehrotra, Nalini Venkatasubraman...
PE
2008
Springer
120views Optimization» more  PE 2008»
13 years 9 months ago
A queueing approach to optimal resource replication in wireless sensor networks
We develop a queueing model for analyzing resource replication strategies in wireless sensor networks. The model can be used to minimize either the total transmission rate of the ...
Christopher R. Mann, Rusty O. Baldwin, Jeffrey P. ...