Sciweavers

494 search results - page 39 / 99
» Approximate continuous querying over distributed streams
Sort
View
DC
2008
13 years 9 months ago
Sketching asynchronous data streams over sliding windows
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
Bojian Xu, Srikanta Tirthapura, Costas Busch
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
14 years 4 months ago
CoTS: A Scalable Framework for Parallelizing Frequency Counting over Data Streams
Applications involving analysis of data streams have gained significant popularity and importance. Frequency counting, frequent elements and top-k queries form a class of operato...
Sudipto Das, Shyam Antony, Divyakant Agrawal, Amr ...
DASFAA
2010
IEEE
179views Database» more  DASFAA 2010»
14 years 4 months ago
Scalable Splitting of Massive Data Streams
Scalable execution of continuous queries over massive data streams often requires splitting input streams into parallel sub-streams over which query operators are executed in paral...
Erik Zeitler, Tore Risch
DASFAA
2007
IEEE
178views Database» more  DASFAA 2007»
14 years 4 months ago
ClusterSheddy : Load Shedding Using Moving Clusters over Spatio-temporal Data Streams
Abstract. Moving object environments are characterized by large numbers of objects continuously sending location updates. At times, data arrival rates may spike up, causing the loa...
Rimma V. Nehme, Elke A. Rundensteiner
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 11 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