Downloaded 59 times
![Verify that the shard was added
• db.runCommand({ listshards:1 })
{ "shards" :
[{"_id”: "shard0000”,"host”: ”<hostname>:27018” } ],
"ok" : 1
}](https://image.slidesharecdn.com/introductiontosharding-130225112733-phpapp01/75/Introduction-to-Sharding-27-2048.jpg)
Uploaded byMongoDB
Introduction to Sharding
This document provides an overview of MongoDB sharding. It discusses how MongoDB addresses the need for horizontal scalability as data and throughput needs exceed the capabilities of a single machine. MongoDB uses sharding to partition data across multiple machines or shards. The key points are: - MongoDB shards or partitions data by a shard key, distributing data ranges across shards for scalability. - A configuration server stores metadata about sharding setup and chunk distribution. Mongos instances route queries to appropriate shards. - MongoDB automatically splits and migrates chunks as data grows to balance load across shards. - Setting up sharding in MongoDB requires minimal configuration and provides a consistent interface like a single database.
More Related Content
Similar to Introduction to Sharding
![MongoDB .local San Francisco 2020: Powering the new age data demands [Infosys]](https://cdn.slidesharecdn.com/ss_thumbnails/315pminfosysfinalsfoversionvocalpart1-200120221508-thumbnail.jpg?width=640&height=640&fit=bounds)
Introduction to Sharding
- 1. #MongoDBDays Introduction to Sharding Brandon Black SoftwareEngineer, 10gen @brandonmblack
- 2. Agenda • Scaling Data •MongoDB's Approach • Architecture • Configuration • Mechanics
- 3.
- 4. Examining Growth • UserGrowth – 1995: 0.4% of the world‟s population – Today: 30% of the world is online (~2.2B) – Emerging Markets & Mobile • Data Set Growth – Facebook‟s data set is around 100 petabytes – 4 billion photos taken in the last year (4x a decade ago)
- 5.
- 6. Working Set ExceedsPhysical Memory
- 7.
- 8.
- 9. Data Store Scalability •Custom Hardware – Oracle • Custom Software – Facebook + MySQL – Google
- 10. Data Store ScalabilityToday • MongoDB Auto-Sharding • A data store that is – Free – Publicly available – Open source (https://github.com/mongodb/mongo) – Horizontally scalable – Application independent
- 11.
- 12. Partitioning • User definesshard key • Shard key defines range of data • Key space is like points on a line • Range is a segment of that line
- 13. Data Distribution • Initially1 chunk • Default max chunk size: 64mb • MongoDB automatically splits & migrates chunks when max reached
- 14. Routing and Balancing •Queries routed to specific shards • MongoDB balances cluster • MongoDB migrates data to new nodes
- 15. MongoDB Auto-Sharding • Minimaleffort required – Same interface as single mongod • Two steps – Enable Sharding for a database – Shard collection within database
- 16.
- 17. What is aShard? • Shard is a node of the cluster • Shard can be a single mongod or a replica set
- 18. Meta Data Storage •Config Server – Stores cluster chunk ranges and locations – Can have only 1 or 3 (production must have 3) – Not a replica set
- 19. Routing and ManagingData • Mongos – Acts as a router / balancer – No local data (persists to config database) – Can have 1 or many
- 20.
- 21.
- 22. Example Cluster • Don’tuse this setup in production! - Only one Config server (No Fault Tolerance) - Shard not in a replica set (Low Availability) - Only one mongos and shard (No Performance Improvement) - Useful for development or demonstrating configuration mechanics
- 23. Starting the ConfigurationServer • mongod --configsvr • Starts a configuration server on the default port (27019)
- 24. Start the mongosRouter • mongos --configdb <hostname>:27019 • For 3 configuration servers: mongos --configdb <host1>:<port1>,<host2>:<port2>,<host3>:<port3> • This is always how to start a new mongos, even if the cluster is already running
- 25. Start the sharddatabase • mongod --shardsvr • Starts a mongod with the default shard port (27018) • Shard is not yet connected to the rest of the cluster • Shard may have already been running in production
- 26. Add the Shard •On mongos: - sh.addShard(„<host>:27018‟) • Adding a replica set: - sh.addShard(„<rsname>/<seedlist>‟)
- 27. Verify that theshard was added • db.runCommand({ listshards:1 }) { "shards" : [{"_id”: "shard0000”,"host”: ”<hostname>:27018” } ], "ok" : 1 }
- 28. Enabling Sharding • Enablesharding on a database sh.enableSharding(“<dbname>”) • Shard a collection with the given key sh.shardCollection(“<dbname>.people”,{“country”:1}) • Use a compound shard key to prevent duplicates sh.shardCollection(“<dbname>.cars”,{“year”:1, ”uniqueid”:1})
- 29.
- 30. Partitioning • Remember it'sbased on ranges
- 31. Chunk is asection of the entire range
- 32. Chunk splitting • Achunk is split once it exceeds the maximum size • There is no split point if all documents have the same shard key • Chunk split is a logical operation (no data is moved)
- 33. Balancing • Balancer isrunning on mongos • Once the difference in chunks between the most dense shard and the least dense shard is above the migration threshold, a balancing round starts
- 34. Acquiring the BalancerLock • The balancer on mongos takes out a “balancer lock” • To see the status of these locks: use config db.locks.find({ _id: “balancer” })
- 35. Moving the chunk •The mongos sends a moveChunk command to source shard • The source shard then notifies destination shard • Destination shard starts pulling documents from source shard
- 36. Committing Migration • Whencomplete, destination shard updates config server - Provides new locations of the chunks
- 37. Cleanup • Source sharddeletes moved data - Must wait for open cursors to either close or time out - NoTimeout cursors may prevent the release of the lock • The mongos releases the balancer lock after old chunks are deleted
- 38.
- 39. Cluster Request Routing •Targeted Queries • Scatter Gather Queries • Scatter Gather Queries with Sort
- 40. Cluster Request Routing:Targeted Query
- 41.
- 42. Request routed toappropriate shard
- 43.
- 44. Mongos returns resultsto client
- 45. Cluster Request Routing:Non-Targeted Query
- 46.
- 47. Request sent toall shards
- 48. Shards return resultsto mongos
- 49. Mongos returns resultsto client
- 50. Cluster Request Routing:Non-Targeted Query with Sort
- 51. Non-Targeted request withsort received
- 52. Request sent toall shards
- 53. Query and sortperformed locally
- 54. Shards return resultsto mongos
- 55. Mongos merges sortedresults
- 56. Mongos returns resultsto client
- 57.
- 58. Shard Key • Shardkey is immutable • Shard key values are immutable • Shard key must be indexed • Shard key limited to 512 bytes in size • Shard key used to route queries – Choose a field commonly used in queries • Only shard key can be unique across shards – `_id` field is only unique within individual shard
- 59. Shard Key Considerations •Cardinality • Write Distribution • Query Isolation • Reliability • Index Locality
- 60.
- 61.
- 62. Working Set ExceedsPhysical Memory
- 63. Sharding Enables Scale •MongoDB‟s Auto-Sharding – Easy to Configure – Consistent Interface – Free and Open Source
- 64. • What‟s next? – Schema Design @ 10:35am – Replication @ 12:15pm – Indexing @ 1:45pm – Sharding @ 2:30pm – Webinar: Technical Overview of MongoDB (March 7th) – MongoDB User Group • Resources https://education.10gen.com/ http://www.10gen.com/presentations http://github.com/brandonblack/presentations
- 65. #MongoDBDays Thank You Brandon Black SoftwareEngineer, 10gen @brandonmblack
Editor's Notes
- #4 Ops will be most interested in ConfigurationDev will be most interested in Mechanics
- #6 Take this slide and toss it out the window for the combined sharding talk. It’s a nice intro, but it’s more effective to spend time talking about tag aware and shard keys if you’re trying to go beyond the intro talk.
- #8 Indexes should be contained in working set.
- #9 From mainframes, to RAC Oracle servers.. People solved problems by adding more resources to a single machine.
- #10 Google was the first to demonstrate that a large scale operation could be had with high performance on commodity hardwareBuild - Document oriented database maps perfectly to object oriented languagesScale - MongoDB presents clear path to scalability that isn't ops intensive - Provides same interface for sharded cluster as single instance
- #11 In 2005, two ways to achieve datastore scalability:Lots of money to purchase custom hardwareLots of money to develop custom software
- #28 MongoDB 2.2 and later only need <host> and <port> for one member of the replica set
- #31 This can be skipped for the intro talk, but might be good to include if you’re doing the combined sharding talk. Totally optional, you don’t really have enough time to do this topic justice but it might be worth a mention.
- #33 Quick review from earlier.
- #35 Once chunk size is reached, mongos asks mongod to split a chunk + internal function called splitVector()mongod counts number of documents on each side of split + based on avg. document size `db.stats()`Chunk split is a **logical** operation (no data has moved)Max on first chunk should be 14
- #37 Balancer lock actually held on config server.
- #38 Moved chunk on shard2 should be gray
- #39 How do the other mongoses know that their configuration is out of date? When does the chunk version on the shard itself get updated?
- #58 The mongos does not have to load the whole set into memory since each shard sorts locally. The mongos can just getMore from the shards as needed and incrementally return the results to the client.
- #61 _id could be unique across shards if used as shard key.we could only guarantee uniqueness of (any) attributes if the keys are used as shard keys with unique attribute equals true
- #62 Cardinality – Can your data be broken down enough?Query Isolation - query targeting to a specific shardReliability – shard outagesA good shard key can:Optimize routingMinimize (unnecessary) trafficAllow best scaling
- #63 This section can be skipped for the intro talk, but might be good to include if you’re doing the combined sharding talk.
- #64 Reliability = if we lost an entire shard what would be the effect on the system?For most frequently used/largest indexes, how are they partitioned across shards?
- #65 Reliability = if we lost an entire shard what would be the effect on the system?For most frequently used/largest indexes, how are they partitioned across shards?
- #66 Reliability = if we lost an entire shard what would be the effect on the system?For most frequently used/largest indexes, how are they partitioned across shards?
- #67 Reliability = if we lost an entire shard what would be the effect on the system?For most frequently used/largest indexes, how are they partitioned across shards?
- #68 Compound shard key, utilize already existing (used) index, partition chunk for "power" users.For those users more than one shard *may* need to be queried in a targeted query.Reliability = if we lost an entire shard what would be the effect on the system?For most frequently used/largest indexes, how are they partitioned across shards?
- #71 Indexes should be contained in working set.