ClickHouse/tests/queries/0_stateless/01786_explain_merge_tree.reference
Nikolai Kochetov abe84acc8c Update test.
2021-04-16 20:19:03 +03:00

52 lines
1.3 KiB
Plaintext

ReadFromMergeTree
Indexes:
MinMax
Keys:
y
Condition: (y in [1, +inf))
Parts: 4/5
Granules: 11/12
Partition
Keys:
y
bitAnd(z, 3)
Condition: and((bitAnd(z, 3) not in [1, 1]), and((y in [1, +inf)), (bitAnd(z, 3) not in [1, 1])))
Parts: 3/4
Granules: 10/11
PrimaryKey
Keys:
x
y
Condition: and((x in [11, +inf)), (y in [1, +inf)))
Parts: 2/3
Granules: 6/10
Skip
Name: t_minmax
Description: minmax GRANULARITY 2
Parts: 1/2
Granules: 2/6
Skip
Name: t_set
Description: set GRANULARITY 2
Parts: 1/1
Granules: 1/2
-----------------
ReadFromMergeTree
ReadType: InOrder
Parts: 1
Granules: 3
-----------------
ReadFromMergeTree
ReadType: InReverseOrder
Parts: 1
Granules: 3
ReadFromMergeTree
Indexes:
PrimaryKey
Keys:
x
plus(x, y)
Condition: or((x in 2-element set), (plus(plus(x, y), 1) in (-inf, 2]))
Parts: 1/1
Granules: 1/1