Sciweavers

1171 search results - page 100 / 235
» Streaming Queries over Streaming Data
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
13 years 10 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
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
14 years 5 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 11 months ago
Real-time ranking with concept drift using expert advice
In many practical applications, one is interested in generating a ranked list of items using information mined from continuous streams of data. For example, in the context of comp...
Hila Becker, Marta Arias
ECOI
2010
117views more  ECOI 2010»
13 years 10 months ago
Ensemble extraction for classification and detection of bird species
Advances in technology have enabled new approaches for sensing the environment and collecting data about the world. Once collected, sensor readings can be assembled into data stre...
Eric P. Kasten, Philip K. McKinley, Stuart H. Gage
WEBDB
2005
Springer
107views Database» more  WEBDB 2005»
14 years 4 months ago
Freshness-Aware Scheduling of Continuous Queries in the Dynamic Web
The dynamics of the Web and the demand for new, active services are imposing new requirements on Web servers. One such new service is the processing of continuous queries whose ou...
Mohamed A. Sharaf, Alexandros Labrinidis, Panos K....