[
https://issues.apache.org/jira/browse/PHOENIX-852?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14092887#comment-14092887
]
James Taylor commented on PHOENIX-852:
--------------------------------------
With RHS = (a,5) and LHS = (a,1),(a,1),(c,2) with where pk1 IN (a) will return
two rows from the LHS table (assuming the LHS has a composite primary
constraint of more than just one column, as otherwise there'd be just one row
with a pk of a). Is that what we'd want?
> Optimize child/parent foreign key joins
> ---------------------------------------
>
> Key: PHOENIX-852
> URL: https://issues.apache.org/jira/browse/PHOENIX-852
> Project: Phoenix
> Issue Type: Improvement
> Reporter: James Taylor
> Assignee: Maryann Xue
>
> Often times a join will occur from a child to a parent. Our current algorithm
> would do a full scan of one side or the other. We can do much better than
> that if the HashCache contains the PK (or even part of the PK) from the table
> being joined to. In these cases, we should drive the second scan through a
> skip scan on the server side.
--
This message was sent by Atlassian JIRA
(v6.2#6252)
