Estimating Cardinality for Arbitrarily Large Data Stream With Improved Memory Efficiency
مقال من تأليف: Xiao, Qingjun ; Luo, Junzhou ; Chen, Shigang ; Zhou, You ;
ملخص: Cardinality estimation is the task of determining the number of distinct elements (or the cardinality) in a data stream, under a stringent constraint that the input data stream can be scanned by just one single pass. This is a fundamental problem with many practical applications, such as traffic monitoring of high-speed networks and query optimization of Internet-scale database. To solve the problem, we propose an algorithm named HLL-TailCut, which implements the estimation standard error
لغة:
إنجليزية