Sciweavers

1672 search results - page 150 / 335
» Optimizing Monitoring Queries over Distributed Data
Sort
View
TSP
2010
15 years 1 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 9 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
INFOCOM
2006
IEEE
16 years 13 days ago
Optimal Distributed Detection in Clustered Wireless Sensor Networks: The Weighted Median
− In a clustered, multi-hop sensor network, a large number of inexpensive, geographically-distributed sensor nodes each use their observations of the environment to make local ha...
Qingjiang Tian, Edward J. Coyle
VLDB
2006
ACM
147views Database» more  VLDB 2006»
16 years 6 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 6 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li