Senior Solutions Architect, MongoDB Inc. Massimo Brignoli #MongoDB Introduction to Sharding.

Slides:



Advertisements
Similar presentations
Tuning: overview Rewrite SQL (Leccotech)Leccotech Create Index Redefine Main memory structures (SGA in Oracle) Change the Block Size Materialized Views,
Advertisements

Using the Self Service BMC Helpdesk
Case Study - Amazon. Amazon r Amazon has many Data Centers r Hundreds of services r Thousands of commodity machines r Millions of customers at peak times.
June 22-23, 2005 Technology Infusion Team Committee1 High Performance Parallel Lucene search (for an OAI federation) K. Maly, and M. Zubair Department.
NoSQL and NewSQL Justin DeBrabant CIS Advanced Systems - Fall 2013.
Chapter 9 Overview  Reasons to monitor SQL Server  Performance Monitoring and Tuning  Tools for Monitoring SQL Server  Common Monitoring and Tuning.
Service Broker Lesson 11. Skills Matrix Service Broker Service Broker, provides a solution to common problems with message delivery and consistency that.
Distributed storage for structured data
Installing and Setting up mongoDB replica set PREPARED BY SUDHEER KONDLA SOLUTIONS ARCHITECT.
MongoDB Sharding and its Threats
Russ Houberg Senior Technical Architect, MCM KnowledgeLake, Inc.
A Social blog using MongoDB ITEC-810 Final Presentation Lucero Soria Supervisor: Dr. Jian Yang.
VLAN Trunking Protocol (VTP) W.lilakiatsakun. VLAN Management Challenge (1) It is not difficult to add new VLAN for a small network.
Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung Google∗
How WebMD Maintains Operational Flexibility with NoSQL Rajeev Borborah, Sr. Director, Engineering Matt Wilson – Director, Production Engineering – Consumer.
22-Aug-15 | 1 |1 | Help! I need more servers! What do I do? Scaling a PHP application.
Distributed Data Stores – Facebook Presented by Ben Gooding University of Arkansas – April 21, 2015.
WORKFLOW IN MOBILE ENVIRONMENT. WHAT IS WORKFLOW ?  WORKFLOW IS A COLLECTION OF TASKS ORGANIZED TO ACCOMPLISH SOME BUSINESS PROCESS.  EXAMPLE: Patient.
Software Engineer, #MongoDBDays.
Solutions Summit 2014 Discrepancy Processing & Resolution Terri Sullivan.
Database Design – Lecture 16
VLAN Trunking Protocol (VTP)
HBase A column-centered database 1. Overview An Apache project Influenced by Google’s BigTable Built on Hadoop ▫A distributed file system ▫Supports Map-Reduce.
MapReduce: Simplified Data Processing on Large Clusters Jeffrey Dean and Sanjay Ghemawat.
MySQL. Dept. of Computing Science, University of Aberdeen2 In this lecture you will learn The main subsystems in MySQL architecture The different storage.
MongoDB Replica,Shard Cluster 中央大學電算中心 楊素秋
SURENDER SARA 10GAS Building Corporate KPI’s
Computer Emergency Notification System (CENS)
Module 10 Administering and Configuring SharePoint Search.
Achieving Scalability, Performance and Availability on Linux with Oracle 9iR2-RAC Grant McAlister Senior Database Engineer Amazon.com Paper
MapReduce and GFS. Introduction r To understand Google’s file system let us look at the sort of processing that needs to be done r We will look at MapReduce.
VICTORIA UNIVERSITY OF WELLINGTON Te Whare Wananga o te Upoko o te Ika a Maui SWEN 432 Advanced Database Design and Implementation MongoDB Architecture.
© 2006 Cisco Systems, Inc. All rights reserved.1 Connection 7.0 Serviceability Reports Todd Blaisdell.
® IBM Software Group © 2007 IBM Corporation Best Practices for Session Management
MongoDB is a database management system designed for web applications and internet infrastructure. The data model and persistence strategies are built.
Fast Crash Recovery in RAMCloud. Motivation The role of DRAM has been increasing – Facebook used 150TB of DRAM For 200TB of disk storage However, there.
Databases Illuminated
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 9 Virtual Trunking Protocol.
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
Department of Computing, School of Electrical Engineering and Computer Sciences, NUST - Islamabad KTH Applied Information Security Lab Secure Sharding.
Chapter 4 Version 1 Virtual LANs. Introduction By default, switches forward broadcasts, this means that all segments connected to a switch are in one.
 Introduction  Architecture NameNode, DataNodes, HDFS Client, CheckpointNode, BackupNode, Snapshots  File I/O Operations and Replica Management File.
