Blog
Going live in June 2024!
-
DB Indexes (Indices?)
Fundamentals ·How indexes work under the hood
A db index is essentially just a new, separate table with two columns: the value in the indexed column, and a pointer to the full row in the real db table. And crucially, the index is ordered and stored as a binary tree, making lookups to it O(log(n)) instead of O(n). So when I have the following in my schema:
Two Swaps
Ruby on Rails ·In the course of working on my ‘rails test app,’ I decided to make two simultaneous software swaps: Sqlite3 to Postgres, and Sidekiq to GoodJob.
Sidekiq to GoodJob
This came about not because of any technical limitations, but because I wanted to try something new! A former colleague mentioned their team decided to use GoodJob for a project rather than Sidekiq, so I decided the same. It would be...