Rows vs. Columns: How different are they, really?
72 points by eatonphil 5 days ago | 25 comments

reticulates 3 hours ago
> Those consequences are the reason that most database systems are built for either transactions or analytics, and not both. [24]

> [...]

> [24] People have tried to build one system that does both in the past (HTAP, or hybrid transactional/analytical processing), but those attempts generally didn't work out. Some newer systems seem to be bridging the gap, however. CedarDB, the commercial version of Umbra (a research system from TU Munich), runs transactions and analytics on just one engine and one copy of the data. Databricks' Lakebase keeps Postgres (a row store) as the engine for transactional queries, but its storage layer rewrites the same data into columnar formats in the background, allowing an analytical engine to query it.

The footnote says "those attempts generally didn't work out" but then mentions Lakebase and CedarDB as newer efforts. Can anyone speak to whether or not CedarDB, Lakebase (and any others?) are achieving the fabled transactions + analytics in one database? Should we expect, at some point in the near future, for transactions + analytics to be standard in all databases, or is combining them a niche / esoteric thing with many tradeoffs?

reply
akoller 53 minutes ago
There are always tradeoffs. Databases are fundamentally about managing optimizations, and the question is whether those tradeoffs make sense for your workload.

HTAP has historically been niche because the cost of analytics on fresh data wasn't worth the squeeze (sooner or later the MBAs step in). Separating the OLTP and OLAP layers gives you better workload isolation and the ability to optimize each independently.

Databricks Lakebase/LTAP uses Postgres for transactions and lakehouse engines for analytics, with a shared storage layer. They also use Spark to build Postgres pages in parallel and write them directly to storage, avoiding the single-writer bottleneck when loading large volumes of data.

SingleStore takes a different approach: a distributed database based on MySQL with an in memory rowstore for transactions tightly coupled with a merger to columnstore for analytics.

I don't think HTAP DBs will become the default for every use case. But I do think the space will grow as we move towards agents and automated decision making and optimizations.

reply
contravariant 2 hours ago
I think there's never going to be a point where you can have the kind of performance you can get by optimising a datastructure for a 'fixed' dataset. Nor can you get the maximal performance updating data if you need to maintain a useful datastructure.

A simple case is a sorted list, you can sort it after every update, you can ignore the ordering and sort it as needed, or you can use a datastructure that is typically O(log(N)) at both updates and retrieval. Better datastructurs help, but they cannot remove the tradeoff entirely (in fact O(log(N)) inserts are kind of theoretically minimal, though a trie can do it in O(1) for fixed length datatypes).

reply
lemagedurage 2 hours ago
There's also TiDB which has decent adoption. It allows for columnar replicas of transactional data and exposes both over the same MySQL-compatible interface.
reply
johnnyenn 2 hours ago
[flagged]
reply
4ndrewl 3 hours ago
"a database that keeps each record's details together can't take advantage of that: to read two columns, it has to read all five."

My understanding is that modern databases will take advantage of that if you create an index of those fields - ie it'll read from the index, not the records.

reply
ronfriedhaber 34 minutes ago
One can argue each view of a database is merely a derivate of the WAL, and therefore every view is an index. The major benefit of columnar databases is the data stored being continuous in memory. Avoid all serialize/deserialize and control flow logic. Most core index data structures in relational DBs do not support this kind of tight vector view, Arrow[1]is a format that does.

Theoretically one can have a custom index extension which stores the data in a column-oriented manner, yet then one has major duplication, which is a problem for petabyte-scale databases, and is an even bigger problem in the Cloud.

KDB+ is the best implementation of a columnar DB in my opinion. Simple C, and one can understand how the data is stored down to the DRAM cells. Durability is just MMAP, which is fine as OLAP DBMSs tend not to be ACID.

In my personal opinion one shall learn from the best. The best in the world in massively parallel vectorized computation are the people at OpenAI and Anthropic, and the people who built PyTorch. Much of their work can be applied to analytical DBMSs.

(Draft, of course the topic is much more nuanced)

[1] https://arrow.apache.org/

reply
postexitus 8 minutes ago
Or, every index is a view.
reply
ConnorTsui20 2 hours ago
We generally refer to an index that holds the data it indexes at its leaves a "clustered index". But this only means that the tuples are organized according to the ordering of the index: you still generally store the entire record (all columns/attributes) together.

For example, if I cluster on my sorted primary key, that just means that the index can jump to the tuple with the correct primary key quickly (log time), but you will still end up reading* the entire tuple in the same way I explain in the blog. And if you only store a record ID that points to the other fields instead of the entire tuple at the leaves of the index, then that wouldn't be considered a clustered index.

I will note, however, that DBMSs should be smart enough to know that an aggregation on only an indexed column does not need to fetch the rest of the columns, only the data at the leaves of the index.

