---
title: "Agshin Guliyev (@action) | Hashnode"
description: "engineering. Read the latest articles by Agshin Guliyev on Hashnode."
url: "https://hashnode.com/@action"
---

@action

# Agshin Guliyev

@action · Joined April 2021

engineering

## Comments

[Thanks for the detailed reply. In the RDBMS world, SQL joins are very slow for big data, and sometimes the preferred way is to use denormalization to avoid expensive joins. I was wondering how columnar structure deals with big joins. I am looking forward to reading about hashing-based indexes. It may answer my question regarding optimization of join queries :)](https://hashnode.com/posts/column-oriented-processing/6081e3bafea38e52a9c59029/comment/60830722ff5fc65284a7891f#reply-60834526fea38e52a9c5b0a2)

Reply · Article · Apr 23, 2021 · [Column-oriented processing.](https://hashnode.com/posts/column-oriented-processing/6081e3bafea38e52a9c59029)

[Thanks, Taras, for the article. I have few questions: How does indexing work in columnar databases? What if I need to query 'Hire\_date' info for Bob and Jim in a huge table. In RDBMS, I could use column index(B tree etc.) to fetch data very quickly. You mentioned "array of structs vs. a struct of arrays" for column-based data. IIUC customer has to do proper mapping between columns on the client-side. If you use incorrect indexes to map columns for a specific row, it will introduce hidden bugs that are very difficult to debug. I wonder what is the best practice to fetch column-based data. How are join queries performed? What would be the joining criteria? Thanks!](https://hashnode.com/posts/column-oriented-processing/6081e3bafea38e52a9c59029/comment/60830722ff5fc65284a7891f)

Comment · Article · Apr 23, 2021 · [Column-oriented processing.](https://hashnode.com/posts/column-oriented-processing/6081e3bafea38e52a9c59029)
