/root/doris/be/src/olap/hll.cpp

Source
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements.  See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership.  The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License.  You may obtain a copy of the License at
//
//   http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied.  See the License for the
// specific language governing permissions and limitations
// under the License.

#include "olap/hll.h"

#include <cmath>
#include <map>
#include <ostream>

#include "common/logging.h"
#include "util/coding.h"
#include "util/slice.h"

using std::string;
using std::stringstream;

namespace doris {
#include "common/compile_check_begin.h"
HyperLogLog::HyperLogLog(const Slice& src) {
    // When deserialize return false, we make this object a empty
    if (!deserialize(src)) {
        _type = HLL_DATA_EMPTY;
    }
}

// Convert explicit values to register format, and clear explicit values.
// NOTE: this function won't modify _type.
void HyperLogLog::_convert_explicit_to_register() {
    DCHECK(_type == HLL_DATA_EXPLICIT)
            << "_type(" << _type << ") should be explicit(" << HLL_DATA_EXPLICIT << ")";
    _registers = new uint8_t[HLL_REGISTERS_COUNT];
    memset(_registers, 0, HLL_REGISTERS_COUNT);
    for (auto value : _hash_set) {
        _update_registers(value);
    }
    // clear _hash_set
    vectorized::flat_hash_set<uint64_t>().swap(_hash_set);
}

// Change HLL_DATA_EXPLICIT to HLL_DATA_FULL directly, because HLL_DATA_SPARSE
// is implemented in the same way in memory with HLL_DATA_FULL.
void HyperLogLog::update(uint64_t hash_value) {
    switch (_type) {
    case HLL_DATA_EMPTY:
        _hash_set.insert(hash_value);
        _type = HLL_DATA_EXPLICIT;
        break;
    case HLL_DATA_EXPLICIT:
        if (_hash_set.size() < HLL_EXPLICIT_INT64_NUM) {
            _hash_set.insert(hash_value);
            break;
        }
        _convert_explicit_to_register();
        _type = HLL_DATA_FULL;
        // fall through
    case HLL_DATA_SPARSE:
    case HLL_DATA_FULL:
        _update_registers(hash_value);
        break;
    }
}

void HyperLogLog::merge(const HyperLogLog& other) {
    // fast path
    if (other._type == HLL_DATA_EMPTY) {
        return;
    }
    switch (_type) {
    case HLL_DATA_EMPTY: {
        // _type must change
        _type = other._type;
        switch (other._type) {
        case HLL_DATA_EXPLICIT:
            _hash_set = other._hash_set;
            break;
        case HLL_DATA_SPARSE:
        case HLL_DATA_FULL:
            _registers = new uint8_t[HLL_REGISTERS_COUNT];
            memcpy(_registers, other._registers, HLL_REGISTERS_COUNT);
            break;
        default:
            break;
        }
        break;
    }
    case HLL_DATA_EXPLICIT: {
        switch (other._type) {
        case HLL_DATA_EXPLICIT: {
            // Merge other's explicit values first, then check if the number is exceed
            // HLL_EXPLICIT_INT64_NUM. This is OK because the max value is 2 * 160.
            _hash_set.insert(other._hash_set.begin(), other._hash_set.end());
            if (_hash_set.size() > HLL_EXPLICIT_INT64_NUM) {
                _convert_explicit_to_register();
                _type = HLL_DATA_FULL;
            }
        } break;
        case HLL_DATA_SPARSE:
        case HLL_DATA_FULL:
            _convert_explicit_to_register();
            _merge_registers(other._registers);
            _type = HLL_DATA_FULL;
            break;
        default:
            break;
        }
        break;
    }
    case HLL_DATA_SPARSE:
    case HLL_DATA_FULL: {
        switch (other._type) {
        case HLL_DATA_EXPLICIT:
            for (auto hash_value : other._hash_set) {
                _update_registers(hash_value);
            }
            break;
        case HLL_DATA_SPARSE:
        case HLL_DATA_FULL:
            _merge_registers(other._registers);
            break;
        default:
            break;
        }
        break;
    }
    }
}

size_t HyperLogLog::max_serialized_size() const {
    switch (_type) {
    case HLL_DATA_EMPTY:
    default:
        return 1;
    case HLL_DATA_EXPLICIT:
        return 2 + _hash_set.size() * 8;
    case HLL_DATA_SPARSE:
    case HLL_DATA_FULL:
        return 1 + HLL_REGISTERS_COUNT;
    }
}

size_t HyperLogLog::serialize(uint8_t* dst) const {
    uint8_t* ptr = dst;
    switch (_type) {
    case HLL_DATA_EMPTY:
    default: {
        // When the _type is unknown, which may not happen, we encode it as
        // Empty HyperLogLog object.
        *ptr++ = HLL_DATA_EMPTY;
        break;
    }
    case HLL_DATA_EXPLICIT: {
        DCHECK(_hash_set.size() <= HLL_EXPLICIT_INT64_NUM)
                << "Number of explicit elements(" << _hash_set.size()
                << ") should be less or equal than " << HLL_EXPLICIT_INT64_NUM;
        *ptr++ = _type;
        *ptr++ = (uint8_t)_hash_set.size();
        for (auto hash_value : _hash_set) {
            encode_fixed64_le(ptr, hash_value);
            ptr += 8;
        }
        break;
    }
    case HLL_DATA_SPARSE:
    case HLL_DATA_FULL: {
        uint32_t num_non_zero_registers = 0;
        for (int i = 0; i < HLL_REGISTERS_COUNT; ++i) {
            num_non_zero_registers += (_registers[i] != 0);
        }

        // each register in sparse format will occupy 3bytes, 2 for index and
        // 1 for register value. So if num_non_zero_registers is greater than
        // 4K we use full encode format.
        if (num_non_zero_registers > HLL_SPARSE_THRESHOLD) {
            *ptr++ = HLL_DATA_FULL;
            memcpy(ptr, _registers, HLL_REGISTERS_COUNT);
            ptr += HLL_REGISTERS_COUNT;
        } else {
            *ptr++ = HLL_DATA_SPARSE;
            // 2-5(4 byte): number of registers
            encode_fixed32_le(ptr, num_non_zero_registers);
            ptr += 4;

            for (uint16_t i = 0; i < HLL_REGISTERS_COUNT; ++i) {
                if (_registers[i] == 0) {
                    continue;
                }
                // 2 bytes: register index
                // 1 byte: register value
                encode_fixed16_le(ptr, i);
                ptr += 2;
                *ptr++ = _registers[i];
            }
        }
        break;
    }
    }
    return ptr - dst;
}

bool HyperLogLog::is_valid(const Slice& slice) {
    if (slice.size < 1) {
        return false;
    }
    const uint8_t* ptr = (uint8_t*)slice.data;
    const uint8_t* end = (uint8_t*)slice.data + slice.size;
    auto type = (HllDataType)*ptr++;
    switch (type) {
    case HLL_DATA_EMPTY:
        break;
    case HLL_DATA_EXPLICIT: {
        if ((ptr + 1) > end) {
            return false;
        }
        uint8_t num_explicits = *ptr++;
        ptr += num_explicits * 8;
        break;
    }
    case HLL_DATA_SPARSE: {
        if ((ptr + 4) > end) {
            return false;
        }
        uint32_t num_registers = decode_fixed32_le(ptr);
        ptr += 4 + 3 * num_registers;
        break;
    }
    case HLL_DATA_FULL: {
        ptr += HLL_REGISTERS_COUNT;
        break;
    }
    default:
        return false;
    }
    return ptr == end;
}

// TODO(zc): check input string's length
bool HyperLogLog::deserialize(const Slice& slice) {
    // can be called only when type is empty
    DCHECK(_type == HLL_DATA_EMPTY);

    // NOTE(zc): Don't remove this check unless you known what
    // you are doing. Because of history bug, we ingest some
    // invalid HLL data in storage, which ptr is nullptr.
    // we must handle this case to avoid process crash.
    // This bug is in release 0.10, I think we can remove this
    // in release 0.12 or later.
    if (slice.data == nullptr || slice.size <= 0) {
        return false;
    }
    // check if input length is valid
    if (!is_valid(slice)) {
        return false;
    }

    const uint8_t* ptr = (uint8_t*)slice.data;
    // first byte : type
    _type = (HllDataType)*ptr++;
    switch (_type) {
    case HLL_DATA_EMPTY:
        break;
    case HLL_DATA_EXPLICIT: {
        // 2: number of explicit values
        // make sure that num_explicit is positive
        uint8_t num_explicits = *ptr++;
        // 3+: 8 bytes hash value
        for (int i = 0; i < num_explicits; ++i) {
            _hash_set.insert(decode_fixed64_le(ptr));
            ptr += 8;
        }
        break;
    }
    case HLL_DATA_SPARSE: {
        _registers = new uint8_t[HLL_REGISTERS_COUNT];
        memset(_registers, 0, HLL_REGISTERS_COUNT);
        // 2-5(4 byte): number of registers
        uint32_t num_registers = decode_fixed32_le(ptr);
        ptr += 4;
        for (uint32_t i = 0; i < num_registers; ++i) {
            // 2 bytes: register index
            // 1 byte: register value
            uint16_t register_idx = decode_fixed16_le(ptr);
            ptr += 2;
            _registers[register_idx] = *ptr++;
        }
        break;
    }
    case HLL_DATA_FULL: {
        _registers = new uint8_t[HLL_REGISTERS_COUNT];
        // 2+ : hll register value
        memcpy(_registers, ptr, HLL_REGISTERS_COUNT);
        break;
    }
    default:
        // revert type to EMPTY
        _type = HLL_DATA_EMPTY;
        return false;
    }
    return true;
}

int64_t HyperLogLog::estimate_cardinality() const {
    if (_type == HLL_DATA_EMPTY) {
        return 0;
    }
    if (_type == HLL_DATA_EXPLICIT) {
        return _hash_set.size();
    }

    const int num_streams = HLL_REGISTERS_COUNT;
    // Empirical constants for the algorithm.
    float alpha = 0;

    if (num_streams == 16) {
        alpha = 0.673F;
    } else if (num_streams == 32) {
        alpha = 0.697F;
    } else if (num_streams == 64) {
        alpha = 0.709F;
    } else {
        alpha = 0.7213F / (1 + 1.079F / num_streams);
    }

    float harmonic_mean = 0;
    int num_zero_registers = 0;

    for (int i = 0; i < HLL_REGISTERS_COUNT; ++i) {
        harmonic_mean += powf(2.0F, -_registers[i]);

        if (_registers[i] == 0) {
            ++num_zero_registers;
        }
    }

    harmonic_mean = 1.0F / harmonic_mean;
    double estimate = alpha * num_streams * num_streams * harmonic_mean;
    // according to HyperLogLog current correction, if E is cardinal
    // E =< num_streams * 2.5 , LC has higher accuracy.
    // num_streams * 2.5 < E , HyperLogLog has higher accuracy.
    // Generally , we can use HyperLogLog to produce value as E.
    if (estimate <= num_streams * 2.5 && num_zero_registers != 0) {
        // Estimated cardinality is too low. Hll is too inaccurate here, instead use
        // linear counting.
        estimate = num_streams *
                   log(static_cast<double>(num_streams) / static_cast<double>(num_zero_registers));
    } else if (num_streams == 16384 && estimate < 72000) {
        // when Linear Couint change to HyperLogLog according to HyperLogLog Correction,
        // there are relatively large fluctuations, we fixed the problem refer to redis.
        double bias = 5.9119 * 1.0e-18 * (estimate * estimate * estimate * estimate) -
                      1.4253 * 1.0e-12 * (estimate * estimate * estimate) +
                      1.2940 * 1.0e-7 * (estimate * estimate) - 5.2921 * 1.0e-3 * estimate +
                      83.3216;
        estimate -= estimate * (bias / 100);
    }
    return (int64_t)(estimate + 0.5);
}
#include "common/compile_check_end.h"
} // namespace doris

