Everything about transaction isolation in PostgreSQL for application developer
Whenever multiple users, processes, or threads are concurrently modifying data which is shared among them, problems can occur if race conditions are not handled somehow. These problems are particularly acute in a database which provide ACID semantics. A set of changes grouped into a database transaction must appear atomically, both to concurrent transactions and in terms of crash recovery. Each transaction must move the database from one consistent state (with regard to business rules) to another. For programming efficiency, each transaction must be able to be coded independently of what other transactions may happen to be running at the same time. In the event of a crash, all modifications made by transactions for which the application was notified of successful completion, and all modifications which had become visible to other transactions, must still be completed upon crash recovery. Over the years, various strategies have been employed to provide these guarantees, and sometimes the guarantees have been compromised in one way or another. This talk will cover the approaches taken to provide these guarantees or compromised variations of them, with an emphasis on the Serializable Snapshot Isolation (SSI) technique available in PostgreSQL (and so far not in any other production product). While SSI already performs faster and with higher concurrency than any other technique for managing race conditions with most common workloads, there are many opportunities for further enhancing performance, some of which would require the assistance of people expert in the various index access methods; these issues will be discussed. The talk will also present some rough ideas about how SSI techniques might be used with XTM in a distributed system.
Time will be reserved at the end of the talk for group discussion of optimizations and possible application in distributed environments.
Слайды
6_Кевин Гриттнер kevin.pptВидео
Другие доклады
-
45 мин
Ivan Goncharov IBMWhy IBM Power 8 is optimal platform for PostgreSQL
Architecture features of IBM Power 8 allowing to gain high performance in comparison with x86_64. CPU, memory, IO etc. Experience of real benchmarking.
-
45 мин
Dmitry Vasiliev Postgres ProfessionalPostgreSQL Scalability
The talk describes performance benchmarking results of PostgreSQL on modern Hi-End servers. The main attention was paid to the locks for shared data access and associated bottlenecks. The testing propose was to test the linear read scalability limits with an increase of cores number allocated for PostgreSQL. Testing was performed for different postgres versions (9.4, 9.5, 9.6) to check new features designed to increase performance on multiprocessing architectures.
-
45 мин
Ronan Dunklau DaliboMulticorn: writing FDWs in Python
Multicorn is a generic Foreign Data Wrapper which goal is to simplify development of FDWs by writing them in Python.
We will see:
- what is an FDW what Multicorn is trying to solve how to use it, with a brief tour of the FDWs shipping with Multicorn.
- how to write your own FDW in python, including the new 9.5 IMPORT FOREIGN SCHEMA api.
- the internals: what Multicorn is doing for you behind the scenes, and what it doesn't
After a presentation of FDWs in general, and what the Multicorn extension really is, we will take a look at some of the FDWs bundled with Multicorn.
Then, a complete tour of the Multicorn API will teach you how to write a FDW in python, including the following features:
- using the table definition
- WHERE clauses push-down
- output columns restrictions
- influencing the planner
- writing to a foreign table
- IMPORT FOREIGN SCHEMA
- ORDER BY clauses pushdown
- transaction management
This will be a hands-on explanation, with code snippets allowing you to build your own FDW in python from scratch.
-
45 мин
Anastasia Lubennikova Postgres ProfessionalNew B-tree features
B-tree is the most widely used index type in PostgreSQL. This data structure and concerned algorithms are developed about forty years ago. But there is still an area for optimisations. In this presentation I'm going to talk about B-tree data structure, and its features important for the optimal index usage. Furthermore, I'll present a couple of new features which are expected to be included in PostgreSQL 9.6 release.