* Description of the iLike function
Добавил описание функции iLike и добавил оператор ILIKE.
* Update string-search-functions.md
Changed by comments.
* Update and translation ilike function and ILIKE operator..
Внес поправки в английскую версию и сделал перевод на русский язык.
Co-authored-by: Dmitriy <sevirov@yandex-team.ru>
* Create view.md
Создал файл view.md и сделал описание функции view.
* Update view.md
I made changes.
* Update view.md
Changed parametrs.
* Update view.md
Changed by comments.
* Create view.md
Перевел на русский язык.
* Update ru and en file view.md
Changed by comments.
* Update en and ru versions view function.
Changed links.
Co-authored-by: Dmitriy <sevirov@yandex-team.ru>
* Added two modificators into the table of supported modificators
* Clarified description of added modifiers and started to add info according to the template of function description
* fixed link
* fix link again
* edits
* Update docs/en/sql-reference/functions/date-time-functions.md
Co-authored-by: BayoNet <da-daos@yandex.ru>
* Update docs/en/sql-reference/functions/date-time-functions.md
Co-authored-by: BayoNet <da-daos@yandex.ru>
* Update docs/en/sql-reference/functions/date-time-functions.md
Co-authored-by: BayoNet <da-daos@yandex.ru>
* comments from ticket
* +
* +
* polishing
* Update docs/en/sql-reference/functions/date-time-functions.md
Co-authored-by: BayoNet <da-daos@yandex.ru>
* external link for understanding
* Перевод на русский
* Доработала русский перевод
* Причесала перевод
* Уточнение части перевода
* Шлифовка части перевода
Co-authored-by: BayoNet <da-daos@yandex.ru>
preallocation can be used only when we know number of rows, and for this
we need:
- source clickhouse
- no filtering (i.e. lack of <where>), since filtering can filter
too much rows and eventually it may allocate memory that will
never be used.
For sparse_hash the difference is quite significant, preallocated
sparse_hash hashtable allocates ~33% faster (7.5 seconds vs 5 seconds
for insert, and the difference is more significant for higher number of
elements):
$ ninja bench-sparse_hash-run
[1/1] cd /src/ch/hashtable-bench/.cmake && ...ch/hashtable-bench/.cmake/bench-sparse_hash
sparse_hash/insert: 7.574 <!--
sparse_hash/find : 2.14426
sparse_hash/maxrss: 174MiB
sparse_hash/time: 9710.51 msec (user+sys)
$ time ninja bench-sparse_hash-preallocate-run
[1/1] cd /src/ch/hashtable-bench/.cmake && ...-bench/.cmake/bench-sparse_hash-preallocate
sparse_hash/insert: 5.0522 <!--
sparse_hash/find : 2.14024
sparse_hash/maxrss: 174MiB
sparse_hash/time: 7192.06 msec (user+sys)
P.S. the difference for sparse_hashed dictionary with 4e9 elements
(uint64, uint16) is ~18% (4975.905 vs 4103.569 sec)
v2: do not reallocate the dictionary from the progress callback
Since this will access hashtable in parallel.
v3: drop PREALLOCATE() and do this only for source=clickhouse and empty
<where>
* Docs for the extractAllGroupsHorizontal and extractAllGroupsVertical functions (English).
* Minor fixes (en).
* Misspelling fixed.
* English docs corrected and translated into Russian.
* English misspelling corrected.
Co-authored-by: Olga Revyakina <revolg@yandex.ru>
Co-authored-by: Olga Revyakina <revolg@yandex-team.ru>
