{"push_id":1357697611,"size":6,"distinct_size":1,"ref":"refs/heads/partitioned-aggregate-new","head":"7f0269bfd5fb3a5056290d3c5ab1dbe203dadaec","before":"aaba94624a9a9240de58b5928f8d54b1ca3c66e5","commits":[{"sha":"160276c7d790883ad667105cf1ec3e43a487855c","author":{"name":"Saket Saurabh","email":"56092ce4b6da279a66297f1a487b703d54adba4d@cs.wisc.edu"},"message":"Update travis to run only 1 thread while building release version","distinct":false,"url":"https://api.github.com/repos/apache/incubator-quickstep/commits/160276c7d790883ad667105cf1ec3e43a487855c"},{"sha":"7a46443491b1c25af3d7aaf738d6e9b096ed52d0","author":{"name":"Jianqiao Zhu","email":"bd051b10ff680c504ce7f0b2ce894341f9762c2a@cs.wisc.edu"},"message":"Optimizer changes for the LIPFilter feature.","distinct":false,"url":"https://api.github.com/repos/apache/incubator-quickstep/commits/7a46443491b1c25af3d7aaf738d6e9b096ed52d0"},{"sha":"2ee5c1cc656ef71c99714380b1a78bbd16a74925","author":{"name":"Jianqiao Zhu","email":"bd051b10ff680c504ce7f0b2ce894341f9762c2a@cs.wisc.edu"},"message":"Use SimpleCostModel for estimating JoinHashTable size","distinct":false,"url":"https://api.github.com/repos/apache/incubator-quickstep/commits/2ee5c1cc656ef71c99714380b1a78bbd16a74925"},{"sha":"55480d8d1719b5ff97b9562d53ddc63ba1c4d93d","author":{"name":"Jianqiao Zhu","email":"bd051b10ff680c504ce7f0b2ce894341f9762c2a@cs.wisc.edu"},"message":"Clean up the old bloom-filter implementation which are attached to HashTables.","distinct":false,"url":"https://api.github.com/repos/apache/incubator-quickstep/commits/55480d8d1719b5ff97b9562d53ddc63ba1c4d93d"},{"sha":"d3a0920595e4c40ba5e86907359b6e254b5b4958","author":{"name":"cramja","email":"e3cf02461bb7be12972407178a80188977ebf779@gmail.com"},"message":"Refectored bulk insertion to the SplitRow store\n\nThe inner loop of the insert algorithm has been changed to reduce\nfunction calls to only those that are absolutely necessary. Also, we\nmerge copies which come from other rowstore source, speeding up\ninsertion time.\n\nAlso adds support for the idea of 'partial inserts'. Partial\ninserts are when you are only inserting a subset of the columns at a\ntime. Partial inserts will be used in a later commit.","distinct":false,"url":"https://api.github.com/repos/apache/incubator-quickstep/commits/d3a0920595e4c40ba5e86907359b6e254b5b4958"},{"sha":"7f0269bfd5fb3a5056290d3c5ab1dbe203dadaec","author":{"name":"Harshad Deshmukh","email":"e880e92be8d08226c5259d744952cc8b7e6f2519@apache.org"},"message":"Support for performing partitioned aggregation.\n\n- Used for creating a pool of hash tables such that each hash table\n  belongs to a unique partition.\n- The partitioning is done on the group-by keys.\n- Wrote a utility function to compute composite hash of a group of\n  TypedValues.\n- Added a check for whether the aggregation is partitioned or not.\n- The conditions for whether the aggregation can be partitioned\n  are as follows:\n  1. The query has a GROUP BY clause.\n  2. There are no aggrgeations with a DISTINCT clause.\n  3. The estimated number of groups are greater than a pre-defined\n  threshold.\n  4. The query has at least one aggregation function.\n- Method for partitioned aggregation with GROUP BY\n- StorageBlock now provides a method for performing GROUP BY aggregation\n  in a partitioned way.\n- The Tuple class now supports a method to compute the hash of the entire\n  tuple (i.e. hash key is the composite key made up of all the\n  attributes in the tuple).\n- AggregationOperationState calls appropriate method (i.e.\n  aggregateGroupBy or aggregateGroupByPartitioned) based on the way in\n  which aggregation is being performed.\n- Set each hash table's size estimate to be overall estimate divided by\n  the number of partitions.","distinct":true,"url":"https://api.github.com/repos/apache/incubator-quickstep/commits/7f0269bfd5fb3a5056290d3c5ab1dbe203dadaec"}]}
{"actor":{"display_login":"asfgit"}}