Can someone explain database scaling issues for web?
I don't really understand the technical challenges behind scaling, when people talk about using NoSQL or Redis.
I mean at the end of the day aren't you still trying to lookup (or insert or delete) into a very, very, very large list? Is one technique to "flatten" out your entire user database into a tree, say by location and then further subdivide so you just go down the tree to choose which smaller DB to access?
Those are my initial naive thoughts on the matter; could someone help me understand some of the non-trivialities to database scaling?
Thanks
(
3 comments
| 3 points
| on HN
)
Problems with the sub-system of databasing are too many transactions (I/O) and the speed of getting the data and acting on it is very inefficient.
If you want to talk to me about it in more detail, message me on Twitter: @compooter or get my email at mayorpear.com
http://www.mongodb.org/display/DOCS/Sharding+Introduction
Each shard can be either a single node, or can be divided among nodes in a Replica Set for distributed reads.
http://www.mongodb.org/display/DOCS/Replica+Sets