✳flâneur — a map of the web's best reading
Parallel Query Processing | Database Systems
cs186berkeley.net · 3,563 words · saved by 1 readers
Online textbook for CS186, Berkeley’s Database Systems course.
Parallel Query Processing - Database Systems Parallel Query Processing | Database Systems Search Menu Expand Document Database Systems Save this note as PDF Introduction Up until now, we have assumed that our database is running on a single computer. For modern applications that deal with millions of requests over terabytes of data it would be impossible for one computer to quickly respond to all of those requests. We need to figure out how to run our database on multiple computers. We will call this parallel query processing because a query will be run on multiple machines in parallel. Parall
Explore this link on the map →related reading
- Iterators and Joins - Database Systemscs186berkeley.net
- Embarrassingly parallel - Wikipediaen.wikipedia.org
- Algorithms for Modern Hardware - Algorithmicaen.algorithmica.org
- Hash-Range Partitioning | ben.kirw.inben.kirw.in
- A Parallel Computing Primerthephysicsmill.com
- Amdahl's law - Wikipediaen.wikipedia.org
- An Overview of Distributed PostgreSQL... | Crunchy Data Blogcrunchydata.com
- Making 768 servers look like 1 — PlanetScaleplanetscale.com
- pthorpe92.devpthorpe92.dev
- MapReduce and Spark - Database Systemscs186berkeley.net
- A More Human Approach To Databasesccorcos.github.io
- Introduction to partitioned tables | BigQuery | Google Cloud Documentationcloud.google.com