Înapoi la articole →

Cel mai recent articol

Ultima verificare

Urmăritori 0 urmăritori
Articole: 18
  1. Intro When you want fast lookups in a sorted collection, a very common choice is a B-tree.

  2. Recently found this summarization prompt that worked quite well.

  3. I gave a presentation at $work about data modelling based on William Kent's Data and Reality (read the 2nd edition, not the third).

  4. AI Tutor Trap

    How effective are LLMs as tutors?

  5. When building a service that handles many different API integrations, it's helpful to standardize the response.

  6. (Note: This post is part of the simpledb series) Intro Accessing data from disk is dramatically slower than from RAM - by a factor of 100,000.

  7. Intro I recently needed to learn Python concurrency.

  8. Every time you query a database, a complex series of actions begin behind the scenes.

  9. Have you implemented a simple RAG system but found it a bit lacking?

  10. I was recently developing a RAG (retrieval augmented generation) app, using vector search via embeddings generated from OpenAI and pgvector.

  11. What is software complexity?

    As a fellow grug brained developer, I also agree that complexity is very bad.

  12. I've been working my way through Andrej Karpathy's spelled-out intro to backpropagation, and this post is my recap of how backpropagation works.

  13. I was recently working on a bug that only appeared on production.

  14. Stable diffusion allows non-artistic individuals, like myself, to create stunning images simply by providing a text prompt.

  15. Why are B-trees important?

  16. Do you need to group together similar data points into sets?

  17. Tables with polymorphic associations can be quite annoying to query with sql.

  18. Performance concerns are usually put off until they become issues.