The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Space-efficient online computation of quantile summaries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Distributed streams algorithms for sliding windows
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Maintaining Stream Statistics over Sliding Windows
SIAM Journal on Computing
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Proceedings of the 27th International Conference on Very Large Data Bases
Finding Frequent Items in Data Streams
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
What's hot and what's not: tracking most frequent items dynamically
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adaptive filters for continuous queries over distributed data streams
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Holistic aggregates in a networked world: distributed tracking of approximate quantiles
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
Supporting sliding window queries for continuous data streams
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
A geometric approach to monitoring threshold functions over distributed data streams
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Sketching asynchronous streams over a sliding window
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Communication-Efficient Tracking of Distributed Cumulative Triggers
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Approximate continuous querying over distributed streams
ACM Transactions on Database Systems (TODS)
The eternal sunshine of the sketch data structure
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maintaining time-decaying stream aggregates
Journal of Algorithms
A deterministic algorithm for summarizing asynchronous streams over a sliding window
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Finding heavy hitters over the sliding window of a weighted data stream
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Time-decaying Sketches for Robust Aggregation of Sensor Data
SIAM Journal on Computing
A workload characterization study of the 1998 World Cup Web site
IEEE Network: The Magazine of Global Internetworking
Privacy-preserving distributed monitoring of visit quantities
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Stream mining of frequent sets with limited memory
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Proceedings of the ACM SIGMOD Workshop on Databases and Social Networks
Resource/accuracy tradeoffs in software-defined measurement
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Report on the first workshop on innovative querying of streams
ACM SIGMOD Record
Mining frequent itemsets from sparse data streams in limited memory environments
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Identifying streaming frequent items in ad hoc time windows
Data & Knowledge Engineering
Data management research at the technical university of crete
ACM SIGMOD Record
| Hi-index | 0.00 |
While traditional data-management systems focus on evaluating single, ad-hoc queries over static data sets in a centralized setting, several emerging applications require (possibly, continuous) answers to queries on dynamic data that is widely distributed and constantly updated. Furthermore, such query answers often need to discount data that is "stale", and operate solely on a sliding window of recent data arrivals (e.g., data updates occurring over the last 24 hours). Such distributed data streaming applications mandate novel algorithmic solutions that are both time- and space-efficient (to manage high-speed data streams), and also communication-efficient (to deal with physical data distribution). In this paper, we consider the problem of complex query answering over distributed, high-dimensional data streams in the sliding-window model. We introduce a novel sketching technique (termed ECM-sketch) that allows effective summarization of streaming data over both time-based and count-based sliding windows with probabilistic accuracy guarantees. Our sketch structure enables point as well as inner-product queries, and can be employed to address a broad range of problems, such as maintaining frequency statistics, finding heavy hitters, and computing quantiles in the sliding-window model. Focusing on distributed environments, we demonstrate how ECM-sketches of individual, local streams can be composed to generate a (low-error) ECM-sketch summary of the order-preserving aggregation of all streams; furthermore, we show how ECM-sketches can be exploited for continuous monitoring of sliding-window queries over distributed streams. Our extensive experimental study with two real-life data sets validates our theoretical claims and verifies the effectiveness of our techniques. To the best of our knowledge, ours is the first work to address efficient, guaranteed-error complex query answering over distributed data streams in the sliding-window model.