750 search results - page 30 / 150 » Aggregates in Possibilistic Databases |
IDEAS
2006
IEEE
14 years 1 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...
ICDT
2001
ACM
13 years 12 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
VLDB
2004
ACM
14 years 23 days ago
2004
ACM
We consider the problem of resource sharing when processing large numbers of continuous queries. We specifically address sliding-window aggregates over data streams, an important...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...