[
https://issues.apache.org/jira/browse/KUDU-2038?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16045297#comment-16045297
]
Todd Lipcon commented on KUDU-2038:
-----------------------------------
I think bitmap indexing is probably more appropriate for typical datawarehouse
applications rather than b-tree.
One thing to keep in mind, though, is that the design would need to either
support mutability (which is a bit tricky on bitmap indexes) or incorporate
some kind of feature that users could mark a column as immutable, and only
allow indexing immutable columns. Another option would be to invalidate indexes
after mutations in a given cfile, so that some portion of the index might be
"inactive" at a given time due to mutations, but the assumption is that most
portions would be active.
I don't know of anyone currently working on this, but long term it is an
appealing idea.
> 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.3.15#6346)
