1774 lines
99 KiB
Markdown
1774 lines
99 KiB
Markdown
> * 原文地址：[github.com/donnemartin/system-design-primer](https://github.com/donnemartin/system-design-primer)
|
||
> * 译文出自：[掘金翻译计划](https://github.com/xitu/gold-miner)
|
||
> * 译者：
|
||
> * 校对者：
|
||
> * 这个 [链接](https://github.com/xitu/system-design-primer/compare/master...donnemartin:master) 用来查看本翻译与英文版是否有差别（如果你没有看到 README.md 发生变化，那就意味着这份翻译文档是最新的）。
|
||
|
||
# The System Design Primer
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/jj3A5N8.png">
|
||
<br/>
|
||
</p>
|
||
|
||
## Motivation
|
||
|
||
> Learn how to design large scale systems.
|
||
>
|
||
> Prep for the system design interview.
|
||
|
||
### Learn how to design large scale systems
|
||
|
||
Learning how to design scalable systems will help you become a better engineer.
|
||
|
||
System design is a broad topic. There is a **vast amount of resources scattered throughout the web** on system design principles.
|
||
|
||
This repo is an **organized collection** of resources to help you learn how to build systems at scale.
|
||
|
||
### Learn from the open source community
|
||
|
||
This is an early draft of a continually updated, open source project.
|
||
|
||
[Contributions](#contributing) are welcome!
|
||
|
||
### Prep for the system design interview
|
||
|
||
In addition to coding interviews, system design is a **required component** of the **technical interview process** at many tech companies.
|
||
|
||
**Practice common system design interview questions** and **compare** your results with **sample solutions**: discussions, code, and diagrams.
|
||
|
||
Additional topics for interview prep:
|
||
|
||
* [Study guide](#study-guide)
|
||
* [How to approach a system design interview question](#how-to-approach-a-system-design-interview-question)
|
||
* [System design interview questions, **with solutions**](#system-design-interview-questions-with-solutions)
|
||
* [Object-oriented design interview questions, **with solutions**](#object-oriented-design-interview-questions-with-solutions)
|
||
* [Additional system design interview questions](#additional-system-design-interview-questions)
|
||
|
||
## Anki flashcards
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/zdCAkB3.png">
|
||
<br/>
|
||
</p>
|
||
|
||
The provided [Anki flashcard decks](https://apps.ankiweb.net/) use spaced repetition to help you retain key system design concepts.
|
||
|
||
* [System design deck](resources/flash_cards/System%20Design.apkg)
|
||
* [System design exercises deck](resources/flash_cards/System%20Design%20Exercises.apkg)
|
||
* [Object oriented design exercises deck](resources/flash_cards/OO%20Design.apkg)
|
||
|
||
Great for use while on-the-go.
|
||
|
||
## Contributing
|
||
|
||
> Learn from the community.
|
||
|
||
Feel free to submit pull requests to help:
|
||
|
||
* Fix errors
|
||
* Improve sections
|
||
* Add new sections
|
||
|
||
Content that needs some polishing is placed [under development](#under-development).
|
||
|
||
Review the [Contributing Guidelines](CONTRIBUTING.md).
|
||
|
||
### Translations
|
||
|
||
Interested in **translating**? Please see the following [ticket](https://github.com/donnemartin/system-design-primer/issues/28).
|
||
|
||
## Index of system design topics
|
||
|
||
> Summaries of various system design topics, including pros and cons. **Everything is a trade-off**.
|
||
>
|
||
> Each section contains links to more in-depth resources.
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/jrUBAF7.png">
|
||
<br/>
|
||
</p>
|
||
|
||
* [System design topics: start here](#system-design-topics-start-here)
|
||
* [Step 1: Review the scalability video lecture](#step-1-review-the-scalability-video-lecture)
|
||
* [Step 2: Review the scalability article](#step-2-review-the-scalability-article)
|
||
* [Next steps](#next-steps)
|
||
* [Performance vs scalability](#performance-vs-scalability)
|
||
* [Latency vs throughput](#latency-vs-throughput)
|
||
* [Availability vs consistency](#availability-vs-consistency)
|
||
* [CAP theorem](#cap-theorem)
|
||
* [CP - consistency and partition tolerance](#cp---consistency-and-partition-tolerance)
|
||
* [AP - availability and partition tolerance](#ap---availability-and-partition-tolerance)
|
||
* [Consistency patterns](#consistency-patterns)
|
||
* [Weak consistency](#weak-consistency)
|
||
* [Eventual consistency](#eventual-consistency)
|
||
* [Strong consistency](#strong-consistency)
|
||
* [Availability patterns](#availability-patterns)
|
||
* [Fail-over](#fail-over)
|
||
* [Replication](#replication)
|
||
* [Domain name system](#domain-name-system)
|
||
* [Content delivery network](#content-delivery-network)
|
||
* [Push CDNs](#push-cdns)
|
||
* [Pull CDNs](#pull-cdns)
|
||
* [Load balancer](#load-balancer)
|
||
* [Active-passive](#active-passive)
|
||
* [Active-active](#active-active)
|
||
* [Layer 4 load balancing](#layer-4-load-balancing)
|
||
* [Layer 7 load balancing](#layer-7-load-balancing)
|
||
* [Horizontal scaling](#horizontal-scaling)
|
||
* [Reverse proxy (web server)](#reverse-proxy-web-server)
|
||
* [Load balancer vs reverse proxy](#load-balancer-vs-reverse-proxy)
|
||
* [Application layer](#application-layer)
|
||
* [Microservices](#microservices)
|
||
* [Service discovery](#service-discovery)
|
||
* [Database](#database)
|
||
* [Relational database management system (RDBMS)](#relational-database-management-system-rdbms)
|
||
* [Master-slave replication](#master-slave-replication)
|
||
* [Master-master replication](#master-master-replication)
|
||
* [Federation](#federation)
|
||
* [Sharding](#sharding)
|
||
* [Denormalization](#denormalization)
|
||
* [SQL tuning](#sql-tuning)
|
||
* [NoSQL](#nosql)
|
||
* [Key-value store](#key-value-store)
|
||
* [Document store](#document-store)
|
||
* [Wide column store](#wide-column-store)
|
||
* [Graph Database](#graph-database)
|
||
* [SQL or NoSQL](#sql-or-nosql)
|
||
* [Cache](#cache)
|
||
* [Client caching](#client-caching)
|
||
* [CDN caching](#cdn-caching)
|
||
* [Web server caching](#web-server-caching)
|
||
* [Database caching](#database-caching)
|
||
* [Application caching](#application-caching)
|
||
* [Caching at the database query level](#caching-at-the-database-query-level)
|
||
* [Caching at the object level](#caching-at-the-object-level)
|
||
* [When to update the cache](#when-to-update-the-cache)
|
||
* [Cache-aside](#cache-aside)
|
||
* [Write-through](#write-through)
|
||
* [Write-behind (write-back)](#write-behind-write-back)
|
||
* [Refresh-ahead](#refresh-ahead)
|
||
* [Asynchronism](#asynchronism)
|
||
* [Message queues](#message-queues)
|
||
* [Task queues](#task-queues)
|
||
* [Back pressure](#back-pressure)
|
||
* [Communication](#communication)
|
||
* [Transmission control protocol (TCP)](#transmission-control-protocol-tcp)
|
||
* [User datagram protocol (UDP)](#user-datagram-protocol-udp)
|
||
* [Remote procedure call (RPC)](#remote-procedure-call-rpc)
|
||
* [Representational state transfer (REST)](#representational-state-transfer-rest)
|
||
* [Security](#security)
|
||
* [Appendix](#appendix)
|
||
* [Powers of two table](#powers-of-two-table)
|
||
* [Latency numbers every programmer should know](#latency-numbers-every-programmer-should-know)
|
||
* [Additional system design interview questions](#additional-system-design-interview-questions)
|
||
* [Real world architectures](#real-world-architectures)
|
||
* [Company architectures](#company-architectures)
|
||
* [Company engineering blogs](#company-engineering-blogs)
|
||
* [Under development](#under-development)
|
||
* [Credits](#credits)
|
||
* [Contact info](#contact-info)
|
||
* [License](#license)
|
||
|
||
## Study guide
|
||
|
||
> Suggested topics to review based on your interview timeline (short, medium, long).
|
||
|
||
|
||
|
||
**Q: For interviews, do I need to know everything here?**
|
||
|
||
**A: No, you don't need to know everything here to prepare for the interview**.
|
||
|
||
What you are asked in an interview depends on variables such as:
|
||
|
||
* How much experience you have
|
||
* What your technical background is
|
||
* What positions you are interviewing for
|
||
* Which companies you are interviewing with
|
||
* Luck
|
||
|
||
More experienced candidates are generally expected to know more about system design. Architects or team leads might be expected to know more than individual contributors. Top tech companies are likely to have one or more design interview rounds.
|
||
|
||
Start broad and go deeper in a few areas. It helps to know a little about various key system design topics. Adjust the following guide based on your timeline, experience, what positions you are interviewing for, and which companies you are interviewing with.
|
||
|
||
* **Short timeline** - Aim for **breadth** with system design topics. Practice by solving **some** interview questions.
|
||
* **Medium timeline** - Aim for **breadth** and **some depth** with system design topics. Practice by solving **many** interview questions.
|
||
* **Long timeline** - Aim for **breadth** and **more depth** with system design topics. Practice by solving **most** interview questions.
|
||
|
||
| | Short | Medium | Long |
|
||
|---|---|---|---|
|
||
| Read through the [System design topics](#index-of-system-design-topics) to get a broad understanding of how systems work | :+1: | :+1: | :+1: |
|
||
| Read through a few articles in the [Company engineering blogs](#company-engineering-blogs) for the companies you are interviewing with | :+1: | :+1: | :+1: |
|
||
| Read through a few [Real world architectures](#real-world-architectures) | :+1: | :+1: | :+1: |
|
||
| Review [How to approach a system design interview question](#how-to-approach-a-system-design-interview-question) | :+1: | :+1: | :+1: |
|
||
| Work through [System design interview questions with solutions](#system-design-interview-questions-with-solutions) | Some | Many | Most |
|
||
| Work through [Object-oriented design interview questions with solutions](#object-oriented-design-interview-questions-with-solutions) | Some | Many | Most |
|
||
| Review [Additional system design interview questions](#additional-system-design-interview-questions) | Some | Many | Most |
|
||
|
||
## How to approach a system design interview question
|
||
|
||
> How to tackle a system design interview question.
|
||
|
||
The system design interview is an **open-ended conversation**. You are expected to lead it.
|
||
|
||
You can use the following steps to guide the discussion. To help solidify this process, work through the [System design interview questions with solutions](#system-design-interview-questions-with-solutions) section using the following steps.
|
||
|
||
### Step 1: Outline use cases, constraints, and assumptions
|
||
|
||
Gather requirements and scope the problem. Ask questions to clarify use cases and constraints. Discuss assumptions.
|
||
|
||
* Who is going to use it?
|
||
* How are they going to use it?
|
||
* How many users are there?
|
||
* What does the system do?
|
||
* What are the inputs and outputs of the system?
|
||
* How much data do we expect to handle?
|
||
* How many requests per second do we expect?
|
||
* What is the expected read to write ratio?
|
||
|
||
### Step 2: Create a high level design
|
||
|
||
Outline a high level design with all important components.
|
||
|
||
* Sketch the main components and connections
|
||
* Justify your ideas
|
||
|
||
### Step 3: Design core components
|
||
|
||
Dive into details for each core component. For example, if you were asked to [design a url shortening service](solutions/system_design/pastebin/README.md), discuss:
|
||
|
||
* Generating and storing a hash of the full url
|
||
* [MD5](solutions/system_design/pastebin/README.md) and [Base62](solutions/system_design/pastebin/README.md)
|
||
* Hash collisions
|
||
* SQL or NoSQL
|
||
* Database schema
|
||
* Translating a hashed url to the full url
|
||
* Database lookup
|
||
* API and object-oriented design
|
||
|
||
### Step 4: Scale the design
|
||
|
||
Identify and address bottlenecks, given the constraints. For example, do you need the following to address scalability issues?
|
||
|
||
* Load balancer
|
||
* Horizontal scaling
|
||
* Caching
|
||
* Database sharding
|
||
|
||
Discuss potential solutions and trade-offs. Everything is a trade-off. Address bottlenecks using [principles of scalable system design](#index-of-system-design-topics).
|
||
|
||
### Back-of-the-envelope calculations
|
||
|
||
You might be asked to do some estimates by hand. Refer to the [Appendix](#appendix) for the following resources:
|
||
|
||
* [Use back of the envelope calculations](http://highscalability.com/blog/2011/1/26/google-pro-tip-use-back-of-the-envelope-calculations-to-choo.html)
|
||
* [Powers of two table](#powers-of-two-table)
|
||
* [Latency numbers every programmer should know](#latency-numbers-every-programmer-should-know)
|
||
|
||
### Source(s) and further reading
|
||
|
||
Check out the following links to get a better idea of what to expect:
|
||
|
||
* [How to ace a systems design interview](https://www.palantir.com/2011/10/how-to-rock-a-systems-design-interview/)
|
||
* [The system design interview](http://www.hiredintech.com/system-design)
|
||
* [Intro to Architecture and Systems Design Interviews](https://www.youtube.com/watch?v=ZgdS0EUmn70)
|
||
|
||
## System design interview questions with solutions
|
||
|
||
> Common system design interview questions with sample discussions, code, and diagrams.
|
||
>
|
||
> Solutions linked to content in the `solutions/` folder.
|
||
|
||
| Question | |
|
||
|---|---|
|
||
| Design Pastebin.com (or Bit.ly) | [Solution](solutions/system_design/pastebin/README.md) |
|
||
| Design the Twitter timeline (or Facebook feed)<br/>Design Twitter search (or Facebook search) | [Solution](solutions/system_design/twitter/README.md) |
|
||
| Design a web crawler | [Solution](solutions/system_design/web_crawler/README.md) |
|
||
| Design Mint.com | [Solution](solutions/system_design/mint/README.md) |
|
||
| Design the data structures for a social network | [Solution](solutions/system_design/social_graph/README.md) |
|
||
| Design a key-value store for a search engine | [Solution](solutions/system_design/query_cache/README.md) |
|
||
| Design Amazon's sales ranking by category feature | [Solution](solutions/system_design/sales_rank/README.md) |
|
||
| Design a system that scales to millions of users on AWS | [Solution](solutions/system_design/scaling_aws/README.md) |
|
||
| Add a system design question | [Contribute](#contributing) |
|
||
|
||
### Design Pastebin.com (or Bit.ly)
|
||
|
||
[View exercise and solution](solutions/system_design/pastebin/README.md)
|
||
|
||
|
||
|
||
### Design the Twitter timeline and search (or Facebook feed and search)
|
||
|
||
[View exercise and solution](solutions/system_design/twitter/README.md)
|
||
|
||
|
||
|
||
### Design a web crawler
|
||
|
||
[View exercise and solution](solutions/system_design/web_crawler/README.md)
|
||
|
||
|
||
|
||
### Design Mint.com
|
||
|
||
[View exercise and solution](solutions/system_design/mint/README.md)
|
||
|
||
|
||
|
||
### Design the data structures for a social network
|
||
|
||
[View exercise and solution](solutions/system_design/social_graph/README.md)
|
||
|
||
|
||
|
||
### Design a key-value store for a search engine
|
||
|
||
[View exercise and solution](solutions/system_design/query_cache/README.md)
|
||
|
||
|
||
|
||
### Design Amazon's sales ranking by category feature
|
||
|
||
[View exercise and solution](solutions/system_design/sales_rank/README.md)
|
||
|
||
|
||
|
||
### Design a system that scales to millions of users on AWS
|
||
|
||
[View exercise and solution](solutions/system_design/scaling_aws/README.md)
|
||
|
||
|
||
|
||
## 面向对象设计面试问题及解答
|
||
|
||
> 常见面向对象设计面试问题及样例讨论，代码和图标演示。
|
||
>
|
||
> 与内容有关的解决方案在 `solutions/` 文件夹中。
|
||
|
||
>**注：此节还在完善中**
|
||
|
||
| 问题 | |
|
||
|---|---|
|
||
| 设计 hash map | [解决方案](solutions/object_oriented_design/hash_table/hash_map.ipynb) |
|
||
| 设计 LRU 缓存 | [解决方案](solutions/object_oriented_design/lru_cache/lru_cache.ipynb) |
|
||
| 设计一个呼叫中心 | [解决方案](solutions/object_oriented_design/call_center/call_center.ipynb) |
|
||
| 设计一副牌 | [解决方案](solutions/object_oriented_design/deck_of_cards/deck_of_cards.ipynb) |
|
||
| 设计一个停车场 | [解决方案](solutions/object_oriented_design/parking_lot/parking_lot.ipynb) |
|
||
| 设计一个聊天服务 | [解决方案](solutions/object_oriented_design/online_chat/online_chat.ipynb) |
|
||
| 设计一个环形数组 | [待解决](#contributing) |
|
||
| 添加一个面向对象设计问题 | [待解决](#contributing) |
|
||
|
||
## 系统设计主题：从这里开始
|
||
|
||
不熟悉系统设计？
|
||
|
||
首先，你应对一般性原则有着基本理解，知道它们是什么，怎样使用以及利弊。
|
||
|
||
### 第一步：回顾可扩展性（scalability）的视频讲座
|
||
|
||
[哈佛大学可扩展性讲座](https://www.youtube.com/watch?v=-W9F__D3oY4)
|
||
|
||
* 主题涵盖
|
||
* 纵向扩展（Vertical scaling）
|
||
* 横向扩展（Horizontal scaling）
|
||
* 缓存
|
||
* 负载均衡
|
||
* 数据库复制
|
||
* 数据库分区
|
||
|
||
### 第二步：回顾可扩展性文章
|
||
|
||
[可扩展性](http://www.lecloud.net/tagged/scalability)
|
||
|
||
* 主题涵盖：
|
||
* [Clones](http://www.lecloud.net/post/7295452622/scalability-for-dummies-part-1-clones)
|
||
* [数据库](http://www.lecloud.net/post/7994751381/scalability-for-dummies-part-2-database)
|
||
* [缓存](http://www.lecloud.net/post/9246290032/scalability-for-dummies-part-3-cache)
|
||
* [异步](http://www.lecloud.net/post/9699762917/scalability-for-dummies-part-4-asynchronism)
|
||
|
||
### 下一步
|
||
|
||
接下来，我们将看看高阶的权衡:
|
||
|
||
* **性能** 与 **可扩展性**
|
||
* **延迟** 与 **吞吐量**
|
||
* **可用性** 与 **一致性**
|
||
|
||
记住**一切都面临取舍**。
|
||
|
||
然后，我们将深入更具体的主题，如 DNS，CDN 和负载均衡器。
|
||
|
||
## 性能与可扩展性
|
||
|
||
如果服务**性能**的增长与资源的增加是成比例的，服务是可扩展的。通常，提高性能意味着服务于更多的工作单元，另一方面，当数据集增长时，同样也可以处理更大的工作单位。<sup><a href=http://www.allthingsdistributed.com/2006/03/a_word_on_scalability.html>1</a></sup>
|
||
|
||
另一种方式来看待性能与可扩展性(关系):
|
||
|
||
* 如果你的系统有 **性能** 问题，对于单个用户来说是缓慢的。
|
||
* 如果你的系统有 **可扩展性** 问题，单个用户较快但在高负荷下会慢。
|
||
|
||
### 来源及延伸阅读
|
||
|
||
* [A word on scalability](http://www.allthingsdistributed.com/2006/03/a_word_on_scalability.html)
|
||
* [Scalability, availability, stability, patterns](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/)
|
||
|
||
## 延迟与吞吐量
|
||
|
||
**延迟**是执行操作或运算结果所花费的时间。
|
||
|
||
**吞吐量**是单位时间内(执行)此类操作或运算的数量。
|
||
|
||
通常，你应该以**可接受级延迟**下的**最大吞吐量**为目标。
|
||
|
||
### 来源及延伸阅读
|
||
|
||
* [Understanding latency vs throughput](https://community.cadence.com/cadence_blogs_8/b/sd/archive/2010/09/13/understanding-latency-vs-throughput)
|
||
|
||
## 可用性与一致性
|
||
|
||
### CAP 定理
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/bgLMI2u.png">
|
||
<br/>
|
||
<i><a href=http://robertgreiner.com/2014/08/cap-theorem-revisited>来源:CAP theorem revisited</a></i>
|
||
</p>
|
||
|
||
在一个分布式计算系统中，只能同时满足下列的两点:
|
||
|
||
* **一致性** - 每次访问都能获得最新数据但可能会收到错误响应
|
||
* **可用性** - 每次访问都能收到非错响应，但不保证获取到最新数据
|
||
* **分区容错性** - 在任意分区网络故障的情况下系统仍能继续运行
|
||
|
||
*网络不可靠，所以你应要支持分区容错性，并需要在软件可用性和一致性间做出取舍。*
|
||
|
||
#### CP 方式 - 一致性和分区容错性
|
||
|
||
等待分区节点的响应可能会导致延时错误。如果你的业务需求需要原子读写，CP 方式是一个不错的选择。
|
||
|
||
#### AP 方式 - 可用性与分区容错性
|
||
|
||
响应返回的最近版本数据可能并不是最新的。当分区解析完后，写入(操作)可能要花一些时间来传播。
|
||
|
||
如果业务需求允许[最终一致性](#eventual-consistency)或当有外部故障时要求系统继续运行，AP 方式是一个不错的选择。
|
||
|
||
### 来源及延伸阅读
|
||
|
||
* [CAP theorem revisited](http://robertgreiner.com/2014/08/cap-theorem-revisited/)
|
||
* [A plain english introduction to CAP theorem](http://ksat.me/a-plain-english-introduction-to-cap-theorem/)
|
||
* [CAP FAQ](https://github.com/henryr/cap-faq)
|
||
|
||
## 一致性模式
|
||
|
||
有同一份数据的多份副本，我们面临着怎样同步它们的选择，以便让客户端有一致的显示数据。回想[CAP 定理](#cap-theorem)中的一致性定义 - 每次访问都能获得最新数据但可能会收到错误响应
|
||
|
||
|
||
### 弱一致性
|
||
|
||
在写入之后，访问可能看到，也可能看不到(写入数据)。尽力优化之让其可见。
|
||
|
||
这种方式可以 memcached 等系统中看到。弱一致性在 VoIP，视频聊天和实时多人游戏等真实用例中表现不错。打个比方，如果你在通话中丢失信号几秒钟时间，当重新连接时你是听不到这几秒钟所说的话的。
|
||
|
||
### 最终一致性
|
||
|
||
在写入后，访问最终能看到写入数据(通常在数毫秒内)。数据被异步复制。
|
||
|
||
此种方式在 DNS 和 email 等系统中使用。最终一致性在高可用性系统中效果不错。
|
||
|
||
### 强一致性
|
||
|
||
在写入后，访问立即可见。数据被同步复制。
|
||
|
||
此种方式在文件系统和关系型数据库(RDBMS)中使用。强一致性在需要记录的系统中运作良好。
|
||
|
||
### 来源及延伸阅读
|
||
|
||
* [Transactions across data centers](http://snarfed.org/transactions_across_datacenters_io.html)
|
||
|
||
## 可用性模式
|
||
|
||
有两种支持高可用性的模式: **故障切换(fail-over)**和**复制(replication)**。
|
||
|
||
### 故障切换
|
||
|
||
#### 工作到备用切换(Active-passive)
|
||
|
||
关于工作到备用的故障切换，工作服务器发送周期信号给等待中的备用服务器。如果周期信号中断，备用服务器切换成工作服务器的 IP 地址并恢复服务。
|
||
|
||
宕机时间取决于备用服务器处于‘热‘等待状态还是需要从‘冷‘等待状态进行启动。只有工作服务器处理流量。
|
||
|
||
工作到备用的故障切换也被称为主动切换。
|
||
|
||
#### 双工作切换(Active-active)
|
||
|
||
在双工作切换中，双方都在管控流量，在它们之间分散负载。
|
||
|
||
如果是外网服务器，DNS 将需要对两方都了解。如果是内网服务器，应用程序逻辑将需要对两方都了解。
|
||
|
||
双工作切换也可以称为主主切换。
|
||
|
||
### 缺陷:故障切换
|
||
|
||
* 故障切换添加了更多硬件并增加复杂性
|
||
* 如果新写入数据在能被复制到备用系统之前，工作系统出现了故障，则有可能会丢失数据。
|
||
|
||
### 复制
|
||
|
||
#### 主-从复制和主-主复制
|
||
|
||
这个主题进一步探讨了[数据库](#database)部分:
|
||
|
||
* [主-从复制](#master-slave-replication)
|
||
* [主-主复制](#master-master-replication)
|
||
|
||
## 域名系统
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/IOyLj4i.jpg">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/srikrupa5/dns-security-presentation-issa>来源: DNS security presentation</a></i>
|
||
</p>
|
||
|
||
域名系统是把 www.example.com 等域名转换成 IP 地址。
|
||
|
||
域名系统是分层次的，一些 DNS 服务器位于顶层。当查询(域名) IP 时，路由或 ISP 提供连接 DNS 服务器的信息。较低层 DNS 服务器缓存映射，它可能会因为 DNS 传播延时而失效。DNS 结果可以缓存在浏览器或操作系统中一段时间，时间长短取决于[存活时间 TTL](https://en.wikipedia.org/wiki/Time_to_live)。
|
||
|
||
* **NS 记录(域名服务)** - 指定解析域名或子域名的 DNS 服务器。
|
||
* **MX 记录(邮件交换)** - 指定接收信息的邮件服务器。
|
||
* **A 记录(地址)** - 指定域名对应的 IP 地址记录。
|
||
* **CNAME(规范)** - 一个域名映射到另一个域名或 `CNAME` 记录(example.com 指向 www.example.com)或映射到一个 `A` 记录。
|
||
|
||
[CloudFlare](https://www.cloudflare.com/dns/) 和 [Route 53](https://aws.amazon.com/route53/) 等平台提供管理 DNS 的功能。某些 DNS 服务通过集中方式来路由流量:
|
||
|
||
* [加权轮询调度](http://g33kinfo.com/info/archives/2657)
|
||
* 防止流量进入维护中的服务器
|
||
* 在不同大小集群间负载均衡
|
||
* A/B 测试
|
||
* 基于延迟路由
|
||
* 基于地理位置路由
|
||
|
||
### 缺陷:DNS
|
||
|
||
* 虽说缓存可以来减轻 DNS 延迟，但连接 DNS 服务器还是带来了轻微的延迟。
|
||
* 虽然它们通常由[政府，网络服务提供商和大公司](http://superuser.com/questions/472695/who-controls-the-dns-servers/472729)管理，但 DNS 服务管理仍可能是复杂的。
|
||
* DNS 服务最近遭受 [DDoS 攻击](http://dyn.com/blog/dyn-analysis-summary-of-friday-october-21-attack/)，防止人们访问 Twitter 等网站而不知道 Twitter 的 IP 地址。
|
||
|
||
### 来源及延伸阅读
|
||
|
||
* [DNS architecture](https://technet.microsoft.com/en-us/library/dd197427(v=ws.10).aspx)
|
||
* [Wikipedia](https://en.wikipedia.org/wiki/Domain_Name_System)
|
||
* [DNS articles](https://support.dnsimple.com/categories/dns/)
|
||
|
||
## 内容分发网络
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/h9TAuGI.jpg">
|
||
<br/>
|
||
<i><a href=https://www.creative-artworks.eu/why-use-a-content-delivery-network-cdn/>来源: Why use a CDN</a></i>
|
||
</p>
|
||
|
||
内容分发网络是一个全球性的代理服务器分布式网络，它从靠近用户的位置提供内容。通常，HTML/CSS/JS，图片和视频等静态内容由 CDN 提供，虽然亚马逊 CloudFront 等也支持动态内容。CDN 的 DNS 解析会告知客户端连接哪台服务器。
|
||
|
||
将内容存储在 CDN 上可以从两个方面来提供性能:
|
||
|
||
* 从靠近用户的数据中心提供资源
|
||
* 通过 CDN 你的服务器不必真的处理请求
|
||
|
||
### CDN 推送(push)
|
||
|
||
当你服务器上内容发生变动时，推送 CDN 接受新的内容。你负责提供内容，直接接推送至 CDN 并重写 URL 地址以指向 CDN 地址。你可以配置内容到期时间及何时更新。内容只有在更改或新增是才推送，最小化流量，但最大化存储空间。
|
||
|
||
|
||
|
||
|
||
### CDN 拉取(pull)
|
||
|
||
CDN 拉取是当第一个用户请求该资源时，从服务器上拉取资源。你将内容留在自己的服务器上并重写 URL 指向 CDN 地址。直到内容被缓存在 CDN 上，这样请求会更慢。
|
||
|
||
[存活时间(TTL)](https://en.wikipedia.org/wiki/Time_to_live)决定缓存多久时间。CDN 拉取方式小化 CDN 上的储存空间，但如果过期文件并在实际更改之前被拉取，则会导致冗余的流量。
|
||
|
||
高流量站点使用 CDN 拉取效果不错，因为只有最近请求的内容保存在 CDN 中，流量才能更平衡地分散。
|
||
|
||
### 缺陷:CDN
|
||
|
||
* CDN 成本可能因流量而异，可能在权衡之后你将不会使用 CDN。
|
||
* 如果在 TTL 过期之前更新内容，CDN 缓存内容可能会过时。
|
||
* CDN 需要更改静态内容的 URL 地址以指向 CDN。
|
||
|
||
### 来源及延伸阅读
|
||
|
||
* [Globally distributed content delivery](http://repository.cmu.edu/cgi/viewcontent.cgi?article=2112&context=compsci)
|
||
* [The differences between push and pull CDNs](http://www.travelblogadvice.com/technical/the-differences-between-push-and-pull-cdns/)
|
||
* [Wikipedia](https://en.wikipedia.org/wiki/Content_delivery_network)
|
||
|
||
## 负载均衡器
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/h81n9iK.png">
|
||
<br/>
|
||
<i><a href=http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html>Source: Scalable system design patterns</a></i>
|
||
</p>
|
||
|
||
负载均衡器将传入的请求分发到应用服务器和数据库等计算资源。无论哪种情况，负载均衡器将从计算资源来的响应返回给恰当的客户端。负载均衡器的效用在于:
|
||
|
||
* 防止请求进入不好的服务器
|
||
* 防止资源过载
|
||
* 帮助消除单一的故障点
|
||
|
||
负载均衡器可以通过硬件(昂贵)或 HAProxy 等软件来实现。
|
||
增加的益处包括:
|
||
|
||
* **SSL 终结** - 解密传入的请求并加密服务器响应，这样的话后端服务器就不必再执行这些潜在高消耗运算了。
|
||
* 不需要再每台服务器上安装 [X.509 证书](https://en.wikipedia.org/wiki/X.509)。
|
||
* **Session 留存** - 如果 Web 应用程序不追踪回话，发出 cookie 并将特定客户端的请求路由到同一实例。
|
||
|
||
通常会设置采用[工作-备用](#active-passive) 或 [active-active](#active-active) 模式的多个负载均衡器，以免发生故障。
|
||
|
||
负载均衡器能基于多种方式来路由流量:
|
||
|
||
* 随机
|
||
* 最少负载
|
||
* Session/cookies
|
||
* [轮询调度或加权轮询调度算法](http://g33kinfo.com/info/archives/2657)
|
||
* [四层负载均衡](#layer-4-load-balancing)
|
||
* [7 层负载均衡](#layer-7-load-balancing)
|
||
|
||
### 四层负载均衡
|
||
|
||
四层负载均衡根据监看[传输层](#communication)的信息来决定如何分发请求。通常，这会涉及来源，目标 IP 地址和请求头中的端口，但不包括数据包(报文)内容。四层负载均衡执行[网络地址转换(NAT)](https://www.nginx.com/resources/glossary/layer-4-load-balancing/)来向上游服务器转发网络数据包。
|
||
|
||
### 7 层负载均衡器
|
||
|
||
7 层负载均衡器根据监看[应用层](#communication)来决定怎样分发请求。这会涉及请求头的内容，消息和 cookie。7 层负载均衡器终结网络流量，读取消息，做出负载均衡判定，然后连接选定的特定服务器。比如，一个 7 层负载均衡器能直接将视频流量连接到托管视频的服务器，同时将更敏感的用户账单流量引导到安全性更强的服务器。
|
||
|
||
以损失灵活性为代价，4 层负载均衡比 7 层负载均衡只需更少时间和计算资源，虽然这在现代商用硬件上的性能影响甚微。
|
||
|
||
### 横向扩展
|
||
|
||
负载均衡器还能帮助横向扩展，提高性能和可用性。使用商业硬件的性价比更高，并且比在单台硬件上**纵向扩展**更贵的硬件具有更高的可用性。招聘商业硬件的人才比特定企业系统的人才更容易。
|
||
|
||
#### 缺陷:横向扩展
|
||
|
||
* 横向扩展引入了复杂度并设计服务器复制
|
||
* 服务器应该是无状态的:它们也不该包含任何与用户关联的数据，像 session 或资料图片。
|
||
* session 可以集中存储在数据库或持久化[缓存](#cache)(Redis, Memcached)的数据存储区中。
|
||
* 缓存和数据库等下游服务器需要随着上游服务器扩展，处理更多的并发连接。
|
||
|
||
### 缺陷:负载均衡器
|
||
|
||
* 如果没有足够的资源配置或配置错误，负载均衡器会变成一个性能瓶颈。
|
||
* 引入负载均衡器以帮助消除单点故障导致了额外的复杂性。
|
||
* 单个负载均衡器会导致单点故障，但配置多个负载均衡器会进一步增加复杂性。
|
||
|
||
### 来源及延伸阅读
|
||
|
||
* [NGINX architecture](https://www.nginx.com/blog/inside-nginx-how-we-designed-for-performance-scale/)
|
||
* [HAProxy architecture guide](http://www.haproxy.org/download/1.2/doc/architecture.txt)
|
||
* [Scalability](http://www.lecloud.net/post/7295452622/scalability-for-dummies-part-1-clones)
|
||
* [Wikipedia](https://en.wikipedia.org/wiki/Load_balancing_(computing))
|
||
* [Layer 4 load balancing](https://www.nginx.com/resources/glossary/layer-4-load-balancing/)
|
||
* [Layer 7 load balancing](https://www.nginx.com/resources/glossary/layer-7-load-balancing/)
|
||
* [ELB listener config](http://docs.aws.amazon.com/elasticloadbalancing/latest/classic/elb-listener-config.html)
|
||
|
||
## Reverse proxy (web server)
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/n41Azff.png">
|
||
<br/>
|
||
<i><a href=https://upload.wikimedia.org/wikipedia/commons/6/67/Reverse_proxy_h2g2bob.svg>Source: Wikipedia</a></i>
|
||
<br/>
|
||
</p>
|
||
|
||
A reverse proxy is a web server that centralizes internal services and provides unified interfaces to the public. Requests from clients are forwarded to a server that can fulfill it before the reverse proxy returns the server's response to the client.
|
||
|
||
Additional benefits include:
|
||
|
||
* **Increased security** - Hide information about backend servers, blacklist IPs, limit number of connections per client
|
||
* **Increased scalability and flexibility** - Clients only see the reverse proxy's IP, allowing you to scale servers or change their configuration
|
||
* **SSL termination** - Decrypt incoming requests and encrypt server responses so backend servers do not have to perform these potentially expensive operations
|
||
* Removes the need to install [X.509 certificates](https://en.wikipedia.org/wiki/X.509) on each server
|
||
* **Compression** - Compress server responses
|
||
* **Caching** - Return the response for cached requests
|
||
* **Static content** - Serve static content directly
|
||
* HTML/CSS/JS
|
||
* Photos
|
||
* Videos
|
||
* Etc
|
||
|
||
### Load balancer vs reverse proxy
|
||
|
||
* Deploying a load balancer is useful when you have multiple servers. Often, load balancers route traffic to a set of servers serving the same function.
|
||
* Reverse proxies can be useful even with just one web server or application server, opening up the benefits described in the previous section.
|
||
* Solutions such as NGINX and HAProxy can support both layer 7 reverse proxying and load balancing.
|
||
|
||
### Disadvantage(s): reverse proxy
|
||
|
||
* Introducing a reverse proxy results in increased complexity.
|
||
* A single reverse proxy is a single point of failure, configuring multiple reverse proxies (ie a [failover](https://en.wikipedia.org/wiki/Failover)) further increases complexity.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [Reverse proxy vs load balancer](https://www.nginx.com/resources/glossary/reverse-proxy-vs-load-balancer/)
|
||
* [NGINX architecture](https://www.nginx.com/blog/inside-nginx-how-we-designed-for-performance-scale/)
|
||
* [HAProxy architecture guide](http://www.haproxy.org/download/1.2/doc/architecture.txt)
|
||
* [Wikipedia](https://en.wikipedia.org/wiki/Reverse_proxy)
|
||
|
||
## Application layer
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/yB5SYwm.png">
|
||
<br/>
|
||
<i><a href=http://lethain.com/introduction-to-architecting-systems-for-scale/#platform_layer>Source: Intro to architecting systems for scale</a></i>
|
||
</p>
|
||
|
||
Separating out the web layer from the application layer (also known as platform layer) allows you to scale and configure both layers independently. Adding a new API results in adding application servers without necessarily adding additional web servers.
|
||
|
||
The **single responsibility principle** advocates for small and autonomous services that work together. Small teams with small services can plan more aggressively for rapid growth.
|
||
|
||
Workers in the application layer also help enable [asynchronism](#asynchronism).
|
||
|
||
### Microservices
|
||
|
||
Related to this discussion are [microservices](https://en.wikipedia.org/wiki/Microservices), which can be described as a suite of independently deployable, small, modular services. Each service runs a unique process and communicates through a well-defined, lightweight mechanism to serve a business goal. <sup><a href=https://smartbear.com/learn/api-design/what-are-microservices>1</a></sup>
|
||
|
||
Pinterest, for example, could have the following microservices: user profile, follower, feed, search, photo upload, etc.
|
||
|
||
### Service Discovery
|
||
|
||
Systems such as [Zookeeper](http://www.slideshare.net/sauravhaloi/introduction-to-apache-zookeeper) can help services find each other by keeping track of registered names, addresses, ports, etc.
|
||
|
||
### Disadvantage(s): application layer
|
||
|
||
* Adding an application layer with loosely coupled services requires a different approach from an architectural, operations, and process viewpoint (vs a monolithic system).
|
||
* Microservices can add complexity in terms of deployments and operations.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [Intro to architecting systems for scale](http://lethain.com/introduction-to-architecting-systems-for-scale)
|
||
* [Crack the system design interview](http://www.puncsky.com/blog/2016/02/14/crack-the-system-design-interview/)
|
||
* [Service oriented architecture](https://en.wikipedia.org/wiki/Service-oriented_architecture)
|
||
* [Introduction to Zookeeper](http://www.slideshare.net/sauravhaloi/introduction-to-apache-zookeeper)
|
||
* [Here's what you need to know about building microservices](https://cloudncode.wordpress.com/2016/07/22/msa-getting-started/)
|
||
|
||
## Database
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/Xkm5CXz.png">
|
||
<br/>
|
||
<i><a href=https://www.youtube.com/watch?v=vg5onp8TU6Q>Source: Scaling up to your first 10 million users</a></i>
|
||
</p>
|
||
|
||
### Relational database management system (RDBMS)
|
||
|
||
A relational database like SQL is a collection of data items organized in tables.
|
||
|
||
**ACID** is a set of properties of relational database [transactions](https://en.wikipedia.org/wiki/Database_transaction).
|
||
|
||
* **Atomicity** - Each transaction is all or nothing
|
||
* **Consistency** - Any transaction will bring the database from one valid state to another
|
||
* **Isolation** - Executing transactions concurrently has the same results as if the transactions were executed serially
|
||
* **Durability** - Once a transaction has been committed, it will remain so
|
||
|
||
There are many techniques to scale a relational database: **master-slave replication**, **master-master replication**, **federation**, **sharding**, **denormalization**, and **SQL tuning**.
|
||
|
||
#### Master-slave replication
|
||
|
||
The master serves reads and writes, replicating writes to one or more slaves, which serve only reads. Slaves can also replicate to additional slaves in a tree-like fashion. If the master goes offline, the system can continue to operate in read-only mode until a slave is promoted to a master or a new master is provisioned.
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/C9ioGtn.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
##### Disadvantage(s): master-slave replication
|
||
|
||
* Additional logic is needed to promote a slave to a master.
|
||
* See [Disadvantage(s): replication](#disadvantages-replication) for points related to **both** master-slave and master-master.
|
||
|
||
#### Master-master replication
|
||
|
||
Both masters serve reads and writes and coordinate with each other on writes. If either master goes down, the system can continue to operate with both reads and writes.
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/krAHLGg.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
##### Disadvantage(s): master-master replication
|
||
|
||
* You'll need a load balancer or you'll need to make changes to your application logic to determine where to write.
|
||
* Most master-master systems are either loosely consistent (violating ACID) or have increased write latency due to synchronization.
|
||
* Conflict resolution comes more into play as more write nodes are added and as latency increases.
|
||
* See [Disadvantage(s): replication](#disadvantages-replication) for points related to **both** master-slave and master-master.
|
||
|
||
##### Disadvantage(s): replication
|
||
|
||
* There is a potential for loss of data if the master fails before any newly written data can be replicated to other nodes.
|
||
* Writes are replayed to the read replicas. If there are a lot of writes, the read replicas can get bogged down with replaying writes and can't do as many reads.
|
||
* The more read slaves, the more you have to replicate, which leads to greater replication lag.
|
||
* On some systems, writing to the master can spawn multiple threads to write in parallel, whereas read replicas only support writing sequentially with a single thread.
|
||
* Replication adds more hardware and additional complexity.
|
||
|
||
##### Source(s) and further reading: replication
|
||
|
||
* [Scalability, availability, stability, patterns](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/)
|
||
* [Multi-master replication](https://en.wikipedia.org/wiki/Multi-master_replication)
|
||
|
||
#### Federation
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/U3qV33e.png">
|
||
<br/>
|
||
<i><a href=https://www.youtube.com/watch?v=vg5onp8TU6Q>Source: Scaling up to your first 10 million users</a></i>
|
||
</p>
|
||
|
||
Federation (or functional partitioning) splits up databases by function. For example, instead of a single, monolithic database, you could have three databases: **forums**, **users**, and **products**, resulting in less read and write traffic to each database and therefore less replication lag. Smaller databases result in more data that can fit in memory, which in turn results in more cache hits due to improved cache locality. With no single central master serializing writes you can write in parallel, increasing throughput.
|
||
|
||
##### Disadvantage(s): federation
|
||
|
||
* Federation is not effective if your schema requires huge functions or tables.
|
||
* You'll need to update your application logic to determine which database to read and write.
|
||
* Joining data from two databases is more complex with a [server link](http://stackoverflow.com/questions/5145637/querying-data-by-joining-two-tables-in-two-database-on-different-servers).
|
||
* Federation adds more hardware and additional complexity.
|
||
|
||
##### Source(s) and further reading: federation
|
||
|
||
* [Scaling up to your first 10 million users](https://www.youtube.com/watch?v=vg5onp8TU6Q)
|
||
|
||
#### Sharding
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/wU8x5Id.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
Sharding distributes data across different databases such that each database can only manage a subset of the data. Taking a users database as an example, as the number of users increases, more shards are added to the cluster.
|
||
|
||
Similar to the advantages of [federation](#federation), sharding results in less read and write traffic, less replication, and more cache hits. Index size is also reduced, which generally improves performance with faster queries. If one shard goes down, the other shards are still operational, although you'll want to add some form of replication to avoid data loss. Like federation, there is no single central master serializing writes, allowing you to write in parallel with increased throughput.
|
||
|
||
Common ways to shard a table of users is either through the user's last name initial or the user's geographic location.
|
||
|
||
##### Disadvantage(s): sharding
|
||
|
||
* You'll need to update your application logic to work with shards, which could result in complex SQL queries.
|
||
* Data distribution can become lopsided in a shard. For example, a set of power users on a shard could result in increased load to that shard compared to others.
|
||
* Rebalancing adds additional complexity. A sharding function based on [consistent hashing](http://www.paperplanes.de/2011/12/9/the-magic-of-consistent-hashing.html) can reduce the amount of transferred data.
|
||
* Joining data from multiple shards is more complex.
|
||
* Sharding adds more hardware and additional complexity.
|
||
|
||
##### Source(s) and further reading: sharding
|
||
|
||
* [The coming of the shard](http://highscalability.com/blog/2009/8/6/an-unorthodox-approach-to-database-design-the-coming-of-the.html)
|
||
* [Shard database architecture](https://en.wikipedia.org/wiki/Shard_(database_architecture))
|
||
* [Consistent hashing](http://www.paperplanes.de/2011/12/9/the-magic-of-consistent-hashing.html)
|
||
|
||
#### Denormalization
|
||
|
||
Denormalization attempts to improve read performance at the expense of some write performance. Redundant copies of the data are written in multiple tables to avoid expensive joins. Some RDBMS such as [PostgreSQL](https://en.wikipedia.org/wiki/PostgreSQL) and Oracle support [materialized views](https://en.wikipedia.org/wiki/Materialized_view) which handle the work of storing redundant information and keeping redundant copies consistent.
|
||
|
||
Once data becomes distributed with techniques such as [federation](#federation) and [sharding](#sharding), managing joins across data centers further increases complexity. Denormalization might circumvent the need for such complex joins.
|
||
|
||
In most systems, reads can heavily number writes 100:1 or even 1000:1. A read resulting in a complex database join can be very expensive, spending a significant amount of time on disk operations.
|
||
|
||
##### Disadvantage(s): denormalization
|
||
|
||
* Data is duplicated.
|
||
* Constraints can help redundant copies of information stay in sync, which increases complexity of the database design.
|
||
* A denormalized database under heavy write load might perform worse than its normalized counterpart.
|
||
|
||
###### Source(s) and further reading: denormalization
|
||
|
||
* [Denormalization](https://en.wikipedia.org/wiki/Denormalization)
|
||
|
||
#### SQL tuning
|
||
|
||
SQL tuning is a broad topic and many [books](https://www.amazon.com/s/ref=nb_sb_noss_2?url=search-alias%3Daps&field-keywords=sql+tuning) have been written as reference.
|
||
|
||
It's important to **benchmark** and **profile** to simulate and uncover bottlenecks.
|
||
|
||
* **Benchmark** - Simulate high-load situations with tools such as [ab](http://httpd.apache.org/docs/2.2/programs/ab.html).
|
||
* **Profile** - Enable tools such as the [slow query log](http://dev.mysql.com/doc/refman/5.7/en/slow-query-log.html) to help track performance issues.
|
||
|
||
Benchmarking and profiling might point you to the following optimizations.
|
||
|
||
##### Tighten up the schema
|
||
|
||
* MySQL dumps to disk in contiguous blocks for fast access.
|
||
* Use `CHAR` instead of `VARCHAR` for fixed-length fields.
|
||
* `CHAR` effectively allows for fast, random access, whereas with `VARCHAR`, you must find the end of a string before moving onto the next one.
|
||
* Use `TEXT` for large blocks of text such as blog posts. `TEXT` also allows for boolean searches. Using a `TEXT` field results in storing a pointer on disk that is used to locate the text block.
|
||
* Use `INT` for larger numbers up to 2^32 or 4 billion.
|
||
* Use `DECIMAL` for currency to avoid floating point representation errors.
|
||
* Avoid storing large `BLOBS`, store the location of where to get the object instead.
|
||
* `VARCHAR(255)` is the largest number of characters that can be counted in an 8 bit number, often maximizing the use of a byte in some RDBMS.
|
||
* Set the `NOT NULL` constraint where applicable to [improve search performance](http://stackoverflow.com/questions/1017239/how-do-null-values-affect-performance-in-a-database-search).
|
||
|
||
##### Use good indices
|
||
|
||
* Columns that you are querying (`SELECT`, `GROUP BY`, `ORDER BY`, `JOIN`) could be faster with indices.
|
||
* Indices are usually represented as self-balancing [B-tree](https://en.wikipedia.org/wiki/B-tree) that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time.
|
||
* Placing an index can keep the data in memory, requiring more space.
|
||
* Writes could also be slower since the index also needs to be updated.
|
||
* When loading large amounts of data, it might be faster to disable indices, load the data, then rebuild the indices.
|
||
|
||
##### Avoid expensive joins
|
||
|
||
* [Denormalize](#denormalization) where performance demands it.
|
||
|
||
##### Partition tables
|
||
|
||
* Break up a table by putting hot spots in a separate table to help keep it in memory.
|
||
|
||
##### Tune the query cache
|
||
|
||
* In some cases, the [query cache](http://dev.mysql.com/doc/refman/5.7/en/query-cache) could lead to [performance issues](https://www.percona.com/blog/2014/01/28/10-mysql-performance-tuning-settings-after-installation/).
|
||
|
||
##### Source(s) and further reading: SQL tuning
|
||
|
||
* [Tips for optimizing MySQL queries](http://20bits.com/article/10-tips-for-optimizing-mysql-queries-that-dont-suck)
|
||
* [Is there a good reason i see VARCHAR(255) used so often?](http://stackoverflow.com/questions/1217466/is-there-a-good-reason-i-see-varchar255-used-so-often-as-opposed-to-another-l)
|
||
* [How do null values affect performance?](http://stackoverflow.com/questions/1017239/how-do-null-values-affect-performance-in-a-database-search)
|
||
* [Slow query log](http://dev.mysql.com/doc/refman/5.7/en/slow-query-log.html)
|
||
|
||
### NoSQL
|
||
|
||
NoSQL is a collection of data items represented in a **key-value store**, **document-store**, **wide column store**, or a **graph database**. Data is denormalized, and joins are generally done in the application code. Most NoSQL stores lack true ACID transactions and favor [eventual consistency](#eventual-consistency).
|
||
|
||
**BASE** is often used to describe the properties of NoSQL databases. In comparison with the [CAP Theorem](#cap-theorem), BASE chooses availability over consistency.
|
||
|
||
* **Basically available** - the system guarantees availability.
|
||
* **Soft state** - the state of the system may change over time, even without input.
|
||
* **Eventual consistency** - the system will become consistent over a period of time, given that the system doesn't receive input during that period.
|
||
|
||
In addition to choosing between [SQL or NoSQL](#sql-or-nosql), it is helpful to understand which type of NoSQL database best fits your use case(s). We'll review **key-value stores**, **document-stores**, **wide column stores**, and **graph databases** in the next section.
|
||
|
||
#### Key-value store
|
||
|
||
> Abstraction: hash table
|
||
|
||
A key-value store generally allows for O(1) reads and writes and is often backed by memory or SSD. Data stores can maintain keys in [lexicographic order](https://en.wikipedia.org/wiki/Lexicographical_order), allowing efficient retrieval of key ranges. Key-value stores can allow for storing of metadata with a value.
|
||
|
||
Key-value stores provide high performance and are often used for simple data models or for rapidly-changing data, such as an in-memory cache layer. Since they offer only a limited set of operations, complexity is shifted to the application layer if additional operations are needed.
|
||
|
||
A key-value store is the basis for more complex systems such as a document store, and in some cases, a graph database.
|
||
|
||
##### Source(s) and further reading: key-value store
|
||
|
||
* [Key-value database](https://en.wikipedia.org/wiki/Key-value_database)
|
||
* [Disadvantages of key-value stores](http://stackoverflow.com/questions/4056093/what-are-the-disadvantages-of-using-a-key-value-table-over-nullable-columns-or)
|
||
* [Redis architecture](http://qnimate.com/overview-of-redis-architecture/)
|
||
* [Memcached architecture](https://www.adayinthelifeof.nl/2011/02/06/memcache-internals/)
|
||
|
||
#### Document store
|
||
|
||
> Abstraction: key-value store with documents stored as values
|
||
|
||
A document store is centered around documents (XML, JSON, binary, etc), where a document stores all information for a given object. Document stores provide APIs or a query language to query based on the internal structure of the document itself. *Note, many key-value stores include features for working with a value's metadata, blurring the lines between these two storage types.*
|
||
|
||
Based on the underlying implementation, documents are organized in either collections, tags, metadata, or directories. Although documents can be organized or grouped together, documents may have fields that are completely different from each other.
|
||
|
||
Some document stores like [MongoDB](https://www.mongodb.com/mongodb-architecture) and [CouchDB](https://blog.couchdb.org/2016/08/01/couchdb-2-0-architecture/) also provide a SQL-like language to perform complex queries. [DynamoDB](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/decandia07dynamo.pdf) supports both key-values and documents.
|
||
|
||
Document stores provide high flexibility and are often used for working with occasionally changing data.
|
||
|
||
##### Source(s) and further reading: document store
|
||
|
||
* [Document-oriented database](https://en.wikipedia.org/wiki/Document-oriented_database)
|
||
* [MongoDB architecture](https://www.mongodb.com/mongodb-architecture)
|
||
* [CouchDB architecture](https://blog.couchdb.org/2016/08/01/couchdb-2-0-architecture/)
|
||
* [Elasticsearch architecture](https://www.elastic.co/blog/found-elasticsearch-from-the-bottom-up)
|
||
|
||
#### Wide column store
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/n16iOGk.png">
|
||
<br/>
|
||
<i><a href=http://blog.grio.com/2015/11/sql-nosql-a-brief-history.html>Source: SQL & NoSQL, a brief history</a></i>
|
||
</p>
|
||
|
||
> Abstraction: nested map `ColumnFamily<RowKey, Columns<ColKey, Value, Timestamp>>`
|
||
|
||
A wide column store's basic unit of data is a column (name/value pair). A column can be grouped in column families (analogous to a SQL table). Super column families further group column families. You can access each column independently with a row key, and columns with the same row key form a row. Each value contains a timestamp for versioning and for conflict resolution.
|
||
|
||
Google introduced [Bigtable](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/chang06bigtable.pdf) as the first wide column store, which influenced the open-source [HBase](https://www.mapr.com/blog/in-depth-look-hbase-architecture) often-used in the Hadoop ecosystem, and [Cassandra](http://docs.datastax.com/en/archived/cassandra/2.0/cassandra/architecture/architectureIntro_c.html) from Facebook. Stores such as BigTable, HBase, and Cassandra maintain keys in lexicographic order, allowing efficient retrieval of selective key ranges.
|
||
|
||
Wide column stores offer high availability and high scalability. They are often used for very large data sets.
|
||
|
||
##### Source(s) and further reading: wide column store
|
||
|
||
* [SQL & NoSQL, a brief history](http://blog.grio.com/2015/11/sql-nosql-a-brief-history.html)
|
||
* [Bigtable architecture](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/chang06bigtable.pdf)
|
||
* [HBase architecture](https://www.mapr.com/blog/in-depth-look-hbase-architecture)
|
||
* [Cassandra architecture](http://docs.datastax.com/en/archived/cassandra/2.0/cassandra/architecture/architectureIntro_c.html)
|
||
|
||
#### Graph database
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/fNcl65g.png">
|
||
<br/>
|
||
<i><a href=https://en.wikipedia.org/wiki/File:GraphDatabase_PropertyGraph.png>Source: Graph database</a></i>
|
||
</p>
|
||
|
||
> Abstraction: graph
|
||
|
||
In a graph database, each node is a record and each arc is a relationship between two nodes. Graph databases are optimized to represent complex relationships with many foreign keys or many-to-many relationships.
|
||
|
||
Graphs databases offer high performance for data models with complex relationships, such as a social network. They are relatively new and are not yet widely-used; it might be more difficult to find development tools and resources. Many graphs can only be accessed with [REST APIs](#representational-state-transfer-rest).
|
||
|
||
##### Source(s) and further reading: graph
|
||
|
||
* [Graph database](https://en.wikipedia.org/wiki/Graph_database)
|
||
* [Neo4j](https://neo4j.com/)
|
||
* [FlockDB](https://blog.twitter.com/2010/introducing-flockdb)
|
||
|
||
#### Source(s) and further reading: NoSQL
|
||
|
||
* [Explanation of base terminology](http://stackoverflow.com/questions/3342497/explanation-of-base-terminology)
|
||
* [NoSQL databases a survey and decision guidance](https://medium.com/baqend-blog/nosql-databases-a-survey-and-decision-guidance-ea7823a822d#.wskogqenq)
|
||
* [Scalability](http://www.lecloud.net/post/7994751381/scalability-for-dummies-part-2-database)
|
||
* [Introduction to NoSQL](https://www.youtube.com/watch?v=qI_g07C_Q5I)
|
||
* [NoSQL patterns](http://horicky.blogspot.com/2009/11/nosql-patterns.html)
|
||
|
||
### SQL or NoSQL
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/wXGqG5f.png">
|
||
<br/>
|
||
<i><a href=https://www.infoq.com/articles/Transition-RDBMS-NoSQL/>Source: Transitioning from RDBMS to NoSQL</a></i>
|
||
</p>
|
||
|
||
Reasons for **SQL**:
|
||
|
||
* Structured data
|
||
* Strict schema
|
||
* Relational data
|
||
* Need for complex joins
|
||
* Transactions
|
||
* Clear patterns for scaling
|
||
* More established: developers, community, code, tools, etc
|
||
* Lookups by index are very fast
|
||
|
||
Reasons for **NoSQL**:
|
||
|
||
* Semi-structured data
|
||
* Dynamic or flexible schema
|
||
* Non relational data
|
||
* No need for complex joins
|
||
* Store many TB (or PB) of data
|
||
* Very data intensive workload
|
||
* Very high throughput for IOPS
|
||
|
||
Sample data well-suited for NoSQL:
|
||
|
||
* Rapid ingest of clickstream and log data
|
||
* Leaderboard or scoring data
|
||
* Temporary data, such as a shopping cart
|
||
* Frequently accessed ('hot') tables
|
||
* Metadata/lookup tables
|
||
|
||
##### Source(s) and further reading: SQL or NoSQL
|
||
|
||
* [Scaling up to your first 10 million users](https://www.youtube.com/watch?v=vg5onp8TU6Q)
|
||
* [SQL vs NoSQL differences](https://www.sitepoint.com/sql-vs-nosql-differences/)
|
||
|
||
## Cache
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/Q6z24La.png">
|
||
<br/>
|
||
<i><a href=http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html>Source: Scalable system design patterns</a></i>
|
||
</p>
|
||
|
||
Caching improves page load times and can reduce the load on your servers and databases. In this model, the dispatcher will first lookup if the request has been made before and try to find the previous result to return, in order to save the actual execution.
|
||
|
||
Databases often benefit from a uniform distribution of reads and writes across its partitions. Popular items can skew the distribution, causing bottlenecks. Putting a cache in front of a database can help absorb uneven loads and spikes in traffic.
|
||
|
||
### Client caching
|
||
|
||
Caches can be located on the client side (OS or browser), [server side](#reverse-proxy), or in a distinct cache layer.
|
||
|
||
### CDN caching
|
||
|
||
[CDNs](#content-delivery-network) are considered a type of cache.
|
||
|
||
### Web server caching
|
||
|
||
[Reverse proxies](#reverse-proxy-web-server) and caches such as [Varnish](https://www.varnish-cache.org/) can serve static and dynamic content directly. Web servers can also cache requests, returning responses without having to contact application servers.
|
||
|
||
### Database caching
|
||
|
||
Your database usually includes some level of caching in a default configuration, optimized for a generic use case. Tweaking these settings for specific usage patterns can further boost performance.
|
||
|
||
### Application caching
|
||
|
||
In-memory caches such as Memcached and Redis are key-value stores between your application and your data storage. Since the data is held in RAM, it is much faster than typical databases where data is stored on disk. RAM is more limited than disk, so [cache invalidation](https://en.wikipedia.org/wiki/Cache_algorithms) algorithms such as [least recently used (LRU)](https://en.wikipedia.org/wiki/Cache_algorithms#Least_Recently_Used) can help invalidate 'cold' entries and keep 'hot' data in RAM.
|
||
|
||
Redis has the following additional features:
|
||
|
||
* Persistence option
|
||
* Built-in data structures such as sorted sets and lists
|
||
|
||
There are multiple levels you can cache that fall into two general categories: **database queries** and **objects**:
|
||
|
||
* Row level
|
||
* Query-level
|
||
* Fully-formed serializable objects
|
||
* Fully-rendered HTML
|
||
|
||
Generally, you should try to avoid file-based caching, as it makes cloning and auto-scaling more difficult.
|
||
|
||
### Caching at the database query level
|
||
|
||
Whenever you query the database, hash the query as a key and store the result to the cache. This approach suffers from expiration issues:
|
||
|
||
* Hard to delete a cached result with complex queries
|
||
* If one piece of data changes such as a table cell, you need to delete all cached queries that might include the changed cell
|
||
|
||
### Caching at the object level
|
||
|
||
See your data as an object, similar to what you do with your application code. Have your application assemble the dataset from the database into a class instance or a data structure(s):
|
||
|
||
* Remove the object from cache if its underlying data has changed
|
||
* Allows for asynchronous processing: workers assemble objects by consuming the latest cached object
|
||
|
||
Suggestions of what to cache:
|
||
|
||
* User sessions
|
||
* Fully rendered web pages
|
||
* Activity streams
|
||
* User graph data
|
||
|
||
### When to update the cache
|
||
|
||
Since you can only store a limited amount of data in cache, you'll need to determine which cache update strategy works best for your use case.
|
||
|
||
#### Cache-aside
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/ONjORqk.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/tmatyashovsky/from-cache-to-in-memory-data-grid-introduction-to-hazelcast>Source: From cache to in-memory data grid</a></i>
|
||
</p>
|
||
|
||
The application is responsible for reading and writing from storage. The cache does not interact with storage directly. The application does the following:
|
||
|
||
* Look for entry in cache, resulting in a cache miss
|
||
* Load entry from the database
|
||
* Add entry to cache
|
||
* Return entry
|
||
|
||
```
|
||
def get_user(self, user_id):
|
||
user = cache.get("user.{0}", user_id)
|
||
if user is None:
|
||
user = db.query("SELECT * FROM users WHERE user_id = {0}", user_id)
|
||
if user is not None:
|
||
key = "user.{0}".format(user_id)
|
||
cache.set(key, json.dumps(user))
|
||
return user
|
||
```
|
||
|
||
[Memcached](https://memcached.org/) is generally used in this manner.
|
||
|
||
Subsequent reads of data added to cache are fast. Cache-aside is also referred to as lazy loading. Only requested data is cached, which avoids filling up the cache with data that isn't requested.
|
||
|
||
##### Disadvantage(s): cache-aside
|
||
|
||
* Each cache miss results in three trips, which can cause a noticeable delay.
|
||
* Data can become stale if it is updated in the database. This issue is mitigated by setting a time-to-live (TTL) which forces an update of the cache entry, or by using write-through.
|
||
* When a node fails, it is replaced by a new, empty node, increasing latency.
|
||
|
||
#### Write-through
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/0vBc0hN.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
The application uses the cache as the main data store, reading and writing data to it, while the cache is responsible for reading and writing to the database:
|
||
|
||
* Application adds/updates entry in cache
|
||
* Cache synchronously writes entry to data store
|
||
* Return
|
||
|
||
Application code:
|
||
|
||
```
|
||
set_user(12345, {"foo":"bar"})
|
||
```
|
||
|
||
Cache code:
|
||
|
||
```
|
||
def set_user(user_id, values):
|
||
user = db.query("UPDATE Users WHERE id = {0}", user_id, values)
|
||
cache.set(user_id, user)
|
||
```
|
||
|
||
Write-through is a slow overall operation due to the write operation, but subsequent reads of just written data are fast. Users are generally more tolerant of latency when updating data than reading data. Data in the cache is not stale.
|
||
|
||
##### Disadvantage(s): write through
|
||
|
||
* When a new node is created due to failure or scaling, the new node will not cache entries until the entry is updated in the database. Cache-aside in conjunction with write through can mitigate this issue.
|
||
* Most data written might never read, which can be minimized with a TTL.
|
||
|
||
#### Write-behind (write-back)
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/rgSrvjG.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/jboner/scalability-availability-stability-patterns/>Source: Scalability, availability, stability, patterns</a></i>
|
||
</p>
|
||
|
||
In write-behind, tha application does the following:
|
||
|
||
* Add/update entry in cache
|
||
* Asynchronously write entry to the data store, improving write performance
|
||
|
||
##### Disadvantage(s): write-behind
|
||
|
||
* There could be data loss if the cache goes down prior to its contents hitting the data store.
|
||
* It is more complex to implement write-behind than it is to implement cache-aside or write-through.
|
||
|
||
#### Refresh-ahead
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/kxtjqgE.png">
|
||
<br/>
|
||
<i><a href=http://www.slideshare.net/tmatyashovsky/from-cache-to-in-memory-data-grid-introduction-to-hazelcast>Source: From cache to in-memory data grid</a></i>
|
||
</p>
|
||
|
||
You can configure the cache to automatically refresh any recently accessed cache entry prior to its expiration.
|
||
|
||
Refresh-ahead can result in reduced latency vs read-through if the cache can accurately predict which items are likely to be needed in the future.
|
||
|
||
##### Disadvantage(s): refresh-ahead
|
||
|
||
* Not accurately predicting which items are likely to be needed in the future can result in reduced performance than without refresh-ahead.
|
||
|
||
### Disadvantage(s): cache
|
||
|
||
* Need to maintain consistency between caches and the source of truth such as the database through [cache invalidation](https://en.wikipedia.org/wiki/Cache_algorithms).
|
||
* Need to make application changes such as adding Redis or memcached.
|
||
* Cache invalidation is a difficult problem, there is additional complexity associated with when to update the cache.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [From cache to in-memory data grid](http://www.slideshare.net/tmatyashovsky/from-cache-to-in-memory-data-grid-introduction-to-hazelcast)
|
||
* [Scalable system design patterns](http://horicky.blogspot.com/2010/10/scalable-system-design-patterns.html)
|
||
* [Introduction to architecting systems for scale](http://lethain.com/introduction-to-architecting-systems-for-scale/)
|
||
* [Scalability, availability, stability, patterns](http://www.slideshare.net/jboner/scalability-availability-stability-patterns/)
|
||
* [Scalability](http://www.lecloud.net/post/9246290032/scalability-for-dummies-part-3-cache)
|
||
* [AWS ElastiCache strategies](http://docs.aws.amazon.com/AmazonElastiCache/latest/UserGuide/Strategies.html)
|
||
* [Wikipedia](https://en.wikipedia.org/wiki/Cache_(computing))
|
||
|
||
## Asynchronism
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/54GYsSx.png">
|
||
<br/>
|
||
<i><a href=http://lethain.com/introduction-to-architecting-systems-for-scale/#platform_layer>Source: Intro to architecting systems for scale</a></i>
|
||
</p>
|
||
|
||
Asynchronous workflows help reduce request times for expensive operations that would otherwise be performed in-line. They can also help by doing time-consuming work in advance, such as periodic aggregation of data.
|
||
|
||
### Message queues
|
||
|
||
Message queues receive, hold, and deliver messages. If an operation is too slow to perform inline, you can use a message queue with the following workflow:
|
||
|
||
* An application publishes a job to the queue, then notifies the user of job status
|
||
* A worker picks up the job from the queue, processes it, then signals the job is complete
|
||
|
||
The user is not blocked and the job is processed in the background. During this time, the client might optionally do a small amount of processing to make it seem like the task has completed. For example, if posting a tweet, the tweet could be instantly posted to your timeline, but it could take some time before your tweet is actually delivered to all of your followers.
|
||
|
||
**Redis** is useful as a simple message broker but messages can be lost.
|
||
|
||
**RabbitMQ** is popular but requires you to adapt to the 'AMQP' protocol and manage your own nodes.
|
||
|
||
**Amazon SQS**, is hosted but can have high latency and has the possibility of messages being delivered twice.
|
||
|
||
### Task queues
|
||
|
||
Tasks queues receive tasks and their related data, runs them, then delivers their results. They can support scheduling and can be used to run computationally-intensive jobs in the background.
|
||
|
||
**Celery** has support for scheduling and primarily has python support.
|
||
|
||
### Back pressure
|
||
|
||
If queues start to grow significantly, the queue size can become larger than memory, resulting in cache misses, disk reads, and even slower performance. [Back pressure](http://mechanical-sympathy.blogspot.com/2012/05/apply-back-pressure-when-overloaded.html) can help by limiting the queue size, thereby maintaining a high throughput rate and good response times for jobs already in the queue. Once the queue fills up, clients get a server busy or HTTP 503 status code to try again later. Clients can retry the request at a later time, perhaps with [exponential backoff](https://en.wikipedia.org/wiki/Exponential_backoff).
|
||
|
||
### Disadvantage(s): asynchronism
|
||
|
||
* Use cases such as inexpensive calculations and realtime workflows might be better suited for synchronous operations, as introducing queues can add delays and complexity.
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [It's all a numbers game](https://www.youtube.com/watch?v=1KRYH75wgy4)
|
||
* [Applying back pressure when overloaded](http://mechanical-sympathy.blogspot.com/2012/05/apply-back-pressure-when-overloaded.html)
|
||
* [Little's law](https://en.wikipedia.org/wiki/Little%27s_law)
|
||
* [What is the difference between a message queue and a task queue?](https://www.quora.com/What-is-the-difference-between-a-message-queue-and-a-task-queue-Why-would-a-task-queue-require-a-message-broker-like-RabbitMQ-Redis-Celery-or-IronMQ-to-function)
|
||
|
||
## Communication
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/5KeocQs.jpg">
|
||
<br/>
|
||
<i><a href=http://www.escotal.com/osilayer.html>Source: OSI 7 layer model</a></i>
|
||
</p>
|
||
|
||
### Hypertext transfer protocol (HTTP)
|
||
|
||
HTTP is a method for encoding and transporting data between a client and a server. It is a request/response protocol: clients issue requests and servers issue responses with relevant content and completion status info about the request. HTTP is self-contained, allowing requests and responses to flow through many intermediate routers and servers that perform load balancing, caching, encryption, and compression.
|
||
|
||
A basic HTTP request consists of a verb (method) and a resource (endpoint). Below are common HTTP verbs:
|
||
|
||
| Verb | Description | Idempotent* | Safe | Cacheable |
|
||
|---|---|---|---|---|
|
||
| GET | Reads a resource | Yes | Yes | Yes |
|
||
| POST | Creates a resource or trigger a process that handles data | No | No | Yes if response contains freshness info |
|
||
| PUT | Creates or replace a resource | Yes | No | No |
|
||
| PATCH | Partially updates a resource | No | No | Yes if response contains freshness info |
|
||
| DELETE | Deletes a resource | Yes | No | No |
|
||
|
||
*Can be called many times without different outcomes.
|
||
|
||
HTTP is an application layer protocol relying on lower-level protocols such as **TCP** and **UDP**.
|
||
|
||
* [HTTP](https://www.nginx.com/resources/glossary/http/)
|
||
* [README](https://www.quora.com/What-is-the-difference-between-HTTP-protocol-and-TCP-protocol)
|
||
|
||
### Transmission control protocol (TCP)
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/JdAsdvG.jpg">
|
||
<br/>
|
||
<i><a href=http://www.wildbunny.co.uk/blog/2012/10/09/how-to-make-a-multi-player-game-part-1/>Source: How to make a multiplayer game</a></i>
|
||
</p>
|
||
|
||
TCP is a connection-oriented protocol over an [IP network](https://en.wikipedia.org/wiki/Internet_Protocol). Connection is established and terminated using a [handshake](https://en.wikipedia.org/wiki/Handshaking). All packets sent are guaranteed to reach the destination in the original order and without corruption through:
|
||
|
||
* Sequence numbers and [checksum fields](https://en.wikipedia.org/wiki/Transmission_Control_Protocol#Checksum_computation) for each packet
|
||
* [Acknowledgement](https://en.wikipedia.org/wiki/Acknowledgement_(data_networks)) packets and automatic retransmission
|
||
|
||
If the sender does not receive a correct response, it will resend the packets. If there are multiple timeouts, the connection is dropped. TCP also implements [flow control](https://en.wikipedia.org/wiki/Flow_control_(data)) and [congestion control](https://en.wikipedia.org/wiki/Network_congestion#Congestion_control). These guarantees cause delays and generally results in less efficient transmission than UDP.
|
||
|
||
To ensure high throughput, web servers can keep a large number of TCP connections open, resulting in high memory usage. It can be expensive to have a large number of open connections between web server threads and say, a [memcached](#memcached) server. [Connection pooling](https://en.wikipedia.org/wiki/Connection_pool) can help in addition to switching to UDP where applicable.
|
||
|
||
TCP is useful for applications that require high reliability but are less time critical. Some examples include web servers, database info, SMTP, FTP, and SSH.
|
||
|
||
Use TCP over UDP when:
|
||
|
||
* You need all of the data to arrive intact
|
||
* You want to automatically make a best estimate use of the network throughput
|
||
|
||
### User datagram protocol (UDP)
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/yzDrJtA.jpg">
|
||
<br/>
|
||
<i><a href=http://www.wildbunny.co.uk/blog/2012/10/09/how-to-make-a-multi-player-game-part-1/>Source: How to make a multiplayer game</a></i>
|
||
</p>
|
||
|
||
UDP is connectionless. Datagrams (analogous to packets) are guaranteed only at the datagram level. Datagrams might reach their destination out of order or not at all. UDP does not support congestion control. Without the guarantees that TCP support, UDP is generally more efficient.
|
||
|
||
UDP can broadcast, sending datagrams to all devices on the subnet. This is useful with [DHCP](https://en.wikipedia.org/wiki/Dynamic_Host_Configuration_Protocol) because the client has not yet received an IP address, thus preventing a way for TCP to stream without the IP address.
|
||
|
||
UDP is less reliable but works well in real time use cases such as VoIP, video chat, streaming, and realtime multiplayer games.
|
||
|
||
Use UDP over TCP when:
|
||
|
||
* You need the lowest latency
|
||
* Late data is worse than loss of data
|
||
* You want to implement your own error correction
|
||
|
||
#### Source(s) and further reading: TCP and UDP
|
||
|
||
* [Networking for game programming](http://gafferongames.com/networking-for-game-programmers/udp-vs-tcp/)
|
||
* [Key differences between TCP and UDP protocols](http://www.cyberciti.biz/faq/key-differences-between-tcp-and-udp-protocols/)
|
||
* [Difference between TCP and UDP](http://stackoverflow.com/questions/5970383/difference-between-tcp-and-udp)
|
||
* [Transmission control protocol](https://en.wikipedia.org/wiki/Transmission_Control_Protocol)
|
||
* [User datagram protocol](https://en.wikipedia.org/wiki/User_Datagram_Protocol)
|
||
* [Scaling memcache at Facebook](http://www.cs.bu.edu/~jappavoo/jappavoo.github.com/451/papers/memcache-fb.pdf)
|
||
|
||
### Remote procedure call (RPC)
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/iF4Mkb5.png">
|
||
<br/>
|
||
<i><a href=http://www.puncsky.com/blog/2016/02/14/crack-the-system-design-interview/>Source: Crack the system design interview</a></i>
|
||
</p>
|
||
|
||
In an RPC, a client causes a procedure to execute on a different address space, usually a remote server. The procedure is coded as if it were a local procedure call, abstracting away the details of how to communicate with the server from the client program. Remote calls are usually slower and less reliable than local calls so it is helpful to distinguish RPC calls from local calls. Popular RPC frameworks include [Protobuf](https://developers.google.com/protocol-buffers/), [Thrift](https://thrift.apache.org/), and [Avro](https://avro.apache.org/docs/current/).
|
||
|
||
RPC is a request-response protocol:
|
||
|
||
* **Client program** - Calls the client stub procedure. The parameters are pushed onto the stack like a local procedure call.
|
||
* **Client stub procedure** - Marshals (packs) procedure id and arguments into a request message.
|
||
* **Client communication module** - OS sends the message from the client to the server.
|
||
* **Server communication module** - OS passes the incoming packets to the server stub procedure.
|
||
* **Server stub procedure** - Unmarshalls the results, calls the server procedure matching the procedure id and passes the given arguments.
|
||
* The server response repeats the steps above in reverse order.
|
||
|
||
Sample RPC calls:
|
||
|
||
```
|
||
GET /someoperation?data=anId
|
||
|
||
POST /anotheroperation
|
||
{
|
||
"data":"anId";
|
||
"anotherdata": "another value"
|
||
}
|
||
```
|
||
|
||
RPC is focused on exposing behaviors. RPCs are often used for performance reasons with internal communications, as you can hand-craft native calls to better fit your use cases.
|
||
|
||
Choose a Native Library aka SDK when:
|
||
|
||
* You know your target platform.
|
||
* You want to control how your "logic" is accessed
|
||
* You want to control how error control happens off your library
|
||
* Performance and end user experience is your primary concern
|
||
|
||
HTTP APIs following **REST** tend to be used more often for public APIs.
|
||
|
||
#### Disadvantage(s): RPC
|
||
|
||
* RPC clients become tightly coupled to the service implementation.
|
||
* A new API must be defined for every new operation or use case.
|
||
* It can be difficult to debug RPC.
|
||
* You might not be able to leverage existing technologies out of the box. For example, it might require additional effort to ensure [RPC calls are properly cached](http://etherealbits.com/2012/12/debunking-the-myths-of-rpc-rest/) on caching servers such as [Squid](http://www.squid-cache.org/).
|
||
|
||
### Representational state transfer (REST)
|
||
|
||
REST is an architectural style enforcing a client/server model where the client acts on a set of resources managed by the server. The server provides a representation of resources and actions that can either manipulate or get a new representation of resources. All communication must be stateless and cacheable.
|
||
|
||
There are four qualities of a RESTful interface:
|
||
|
||
* **Identify resources (URI in HTTP)** - use the same URI regardless of any operation.
|
||
* **Change with representations (Verbs in HTTP)** - use verbs, headers, and body.
|
||
* **Self-descriptive error message (status response in HTTP)** - Use status codes, don't reinvent the wheel.
|
||
* **[HATEOAS](http://restcookbook.com/Basics/hateoas/) (HTML interface for HTTP)** - your web service should be fully accessible in a browser.
|
||
|
||
Sample REST calls:
|
||
|
||
```
|
||
GET /someresources/anId
|
||
|
||
PUT /someresources/anId
|
||
{"anotherdata": "another value"}
|
||
```
|
||
|
||
REST is focused on exposing data. It minimizes the coupling between client/server and is often used for public HTTP APIs. REST uses a more generic and uniform method of exposing resources through URIs, [representation through headers](https://github.com/for-GET/know-your-http-well/blob/master/headers.md), and actions through verbs such as GET, POST, PUT, DELETE, and PATCH. Being stateless, REST is great for horizontal scaling and partitioning.
|
||
|
||
#### Disadvantage(s): REST
|
||
|
||
* With REST being focused on exposing data, it might not be a good fit if resources are not naturally organized or accessed in a simple hierarchy. For example, returning all updated records from the past hour matching a particular set of events is not easily expressed as a path. With REST, it is likely to be implemented with a combination of URI path, query parameters, and possibly the request body.
|
||
* REST typically relies on a few verbs (GET, POST, PUT, DELETE, and PATCH) which sometimes doesn't fit your use case. For example, moving expired documents to the archive folder might not cleanly fit within these verbs.
|
||
* Fetching complicated resources with nested hierarchies requires multiple round trips between the client and server to render single views, e.g. fetching content of a blog entry and the comments on that entry. For mobile applications operating in variable network conditions, these multiple roundtrips are highly undesirable.
|
||
* Over time, more fields might be added to an API response and older clients will receive all new data fields, even those that they do not need, as a result, it bloats the payload size and leads to larger latencies.
|
||
|
||
### RPC and REST calls comparison
|
||
|
||
| Operation | RPC | REST |
|
||
|---|---|---|
|
||
| Signup | **POST** /signup | **POST** /persons |
|
||
| Resign | **POST** /resign<br/>{<br/>"personid": "1234"<br/>} | **DELETE** /persons/1234 |
|
||
| Read a person | **GET** /readPerson?personid=1234 | **GET** /persons/1234 |
|
||
| Read a person’s items list | **GET** /readUsersItemsList?personid=1234 | **GET** /persons/1234/items |
|
||
| Add an item to a person’s items | **POST** /addItemToUsersItemsList<br/>{<br/>"personid": "1234";<br/>"itemid": "456"<br/>} | **POST** /persons/1234/items<br/>{<br/>"itemid": "456"<br/>} |
|
||
| Update an item | **POST** /modifyItem<br/>{<br/>"itemid": "456";<br/>"key": "value"<br/>} | **PUT** /items/456<br/>{<br/>"key": "value"<br/>} |
|
||
| Delete an item | **POST** /removeItem<br/>{<br/>"itemid": "456"<br/>} | **DELETE** /items/456 |
|
||
|
||
<p align="center">
|
||
<i><a href=https://apihandyman.io/do-you-really-know-why-you-prefer-rest-over-rpc/>Source: Do you really know why you prefer REST over RPC</a></i>
|
||
</p>
|
||
|
||
#### Source(s) and further reading: REST and RPC
|
||
|
||
* [Do you really know why you prefer REST over RPC](https://apihandyman.io/do-you-really-know-why-you-prefer-rest-over-rpc/)
|
||
* [When are RPC-ish approaches more appropriate than REST?](http://programmers.stackexchange.com/a/181186)
|
||
* [REST vs JSON-RPC](http://stackoverflow.com/questions/15056878/rest-vs-json-rpc)
|
||
* [Debunking the myths of RPC and REST](http://etherealbits.com/2012/12/debunking-the-myths-of-rpc-rest/)
|
||
* [What are the drawbacks of using REST](https://www.quora.com/What-are-the-drawbacks-of-using-RESTful-APIs)
|
||
* [Crack the system design interview](http://www.puncsky.com/blog/2016/02/14/crack-the-system-design-interview/)
|
||
* [Thrift](https://code.facebook.com/posts/1468950976659943/)
|
||
* [Why REST for internal use and not RPC](http://arstechnica.com/civis/viewtopic.php?t=1190508)
|
||
|
||
## Security
|
||
|
||
This section could use some updates. Consider [contributing](#contributing)!
|
||
|
||
Security is a broad topic. Unless you have considerable experience, a security background, or are applying for a position that requires knowledge of security, you probably won't need to know more than the basics:
|
||
|
||
* Encrypt in transit and at rest.
|
||
* Sanitize all user inputs or any input parameters exposed to user to prevent [XSS](https://en.wikipedia.org/wiki/Cross-site_scripting) and [SQL injection](https://en.wikipedia.org/wiki/SQL_injection).
|
||
* Use parameterized queries to prevent SQL injection.
|
||
* Use the principle of [least privilege](https://en.wikipedia.org/wiki/Principle_of_least_privilege).
|
||
|
||
### Source(s) and further reading
|
||
|
||
* [Security guide for developers](https://github.com/FallibleInc/security-guide-for-developers)
|
||
* [OWASP top ten](https://www.owasp.org/index.php/OWASP_Top_Ten_Cheat_Sheet)
|
||
|
||
## Appendix
|
||
|
||
You'll sometimes be asked to do 'back-of-the-envelope' estimates. For example, you might need to determine how long it will take to generate 100 image thumbnails from disk or how much memory a data structure will take. The **Powers of two table** and **Latency numbers every programmer should know** are handy references.
|
||
|
||
### Powers of two table
|
||
|
||
```
|
||
Power Exact Value Approx Value Bytes
|
||
---------------------------------------------------------------
|
||
7 128
|
||
8 256
|
||
10 1024 1 thousand 1 KB
|
||
16 65,536 64 KB
|
||
20 1,048,576 1 million 1 MB
|
||
30 1,073,741,824 1 billion 1 GB
|
||
32 4,294,967,296 4 GB
|
||
40 1,099,511,627,776 1 trillion 1 TB
|
||
```
|
||
|
||
#### Source(s) and further reading
|
||
|
||
* [Powers of two](https://en.wikipedia.org/wiki/Power_of_two)
|
||
|
||
### Latency numbers every programmer should know
|
||
|
||
```
|
||
Latency Comparison Numbers
|
||
--------------------------
|
||
L1 cache reference 0.5 ns
|
||
Branch mispredict 5 ns
|
||
L2 cache reference 7 ns 14x L1 cache
|
||
Mutex lock/unlock 100 ns
|
||
Main memory reference 100 ns 20x L2 cache, 200x L1 cache
|
||
Compress 1K bytes with Zippy 10,000 ns 10 us
|
||
Send 1 KB bytes over 1 Gbps network 10,000 ns 10 us
|
||
Read 4 KB randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD
|
||
Read 1 MB sequentially from memory 250,000 ns 250 us
|
||
Round trip within same datacenter 500,000 ns 500 us
|
||
Read 1 MB sequentially from SSD* 1,000,000 ns 1,000 us 1 ms ~1GB/sec SSD, 4X memory
|
||
Disk seek 10,000,000 ns 10,000 us 10 ms 20x datacenter roundtrip
|
||
Read 1 MB sequentially from 1 Gbps 10,000,000 ns 10,000 us 10 ms 40x memory, 10X SSD
|
||
Read 1 MB sequentially from disk 30,000,000 ns 30,000 us 30 ms 120x memory, 30X SSD
|
||
Send packet CA->Netherlands->CA 150,000,000 ns 150,000 us 150 ms
|
||
|
||
Notes
|
||
-----
|
||
1 ns = 10^-9 seconds
|
||
1 us = 10^-6 seconds = 1,000 ns
|
||
1 ms = 10^-3 seconds = 1,000 us = 1,000,000 ns
|
||
```
|
||
|
||
Handy metrics based on numbers above:
|
||
|
||
* Read sequentially from disk at 30 MB/s
|
||
* Read sequentially from 1 Gbps Ethernet at 100 MB/s
|
||
* Read sequentially from SSD at 1 GB/s
|
||
* Read sequentially from main memory at 4 GB/s
|
||
* 6-7 world-wide round trips per second
|
||
* 2,000 round trips per second within a data center
|
||
|
||
#### Latency numbers visualized
|
||
|
||
|
||
|
||
#### Source(s) and further reading
|
||
|
||
* [Latency numbers every programmer should know - 1](https://gist.github.com/jboner/2841832)
|
||
* [Latency numbers every programmer should know - 2](https://gist.github.com/hellerbarde/2843375)
|
||
* [Designs, lessons, and advice from building large distributed systems](http://www.cs.cornell.edu/projects/ladis2009/talks/dean-keynote-ladis2009.pdf)
|
||
* [Software Engineering Advice from Building Large-Scale Distributed Systems](https://static.googleusercontent.com/media/research.google.com/en//people/jeff/stanford-295-talk.pdf)
|
||
|
||
### Additional system design interview questions
|
||
|
||
> Common system design interview questions, with links to resources on how to solve each.
|
||
|
||
| Question | Reference(s) |
|
||
|---|---|
|
||
| Design a file sync service like Dropbox | [youtube.com](https://www.youtube.com/watch?v=PE4gwstWhmc) |
|
||
| Design a search engine like Google | [queue.acm.org](http://queue.acm.org/detail.cfm?id=988407)<br/>[stackexchange.com](http://programmers.stackexchange.com/questions/38324/interview-question-how-would-you-implement-google-search)<br/>[ardendertat.com](http://www.ardendertat.com/2012/01/11/implementing-search-engines/)<br>[stanford.edu](http://infolab.stanford.edu/~backrub/google.html) |
|
||
| Design a scalable web crawler like Google | [quora.com](https://www.quora.com/How-can-I-build-a-web-crawler-from-scratch) |
|
||
| Design Google docs | [code.google.com](https://code.google.com/p/google-mobwrite/)<br/>[neil.fraser.name](https://neil.fraser.name/writing/sync/) |
|
||
| Design a key-value store like Redis | [slideshare.net](http://www.slideshare.net/dvirsky/introduction-to-redis) |
|
||
| Design a cache system like Memcached | [slideshare.net](http://www.slideshare.net/oemebamo/introduction-to-memcached) |
|
||
| Design a recommendation system like Amazon's | [hulu.com](http://tech.hulu.com/blog/2011/09/19/recommendation-system.html)<br/>[ijcai13.org](http://ijcai13.org/files/tutorial_slides/td3.pdf) |
|
||
| Design a tinyurl system like Bitly | [n00tc0d3r.blogspot.com](http://n00tc0d3r.blogspot.com/) |
|
||
| Design a chat app like WhatsApp | [highscalability.com](http://highscalability.com/blog/2014/2/26/the-whatsapp-architecture-facebook-bought-for-19-billion.html)
|
||
| Design a picture sharing system like Instagram | [highscalability.com](http://highscalability.com/flickr-architecture)<br/>[highscalability.com](http://highscalability.com/blog/2011/12/6/instagram-architecture-14-million-users-terabytes-of-photos.html) |
|
||
| Design the Facebook news feed function | [quora.com](http://www.quora.com/What-are-best-practices-for-building-something-like-a-News-Feed)<br/>[quora.com](http://www.quora.com/Activity-Streams/What-are-the-scaling-issues-to-keep-in-mind-while-developing-a-social-network-feed)<br/>[slideshare.net](http://www.slideshare.net/danmckinley/etsy-activity-feeds-architecture) |
|
||
| Design the Facebook timeline function | [facebook.com](https://www.facebook.com/note.php?note_id=10150468255628920)<br/>[highscalability.com](http://highscalability.com/blog/2012/1/23/facebook-timeline-brought-to-you-by-the-power-of-denormaliza.html) |
|
||
| Design the Facebook chat function | [erlang-factory.com](http://www.erlang-factory.com/upload/presentations/31/EugeneLetuchy-ErlangatFacebook.pdf)<br/>[facebook.com](https://www.facebook.com/note.php?note_id=14218138919&id=9445547199&index=0) |
|
||
| Design a graph search function like Facebook's | [facebook.com](https://www.facebook.com/notes/facebook-engineering/under-the-hood-building-out-the-infrastructure-for-graph-search/10151347573598920)<br/>[facebook.com](https://www.facebook.com/notes/facebook-engineering/under-the-hood-indexing-and-ranking-in-graph-search/10151361720763920)<br/>[facebook.com](https://www.facebook.com/notes/facebook-engineering/under-the-hood-the-natural-language-interface-of-graph-search/10151432733048920) |
|
||
| Design a content delivery network like CloudFlare | [cmu.edu](http://repository.cmu.edu/cgi/viewcontent.cgi?article=2112&context=compsci) |
|
||
| Design a trending topic system like Twitter's | [michael-noll.com](http://www.michael-noll.com/blog/2013/01/18/implementing-real-time-trending-topics-in-storm/)<br/>[snikolov .wordpress.com](http://snikolov.wordpress.com/2012/11/14/early-detection-of-twitter-trends/) |
|
||
| Design a random ID generation system | [blog.twitter.com](https://blog.twitter.com/2010/announcing-snowflake)<br/>[github.com](https://github.com/twitter/snowflake/) |
|
||
| Return the top k requests during a time interval | [ucsb.edu](https://icmi.cs.ucsb.edu/research/tech_reports/reports/2005-23.pdf)<br/>[wpi.edu](http://davis.wpi.edu/xmdv/docs/EDBT11-diyang.pdf) |
|
||
| Design a system that serves data from multiple data centers | [highscalability.com](http://highscalability.com/blog/2009/8/24/how-google-serves-data-from-multiple-datacenters.html) |
|
||
| Design an online multiplayer card game | [indieflashblog.com](http://www.indieflashblog.com/how-to-create-an-asynchronous-multiplayer-game.html)<br/>[buildnewgames.com](http://buildnewgames.com/real-time-multiplayer/) |
|
||
| Design a garbage collection system | [stuffwithstuff.com](http://journal.stuffwithstuff.com/2013/12/08/babys-first-garbage-collector/)<br/>[washington.edu](http://courses.cs.washington.edu/courses/csep521/07wi/prj/rick.pdf) |
|
||
| Add a system design question | [Contribute](#contributing) |
|
||
|
||
### Real world architectures
|
||
|
||
> Articles on how real world systems are designed.
|
||
|
||
<p align="center">
|
||
<img src="http://i.imgur.com/TcUo2fw.png">
|
||
<br/>
|
||
<i><a href=https://www.infoq.com/presentations/Twitter-Timeline-Scalability>Source: Twitter timelines at scale</a></i>
|
||
</p>
|
||
|
||
**Don't focus on nitty gritty details for the following articles, instead:**
|
||
|
||
* Identify shared principles, common technologies, and patterns within these articles
|
||
* Study what problems are solved by each component, where it works, where it doesn't
|
||
* Review the lessons learned
|
||
|
||
|Type | System | Reference(s) |
|
||
|---|---|---|
|
||
| Data processing | **MapReduce** - Distributed data processing from Google | [research.google.com](http://static.googleusercontent.com/media/research.google.com/zh-CN/us/archive/mapreduce-osdi04.pdf) |
|
||
| Data processing | **Spark** - Distributed data processing from Databricks | [slideshare.net](http://www.slideshare.net/AGrishchenko/apache-spark-architecture) |
|
||
| Data processing | **Storm** - Distributed data processing from Twitter | [slideshare.net](http://www.slideshare.net/previa/storm-16094009) |
|
||
| | | |
|
||
| Data store | **Bigtable** - Distributed column-oriented database from Google | [harvard.edu](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/chang06bigtable.pdf) |
|
||
| Data store | **HBase** - Open source implementation of Bigtable | [slideshare.net](http://www.slideshare.net/alexbaranau/intro-to-hbase) |
|
||
| Data store | **Cassandra** - Distributed column-oriented database from Facebook | [slideshare.net](http://www.slideshare.net/planetcassandra/cassandra-introduction-features-30103666)
|
||
| Data store | **DynamoDB** - Document-oriented database from Amazon | [harvard.edu](http://www.read.seas.harvard.edu/~kohler/class/cs239-w08/decandia07dynamo.pdf) |
|
||
| Data store | **MongoDB** - Document-oriented database | [slideshare.net](http://www.slideshare.net/mdirolf/introduction-to-mongodb) |
|
||
| Data store | **Spanner** - Globally-distributed database from Google | [research.google.com](http://research.google.com/archive/spanner-osdi2012.pdf) |
|
||
| Data store | **Memcached** - Distributed memory caching system | [slideshare.net](http://www.slideshare.net/oemebamo/introduction-to-memcached) |
|
||
| Data store | **Redis** - Distributed memory caching system with persistence and value types | [slideshare.net](http://www.slideshare.net/dvirsky/introduction-to-redis) |
|
||
| | | |
|
||
| File system | **Google File System (GFS)** - Distributed file system | [research.google.com](http://static.googleusercontent.com/media/research.google.com/zh-CN/us/archive/gfs-sosp2003.pdf) |
|
||
| File system | **Hadoop File System (HDFS)** - Open source implementation of GFS | [apache.org](https://hadoop.apache.org/docs/r1.2.1/hdfs_design.html) |
|
||
| | | |
|
||
| Misc | **Chubby** - Lock service for loosely-coupled distributed systems from Google | [research.google.com](http://static.googleusercontent.com/external_content/untrusted_dlcp/research.google.com/en/us/archive/chubby-osdi06.pdf) |
|
||
| Misc | **Dapper** - Distributed systems tracing infrastructure | [research.google.com](http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/36356.pdf)
|
||
| Misc | **Kafka** - Pub/sub message queue from LinkedIn | [slideshare.net](http://www.slideshare.net/mumrah/kafka-talk-tri-hug) |
|
||
| Misc | **Zookeeper** - Centralized infrastructure and services enabling synchronization | [slideshare.net](http://www.slideshare.net/sauravhaloi/introduction-to-apache-zookeeper) |
|
||
| | Add an architecture | [Contribute](#contributing) |
|
||
|
||
### Company architectures
|
||
|
||
| Company | Reference(s) |
|
||
|---|---|
|
||
| Amazon | [Amazon architecture](http://highscalability.com/amazon-architecture) |
|
||
| Cinchcast | [Producing 1,500 hours of audio every day](http://highscalability.com/blog/2012/7/16/cinchcast-architecture-producing-1500-hours-of-audio-every-d.html) |
|
||
| DataSift | [Realtime datamining At 120,000 tweets per second](http://highscalability.com/blog/2011/11/29/datasift-architecture-realtime-datamining-at-120000-tweets-p.html) |
|
||
| DropBox | [How we've scaled Dropbox](https://www.youtube.com/watch?v=PE4gwstWhmc) |
|
||
| ESPN | [Operating At 100,000 duh nuh nuhs per second](http://highscalability.com/blog/2013/11/4/espns-architecture-at-scale-operating-at-100000-duh-nuh-nuhs.html) |
|
||
| Google | [Google architecture](http://highscalability.com/google-architecture) |
|
||
| Instagram | [14 million users, terabytes of photos](http://highscalability.com/blog/2011/12/6/instagram-architecture-14-million-users-terabytes-of-photos.html)<br/>[What powers Instagram](http://instagram-engineering.tumblr.com/post/13649370142/what-powers-instagram-hundreds-of-instances) |
|
||
| Justin.tv | [Justin.Tv's live video broadcasting architecture](http://highscalability.com/blog/2010/3/16/justintvs-live-video-broadcasting-architecture.html) |
|
||
| Facebook | [Scaling memcached at Facebook](https://cs.uwaterloo.ca/~brecht/courses/854-Emerging-2014/readings/key-value/fb-memcached-nsdi-2013.pdf)<br/>[TAO: Facebook’s distributed data store for the social graph](https://cs.uwaterloo.ca/~brecht/courses/854-Emerging-2014/readings/data-store/tao-facebook-distributed-datastore-atc-2013.pdf)<br/>[Facebook’s photo storage](https://www.usenix.org/legacy/event/osdi10/tech/full_papers/Beaver.pdf) |
|
||
| Flickr | [Flickr architecture](http://highscalability.com/flickr-architecture) |
|
||
| Mailbox | [From 0 to one million users in 6 weeks](http://highscalability.com/blog/2013/6/18/scaling-mailbox-from-0-to-one-million-users-in-6-weeks-and-1.html) |
|
||
| Pinterest | [From 0 To 10s of billions of page views a month](http://highscalability.com/blog/2013/4/15/scaling-pinterest-from-0-to-10s-of-billions-of-page-views-a.html)<br/>[18 million visitors, 10x growth, 12 employees](http://highscalability.com/blog/2012/5/21/pinterest-architecture-update-18-million-visitors-10x-growth.html) |
|
||
| Playfish | [50 million monthly users and growing](http://highscalability.com/blog/2010/9/21/playfishs-social-gaming-architecture-50-million-monthly-user.html) |
|
||
| PlentyOfFish | [PlentyOfFish architecture](http://highscalability.com/plentyoffish-architecture) |
|
||
| Salesforce | [How they handle 1.3 billion transactions a day](http://highscalability.com/blog/2013/9/23/salesforce-architecture-how-they-handle-13-billion-transacti.html) |
|
||
| Stack Overflow | [Stack Overflow architecture](http://highscalability.com/blog/2009/8/5/stack-overflow-architecture.html) |
|
||
| TripAdvisor | [40M visitors, 200M dynamic page views, 30TB data](http://highscalability.com/blog/2011/6/27/tripadvisor-architecture-40m-visitors-200m-dynamic-page-view.html) |
|
||
| Tumblr | [15 billion page views a month](http://highscalability.com/blog/2012/2/13/tumblr-architecture-15-billion-page-views-a-month-and-harder.html) |
|
||
| Twitter | [Making Twitter 10000 percent faster](http://highscalability.com/scaling-twitter-making-twitter-10000-percent-faster)<br/>[Storing 250 million tweets a day using MySQL](http://highscalability.com/blog/2011/12/19/how-twitter-stores-250-million-tweets-a-day-using-mysql.html)<br/>[150M active users, 300K QPS, a 22 MB/S firehose](http://highscalability.com/blog/2013/7/8/the-architecture-twitter-uses-to-deal-with-150m-active-users.html)<br/>[Timelines at scale](https://www.infoq.com/presentations/Twitter-Timeline-Scalability)<br/>[Big and small data at Twitter](https://www.youtube.com/watch?v=5cKTP36HVgI)<br/>[Operations at Twitter: scaling beyond 100 million users](https://www.youtube.com/watch?v=z8LU0Cj6BOU) |
|
||
| Uber | [How Uber scales their real-time market platform](http://highscalability.com/blog/2015/9/14/how-uber-scales-their-real-time-market-platform.html) |
|
||
| WhatsApp | [The WhatsApp architecture Facebook bought for $19 billion](http://highscalability.com/blog/2014/2/26/the-whatsapp-architecture-facebook-bought-for-19-billion.html) |
|
||
| YouTube | [YouTube scalability](https://www.youtube.com/watch?v=w5WVu624fY8)<br/>[YouTube architecture](http://highscalability.com/youtube-architecture) |
|
||
|
||
### Company engineering blogs
|
||
|
||
> Architectures for companies you are interviewing with.
|
||
>
|
||
> Questions you encounter might be from the same domain.
|
||
|
||
* [Airbnb Engineering](http://nerds.airbnb.com/)
|
||
* [Atlassian Developers](https://developer.atlassian.com/blog/)
|
||
* [Autodesk Engineering](http://cloudengineering.autodesk.com/blog/)
|
||
* [AWS Blog](https://aws.amazon.com/blogs/aws/)
|
||
* [Bitly Engineering Blog](http://word.bitly.com/)
|
||
* [Box Blogs](https://www.box.com/blog/engineering/)
|
||
* [Cloudera Developer Blog](http://blog.cloudera.com/blog/)
|
||
* [Dropbox Tech Blog](https://tech.dropbox.com/)
|
||
* [Engineering at Quora](http://engineering.quora.com/)
|
||
* [Ebay Tech Blog](http://www.ebaytechblog.com/)
|
||
* [Evernote Tech Blog](https://blog.evernote.com/tech/)
|
||
* [Etsy Code as Craft](http://codeascraft.com/)
|
||
* [Facebook Engineering](https://www.facebook.com/Engineering)
|
||
* [Flickr Code](http://code.flickr.net/)
|
||
* [Foursquare Engineering Blog](http://engineering.foursquare.com/)
|
||
* [GitHub Engineering Blog](http://githubengineering.com/)
|
||
* [Google Research Blog](http://googleresearch.blogspot.com/)
|
||
* [Groupon Engineering Blog](https://engineering.groupon.com/)
|
||
* [Heroku Engineering Blog](https://engineering.heroku.com/)
|
||
* [Hubspot Engineering Blog](http://product.hubspot.com/blog/topic/engineering)
|
||
* [High Scalability](http://highscalability.com/)
|
||
* [Instagram Engineering](http://instagram-engineering.tumblr.com/)
|
||
* [Intel Software Blog](https://software.intel.com/en-us/blogs/)
|
||
* [Jane Street Tech Blog](https://blogs.janestreet.com/category/ocaml/)
|
||
* [LinkedIn Engineering](http://engineering.linkedin.com/blog)
|
||
* [Microsoft Engineering](https://engineering.microsoft.com/)
|
||
* [Microsoft Python Engineering](https://blogs.msdn.microsoft.com/pythonengineering/)
|
||
* [Netflix Tech Blog](http://techblog.netflix.com/)
|
||
* [Paypal Developer Blog](https://devblog.paypal.com/category/engineering/)
|
||
* [Pinterest Engineering Blog](http://engineering.pinterest.com/)
|
||
* [Quora Engineering](https://engineering.quora.com/)
|
||
* [Reddit Blog](http://www.redditblog.com/)
|
||
* [Salesforce Engineering Blog](https://developer.salesforce.com/blogs/engineering/)
|
||
* [Slack Engineering Blog](https://slack.engineering/)
|
||
* [Spotify Labs](https://labs.spotify.com/)
|
||
* [Twilio Engineering Blog](http://www.twilio.com/engineering)
|
||
* [Twitter Engineering](https://engineering.twitter.com/)
|
||
* [Uber Engineering Blog](http://eng.uber.com/)
|
||
* [Yahoo Engineering Blog](http://yahooeng.tumblr.com/)
|
||
* [Yelp Engineering Blog](http://engineeringblog.yelp.com/)
|
||
* [Zynga Engineering Blog](https://www.zynga.com/blogs/engineering)
|
||
|
||
#### Source(s) and further reading
|
||
|
||
* [kilimchoi/engineering-blogs](https://github.com/kilimchoi/engineering-blogs)
|
||
|
||
## Under development
|
||
|
||
Interested in adding a section or helping complete one in-progress? [Contribute](#contributing)!
|
||
|
||
* Distributed computing with MapReduce
|
||
* Consistent hashing
|
||
* Scatter gather
|
||
* [Contribute](#contributing)
|
||
|
||
## Credits
|
||
|
||
Credits and sources are provided throughout this repo.
|
||
|
||
Special thanks to:
|
||
|
||
* [Hired in tech](http://www.hiredintech.com/system-design/the-system-design-process/)
|
||
* [Cracking the coding interview](https://www.amazon.com/dp/0984782850/)
|
||
* [High scalability](http://highscalability.com/)
|
||
* [checkcheckzz/system-design-interview](https://github.com/checkcheckzz/system-design-interview)
|
||
* [shashank88/system_design](https://github.com/shashank88/system_design)
|
||
* [mmcgrana/services-engineering](https://github.com/mmcgrana/services-engineering)
|
||
* [System design cheat sheet](https://gist.github.com/vasanthk/485d1c25737e8e72759f)
|
||
* [A distributed systems reading list](http://dancres.github.io/Pages/)
|
||
* [Cracking the system design interview](http://www.puncsky.com/blog/2016/02/14/crack-the-system-design-interview/)
|
||
|
||
## Contact info
|
||
|
||
Feel free to contact me to discuss any issues, questions, or comments.
|
||
|
||
My contact info can be found on my [GitHub page](https://github.com/donnemartin).
|
||
|
||
## License
|
||
|
||
Creative Commons Attribution 4.0 International License (CC BY 4.0)
|
||
|
||
http://creativecommons.org/licenses/by/4.0/
|