Efficient exact algorithm for count distinct problem

DOI10.1007/978-3-030-26831-2_5MaRDI QIDQ2175568zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 29 April 2020

Full work available at URL https://doi.org/10.1007/978-3-030-26831-2_5

zbMATH Keywords

analyticsbig datacardinality estimationclickstream analysisdatabasedistinct elements problemMPPperformance

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Computational aspects of data analysis and big data (68T09)

Recommendations

• Probabilistic counting algorithms for data base applications
• scientific article; zbMATH DE number 5763313
• scientific article; zbMATH DE number 2019620
• LogLog counting of large cardinalities (extended abstract)
• Algorithms and Computation

Cited in

(1)

• Arrays of distinct representatives --- a very simple NP-complete problem

This page was built for publication: Efficient exact algorithm for count distinct problem

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