316 search results - page 3 / 64 » Top-K aggregation queries over large networks |
PODS
2005
ACM
14 years 5 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
IDEAS
2006
IEEE
13 years 11 months ago
2006
IEEE
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...
PODS
2001
ACM
14 years 5 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
WMCSA
2002
IEEE
13 years 10 months ago
2002
IEEE
We show how the database community’s notion of a generic query interface for data aggregation can be applied to ad-hoc networks of sensor devices. As has been noted in the senso...
ICDE
2012
IEEE
11 years 8 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...