Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> it's interesting when you learn in practice that sometimes an N+1 problem is actually faster as N+1 than trying to query across separate DBMS systems.

This is specially visible in SQLite workflows.

The roundtrip for querying a local SQLite file is so fast that it's passable to execute N SELECTS inside a loop instead of a single SELECT with a JOIN, for example.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: