Algorithms and Computation

DOI10.1007/11602613MaRDI QIDQ5897883zbMATH OpenOpenAlexFDO

Authors Sumit Ganguly

Publication date 14 November 2006

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

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

Mathematics Subject Classification ID

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

Recommendations

• Counting distinct items over update streams
• scientific article; zbMATH DE number 2019620
• Probabilistic counting algorithms for data base applications
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Cited in

(7)

• On the I/O complexity of dynamic distinct counting
• Counting distinct items over update streams
• scientific article; zbMATH DE number 2019620 (Why is no real title available?)
• Deterministic \(k\)-set structure
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
• Efficient exact algorithm for count distinct problem

This page was built for publication: Algorithms and Computation

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