Coverage Report

Created: 2025-09-15 16:27

Line	Count	Source
1		// Licensed to the Apache Software Foundation (ASF) under one
2		// or more contributor license agreements. See the NOTICE file
3		// distributed with this work for additional information
4		// regarding copyright ownership. The ASF licenses this file
5		// to you under the Apache License, Version 2.0 (the
6		// "License"); you may not use this file except in compliance
7		// with the License. You may obtain a copy of the License at
8		//
9		// http://www.apache.org/licenses/LICENSE-2.0
10		//
11		// Unless required by applicable law or agreed to in writing,
12		// software distributed under the License is distributed on an
13		// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
14		// KIND, either express or implied. See the License for the
15		// specific language governing permissions and limitations
16		// under the License.
17
18		#include "olap/hll.h"
19
20		#include <cmath>
21		#include <map>
22		#include <ostream>
23
24		#include "common/logging.h"
25		#include "util/coding.h"
26		#include "util/slice.h"
27
28		using std::string;
29		using std::stringstream;
30
31		namespace doris {
32		#include "common/compile_check_begin.h"
33	1.26k	HyperLogLog::HyperLogLog(const Slice& src) {
34		// When deserialize return false, we make this object a empty
35	1.26k	if (!deserialize(src)) {
36	3	_type = HLL_DATA_EMPTY;
37	3	}
38	1.26k	}
39
40		// Convert explicit values to register format, and clear explicit values.
41		// NOTE: this function won't modify _type.
42	245	void HyperLogLog::_convert_explicit_to_register() {
43	245	DCHECK(_type == HLL_DATA_EXPLICIT)
44	0	<< "_type(" << _type << ") should be explicit(" << HLL_DATA_EXPLICIT << ")";
45	245	_registers = new uint8_t[HLL_REGISTERS_COUNT];
46	245	memset(_registers, 0, HLL_REGISTERS_COUNT);
47	39.1k	for (auto value : _hash_set) {
48	39.1k	_update_registers(value);
49	39.1k	}
50		// clear _hash_set
51	245	vectorized::flat_hash_set<uint64_t>().swap(_hash_set);
52	245	}
53
54		// Change HLL_DATA_EXPLICIT to HLL_DATA_FULL directly, because HLL_DATA_SPARSE
55		// is implemented in the same way in memory with HLL_DATA_FULL.
56	25.0M	void HyperLogLog::update(uint64_t hash_value) {
57	25.0M	switch (_type) {
58	27.5k	case HLL_DATA_EMPTY:
59	27.5k	_hash_set.insert(hash_value);
60	27.5k	_type = HLL_DATA_EXPLICIT;
61	27.5k	break;
62	11.3M	case HLL_DATA_EXPLICIT:
63	11.3M	if (_hash_set.size() < HLL_EXPLICIT_INT64_NUM) {
64	11.3M	_hash_set.insert(hash_value);
65	11.3M	break;
66	11.3M	}
67	227	_convert_explicit_to_register();
68	227	_type = HLL_DATA_FULL;
69		// fall through
70	228	case HLL_DATA_SPARSE:
71	13.7M	case HLL_DATA_FULL:
72	13.7M	_update_registers(hash_value);
73	13.7M	break;
74	25.0M	}
75	25.0M	}
76
77	24.3k	void HyperLogLog::merge(const HyperLogLog& other) {
78		// fast path
79	24.3k	if (other._type == HLL_DATA_EMPTY) {
80	312	return;
81	312	}
82	24.0k	switch (_type) {
83	16.9k	case HLL_DATA_EMPTY: {
84		// _type must change
85	16.9k	_type = other._type;
86	16.9k	switch (other._type) {
87	16.7k	case HLL_DATA_EXPLICIT:
88	16.7k	_hash_set = other._hash_set;
89	16.7k	break;
90	183	case HLL_DATA_SPARSE:
91	241	case HLL_DATA_FULL:
92	241	_registers = new uint8_t[HLL_REGISTERS_COUNT];
93	241	memcpy(_registers, other._registers, HLL_REGISTERS_COUNT);
94	241	break;
95	0	default:
96	0	break;
97	16.9k	}
98	16.9k	break;
99	16.9k	}
100	16.9k	case HLL_DATA_EXPLICIT: {
101	1.80k	switch (other._type) {
102	1.80k	case HLL_DATA_EXPLICIT: {
103		// Merge other's explicit values first, then check if the number is exceed
104		// HLL_EXPLICIT_INT64_NUM. This is OK because the max value is 2 * 160.
105	1.80k	_hash_set.insert(other._hash_set.begin(), other._hash_set.end());
106	1.80k	if (_hash_set.size() > HLL_EXPLICIT_INT64_NUM) {
107	8	_convert_explicit_to_register();
108	8	_type = HLL_DATA_FULL;
109	8	}
110	1.80k	} break;
111	0	case HLL_DATA_SPARSE:
112	1	case HLL_DATA_FULL:
113	1	_convert_explicit_to_register();
114	1	_merge_registers(other._registers);
115	1	_type = HLL_DATA_FULL;
116	1	break;
117	0	default:
118	0	break;
119	1.80k	}
120	1.80k	break;
121	1.80k	}
122	1.80k	case HLL_DATA_SPARSE:
123	5.27k	case HLL_DATA_FULL: {
124	5.27k	switch (other._type) {
125	5.27k	case HLL_DATA_EXPLICIT:
126	5.37k	for (auto hash_value : other._hash_set) {
127	5.37k	_update_registers(hash_value);
128	5.37k	}
129	5.27k	break;
130	0	case HLL_DATA_SPARSE:
131	2	case HLL_DATA_FULL:
132	2	_merge_registers(other._registers);
133	2	break;
134	0	default:
135	0	break;
136	5.27k	}
137	5.27k	break;
138	5.27k	}
139	24.0k	}
140	24.0k	}
141
142	33.5k	size_t HyperLogLog::max_serialized_size() const {
143	33.5k	switch (_type) {
144	722	case HLL_DATA_EMPTY:
145	722	default:
146	722	return 1;
147	32.5k	case HLL_DATA_EXPLICIT:
148	32.5k	return 2 + _hash_set.size() * 8;
149	2	case HLL_DATA_SPARSE:
150	242	case HLL_DATA_FULL:
151	242	return 1 + HLL_REGISTERS_COUNT;
152	33.5k	}
153	33.5k	}
154
155	33.3k	size_t HyperLogLog::serialize(uint8_t* dst) const {
156	33.3k	uint8_t* ptr = dst;
157	33.3k	switch (_type) {
158	716	case HLL_DATA_EMPTY:
159	716	default: {
160		// When the _type is unknown, which may not happen, we encode it as
161		// Empty HyperLogLog object.
162	716	*ptr++ = HLL_DATA_EMPTY;
163	716	break;
164	716	}
165	32.4k	case HLL_DATA_EXPLICIT: {
166	32.4k	DCHECK(_hash_set.size() <= HLL_EXPLICIT_INT64_NUM)
167	0	<< "Number of explicit elements(" << _hash_set.size()
168	0	<< ") should be less or equal than " << HLL_EXPLICIT_INT64_NUM;
169	32.4k	*ptr++ = _type;
170	32.4k	*ptr++ = (uint8_t)_hash_set.size();
171	115k	for (auto hash_value : _hash_set) {
172	115k	encode_fixed64_le(ptr, hash_value);
173	115k	ptr += 8;
174	115k	}
175	32.4k	break;
176	716	}
177	1	case HLL_DATA_SPARSE:
178	243	case HLL_DATA_FULL: {
179	243	uint32_t num_non_zero_registers = 0;
180	3.98M	for (int i = 0; i < HLL_REGISTERS_COUNT; ++i) {
181	3.98M	num_non_zero_registers += (_registers[i] != 0);
182	3.98M	}
183
184		// each register in sparse format will occupy 3bytes, 2 for index and
185		// 1 for register value. So if num_non_zero_registers is greater than
186		// 4K we use full encode format.
187	243	if (num_non_zero_registers > HLL_SPARSE_THRESHOLD) {
188	58	*ptr++ = HLL_DATA_FULL;
189	58	memcpy(ptr, _registers, HLL_REGISTERS_COUNT);
190	58	ptr += HLL_REGISTERS_COUNT;
191	185	} else {
192	185	*ptr++ = HLL_DATA_SPARSE;
193		// 2-5(4 byte): number of registers
194	185	encode_fixed32_le(ptr, num_non_zero_registers);
195	185	ptr += 4;
196
197	3.03M	for (uint16_t i = 0; i < HLL_REGISTERS_COUNT; ++i) {
198	3.03M	if (_registers[i] == 0) {
199	2.80M	continue;
200	2.80M	}
201		// 2 bytes: register index
202		// 1 byte: register value
203	229k	encode_fixed16_le(ptr, i);
204	229k	ptr += 2;
205	229k	*ptr++ = _registers[i];
206	229k	}
207	185	}
208	243	break;
209	1	}
210	33.3k	}
211	33.3k	return ptr - dst;
212	33.3k	}
213
214	30.8k	bool HyperLogLog::is_valid(const Slice& slice) {
215	30.8k	if (slice.size < 1) {
216	1	return false;
217	1	}
218	30.8k	const uint8_t* ptr = (uint8_t*)slice.data;
219	30.8k	const uint8_t* end = (uint8_t*)slice.data + slice.size;
220	30.8k	auto type = (HllDataType)*ptr++;
221	30.8k	switch (type) {
222	745	case HLL_DATA_EMPTY:
223	745	break;
224	29.8k	case HLL_DATA_EXPLICIT: {
225	29.8k	if ((ptr + 1) > end) {
226	1	return false;
227	1	}
228	29.8k	uint8_t num_explicits = *ptr++;
229	29.8k	ptr += num_explicits * 8;
230	29.8k	break;
231	29.8k	}
232	188	case HLL_DATA_SPARSE: {
233	188	if ((ptr + 4) > end) {
234	1	return false;
235	1	}
236	187	uint32_t num_registers = decode_fixed32_le(ptr);
237	187	ptr += 4 + 3 * num_registers;
238	187	break;
239	188	}
240	60	case HLL_DATA_FULL: {
241	60	ptr += HLL_REGISTERS_COUNT;
242	60	break;
243	188	}
244	3	default:
245	3	return false;
246	30.8k	}
247	30.8k	return ptr == end;
248	30.8k	}
249
250		// TODO(zc): check input string's length
251	30.8k	bool HyperLogLog::deserialize(const Slice& slice) {
252		// can be called only when type is empty
253	30.8k	DCHECK(_type == HLL_DATA_EMPTY);
254
255		// NOTE(zc): Don't remove this check unless you known what
256		// you are doing. Because of history bug, we ingest some
257		// invalid HLL data in storage, which ptr is nullptr.
258		// we must handle this case to avoid process crash.
259		// This bug is in release 0.10, I think we can remove this
260		// in release 0.12 or later.
261	30.8k	if (slice.data == nullptr \|\| slice.size <= 0) {
262	1	return false;
263	1	}
264		// check if input length is valid
265	30.8k	if (!is_valid(slice)) {
266	2	return false;
267	2	}
268
269	30.8k	const uint8_t* ptr = (uint8_t*)slice.data;
270		// first byte : type
271	30.8k	_type = (HllDataType)*ptr++;
272	30.8k	switch (_type) {
273	743	case HLL_DATA_EMPTY:
274	743	break;
275	29.8k	case HLL_DATA_EXPLICIT: {
276		// 2: number of explicit values
277		// make sure that num_explicit is positive
278	29.8k	uint8_t num_explicits = *ptr++;
279		// 3+: 8 bytes hash value
280	128k	for (int i = 0; i < num_explicits; ++i) {
281	98.3k	_hash_set.insert(decode_fixed64_le(ptr));
282	98.3k	ptr += 8;
283	98.3k	}
284	29.8k	break;
285	0	}
286	186	case HLL_DATA_SPARSE: {
287	186	_registers = new uint8_t[HLL_REGISTERS_COUNT];
288	186	memset(_registers, 0, HLL_REGISTERS_COUNT);
289		// 2-5(4 byte): number of registers
290	186	uint32_t num_registers = decode_fixed32_le(ptr);
291	186	ptr += 4;
292	230k	for (uint32_t i = 0; i < num_registers; ++i) {
293		// 2 bytes: register index
294		// 1 byte: register value
295	230k	uint16_t register_idx = decode_fixed16_le(ptr);
296	230k	ptr += 2;
297	230k	_registers[register_idx] = *ptr++;
298	230k	}
299	186	break;
300	0	}
301	58	case HLL_DATA_FULL: {
302	58	_registers = new uint8_t[HLL_REGISTERS_COUNT];
303		// 2+ : hll register value
304	58	memcpy(_registers, ptr, HLL_REGISTERS_COUNT);
305	58	break;
306	0	}
307	0	default:
308		// revert type to EMPTY
309	0	_type = HLL_DATA_EMPTY;
310	0	return false;
311	30.8k	}
312	30.8k	return true;
313	30.8k	}
314
315	17.3k	int64_t HyperLogLog::estimate_cardinality() const {
316	17.3k	if (_type == HLL_DATA_EMPTY) {
317	578	return 0;
318	578	}
319	16.7k	if (_type == HLL_DATA_EXPLICIT) {
320	16.5k	return _hash_set.size();
321	16.5k	}
322
323	253	const int num_streams = HLL_REGISTERS_COUNT;
324		// Empirical constants for the algorithm.
325	253	float alpha = 0;
326
327	253	if (num_streams == 16) {
328	0	alpha = 0.673F;
329	253	} else if (num_streams == 32) {
330	0	alpha = 0.697F;
331	253	} else if (num_streams == 64) {
332	0	alpha = 0.709F;
333	253	} else {
334	253	alpha = 0.7213F / (1 + 1.079F / num_streams);
335	253	}
336
337	253	float harmonic_mean = 0;
338	253	int num_zero_registers = 0;
339
340	4.14M	for (int i = 0; i < HLL_REGISTERS_COUNT; ++i) {
341	4.14M	harmonic_mean += powf(2.0F, -_registers[i]);
342
343	4.14M	if (_registers[i] == 0) {
344	3.11M	++num_zero_registers;
345	3.11M	}
346	4.14M	}
347
348	253	harmonic_mean = 1.0F / harmonic_mean;
349	253	double estimate = alpha * num_streams * num_streams * harmonic_mean;
350		// according to HyperLogLog current correction, if E is cardinal
351		// E =< num_streams * 2.5 , LC has higher accuracy.
352		// num_streams * 2.5 < E , HyperLogLog has higher accuracy.
353		// Generally , we can use HyperLogLog to produce value as E.
354	253	if (estimate <= num_streams * 2.5 && num_zero_registers != 0) {
355		// Estimated cardinality is too low. Hll is too inaccurate here, instead use
356		// linear counting.
357	223	estimate = num_streams *
358	223	log(static_cast<double>(num_streams) / static_cast<double>(num_zero_registers));
359	223	} else if (num_streams == 16384 && estimate < 72000) {
360		// when Linear Couint change to HyperLogLog according to HyperLogLog Correction,
361		// there are relatively large fluctuations, we fixed the problem refer to redis.
362	8	double bias = 5.9119 * 1.0e-18 * (estimate * estimate * estimate * estimate) -
363	8	1.4253 * 1.0e-12 * (estimate * estimate * estimate) +
364	8	1.2940 * 1.0e-7 * (estimate * estimate) - 5.2921 * 1.0e-3 * estimate +
365	8	83.3216;
366	8	estimate -= estimate * (bias / 100);
367	8	}
368	253	return (int64_t)(estimate + 0.5);
369	16.7k	}
370		#include "common/compile_check_end.h"
371		} // namespace doris