[
https://issues.apache.org/jira/browse/KUDU-2038?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16052465#comment-16052465
]
Yi Guolei commented on KUDU-2038:
---------------------------------
I know the reading processes. But why not apply mutations to the bitmap index
to get a new index, and then using the new bitmap index to evaluate? I think
it is more efficient.
> Add b-tree or inverted index on value field
> -------------------------------------------
>
> Key: KUDU-2038
> URL: https://issues.apache.org/jira/browse/KUDU-2038
> Project: Kudu
> Issue Type: Wish
> Reporter: Yi Guolei
>
> Do we have a plan to add index on any column [not primary column] ? Currently
> kudu does not have btree or inverted index on columns. In this case if a
> query wants to filter a column then kudu has to scan all datas in all
> rowsets.
> For example, select * from table where salary > 10000 and age < 40, the bloom
> filter or min max index will have no effect, kudu has to scan all datas in
> all row sets. But if kudu has inverted index, then it will be much faster.
--
This message was sent by Atlassian JIRA
(v6.4.14#64029)
