Hi:
As the official document describes, Kylin uses bitmap to achieve precise
count ( distinct) .
The premise is to map the content to a number using a specific hash
function. But, if we don't know how much cardinal number is ，how to confirm
the range of mapped numbers?
If the range is set too large, memory is wasted. And if it is set too
small, it is not enough.
[email protected]
