Description
Currently, to enumerate all of the values of a dictionary, we enumerate the ids first and then get the related values. The compute complexity is nlogn. We can achieve the compute complexity of n by pre-order visiting the trie tree.
Attachments
Attachments
Issue Links
- is related to
-
KYLIN-3490 For single column queries, only dictionaries are enough
- Closed