timgarmstrong

3 ms·

1.
by timgarmstrong 5y ago
This is true, but in the case where files are read only, just reading directly from the files with fread()/read()/etc works pretty well. You do have to pay the cost of a system call and a copy from the OS buffer cache into your us
2.
by timgarmstrong 5y ago
Every solution for robust joins sorting, hashing, or partitioning of some form and if you squint hard partitioning and hashing are very closely related to sorting, so I understand conceptually it seems samey - it kinda boils down to differe
3.
by timgarmstrong 5y ago
The theme does come up in some papers - Google's F1 papers for example. A lot of it doing the engineering work to make known techniques work - you can have a broadcast join that spills to disk (using a hybrid hash join or similar) and
4.
by timgarmstrong 6y ago
If I were running an open source software business, I would simply provide long-term support updates for free and also have lots of money to fund ongoing development.
5.
by timgarmstrong 6y ago
If you're using open source software and not paying anyone, sometimes shit happens and you will be surprised or disappointed and have no recourse. Even if everyone starts off with the best of intentions. We could debate forever about w
6.
by timgarmstrong 6y ago
shared_ptrs, if misused, can cause a lot of memory management issues, because you end up with a web of object lifetime dependencies that is hard to reason about. I think this is a severely underrated problem in C++, particularly for newer d
7.
by timgarmstrong 7y ago
Being compute-bound is pretty standard for analytic queries (i.e. computing aggregate things over larger data sets). A lot of workloads do have high reuse rates of data so you'll get a lot of data cached in memory, and a lot of the pro