Sciweavers

485 search results - page 43 / 97
» Processing complex aggregate queries over data streams
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
15 years 2 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
16 years 4 months ago
Characterizing and Exploiting Reference Locality in Data Stream Applications
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
Feifei Li, Ching Chang, George Kollios, Azer Besta...
CIKM
2011
Springer
14 years 3 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
DEBS
2007
ACM
15 years 7 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 3 months ago
Answering Aggregation Queries in a Secure System Model
As more sensitive data is captured in electronic form, security becomes more and more important. Data encryption is the main technique for achieving security. While in the past en...
Tingjian Ge, Stanley B. Zdonik