Bypass PostgreSQL catalog overhead with direct partition hash calculations (shayon.dev) | HN Screenshots

YHacker Newsscreenshots

Screenshot of shayon.dev: Bypass PostgreSQL catalog overhead with direct partition hash calculations

First screen, captured 1 year ago.

Looks similar

Screenshot of shayon.dev: Don't rely on IF NOT EXISTS for concurrent index creation in PostgreSQL

Don't rely on IF NOT EXISTS for concurrent index creation in PostgreSQL (shayon.dev)

60 points by shayonj 2 years ago | 43 comments

Screenshot of shayon.dev: An MVCC-like columnar table on S3 with constant-time deletes

An MVCC-like columnar table on S3 with constant-time deletes (shayon.dev)

36 points by shayonj 1 year ago | 4 comments

Screenshot of orlp.net: Branchless Lomuto Partitioning

Branchless Lomuto Partitioning (orlp.net)

26 points by killcoder 2 years ago | 14 comments

Screenshot of shayon.dev: A PostgreSQL planner semi-join gotcha with CTE, LIMIT, and RETURNING

A PostgreSQL planner semi-join gotcha with CTE, LIMIT, and RETURNING (shayon.dev)

49 points by namanyayg 1 year ago | 38 comments

Screenshot of bkaradzic.github.io: Parsers don't have to be complicated

Parsers don't have to be complicated (bkaradzic.github.io)

51 points by signa11 2 months ago | 50 comments

Screenshot of shayon.dev: Selective async commits in PostgreSQL – balancing durability and performance

Selective async commits in PostgreSQL – balancing durability and performance (shayon.dev)

89 points by shayonj 1 year ago | 29 comments