Sciweavers

14 search results - page 1 / 3
» Range Efficient Computation of F0 over Massive Data Streams
Sort
View
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 5 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 4 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
CGO
2006
IEEE
13 years 8 months ago
Profiling over Adaptive Ranges
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
Shashidhar Mysore, Banit Agrawal, Timothy Sherwood...
EDBTW
2006
Springer
13 years 8 months ago
Spatio-temporal Aggregates over Streaming Geospatial Image Data
Geospatial image data obtained by satellites and aircraft are increasingly important to a wide range of applications, such as disaster management, climatology, and environmental m...
Jie Zhang
PVLDB
2008
116views more  PVLDB 2008»
13 years 4 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