Improving join-performance of SQL databases
The hash join algorithm aims for the weak spot of the nested loops join: the many B-tree traversals when executing the inner query. Instead it loads the candidate records from one side of the join into a hash table that can be probed very quickly for each row from the other side of the join. Tuning a hash join requires an entirely different indexin... See more
Markus Winand • Partial Objects in ORMs: loading a subset of properties
combines scattered data fragments. Proper indexing is again the best solution to reduce response times. The correct index however depends on which of the three common join algorithms is used for the query.
Markus Winand • Improving join-performance of SQL databases
A common workaround is to de-normalize the database so that queries that previously require joins can be performed on a single table.
Alex • System Design Interview - An insider's guide
SQL has limitations as it is built on relational concepts and relies on binary joins.
The future of databases is shifting towards relational knowledge graphs, allowing the flexibility to work with various data structures beyond tables.
Businesses are moving towards explicitly modeling business semantics and logic, which are often stored in document... See more
The future of databases is shifting towards relational knowledge graphs, allowing the flexibility to work with various data structures beyond tables.
Businesses are moving towards explicitly modeling business semantics and logic, which are often stored in document... See more
Nicolay Gerold • Tweet
loading processes • Improving query performance in some cases • Improving data storage strategies