Database Theory - ICDT 2005
From MaRDI portal
Publication:5316609
DOI10.1007/b104421zbMath1112.68371OpenAlexW4232873349MaRDI QIDQ5316609
No author found.
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
Related Items (18)
Measuring evolving data streams' behavior through their intrinsic dimension ⋮ Summary Data Structures for Massive Data ⋮ Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis ⋮ Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space ⋮ \textsf{LotterySampling}: a randomized algorithm for the heavy hitters and top-\(k\) problems in data streams ⋮ Memory-adaptive high utility sequential pattern mining over data streams ⋮ Top-\(k\) frequent items and item frequency tracking over sliding windows of any size ⋮ Unnamed Item ⋮ A general framework for never-ending learning from time series streams ⋮ Adaptively learning probabilistic deterministic automata from data streams ⋮ Deterministic Heavy Hitters with Sublinear Query Time ⋮ Memory-Efficient Structured Convex Optimization via Extreme Point Sampling ⋮ A time optimized scheme for top-\( k\) list maintenance over incomplete data streams ⋮ Simple, Robust and Optimal Ranking from Pairwise Comparisons ⋮ An evaluation study of clustering algorithms in the scope of user communities assessment ⋮ How to catch \(L_2\)-heavy-hitters on sliding windows ⋮ Space‐efficient tracking of persistent items in a massive data stream ⋮ A Space-Optimal Grammar Compression.
This page was built for publication: Database Theory - ICDT 2005
