Picking the optimal sort order for compression of a columnar table appears to be NP-hard or NP-complete, being at least O(n!)
Picking the optimal sort order for compression of a columnar table appears to be NP-hard or NP-complete, being at least O(n!)Continue reading on Medium » Read More Sql on Medium
#sql