SaaSHub helps you find the best software and product alternatives Learn more →
Blog Alternatives
Similar projects and alternatives to blog
-
neon
Neon: Serverless Postgres. We separated storage and compute to offer autoscaling, branching, and bottomless storage.
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
pgreplay
pgreplay reads a PostgreSQL log file (*not* a WAL file), extracts the SQL statements and executes them in the same order and relative time against a PostgreSQL database cluster.
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
-
temporal_tables
Postgresql temporal_tables extension in PL/pgSQL, without the need for external c extension. (by nearform)
blog reviews and mentions
- Versioning data in Postgres? Testing a Git like approach
-
A Different Type of SQL Recursion with PostgreSQL
Originally published at https://github.com/vb-consulting/blog/discussions/1
A follow up on this article was written today
[Recursion with PostgreSQL, Follup 1, Perfomances](https://github.com/vb-consulting/blog/discussions/4)
-
Recursion with PostgreSQL Follow-Up 3 - Finding the Right Path
In my previous article, I managed to get some really crazy performances in tree processing by using PostgreSQL recursive procedural-style function.
- Recursive Hierarchical Queries in SQL: A Deep Dive into Employee Level
- Which Way .NET Developer?
-
Recursion with PostgreSQL, Follup 1, Perfomances
I wrote a follow-up on yesterday's article on tree processing and recursion with PostgreSQL. This one: https://github.com/vb-consulting/blog/discussions/1
SQL was never intended for this kind of stuff; I'm sure that Fabian Pascal will tell us all about it.
And indeed, recursive CTEs are awful, confusing, and severely limited ... but they look cool and smart, and smart people use them (I hate them).
In any case, I used a procedural approach to this problem and, with a few smart optimizations, managed to squeeze some really spectacular performances (757K tree records with 20K unique nodes in just 5 seconds without any indexes, so it probably can go even faster).
-
A note from our sponsor - SaaSHub
www.saashub.com | 2 May 2024
Stats
vb-consulting/blog is an open source project licensed under Creative Commons Zero v1.0 Universal which is not an OSI approved license.
Sponsored