Solving the 1+N query problem
Summary
Discusses solutions to the 1+N query problem, a common performance issue in database interactions, often related to ORM usage.
Similar Articles
What ORMs have taught me: just learn SQL (2014)
The author argues that ORMs are more detrimental than beneficial and that developers should focus on learning SQL directly to avoid issues like attribute creep and inefficient queries.
Making 768 servers look like 1
PlanetScale explains how to scale a relational database from a single server to 768 servers using database sharding, addressing bottlenecks like write limits and resource contention.
Rethinking Database Programming
The article explores new perspectives and challenges traditional approaches to database programming, suggesting innovations to improve efficiency and design.
Time to Move On: Querying Without Nulls and Bags
An academic paper arguing that SQL's use of nulls and bags is unnecessary, and presenting the fully normalized, null-free language Rel as evidence that set semantics can replace these features.
QO-Bench: Diagnosing Query-Operator-Preserving Retrieval over Typed Event Tuples
QO-Bench is a diagnostic benchmark for query-operator question answering over typed event tuples, covering 22,984 news articles and 614 corporate events across 18 query templates. It evaluates RAG, ReAct RAG, GraphRAG, and extraction-to-SQL systems, finding that operator execution—not just retrieval—is a core bottleneck that stronger models alone cannot resolve.