Database Theory - ICDT 2005

DOI10.1007/B104421MaRDI QIDQ5316609zbMATH OpenOpenAlexFDO

Authors

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104421

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20)

Recommendations

• On Finding Frequent Elements in a Data Stream
• Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
• Finding frequent items in data streams
• scientific article; zbMATH DE number 2086663
• New algorithms for heavy hitters in data streams (invited talk)

Cited in

(26)

• Memory-adaptive high utility sequential pattern mining over data streams
• A general framework for never-ending learning from time series streams
• A time optimized scheme for top-\( k\) list maintenance over incomplete data streams
• Effective and efficient top-\(k\) query processing over incomplete data streams
• Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
• How to Select the Top k Elements from Evolving Data?
• Finding Frequent Elements in Non-bursty Streams
• On Finding Frequent Elements in a Data Stream
• Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis
• Simple, Robust and Optimal Ranking from Pairwise Comparisons
• Adaptively learning probabilistic deterministic automata from data streams
• Space‐efficient tracking of persistent items in a massive data stream
• Deterministic heavy hitters with sublinear query time
• A space-optimal grammar compression
• Memory-efficient structured convex optimization via extreme point sampling
• Summary data structures for massive data
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• scientific article; zbMATH DE number 7765407 (Why is no real title available?)
• Efficiently answering top-k frequent term queries in temporal-categorical range
• Randomized counter-based algorithms for frequency estimation over data streams in O( N) space
• \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams
• Intermediate value linearizability: a quantitative correctness criterion
• Intermediate value linearizability: a quantitative correctness criterion
• How to catch \(L_2\)-heavy-hitters on sliding windows
• Measuring evolving data streams' behavior through their intrinsic dimension
• An evaluation study of clustering algorithms in the scope of user communities assessment

This page was built for publication: Database Theory - ICDT 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316609)