Hive's current query execution engine processes one row at a time and uses layers of virtual method calls in the inner loop. This mode of execution is very inefficient for cpu instruction pipelines, superscalar parallelism and L1 cache behavior. Vectorized query execution reads batch of rows as column vectors and each operator processes the whole vectors at a time. This vector mode of execution has been proven to be an order of magnitude faster for cpu performance. In hive we also gain manifolds improvements by removing the layers of branching and virtual method calls in the inner loop. In this talk we present this work including the architecture and algorithms and also present the results that have been acheived.