lawrjone

27 ms·

271.
by lawrjone 6y ago
It’s one of those trapdoors that people continually fall down: https://gocardless.com/blog/in-search-of-performance-how-we-...
272.
During a pandemic, we're not all affected equally(duffel.com)
3 points by lawrjone 6y ago|0 comments
273.
by lawrjone 6y ago
Hey! I'm always up for chatting about this type of thing. Great to trade ideas and experiences, I find you always come away with something new to think you. If you want to email me at me@lawrencejones.dev, we can sort a virtual coffee.
274.
by lawrjone 6y ago
So firstly, I really like this. I find it nicely readable, I like that the structure is almost all you have to write, and I'm quite a fan of lisp-y syntax anyway, so no surprises there. The primary reason we choose Jsonnet for the regi
275.
by lawrjone 6y ago
Author of the post here, happy to answer any questions about our experience with building the registry, what things it tracks, how we might handle infrastructure deletions, etc.
276.
Why you need a service registry(blog.lawrencejones.dev)
12 points by lawrjone 6y ago|6 comments
277.
Avoid time-of-measurement bias with Prometheus(blog.lawrencejones.dev)
5 points by lawrjone 7y ago|3 comments
278.
by lawrjone 8y ago
> were the logs really the best option for getting that "seed" data? It seemed to us like they were. The database under test belongs to a large monolithic app that has long reads, heavy write batch jobs and is serving API traff
279.
by lawrjone 8y ago
Hey, author here! Perhaps I'm missing something, but I think pgBadger is just for log analysis, no? pgBadger is the second component to the tool this article is about. The idea is to replay the original production logs and capture the
280.
Building a PostgreSQL load tester(blog.lawrencejones.dev)
95 points by lawrjone 8y ago|12 comments
281.
by lawrjone 8y ago
Hey, I'm the author of this article- nice to see it's still going the rounds! While we haven't got anything to identify these situations before they happen, we've become quite good at tackling them once they do occur. We
282.
Debugging the Postgres Query Planner(gocardless.com)
13 points by lawrjone 8y ago|0 comments
283.
Diggit: Mining Git repositories for developer insights – feedback needed(medium.com)
6 points by lawrjone 10y ago|0 comments
284.
by lawrjone 10y ago
In the case where you'd require a bfs to traverse a graph, you're already doing something that is algorithmic, and will otherwise be prohibitively costly if explored in a dfs manner. The most complicated part of this algorithm is
285.
by lawrjone 10y ago
What the hell sort of library would you crack out to do a breadth first search traversal? This is my main problem with the OP, BFS isn't some arcane complex cryptic algorithm, it's a way of moving through a data structure that bec