Sciweavers

606 search results - page 62 / 122
» Memory-constrained aggregate computation over data streams
Sort
View
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 8 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
162
Voted
PVLDB
2008
182views more  PVLDB 2008»
15 years 3 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
122
Voted
ICALP
2007
Springer
15 years 9 months ago
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
Sudipto Guha, Andrew McGregor
152
Voted
CLUSTER
2005
IEEE
15 years 9 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
113
Voted
ICPPW
2006
IEEE
15 years 9 months ago
A First Look at the Properties of Many-to-One Data Flows
With the rapid emergence of peer-to-peer applications, more and more applications will generate many-to-one rather than one-to-one traffic flows. While a number of previous works ...
V. T. Sam, P. Y. Ho, Jack Y. B. Lee