database/doris
2
0
Fork 0
Code Issues Pull Requests Actions 3 Packages Projects Releases Wiki Activity

[performance][query]improve the performance of DISTINCT aggregation by using flat hash set replace unordered set (#9401)

Browse Source 
Co-authored-by: shizhiqiang03 <shizhiqiang03@meituan.com>
This commit is contained in:
shee
2022-05-06 17:43:14 -07:00
committed by GitHub
parent b0afa850ca
commit 811f019e47
1 changed files with 6 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
be/src/exprs/aggregate_functions.cpp
View File

@ -1346,7 +1346,8 @@ private:
}
};
std::unordered_set<T, NumericHashHelper> _set;
phmap::flat_hash_set<T, NumericHashHelper> _set;
// Because Anyval does not provide the hash function, in order
// to adopt the type different from the template, the pointer is used
// HybridSetBase* _set;
@ -1503,7 +1504,8 @@ public:
private:
const int DECIMAL_BYTE_SIZE = 16;
std::unordered_set<DecimalV2Value> _set;
phmap::flat_hash_set<DecimalV2Value> _set;
FunctionContext::Type _type;
};
@ -1588,7 +1590,8 @@ private:
const int DATETIME_PACKED_TIME_BYTE_SIZE = 8;
const int DATETIME_TYPE_BYTE_SIZE = 4;
std::unordered_set<DateTimeVal, DateTimeHashHelper> _set;
phmap::flat_hash_set<DateTimeVal, DateTimeHashHelper> _set;
FunctionContext::Type _type;
};