Lecture 7

Question 1

What are the two types of scaling?

Answer 1

Vertical and Horizontal scaling

Question 2

Horizontal scaling

Answer 2

Adding more servers to your application to spread the load.

• Can make use of non-demand cloud server architectures.
• Facilitates redundancy - having each layer running on multiple servers means that if any single machine fails, your application keeps running.
• Requires more complicated software and architecture.

Question 3

Vertical scaling

Answer 3

Add more RAM, processors, bandwidth, or storage to a a machine.

• Quick and east way to get your application’s level of service back up to standard. Will only get you so far.
• Upgrading a single server beyond a certain level can become very expensive and often involves downtime and comes with an upper limit.

Question 4

CAP theorem meanings:

Answer 4

• Consistency
• Availability
• Partition tolerance

Question 5

Consistency

Answer 5

A consistent view of data on all nodes of the distributed system.

Question 6

Availability

Answer 6

Demands the system ti eventually answer every request, even in case of failures.

Question 7

Partition tolerance

Answer 7

The system is resilient to message losses between nodes.

A partition is an arbitrary split between nodes of a system, resulting in complete message loss in between.

Question 8

Partitioning (Definition)

Answer 8

Separating one table’s rows into multiple different tables.

Question 9

Types of partitioning

Answer 9

1. Range based
2. Key based

Question 10

Partitioning explanation

Answer 10

Partitioning may be stored on different table spaces, which can be on different storage tiers. (RAM/SSD/HD)
- Partitions can be compressed using different compression schemes.

• Local indexes can be dropped for some partitions.
• Table statistics can be frozen on some partitions, while being periodically refreshed on others.

Question 10

Partitioning explanation

Answer 10

Partitioning may be stored on different table spaces, which can be on different storage tiers. (RAM/SSD/HD)
- Partitions can be compressed using different compression schemes.

• Local indexes can be dropped for some partitions.
• Table statistics can be frozen on some partitions, while being periodically refreshed on others.

Question 11

Distributed Partitions are also known as..

Answer 11

Sharding

Question 12

Distributed Partitions / Sharding

Answer 12

• Storage and badwidth constraints
• Scale read and write capacity
• Geolocation: Proximity, Privacy and data protection laws.
• Higher Availability (losing a single shard vs losing all connection)

Question 13

Distributed Partitions / Sharding

Answer 13

Sharding key needed, the value used to determine to which database to connect.

• Smaller reference tables may need to be replicated to all shards, a strategy is needed for how these tables can be modified and changes propagated to all shards.

Question 14

Distributed DBMS - Parallel Database

Answer 14

• Nodes are physically close to each other.
• Nodes are connected via high-speed LAN.
• The communication cost between nodes is assumed to be small. As such, one does not need to worry about nodes crashing or packets getting dropped when designing internal protocols.

Question 15

Distributed DBMS - Distributed Database

Answer 15

• Nodes can be far from each other.
• Nodes are potentially connected via a public network, which can be slow and unreliable.
• The communication cost and connection problems cannot be ignored.

Question 16

NoSQL Hashed Sharding

Answer 16

Since records have no relations and cannot be joined, there are no transactions.
We can use a hash-function to distribute the data, this evenly distributes the data across clusters.

Question 17

Leader-Follower Replication

Answer 17

Check online.

• Replicas of databases, where follower replicas, can only execute read-only queries.

Question 18

Replication Synchronous

Answer 18

Check online.

Question 19

Distributed databases: Linearizability

Answer 19

Check online.