Dandandan opened a new pull request #9595: URL: https://github.com/apache/arrow/pull/9595
This PR changes the way we create an array of indices for an inner join to avoid generating a null bit map. It seems currently not really ergonomic to do this with Arrow without resorting to an iterator (which would be hard to do here). This gives a small speedup to query 5: This PR: ``` Query 5 iteration 0 took 174.7 ms Query 5 iteration 1 took 159.8 ms Query 5 iteration 2 took 167.6 ms Query 5 iteration 3 took 171.4 ms Query 5 iteration 4 took 166.3 ms Query 5 iteration 5 took 172.1 ms Query 5 iteration 6 took 165.0 ms Query 5 iteration 7 took 160.6 ms Query 5 iteration 8 took 166.9 ms Query 5 iteration 9 took 162.0 ms Query 5 avg time: 166.63 ms ``` Master: ``` Query 5 iteration 0 took 177.6 ms Query 5 iteration 1 took 169.6 ms Query 5 iteration 2 took 171.8 ms Query 5 iteration 3 took 175.1 ms Query 5 iteration 4 took 167.2 ms Query 5 iteration 5 took 171.1 ms Query 5 iteration 6 took 174.2 ms Query 5 iteration 7 took 178.1 ms Query 5 iteration 8 took 167.9 ms Query 5 iteration 9 took 172.0 ms Query 5 avg time: 172.46 ms ``` ---------------------------------------------------------------- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: us...@infra.apache.org
