Sciweavers

223 search results - page 13 / 45
» Approximate Frequency Counts over Data Streams
Sort
View
PODS
2006
ACM
108views Database» more  PODS 2006»
15 years 9 months ago
Deterministic k-set structure
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
Sumit Ganguly, Anirban Majumder
EDBT
2008
ACM
137views Database» more  EDBT 2008»
15 years 9 months ago
Optimizing away joins on data streams
Abstract. Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. Often, such streaming aggregation queries involve joining...
Lukasz Golab, Theodore Johnson, Nick Koudas, Dives...
ACIIDS
2009
IEEE
144views Database» more  ACIIDS 2009»
15 years 2 months ago
Processing Exact Results for Sliding Window Joins over Time-Sequence, Streaming Data Using a Disk Archive
— We consider the problem of processing exact results for sliding window joins over data streams with limited memory. Existing approaches deal with memory limitations by shedding...
Abhirup Chakraborty, Ajit Singh
ICDCS
2007
IEEE
15 years 1 months ago
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
Manish Bhide, Krithi Ramamritham, Mukund Agrawal
EDBT
2004
ACM
122views Database» more  EDBT 2004»
15 years 9 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...