Github user saketj commented on the issue:
https://github.com/apache/incubator-quickstep/pull/114
@cramja Quite correct. Yeah and it seems so from these benchmark runs. But,
I guess that is happening for only 10% of all the times BitVector is being
used. So, overall this PR gives us
GitHub user hbdeshmukh opened a pull request:
https://github.com/apache/incubator-quickstep/pull/121
Support for performing partitioned aggregation.
- Used for creating a pool of hash tables such that each hash table
belongs to a unique partition.
- The partitioning is
Github user cramja commented on the issue:
https://github.com/apache/incubator-quickstep/pull/114
@saketj so what's the final analysis on why the branchless code takes
longer on these queries? Is it because if the branch is predicted correctly,
then the old code is slightly faster
Github user cramja closed the pull request at:
https://github.com/apache/incubator-quickstep/pull/109
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the
Github user cramja commented on the issue:
https://github.com/apache/incubator-quickstep/pull/109
@jianqiao thanks! will close.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
