Sciweavers

49 search results - page 6 / 10
» Workload-Optimal Histograms on Streams
Sort
View
ICDCS
2009
IEEE
14 years 5 months ago
Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server
The growing popularity of hosted storage services and shared storage infrastructure in data centers is driving the recent interest in resource management and QoS in storage system...
Lanyue Lu, Peter J. Varman, Kshitij Doshi
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
14 years 8 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
PAKDD
2010
ACM
189views Data Mining» more  PAKDD 2010»
14 years 1 months ago
Subsequence Matching of Stream Synopses under the Time Warping Distance
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 9 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha
ICDE
2004
IEEE
259views Database» more  ICDE 2004»
14 years 10 months ago
Querying about the Past, the Present, and the Future in Spatio-Temporal
Moving objects (e.g., vehicles in road networks) continuously generate large amounts of spatio-temporal information in the form of data streams. Efficient management of such strea...
Jimeng Sun, Dimitris Papadias, Yufei Tao, Bin Liu