haha, it's because Go's compiler has very limited optimizations. It's easy to make C++ or Rust assembly easy to read as well by disabling optimizations :)

Great questions, Agshin! most columnar DBMSs do not use indexing, since they are focused on OLAP loads where it's common to scan massive amounts of data anyways. At the same time, it's totally possible to use either sort or hash based indexing scheme depending on data cardinality and specific use-case. I actually plan to write about hash-based indexing in one of the future posts. the only advise I have is building hard-to-misuse APIs. For the most part it's possible to hide the difference completely. they are performed in a similar way to row-based DBMSs. Why would the criteria be any different? :) http://db.csail.mit.edu/projects/cstore/abadi-sigmod08.pdf has more details on indexing and join strategies used in popular solutions.