{"push_id":826288609,"size":2,"distinct_size":1,"ref":"refs/heads/master","head":"4b88be9f370827af3f89a181bde3bbf779f7820a","before":"49d7c409415c6723b4b758015b2912ca7b2f1307","commits":[{"sha":"a33b1993a547d76bf4beb3159ab09c29b2663ea4","author":{"email":"e83021be420bdfbb057d3fad0385b350bfd2d6b7@fb.com","name":"Sergey Goder"},"message":"Speed up how we collect data\n\nThe current implementation is O(n^2), this new method is O(n log n). This will\nonly matter for large queries where it can improve the total execution by as\nmuch as 50%.","distinct":false,"url":"https://api.github.com/repos/prestodb/RPresto/commits/a33b1993a547d76bf4beb3159ab09c29b2663ea4"},{"sha":"4b88be9f370827af3f89a181bde3bbf779f7820a","author":{"email":"ded37b307130590077c29fda0eb88d22950f9304@gmail.com","name":"Ismail Onur Filiz"},"message":"Merge pull request #37 from prestodb/speed-up\n\nSpeed up how we collect data","distinct":true,"url":"https://api.github.com/repos/prestodb/RPresto/commits/4b88be9f370827af3f89a181bde3bbf779f7820a"}]}