MemSQL partitions data across nodes by hash, not by range, so partition prunning is less applicable. However, in a case when it can be applied MemSQL does apply

MemSQL partitions data across nodes by hash, not by range, so partition prunning is less applicable. However, in a case when it can be applied MemSQL does apply it. [1] Within each node, for column store tables in MemSQL we do use segment elimination very aggressively, which is effectively the same thing as partition pruning. [2] [3] [1] http://docs.memsql.com/latest/concepts/distributed_sql/#index-matching http://docs.memsql.com/latest/concepts/distributed_sql/#inde... [2] http://docs.memsql.com/latest/concepts/columnar/#query-efficiency-and-the-memsql-columnstore http://docs.memsql.com/latest/concepts/columnar/#query-effic... [3] http://docs.memsql.com/latest/concepts/columnar/#maintenance-of-the-row-segments http://docs.memsql.com/latest/concepts/columnar/#maintenance...