[
https://issues.apache.org/jira/browse/CALCITE-2384?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16528058#comment-16528058
]
Julian Hyde commented on CALCITE-2384:
--------------------------------------
Thanks for investigating, [~kgyrtkirk].
Is it possible to devise a simple query, generated according to a parameter N,
such that as N rises, performance gets steadily worse? What is the cost
complexity, e.g. is the problem O(N ^ 2) or (2 ^ N) or similar?
Knowing the complexity may help us find the data structure or algorithm that is
the bottleneck here.
> Performance issue in getPulledUpPredicates
> ------------------------------------------
>
> Key: CALCITE-2384
> URL: https://issues.apache.org/jira/browse/CALCITE-2384
> Project: Calcite
> Issue Type: Bug
> Reporter: Julian Hyde
> Assignee: Zoltan Haindrich
> Priority: Major
>
> Performance issue in getPulledUpPredicates. It seems to have been introduced
> in the fix for CALCITE-2247, and causes Performance issue in
> getPulledUpPredicates to exceed its 20 second timeout. (See the [email
> thread|https://lists.apache.org/thread.html/afaa14a864c7027b9f1c66dddd3e5d6320799aeeec937c17d7b24531@%3Cdev.calcite.apache.org%3E]:
> [~risdenk] noticed this problem, and [~michaelmior] isolated the commit that
> caused the problem.)
> This issue has lots of history: that test was introduced to check
> CALCITE-1960 and CALCITE-2205.
> [~kgyrtkirk], Can you please take a look at this?
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
