[
https://issues.apache.org/jira/browse/PHOENIX-539?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14058886#comment-14058886
]
James Taylor commented on PHOENIX-539:
--------------------------------------
bq. [~gabriel.reid], [~giacomotaylor], As I had a closer look at the code, I
now try to understand why it isn't doable with hash-join scan plans.
I had the same idea, [~maryannxue]:
bq. For joins, in theory it could work, though. I suspect that the hash cache
is getting cleared when the scan for the first chunk is closed and then
subsequent chunks wouldn't find it.
If you're up for taking a crack at making this work, that'd be great.
> Implement parallel scanner that does not spool to disk
> ------------------------------------------------------
>
> Key: PHOENIX-539
> URL: https://issues.apache.org/jira/browse/PHOENIX-539
> Project: Phoenix
> Issue Type: Task
> Reporter: James Taylor
> Assignee: Gabriel Reid
> Fix For: 5.0.0, 3.1, 4.1
>
> Attachments: PHOENIX-539.1.patch, PHOENIX-539.patch
>
>
> In scenarios where a LIMIT is not present on a non aggregate query that will
> return a lot of results, Phoenix spools the results to disk. This is less
> than ideal in these situations. @larsh has created a very good and relatively
> simple implementation that is queue based to replace this.
--
This message was sent by Atlassian JIRA
(v6.2#6252)
