Instead of keeping a reference of the original tuple, copy it for every group
Turn on the delete as we go optimization for aggregateexecutor
Fix the valgrind problem by adding const modifier
Use vectors for group by keys instead of allocating tuples. This is much more efficient; Revert delete as we go iterator; Instead of copy the original input tuple, just store the pass through column values for each group
Refactor the serial aggregation execution into two functions
Pass by reference, why did I make such a stupid error
Turn the inProgressGroupByValues vector to a member variable instead; Had trouble turning the aggregate row and info into member variable because of memory or initialization issues
export the aggregate row and serial aggregation information to header file
Add support for inline serial aggregation on seqscan executors; there are more cases that can be optimized, like table agg Having
Merge branch 'master' of github.com:VoltDB/voltdb into inline-agg
Fix the compiler error on linux platform
Refactor some serial aggregation code and add support for index scan serial aggregation
Check in to move a bunch of limit plan node construction work into ParsedSelectStmt.
Turn inline aggregation planner work off. Move some micro-optimization into plan assember part. Check in this point to get tests passed temporarily.
Merge branch 'master' of github.com:VoltDB/voltdb into inline-agg
Add support for serial agg with group by. Fix the test cases. At this point, it should work. Come on~
Merge branch 'master' of github.com:VoltDB/voltdb into inline-agg
Fix the license check. Fix the EE compilation error
Fix the underflow and overflow with index and inline aggregation. Fix the pushdown tests
Refresh the planner tests