Top all-time · #19014
Klaus Aschenbrenner
Personal blog · sqlpassion.at/archiveprogrammingdatasecurity
Klaus Aschenbrenner writes SQLpassion, a personal blog at sqlpassion.at about programming, data and security. Since 2015, 4 different Hacker News readers have linked it 4 times. It is still writing: the last post was on 2026-03-02, and you can follow it by feed.
Too few sampled comments (1) to say how often HN recommends it.?
Why HN links it
HN readers link this SQL Server and database blog for posts on topics like GUID sort order and ever-increasing keys in B-tree indexes. One commenter cites an archived post to support a point on insert behaviour.
Summarised by Claude from a sample of 1 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
What Hacker News says?
Replying to all. @jeltz: > Time sortable UUIDs... Then perhaps store the time as a separate field? Makes them indexable and trivially extracted. > you ensure that inserts are quite often done in sequential order, which is good for btrees. I've just explained why that may not be the case under high insertion rates. This from https://www.sqlpassion.at/archive/2014/04/15/an-ever-increas... "With the best practice of an…
Comment linking /archive/2014/04/15/an-ever-increasing-clustered-key-value-doesnt-scale/
on “How many ways are there to sort GUIDs?”Submitted Understanding the Meltdown exploit in simple words as a story · 2 points
HN discussionSubmitted Why I don’t (yet) recommend In-Memory OLTP to my customers as a story · 2 points
HN discussionSubmitted Reading Files from a FAT12 Partition as a story · 1 points
HN discussion