A simpler and more efficient deterministic scheme for finding frequent items over sliding windows

Authors:
L. K. Lee;H. F. Ting
Affiliations:
The University of Hong Kong, Pokfulam, Hong Kong;The University of Hong Kong, Pokfulam, Hong Kong
Venue:
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2006

Citing 17
Cited 29

New sampling-based summary statistics for improving approximate query answers

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The space complexity of approximating the frequency moments

Journal of Computer and System Sciences
Data-streams and histograms

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Maintaining Stream Statistics over Sliding Windows

SIAM Journal on Computing
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries

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
Frequency Estimation of Internet Packet Streams with Limited Space

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A simple algorithm for finding frequent elements in streams and bags

ACM Transactions on Database Systems (TODS)
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
Clustering data streams

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice

ACM Transactions on Computer Systems (TOCS)
Identifying frequent items in sliding windows over on-line packet streams

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Dynamically maintaining frequent items over a data stream

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
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
Finding (Recently) Frequent Items in Distributed Data Streams

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Approximate counts and quantiles over sliding windows

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Maintaining significant stream statistics over sliding windows

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Time-decaying sketches for sensor data aggregation

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Finding frequent items in probabilistic data

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Time-decaying aggregates in out-of-order streams

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Mining frequent items in a stream using flexible windows

Intelligent Data Analysis - Knowledge Discovery from Data Streams
FIDS: Monitoring Frequent Items over Distributed Data Streams

MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
Finding Frequent Items in a Turnstile Data Stream

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Finding frequent items in data streams

Proceedings of the VLDB Endowment
A novel hash-based approach for mining frequent itemsets over data streams requiring less memory space

Data Mining and Knowledge Discovery
Optimal sampling from sliding windows

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deterministically Estimating Data Stream Frequencies

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Competitive Analysis of Aggregate Max in Windowed Streaming

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Online Evaluation of Patterns from Evolving Web Data Streams

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Methods for finding frequent items in data streams

The VLDB Journal — The International Journal on Very Large Data Bases
Finding frequent items over sliding windows with constant update time

Information Processing Letters
Aggregate computation over data streams

APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Finding heavy hitters over the sliding window of a weighted data stream

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Mining top-k frequent items in a data stream with flexible sliding windows

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining discriminative items in multiple data streams

World Wide Web
Time-decaying Sketches for Robust Aggregation of Sensor Data

SIAM Journal on Computing
Effective Computations on Sliding Windows

SIAM Journal on Computing
Space-efficient tracking of persistent items in a massive data stream

Proceedings of the 5th ACM international conference on Distributed event-based system
Discovering trending phrases on information streams

Proceedings of the 20th ACM international conference on Information and knowledge management
Approximating frequent items in asynchronous data stream over a sliding window

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Tracking distributed aggregates over time-based sliding windows

SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Differentially private continual monitoring of heavy hitters from distributed streams

PETS'12 Proceedings of the 12th international conference on Privacy Enhancing Technologies
SCALLA: A Platform for Scalable One-Pass Analytics Using MapReduce

ACM Transactions on Database Systems (TODS)
Improved counter based algorithms for frequent pairs mining in transactional data streams

ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Mining frequent items in data stream using time fading model

Information Sciences: an International Journal
Efficient frequent itemset mining methods over time-sensitive streams

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we give a simple scheme for identifying ε-approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on the distribution of the item frequencies. It supports O(1/ε) update and query time, and uses O(1/ε) space. It is very simple; its main data structures are just a few short queues whose entries store the position of some items in the sliding window. We also extend our scheme for variable-size window. This extended scheme uses O(1/ε log(εn)) space.