- 22 5月, 2017 5 次提交
-
-
由 Alexey Zatelepin 提交于
-
由 Vitaliy Lyudvichenko 提交于
-
由 Vitaliy Lyudvichenko 提交于
-
由 Alexey Milovidov 提交于
-
由 Alexey Milovidov 提交于
-
- 20 5月, 2017 8 次提交
-
-
由 Vitaliy Lyudvichenko 提交于
* Fix wrong implementation of CastTypeBlockInputStream. [#CLICKHOUSE-2957] * Fix typos and add comments. [#CLICKHOUSE-2957]
-
由 Alexey Zatelepin 提交于
-
由 Vitaliy Lyudvichenko 提交于
-
由 Vitaliy Lyudvichenko 提交于
-
由 Alexey Zatelepin 提交于
-
由 Alexey Zatelepin 提交于
* destructive rollup with Time=0 if no pattern matches * differences in row count for Path and Value columns * missed output rows on the boundaries between blocks
-
由 KochetovNicolai 提交于
* added readBoolTextWord * moved json bool cast to DataTypeNumber
-
由 Alexey Zatelepin 提交于
-
- 18 5月, 2017 2 次提交
-
-
由 robot-metrika-test 提交于
-
由 Vitaliy Lyudvichenko 提交于
-
- 16 5月, 2017 2 次提交
-
-
由 Dmitry Luhtionov 提交于
-
由 orantius 提交于
-
- 15 5月, 2017 3 次提交
-
-
由 Marek Vavruša 提交于
This commit implements a basic IP prefix dictionary that allows storing IPv4/IPv6 prefixes and matching them against a single IP address on query time. This allows for doing IP -> ASN matching and other similar things on query time. The implementation is basic for start, using a simple bitwise trie and reusing interface for complex key dictionaries (so using tuple instead of UInt32/FixedString(16) as the key). A faster bitwise trie implementation (like poptrie) is desired to improve lookup performance and memory consumption with large prefix tables.
-
由 alexey-milovidov 提交于
-
由 Vitaliy Lyudvichenko 提交于
-
- 14 5月, 2017 2 次提交
- 13 5月, 2017 8 次提交
-
-
由 Marek Vavruša 提交于
By default start with 2^4 elements
-
由 Marek Vavruša 提交于
-
由 robot-metrika-test 提交于
-
由 Alexey Milovidov 提交于
-
由 Alexey Milovidov 提交于
-
由 Alexey Milovidov 提交于
-
由 Alexey Milovidov 提交于
-
由 Alexey Milovidov 提交于
-
- 12 5月, 2017 5 次提交
-
-
由 Alexey Milovidov 提交于
StorageBuffer: explicitly disable support for PREWHERE, because possibility of wrong query results [#CLICKHOUSE-2999].
-
由 Alexey Milovidov 提交于
-
由 Vitaliy Lyudvichenko 提交于
-
由 Alexey Milovidov 提交于
-
由 Alexey Milovidov 提交于
-
- 11 5月, 2017 3 次提交
-
-
由 Marek Vavruša 提交于
* allow separate table key / hash key, and use std::string / StringRef for generic variant as it has built-in storage and StringRef is supported by the hash table, this avoids infinitely growing arena with serialised keys * use power-of-2 size for alpha vector for faster binning without using modulo * use custom grower and allocator for SpaceSaving to start with smaller tables * store computed hash in counter for faster reinsertion of smallest element
-
由 Marek Vavruša 提交于
* fixes missing setHash on reinsert * reuses hash when emplacing value
-
由 Vitaliy Lyudvichenko 提交于
-
- 10 5月, 2017 2 次提交
-
-
由 Dmitry Luhtionov 提交于
-
由 Alexey Milovidov 提交于
-