SCALING AND PERFORMANCE CS 260 Database Systems. Overview  Increasing capacity  Database performance  Database indexes B+ Tree Index Bitmap Index 
Bigtable: A Distributed Storage System for Structured Data
Introduction to MongoDB. Database compared.
(Part 2) Josh Wells. Topics  Quick Review  Aggregation  Sharding  MongoDB Users.
1 Information Retrieval and Use De-normalisation and Distributed database systems Geoff Leese September 2008, revised October 2009.
An Introduction to Super-Scalability But first…
Orion Contextbroker PROF. DR. SERGIO TAKEO KOFUJI PROF. MS. FÁBIO H. CABRINI PSI – 5120 – TÓPICOS EM COMPUTAÇÃO EM NUVEM
SQL Basics Review Reviewing what we’ve learned so far…….
Gorilla: A Fast, Scalable, In-Memory Time Series Database
Amazon Web Services. Amazon Web Services (AWS) - robust, scalable and affordable infrastructure for cloud computing. This session is about:
SQL IMPLEMENTATION & ADMINISTRATION Indexing & Views.
1 Gaurav Kohli Xebia Breaking with DBMS and Dating with Relational Hbase.
Logging Microservice Deep Dive
Advanced Topics in Concurrency and Reactive Programming: Case Study – Google Cluster Majeed Kassis.
MongoDB Er. Shiva K. Shrestha ME Computer, NCIT
MongoDB Distributed Write and Read
Learning MongoDB ZhangGang
Maximum Availability Architecture Enterprise Technology Centre.
Senior Solutions Architect, MongoDB Inc.
MongoDB Connection in Husky
CS6604 Digital Libraries IDEAL Webpages Presented by
Arrested by the CAP Handling Data in Distributed Systems
Distributed File Systems
IST346: Scalability.
Crimson® 3.1 Updates January 2019.
Presentation transcript:

Senior Solutions Architect, MongoDB Inc. Massimo Brignoli #MongoDB Introduction to Sharding

Notes to the presenter Themes for this presentation: Horizontal scale only viable approach Cover the scenarios when to shard Explain the mechanics Themes: MongoDB makes this easy MongoDB includes this functionality free Best approach to with consistency

Agenda Scaling Data MongoDB's Approach Architecture Configuration Mechanics

Scaling Data

Examining Growth User Growth – 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)

Read/Write Throughput Exceeds I/O

Working Set Exceeds Physical Memory

Vertical Scalability (Scale Up)

Horizontal Scalability (Scale Out)

Data Store Scalability Custom Hardware – Oracle Custom Software – Facebook + MySQL – Google

