442 lines
20 KiB
Markdown
442 lines
20 KiB
Markdown
# Design Mint.com
|
|
|
|
*Note: This document links directly to relevant areas found in the [system design topics](https://github.com/donnemartin/system-design-primer#index-of-system-design-topics) to avoid duplication. Refer to the linked content for general talking points, tradeoffs, and alternatives.*
|
|
|
|
## Step 1: Outline use cases and constraints
|
|
|
|
> Gather requirements and scope the problem.
|
|
> Ask questions to clarify use cases and constraints.
|
|
> Discuss assumptions.
|
|
|
|
Without an interviewer to address clarifying questions, we'll define some use cases and constraints.
|
|
|
|
### Use cases
|
|
|
|
#### We'll scope the problem to handle only the following use cases
|
|
|
|
* **User** connects to a financial account
|
|
* **Service** extracts transactions from the account
|
|
* Updates daily
|
|
* Categorizes transactions
|
|
* Allows manual category override by the user
|
|
* No automatic re-categorization
|
|
* Analyzes monthly spending, by category
|
|
* **Service** recommends a budget
|
|
* Allows users to manually set a budget
|
|
* Sends notifications when approaching or exceeding budget
|
|
* **Service** has high availability
|
|
|
|
#### Out of scope
|
|
|
|
* **Service** performs additional logging and analytics
|
|
|
|
### Constraints and assumptions
|
|
|
|
#### State assumptions
|
|
|
|
* Traffic is not evenly distributed
|
|
* Automatic daily update of accounts applies only to users active in the past 30 days
|
|
* Adding or removing financial accounts is relatively rare
|
|
* Budget notifications don't need to be instant
|
|
* 10 million users
|
|
* 10 budget categories per user = 100 million budget items
|
|
* Example categories:
|
|
* Housing = $1,000
|
|
* Food = $200
|
|
* Gas = $100
|
|
* Sellers are used to determine transaction category
|
|
* 50,000 sellers
|
|
* 30 million financial accounts
|
|
* 5 billion transactions per month
|
|
* 500 million read requests per month
|
|
* 10:1 write to read ratio
|
|
* Write-heavy, users make transactions daily, but few visit the site daily
|
|
|
|
#### Calculate usage
|
|
|
|
**Clarify with your interviewer if you should run back-of-the-envelope usage calculations.**
|
|
|
|
* Size per transaction:
|
|
* `user_id` - 8 bytes
|
|
* `created_at` - 5 bytes
|
|
* `seller` - 32 bytes
|
|
* `amount` - 5 bytes
|
|
* Total: ~50 bytes
|
|
* 250 GB of new transaction content per month
|
|
* 50 bytes per transaction * 5 billion transactions per month
|
|
* 9 TB of new transaction content in 3 years
|
|
* Assume most are new transactions instead of updates to existing ones
|
|
* 2,000 transactions per second on average
|
|
* 200 read requests per second on average
|
|
|
|
Handy conversion guide:
|
|
|
|
* 2.5 million seconds per month
|
|
* 1 request per second = 2.5 million requests per month
|
|
* 40 requests per second = 100 million requests per month
|
|
* 400 requests per second = 1 billion requests per month
|
|
|
|
## Step 2: Create a high level design
|
|
|
|
> Outline a high level design with all important components.
|
|
|
|
|
|
|
|
## Step 3: Design core components
|
|
|
|
> Dive into details for each core component.
|
|
|
|
### Use case: User connects to a financial account
|
|
|
|
We could store info on the 10 million users in a [relational database](https://github.com/donnemartin/system-design-primer#relational-database-management-system-rdbms). We should discuss the [use cases and tradeoffs between choosing SQL or NoSQL](https://github.com/donnemartin/system-design-primer#sql-or-nosql).
|
|
|
|
* The **Client** sends a request to the **Web Server**, running as a [reverse proxy](https://github.com/donnemartin/system-design-primer#reverse-proxy-web-server)
|
|
* The **Web Server** forwards the request to the **Accounts API** server
|
|
* The **Accounts API** server updates the **SQL Database** `accounts` table with the newly entered account info
|
|
|
|
**Clarify with your interviewer how much code you are expected to write**.
|
|
|
|
The `accounts` table could have the following structure:
|
|
|
|
```
|
|
id int NOT NULL AUTO_INCREMENT
|
|
created_at datetime NOT NULL
|
|
last_update datetime NOT NULL
|
|
account_url varchar(255) NOT NULL
|
|
account_login varchar(32) NOT NULL
|
|
account_password_hash char(64) NOT NULL
|
|
user_id int NOT NULL
|
|
PRIMARY KEY(id)
|
|
FOREIGN KEY(user_id) REFERENCES users(id)
|
|
```
|
|
|
|
We'll create an [index](https://github.com/donnemartin/system-design-primer#use-good-indices) on `id`, `user_id `, and `created_at` to speed up lookups (log-time instead of scanning the entire table) and to keep the data in memory. Reading 1 MB sequentially from memory takes about 250 microseconds, while reading from SSD takes 4x and from disk takes 80x longer.<sup><a href=https://github.com/donnemartin/system-design-primer#latency-numbers-every-programmer-should-know>1</a></sup>
|
|
|
|
We'll use a public [**REST API**](https://github.com/donnemartin/system-design-primer#representational-state-transfer-rest):
|
|
|
|
```
|
|
$ curl -X POST --data '{ "user_id": "foo", "account_url": "bar", \
|
|
"account_login": "baz", "account_password": "qux" }' \
|
|
https://mint.com/api/v1/account
|
|
```
|
|
|
|
For internal communications, we could use [Remote Procedure Calls](https://github.com/donnemartin/system-design-primer#remote-procedure-call-rpc).
|
|
|
|
Next, the service extracts transactions from the account.
|
|
|
|
### Use case: Service extracts transactions from the account
|
|
|
|
We'll want to extract information from an account in these cases:
|
|
|
|
* The user first links the account
|
|
* The user manually refreshes the account
|
|
* Automatically each day for users who have been active in the past 30 days
|
|
|
|
Data flow:
|
|
|
|
* The **Client** sends a request to the **Web Server**
|
|
* The **Web Server** forwards the request to the **Accounts API** server
|
|
* The **Accounts API** server places a job on a **Queue** such as Amazon SQS or [RabbitMQ](https://www.rabbitmq.com/)
|
|
* Extracting transactions could take awhile, we'd probably want to do this [asynchronously with a queue](https://github.com/donnemartin/system-design-primer#asynchronism), although this introduces additional complexity
|
|
* The **Transaction Extraction Service** does the following:
|
|
* Pulls from the **Queue** and extracts transactions for the given account from the financial institution, storing the results as raw log files in the **Object Store**
|
|
* Uses the **Category Service** to categorize each transaction
|
|
* Uses the **Budget Service** to calculate aggregate monthly spending by category
|
|
* The **Budget Service** uses the **Notification Service** to let users know if they are nearing or have exceeded their budget
|
|
* Updates the **SQL Database** `transactions` table with categorized transactions
|
|
* Updates the **SQL Database** `monthly_spending` table with aggregate monthly spending by category
|
|
* Notifies the user the transactions have completed through the **Notification Service**:
|
|
* Uses a **Queue** (not pictured) to asynchronously send out notifications
|
|
|
|
The `transactions` table could have the following structure:
|
|
|
|
```
|
|
id int NOT NULL AUTO_INCREMENT
|
|
created_at datetime NOT NULL
|
|
seller varchar(32) NOT NULL
|
|
amount decimal NOT NULL
|
|
user_id int NOT NULL
|
|
PRIMARY KEY(id)
|
|
FOREIGN KEY(user_id) REFERENCES users(id)
|
|
```
|
|
|
|
We'll create an [index](https://github.com/donnemartin/system-design-primer#use-good-indices) on `id`, `user_id `, and `created_at`.
|
|
|
|
The `monthly_spending` table could have the following structure:
|
|
|
|
```
|
|
id int NOT NULL AUTO_INCREMENT
|
|
month_year date NOT NULL
|
|
category varchar(32)
|
|
amount decimal NOT NULL
|
|
user_id int NOT NULL
|
|
PRIMARY KEY(id)
|
|
FOREIGN KEY(user_id) REFERENCES users(id)
|
|
```
|
|
|
|
We'll create an [index](https://github.com/donnemartin/system-design-primer#use-good-indices) on `id` and `user_id `.
|
|
|
|
#### Category service
|
|
|
|
For the **Category Service**, we can seed a seller-to-category dictionary with the most popular sellers. If we estimate 50,000 sellers and estimate each entry to take less than 255 bytes, the dictionary would only take about 12 MB of memory.
|
|
|
|
**Clarify with your interviewer how much code you are expected to write**.
|
|
|
|
```
|
|
class DefaultCategories(Enum):
|
|
|
|
HOUSING = 0
|
|
FOOD = 1
|
|
GAS = 2
|
|
SHOPPING = 3
|
|
...
|
|
|
|
seller_category_map = {}
|
|
seller_category_map['Exxon'] = DefaultCategories.GAS
|
|
seller_category_map['Target'] = DefaultCategories.SHOPPING
|
|
...
|
|
```
|
|
|
|
For sellers not initially seeded in the map, we could use a crowdsourcing effort by evaluating the manual category overrides our users provide. We could use a heap to quickly lookup the top manual override per seller in O(1) time.
|
|
|
|
```
|
|
class Categorizer(object):
|
|
|
|
def __init__(self, seller_category_map, self.seller_category_crowd_overrides_map):
|
|
self.seller_category_map = seller_category_map
|
|
self.seller_category_crowd_overrides_map = \
|
|
seller_category_crowd_overrides_map
|
|
|
|
def categorize(self, transaction):
|
|
if transaction.seller in self.seller_category_map:
|
|
return self.seller_category_map[transaction.seller]
|
|
elif transaction.seller in self.seller_category_crowd_overrides_map:
|
|
self.seller_category_map[transaction.seller] = \
|
|
self.seller_category_crowd_overrides_map[transaction.seller].peek_min()
|
|
return self.seller_category_map[transaction.seller]
|
|
return None
|
|
```
|
|
|
|
Transaction implementation:
|
|
|
|
```
|
|
class Transaction(object):
|
|
|
|
def __init__(self, created_at, seller, amount):
|
|
self.timestamp = timestamp
|
|
self.seller = seller
|
|
self.amount = amount
|
|
```
|
|
|
|
### Use case: Service recommends a budget
|
|
|
|
To start, we could use a generic budget template that allocates category amounts based on income tiers. Using this approach, we would not have to store the 100 million budget items identified in the constraints, only those that the user overrides. If a user overrides a budget category, which we could store the override in the `TABLE budget_overrides`.
|
|
|
|
```
|
|
class Budget(object):
|
|
|
|
def __init__(self, income):
|
|
self.income = income
|
|
self.categories_to_budget_map = self.create_budget_template()
|
|
|
|
def create_budget_template(self):
|
|
return {
|
|
'DefaultCategories.HOUSING': income * .4,
|
|
'DefaultCategories.FOOD': income * .2
|
|
'DefaultCategories.GAS': income * .1,
|
|
'DefaultCategories.SHOPPING': income * .2
|
|
...
|
|
}
|
|
|
|
def override_category_budget(self, category, amount):
|
|
self.categories_to_budget_map[category] = amount
|
|
```
|
|
|
|
For the **Budget Service**, we can potentially run SQL queries on the `transactions` table to generate the `monthly_spending` aggregate table. The `monthly_spending` table would likely have much fewer rows than the total 5 billion transactions, since users typically have many transactions per month.
|
|
|
|
As an alternative, we can run **MapReduce** jobs on the raw transaction files to:
|
|
|
|
* Categorize each transaction
|
|
* Generate aggregate monthly spending by category
|
|
|
|
Running analyses on the transaction files could significantly reduce the load on the database.
|
|
|
|
We could call the **Budget Service** to re-run the analysis if the user updates a category.
|
|
|
|
**Clarify with your interviewer how much code you are expected to write**.
|
|
|
|
Sample log file format, tab delimited:
|
|
|
|
```
|
|
user_id timestamp seller amount
|
|
```
|
|
|
|
**MapReduce** implementation:
|
|
|
|
```
|
|
class SpendingByCategory(MRJob):
|
|
|
|
def __init__(self, categorizer):
|
|
self.categorizer = categorizer
|
|
self.current_year_month = calc_current_year_month()
|
|
...
|
|
|
|
def calc_current_year_month(self):
|
|
"""Return the current year and month."""
|
|
...
|
|
|
|
def extract_year_month(self, timestamp):
|
|
"""Return the year and month portions of the timestamp."""
|
|
...
|
|
|
|
def handle_budget_notifications(self, key, total):
|
|
"""Call notification API if nearing or exceeded budget."""
|
|
...
|
|
|
|
def mapper(self, _, line):
|
|
"""Parse each log line, extract and transform relevant lines.
|
|
|
|
Argument line will be of the form:
|
|
|
|
user_id timestamp seller amount
|
|
|
|
Using the categorizer to convert seller to category,
|
|
emit key value pairs of the form:
|
|
|
|
(user_id, 2016-01, shopping), 25
|
|
(user_id, 2016-01, shopping), 100
|
|
(user_id, 2016-01, gas), 50
|
|
"""
|
|
user_id, timestamp, seller, amount = line.split('\t')
|
|
category = self.categorizer.categorize(seller)
|
|
period = self.extract_year_month(timestamp)
|
|
if period == self.current_year_month:
|
|
yield (user_id, period, category), amount
|
|
|
|
def reducer(self, key, value):
|
|
"""Sum values for each key.
|
|
|
|
(user_id, 2016-01, shopping), 125
|
|
(user_id, 2016-01, gas), 50
|
|
"""
|
|
total = sum(values)
|
|
yield key, sum(values)
|
|
```
|
|
|
|
## Step 4: Scale the design
|
|
|
|
> Identify and address bottlenecks, given the constraints.
|
|
|
|
|
|
|
|
**Important: Do not simply jump right into the final design from the initial design!**
|
|
|
|
State you would 1) **Benchmark/Load Test**, 2) **Profile** for bottlenecks 3) address bottlenecks while evaluating alternatives and trade-offs, and 4) repeat. See [Design a system that scales to millions of users on AWS](https://github.com/donnemartin/system-design-primer/blob/master/solutions/system_design/scaling_aws/README.md) as a sample on how to iteratively scale the initial design.
|
|
|
|
It's important to discuss what bottlenecks you might encounter with the initial design and how you might address each of them. For example, what issues are addressed by adding a **Load Balancer** with multiple **Web Servers**? **CDN**? **Master-Slave Replicas**? What are the alternatives and **Trade-Offs** for each?
|
|
|
|
We'll introduce some components to complete the design and to address scalability issues. Internal load balancers are not shown to reduce clutter.
|
|
|
|
*To avoid repeating discussions*, refer to the following [system design topics](https://github.com/donnemartin/system-design-primer#index-of-system-design-topics) for main talking points, tradeoffs, and alternatives:
|
|
|
|
* [DNS](https://github.com/donnemartin/system-design-primer#domain-name-system)
|
|
* [CDN](https://github.com/donnemartin/system-design-primer#content-delivery-network)
|
|
* [Load balancer](https://github.com/donnemartin/system-design-primer#load-balancer)
|
|
* [Horizontal scaling](https://github.com/donnemartin/system-design-primer#horizontal-scaling)
|
|
* [Web server (reverse proxy)](https://github.com/donnemartin/system-design-primer#reverse-proxy-web-server)
|
|
* [API server (application layer)](https://github.com/donnemartin/system-design-primer#application-layer)
|
|
* [Cache](https://github.com/donnemartin/system-design-primer#cache)
|
|
* [Relational database management system (RDBMS)](https://github.com/donnemartin/system-design-primer#relational-database-management-system-rdbms)
|
|
* [SQL write master-slave failover](https://github.com/donnemartin/system-design-primer#fail-over)
|
|
* [Master-slave replication](https://github.com/donnemartin/system-design-primer#master-slave-replication)
|
|
* [Asynchronism](https://github.com/donnemartin/system-design-primer#aysnchronism)
|
|
* [Consistency patterns](https://github.com/donnemartin/system-design-primer#consistency-patterns)
|
|
* [Availability patterns](https://github.com/donnemartin/system-design-primer#availability-patterns)
|
|
|
|
We'll add an additional use case: **User** accesses summaries and transactions.
|
|
|
|
User sessions, aggregate stats by category, and recent transactions could be placed in a **Memory Cache** such as Redis or Memcached.
|
|
|
|
* The **Client** sends a read request to the **Web Server**
|
|
* The **Web Server** forwards the request to the **Read API** server
|
|
* Static content can be served from the **Object Store** such as S3, which is cached on the **CDN**
|
|
* The **Read API** server does the following:
|
|
* Checks the **Memory Cache** for the content
|
|
* If the url is in the **Memory Cache**, returns the cached contents
|
|
* Else
|
|
* If the url is in the **SQL Database**, fetches the contents
|
|
* Updates the **Memory Cache** with the contents
|
|
|
|
Refer to [When to update the cache](https://github.com/donnemartin/system-design-primer#when-to-update-the-cache) for tradeoffs and alternatives. The approach above describes [cache-aside](https://github.com/donnemartin/system-design-primer#cache-aside).
|
|
|
|
Instead of keeping the `monthly_spending` aggregate table in the **SQL Database**, we could create a separate **Analytics Database** using a data warehousing solution such as Amazon Redshift or Google BigQuery.
|
|
|
|
We might only want to store a month of `transactions` data in the database, while storing the rest in a data warehouse or in an **Object Store**. An **Object Store** such as Amazon S3 can comfortably handle the constraint of 250 GB of new content per month.
|
|
|
|
To address the 2,000 *average* read requests per second (higher at peak), traffic for popular content should be handled by the **Memory Cache** instead of the database. The **Memory Cache** is also useful for handling the unevenly distributed traffic and traffic spikes. The **SQL Read Replicas** should be able to handle the cache misses, as long as the replicas are not bogged down with replicating writes.
|
|
|
|
200 *average* transaction writes per second (higher at peak) might be tough for a single **SQL Write Master-Slave**. We might need to employ additional SQL scaling patterns:
|
|
|
|
* [Federation](https://github.com/donnemartin/system-design-primer#federation)
|
|
* [Sharding](https://github.com/donnemartin/system-design-primer#sharding)
|
|
* [Denormalization](https://github.com/donnemartin/system-design-primer#denormalization)
|
|
* [SQL Tuning](https://github.com/donnemartin/system-design-primer#sql-tuning)
|
|
|
|
We should also consider moving some data to a **NoSQL Database**.
|
|
|
|
## Additional talking points
|
|
|
|
> Additional topics to dive into, depending on the problem scope and time remaining.
|
|
|
|
#### NoSQL
|
|
|
|
* [Key-value store](https://github.com/donnemartin/system-design-primer#key-value-store)
|
|
* [Document store](https://github.com/donnemartin/system-design-primer#document-store)
|
|
* [Wide column store](https://github.com/donnemartin/system-design-primer#wide-column-store)
|
|
* [Graph database](https://github.com/donnemartin/system-design-primer#graph-database)
|
|
* [SQL vs NoSQL](https://github.com/donnemartin/system-design-primer#sql-or-nosql)
|
|
|
|
### Caching
|
|
|
|
* Where to cache
|
|
* [Client caching](https://github.com/donnemartin/system-design-primer#client-caching)
|
|
* [CDN caching](https://github.com/donnemartin/system-design-primer#cdn-caching)
|
|
* [Web server caching](https://github.com/donnemartin/system-design-primer#web-server-caching)
|
|
* [Database caching](https://github.com/donnemartin/system-design-primer#database-caching)
|
|
* [Application caching](https://github.com/donnemartin/system-design-primer#application-caching)
|
|
* What to cache
|
|
* [Caching at the database query level](https://github.com/donnemartin/system-design-primer#caching-at-the-database-query-level)
|
|
* [Caching at the object level](https://github.com/donnemartin/system-design-primer#caching-at-the-object-level)
|
|
* When to update the cache
|
|
* [Cache-aside](https://github.com/donnemartin/system-design-primer#cache-aside)
|
|
* [Write-through](https://github.com/donnemartin/system-design-primer#write-through)
|
|
* [Write-behind (write-back)](https://github.com/donnemartin/system-design-primer#write-behind-write-back)
|
|
* [Refresh ahead](https://github.com/donnemartin/system-design-primer#refresh-ahead)
|
|
|
|
### Asynchronism and microservices
|
|
|
|
* [Message queues](https://github.com/donnemartin/system-design-primer#message-queues)
|
|
* [Task queues](https://github.com/donnemartin/system-design-primer#task-queues)
|
|
* [Back pressure](https://github.com/donnemartin/system-design-primer#back-pressure)
|
|
* [Microservices](https://github.com/donnemartin/system-design-primer#microservices)
|
|
|
|
### Communications
|
|
|
|
* Discuss tradeoffs:
|
|
* External communication with clients - [HTTP APIs following REST](https://github.com/donnemartin/system-design-primer#representational-state-transfer-rest)
|
|
* Internal communications - [RPC](https://github.com/donnemartin/system-design-primer#remote-procedure-call-rpc)
|
|
* [Service discovery](https://github.com/donnemartin/system-design-primer#service-discovery)
|
|
|
|
### Security
|
|
|
|
Refer to the [security section](https://github.com/donnemartin/system-design-primer#security).
|
|
|
|
### Latency numbers
|
|
|
|
See [Latency numbers every programmer should know](https://github.com/donnemartin/system-design-primer#latency-numbers-every-programmer-should-know).
|
|
|
|
### Ongoing
|
|
|
|
* Continue benchmarking and monitoring your system to address bottlenecks as they come up
|
|
* Scaling is an iterative process
|