Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Wavelet synopses with error guarantees
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Gigascope: high performance network monitoring with an SQL interface
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Frequency Estimation of Internet Packet Streams with Limited Space
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Issues in data stream management
ACM SIGMOD Record
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Identifying frequent items in sliding windows over on-line packet streams
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
A Unified Framework for Monitoring Data Streams in Real Time
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Rank-aware query processing and optimization
Rank-aware query processing and optimization
User-defined aggregate functions: bridging theory and practice
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
On-the-fly sharing for streamed aggregation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Optimal workload-based weighted wavelet synopses
Theoretical Computer Science
On Construction of Holistic Synopses under the Duplicate Semantics of Streaming Queries
TIME '07 Proceedings of the 14th International Symposium on Temporal Representation and Reasoning
StatStream: statistical monitoring of thousands of data streams in real time
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Indexing and searching XML documents based on content and structure synopses
BNCOD'07 Proceedings of the 24th British national conference on Databases
Using a real-time top-k algorithm to mine the most frequent items over multiple streams
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
| Hi-index | 0.00 |
Queries that return a list of frequently occurring items are important in the analysis of real-time Internet packet streams. While several results exist for computing Top-k queries using limited memory in the infinite stream model (e.g., limited-memory sliding windows). To compute the statistics over a sliding window, a synopsis data structure can be maintained for the stream to compute the statistics rapidly. Usually, a Top-k query is always processed over an equal synopsis, but it's very hard to implement over an unequal synopsis because of the resulting inaccurate approximate answers. Therefore, in this paper, we focus on periodically refreshed Top-k queries over sliding windows on Internet traffic streams; we present a deterministic DSW (Dynamic Sub-Window) algorithm to support the processing of Top-k aggregate queries over an unequal synopsis and guarantee the accuracy of the approximation results.