[
https://issues.apache.org/jira/browse/ASTERIXDB-1077?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14708674#comment-14708674
]
Chen Li commented on ASTERIXDB-1077:
------------------------------------
Can you remind me why point lookups are more expensive than range searches?
Too many top-down traversals instead of scanning leaf nodes?
> Inverted index tests are slow compared to others
> ------------------------------------------------
>
> Key: ASTERIXDB-1077
> URL: https://issues.apache.org/jira/browse/ASTERIXDB-1077
> Project: Apache AsterixDB
> Issue Type: Improvement
> Components: Hyracks
> Reporter: Ian Maxon
> Assignee: Ian Maxon
> Priority: Minor
>
> The inverted index tests take up the majority of the time spent in the
> Hyracks tests (~25min out of 33min). Taewoo looked into this and discovered
> that the reason is at least partially because of the parameters in
> AccessMethodTestsConfig . Those parameters are not taking into account that
> queries on an inverted index will be far more expensive, because they are all
> point lookups. It just uses roughly the same number of operations as the
> BTree/RTree tests.
> We may want to lower the number of operations, or perhaps there is some other
> performance improvement that may ameliorate this situation.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
