Over the past 48 hours I have been glued to my screen trying to figure out how to make Beehaw more robust during this Reddit exodus.
My eyes are burning but I am thankful for so much financial support as well as the work of two sysadmins that have given us all a breath of fresh air.
One of the sysadmins was up until 2:30 am helping us out as a volunteer. I am so very grateful for persons such as this.
Thank you all for your continued support and patience.
This must be the one. Those are some monster queries.
I’m no database expert, but I wonder if it would be wise to break those up into multiple queries instead of joins. Joining
postwithpersonandcommunitywould result in a ton of duplicate data, wouldn’t it?I’m actually interested in what people have to say about this, because I have a project that’s kind of sensitive to database query performance, and I’m worried that I’ll find out about some performance bottleneck the hard way like Beehaw just did. The more I learn about the subject, before my project goes to production, the better!
No, joins are always faster. If you ultimately need to combine the data for the app, the database will be faster than your code can do it, since that’s what it was built to do.
Any idea why those queries are slow, then, if not because of all the duplicate data? Missing indices or something?
Looking at the query I think it only returns a single row per post. So not really duplicate data. It all looks very straight forward and you’d think all the “_id” and “id” columns are indexed.
I asked for an EXPLAIN ANALYZE plan to see what really happens and where the most time is spent.
If it’s indexes we’ll see quickly. It might strangely be in the WHERE clause. Not sure what Hot_rank()'s implementation is. But we’ll find that out too if we can get the plan timings. Without looking at the numbers it’s all just guessing.
And I can’t run them myself since I don’t have access to a busy instance with their amount of production data. It’s the thing about databases - what runs fast in dev, doesn’t always translate to real workloads.
Yeah, that’s what really scares me about database programming. I can have something work perfectly on my dev machine, but I’ll never find out how well it works under a real-world workload, and my employer really doesn’t like it when stuff blows up in a customer-visible way.
I decided to write a stress-test tool for my project that generates a bunch of test data and then hits the server with far more concurrent requests than I expect to see in production any time soon. Sure enough, the first time I ran it, my application crashed and burned just like Beehaw did. Biggest problem: I was using serializable transactions everywhere, and with lots of concurrent requests, they’d keep failing and retrying over and over, never making progress.
That’s a lesson I’m glad I didn’t learn in production…but it makes me wonder what lessons I will learn in production.
This is why I love canary and mirror releases when feasible. Hard to do with some projects though
I’m no dev on the project myself, and I haven’t studied that query enough to know, but yeah they are some monster queries. I’d have to fire up pgadmin and try them out on my personal instance to understand them better.
But as for your curiosity, I had an issue with a microservice at my job that is very sensitive to database latency (makes one call, roughly 600 requests per second on average, up to 1200 in spikes.) We solved an issue with some of the joins going on by making a materialised view for what we knew didn’t change more than once per day, which we then scheduled with pg_cron to refresh concurrently (concurrently being key so we don’t lock out reads.) Reduced our query times significantly - ie, down to milliseconds vs up to 20 seconds.
Really boils down to how often some data needs to change, so you can make some sort of way of caching it.