Data Store Scalability Today MongoDB Auto-Sharding A data store that is – Free – Publicly available – Open Source ( – Horizontally scalable – Application independent

MongoDB's Approach to Sharding

Partitioning User defines shard key Shard key defines range of data Key space is like points on a line Range is a segment of that line

Initially 1 chunk Default max chunk size: 64mb MongoDB automatically splits & migrates chunks when max reached Data Distribution

Queries routed to specific shards MongoDB balances cluster MongoDB migrates data to new nodes Routing and Balancing

MongoDB Auto-Sharding Minimal effort required – Same interface as single mongod Two steps – Enable Sharding for a database – Shard collection within database

Architecture

What is a Shard? Shard is a node of the cluster Shard can be a single mongod or a replica set

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

Routing and Managing Data Mongos – Acts as a router / balancer – No local data (persists to config database) – Can have 1 or many

Sharding infrastructure

Configuration

Example Cluster

mongod --configsvr Starts a configuration server on the default port (27019) Starting the Configuration Server

mongos --configdb :27019 For 3 configuration servers: mongos --configdb :, :, : This is always how to start a new mongos, even if the cluster is already running Start the mongos Router

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 Start the shard database

On mongos: – sh.addShard(‘ :27018’) Adding a replica set: – sh.addShard(‘ / ’) Add the Shard

db.runCommand({ listshards:1 }) { "shards" : [{"_id”: "shard0000”,"host”: ” :27018” } ], "ok" : 1 } Verify that the shard was added

Enabling Sharding Enable sharding on a database sh.enableSharding(“ ”) Shard a collection with the given key sh.shardCollection(“.people”,{“country”:1}) Use a compound shard key to prevent duplicates sh.shardCollection(“.cars”,{“year”:1, ”uniqueid”:1})

Tag Aware Sharding Tag aware sharding allows you to control the distribution of your data Tag a range of shard keys – sh.addTagRange(,,, ) Tag a shard – sh.addShardTag(, )

Mechanics

Partitioning Remember it's based on ranges

Chunk is a section of the entire range

A chunk 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) Chunk splitting

Balancer is running 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 Balancing

The balancer on mongos takes out a “balancer lock” To see the status of these locks: use config db.locks.find({ _id: “balancer” }) Acquiring the Balancer Lock

The mongos sends a moveChunk command to source shard The source shard then notifies destination shard Destination shard starts pulling documents from source shard Moving the chunk

When complete, destination shard updates config server – Provides new locations of the chunks Committing Migration

Source shard deletes 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 Cleanup

Routing Requests

Cluster Request Routing Targeted Queries Scatter Gather Queries Scatter Gather Queries with Sort

Cluster Request Routing: Targeted Query

Routable request received

Request routed to appropriate shard

Shard returns results

Mongos returns results to client

Cluster Request Routing: Non-Targeted Query

Non-Targeted Request Received

Request sent to all shards

Shards return results to mongos

Mongos returns results to client

Cluster Request Routing: Non-Targeted Query with Sort

Non-Targeted request with sort received

Request sent to all shards

Query and sort performed locally

Shards return results to mongos

Mongos merges sorted results

Mongos returns results to client

Shard Key

Shard key 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

Shard Key Considerations Cardinality Write Distribution Query Isolation Reliability Index Locality

Notes to the presenter The upcoming section goes into detail about shard key considerations by working through a small example. This is a large deck, and if you’re pressed for time you might opt to skip this. However, if you’re delivering the combined sharding talk (meaning there isn’t an advanced sharding talk accompanying this one) it might be worth diving into this breifly for a few minutes.

{ _id: ObjectId(), user: 123, time: Date(), subject: “...”, recipients: [], body: “...”, attachments: [] } Example: Storage Most common scenario, can be applied to 90% cases Each document can be up to 16MB Each user may have GBs of storage Most common query: get user s sorted by time Indexes on {_id}, {user, time}, {recipients}

Example: Storage Cardinality Write Scaling Query Isolation Reliability Index Locality

Example: Storage Cardinality Write Scaling Query Isolation Reliability Index Locality _idDoc levelOne shard Scatter/gat her All users affected Good

Example: Storage Cardinality Write Scaling Query Isolation Reliability Index Locality _idDoc levelOne shard Scatter/gat her All users affected Good hash(_id)Hash levelAll Shards Scatter/gat her All users affected Poor

Example: Storage Cardinality Write Scaling Query Isolation Reliability Index Locality _idDoc levelOne shard Scatter/gat her All users affected Good hash(_id)Hash levelAll Shards Scatter/gat her All users affected Poor userMany docsAll ShardsTargeted Some users affected Good

Example: Storage Cardinality Write Scaling Query Isolation Reliability Index Locality _idDoc levelOne shard Scatter/gat her All users affected Good hash(_id)Hash levelAll Shards Scatter/gat her All users affected Poor userMany docsAll ShardsTargeted Some users affected Good user, timeDoc levelAll ShardsTargeted Some users affected Good

Conclusion

Read/Write Throughput Exceeds I/O

Working Set Exceeds Physical Memory

Sharding Enables Scale MongoDB’s Auto-Sharding – Easy to Configure – Consistent Interface – Free and Open Source

What’s next? – [ Insert Related Talks ] – [ Insert Upcoming Webinars ] – MongoDB User Group Resources

Thank You Software Engineer, MongoDB Speaker Name #hashtag