133 search results - page 2 / 27 » Ad-hoc Top-k Query Answering for Data Streams |
WWW
2006
ACM
14 years 6 months ago
2006
ACM
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
CORR
2010
Springer
13 years 8 days ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
DAWAK
2007
Springer
13 years 11 months ago
2007
Springer
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...
VLDB
2003
ACM
14 years 5 months ago
2003
ACM
Recent work on querying data streams has focused on systems where newly arriving data is processed and continuously streamed to the user in real time. In many emerging applications...