reply
kubanczyk 3 hours ago
Well, yes. One of the things an index can do is column-oriented storage.
reply
minkeymaniac 3 hours ago
Not really modern either.. Oracle/Sybase/SQL Server have been doing that already in the 90s.. including indexed views for aggregation

What they recently (and some of these were added in late 2000s) added is columnstore indexes... with compression and also in memory (Sybase Hana, SQL Server In Memory aka Hekaton, Oracle IM column store)

reply
gfody 45 minutes ago
it's no use to mention the frontier database engines to HN - they don't exist HTAP is impossible and postgres is SOTA!
reply
j0shk0 4 hours ago
Am I missing something or is this nothing more but AOS vs SOA ?
reply
pdpi 4 hours ago
It's the same basic concept, yes. The details matter, though, and the fact that AoS/SoA is mostly about in-memory layout, whereas row/column store is about on-disk layout means that the performance compromises are very different. E.g. column store databases frequently use RLE for compression, but that's probably _way_ too expensive for SoA.
reply
j0shk0 3 hours ago
Thank you!
reply
OskarS 3 hours ago
One thing to add is that databases tend to take it further using compression. For instance, if you have a column that is all either A or B, you can use run-length encoding ("the next thousand entries are B"). Or you can do delta encoding: if you have some very large number that takes a lot of bits to store, but the deltas between them are quite small, you can save a lot of disk space and I/O by just storing the deltas.

You can also combine these two: if you have a numeric id that increases by 1 every row, you can delta-encode that to just get a massive list of 1's, which you can then run-length encode to just be "the delta for the next million rows is 1", saving huge amounts of space.

You generally don't do this with AOS/SOA, because you do want to be able to random-access your entries ("index" them, in database terms) and I/O performance is much less important. Databases have this issue too, which is why indexes tend to either not be available or much slower in column-oriented DBs.

EDIT: ah, read the original commenter a bit too quickly, missed that they mentioned run-length encoding. Apologies.

reply
ConnorTsui20 3 hours ago
One of the cool things about Vortex (which is a file format, but in this context can be better thought of as the storage layer of a DBMS) is that we have implemented compression encodings that _do_ support fast random access. For example, FastLanes allows us to bit-pack values extremely effectively while retaining random access, and this can be combined with other encodings such as ALP and FSST.

I believe Vortex is unique in its ability to retain random access while recursively compressing data. And turns out that this is helpful for both in-memory _and_ on-disk (we might write about that in the future)!

I unfortunately didn't have much space to write about that in this blog, but in the compression section I did link to other blogs that we have written that go into much more detail, if you are interested :D

reply
kloop 50 minutes ago
Fun fact, the original Pokemon used both DE and RLE to compress the sprites. It's one of the things that makes missingno screw up sprites (it tries to decode game data as if it's a sprite encoded this way and sometimes causes buffer overruns)
reply
slfnflctd 3 hours ago
Appreciate you going into more detail about how run-length encoding works in any case. I had an abstract idea it was something like that, but didn't realize it could actually be implemented so 'simply'.
reply
pdpi 3 hours ago
On the one hand, you missed me mentioning RLE. Oh no how dare you. On the other hand, you added a bunch of extra detail, including stuff I didn't know about.

I call that a pretty positive tradeoff :)

reply
xnorswap 3 hours ago
Please introduce your acronyms!

Array of Structures vs Structure of Arrays.

reply
hansvm 38 minutes ago
It's a technical forum. That's like asking to "please introduce the definition of a linker" the first time it crops up. If somebody really doesn't know, searching "aos vs soa" in Google yields a largely correct AI summary followed by a Wikipedia article on the topic followed by a StackOverflow discussion on pros/cons followed by a similar Reddit discussion. Aside from maybe the image/video results, literally everything on the first page looks like it would explain the concept well.
reply
xnorswap 34 minutes ago
Expanding acronyms helps bring people into your field of interest.

People who might be technical and might even intuitively understand what is meant by "Array of Structures vs Structures of Arrays" might not be familiar with the acronym AOS vs SOA, especially given SOA is already a technical acronym their brain might shortcut to, "Service Oriented Architecture", even if instantly dismissed as clearly incorrect.

By expanding the algorithm you also help let people better decide if they want to spend the time reading up more about it.

reply
hansvm 21 minutes ago
It's the same problem you see with variable names though -- longer names add local clarity but give disproportionate weight to those local concepts rather than the global structure. There's value in selectively using less precise identifiers.

Maybe you agree with that and just disagree with where the line should be drawn?

reply
kinleyd 3 hours ago
Great read! I do enjoy exploring both row and column data stores every now and then. Love the way I get my head bent.
reply
krawcu 3 hours ago
I enjoyed reading this post
reply