官术网_书友最值得收藏!

Understanding basic locking

In this section, you will learn about basic locking mechanisms. The goal is to make you understand how locking works in general and how to get simple applications right.

To show how things work, a simple table can be created. For demonstration purposes, I will add one row to the table:

test=# CREATE TABLE t_test (id int); 
CREATE TABLE
test=# INSERT INTO t_test VALUES (1);
INSERT 0 1

The first important thing is that tables can be read concurrently. Many users reading the same data at the same time won't block each other. This allows PostgreSQL to handle thousands of users without problems.

Multiple users can read the same data at the same time without blocking each other.

The question now is: what happens if reads and writes occur at the same time? Here is an example:

Two transactions are opened. The first one will change a row. However, this is no problem as the second transaction can proceed. It will return the old row as it was before the UPDATE. This behavior is called Multi-Version Concurrency Control (MVCC).

Note that a transaction will see data only if it has been committed by the writing transaction. One transaction cannot inspect the changes made by an active connection.

A transaction can see only those changes that have already been committed.

There is also a second important aspect: many commercial or open source databases are still (as of 2017) unable to handle concurrent reads and writes. In PostgreSQL, this is absolutely not a problem. Reads and writes can coexist.

Writing transactions won't block reading transactions.

After the data has been committed, the table will contain 2.

What will happen if two people change data at the same time? Here is an example:

Suppose you want to count the number of hits on a website. If you run the code as outlined just now, no hit can be lost because PostgreSQL guarantees that one UPDATE is performed after the other.

PostgreSQL will only lock rows affected by the UPDATE. So if you have 1,000 rows, you can theoretically run 1,000 concurrent changes on the same table.

It is also noteworthy that you can always run concurrent reads. Our two writes will not block reads.

主站蜘蛛池模板: 天门市| 宁海县| 安吉县| 阳东县| 绵阳市| 嘉义市| 民权县| 井冈山市| 阳春市| 谷城县| 仙桃市| 苍南县| 噶尔县| 改则县| 洱源县| 绵阳市| 广昌县| 宜兰县| 佛山市| 建平县| 望都县| 禄丰县| 磐安县| 马龙县| 南丹县| 仪征市| 陇川县| 岳阳市| 凤山市| 茂名市| 额尔古纳市| 昂仁县| 齐齐哈尔市| 凤凰县| 温宿县| 赣州市| 象州县| 隆安县| 思南县| 西乌珠穆沁旗| 太原市|