ClickHouse/tests/queries/0_stateless/01786_explain_merge_tree.reference
Nikolai Kochetov 6fe3470893 Update test.
2021-04-16 12:43:11 +03:00

76 lines
1.8 KiB
Plaintext

ReadFromMergeTree
ReadType: Default
Indexes:
MinMax
Keys:
y
Description: (y in [1, +inf))
Parts: 4/5
Granules: 11/12
Partition
Keys:
y
bitAnd(z, 3)
Description: and((bitAnd(z, 3) not in [1, 1]), (y in [1, +inf)))
Parts: 3/4
Granules: 10/11
PrimaryKey
Keys:
x
y
Description: 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
Parts: 1
Granules: 1
-----------------
ReadFromMergeTree
ReadType: InOrder
Indexes:
MinMax
Description: true
Parts: 5/5
Granules: 12/12
Partition
Description: true
Parts: 5/5
Granules: 12/12
PrimaryKey
Keys:
x
Description: (x in [16, +inf))
Parts: 1/5
Granules: 3/12
Parts: 1
Granules: 3
-----------------
ReadFromMergeTree
ReadType: InReverseOrder
Indexes:
MinMax
Description: true
Parts: 5/5
Granules: 12/12
Partition
Description: true
Parts: 5/5
Granules: 12/12
PrimaryKey
Keys:
x
Description: (x in [16, +inf))
Parts: 1/5
Granules: 3/12
Parts: 1
Granules: 3