Publication:4828995
From MaRDI portal
zbMath1093.68673MaRDI QIDQ4828995
Aristides Gionis, Mayur Datar, Rajeev Motwani, Piotr Indyk
Publication date: 29 November 2004
68Q25: Analysis of algorithms and problem complexity
68P05: Data structures
68W25: Approximation algorithms
68W27: Online algorithms; streaming algorithms
Related Items
Dynamically computing approximate frequency counts in sliding window over data stream, Optimal sampling from sliding windows, Streaming techniques and data aggregation in networks of tiny artefacts, Competitive analysis of maintaining frequent items of a stream, CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams, How to catch \(L_2\)-heavy-hitters on sliding windows, The frequent items problem, under polynomial decay, in the streaming model, Recent progress on selected topics in database research. -- A report by nine young Chinese researchers working in the United States., Fast and accurate mining of correlated heavy hitters, Distributed mining of time-faded heavy hitters, Challenges in benchmarking stream learning algorithms with real-world data, Multivariate network traffic analysis using clustered patterns, Efficient pebbling for list traversal synopses with application to program rollback, Linked-tree: An aggregate query algorithm based on sliding window over data stream
