Sciweavers

1810 search results - page 189 / 362
» Networked Query Processing for Distributed Stream-Based Appl...
Sort
View
180
Voted
DPD
2010
153views more  DPD 2010»
15 years 2 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
WWW
2007
ACM
16 years 5 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
ACMICEC
2004
ACM
171views ECommerce» more  ACMICEC 2004»
15 years 10 months ago
Efficient integration of web services with distributed data flow and active mediation
This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted b...
David Liu, Jun Peng, Kincho H. Law, Gio Wiederhold
ICSNW
2004
Springer
188views Database» more  ICSNW 2004»
15 years 10 months ago
Peer Selection in Peer-to-Peer Networks with Semantic Topologies
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
Peter Haase, Ronny Siebes, Frank van Harmelen
TC
2011
15 years 10 hour ago
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
Xiang-Yang Li, Yajun Wang, Yu Wang