Sciweavers

494 search results - page 59 / 99
» Approximate continuous querying over distributed streams
Sort
View
VLDB
2007
ACM
141views Database» more  VLDB 2007»
14 years 10 months ago
Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianc...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 10 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
14 years 11 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
ICDM
2007
IEEE
158views Data Mining» more  ICDM 2007»
14 years 4 months ago
On Appropriate Assumptions to Mine Data Streams: Analysis and Practice
Recent years have witnessed an increasing number of studies in stream mining, which aim at building an accurate model for continuously arriving data. Somehow most existing work ma...
Jing Gao, Wei Fan, Jiawei Han
SSDBM
2006
IEEE
139views Database» more  SSDBM 2006»
14 years 3 months ago
Sampling Trajectory Streams with Spatiotemporal Criteria
Monitoring movement of high-dimensional points is essential for environmental databases, geospatial applications, and biodiversity informatics as it reveals crucial information ab...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...