We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Faster And Durable Hash Indexes

Formal Metadata

Title
Faster And Durable Hash Indexes
Alternative Title
Faster And Reliable Hash Indexes
Title of Series
Number of Parts
19
Author
License
CC Attribution 3.0 Unported:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
PostgreSQL has supported Hash Index for a long time, but they are not much used in production mainly because they are not durable. In this talk, I will discuss the work done in PostgreSQL 10.0 to make it reliable and performant. This paper will discuss the performance characteristics of Hash Indexes wherein we will see the performance improvements made in PostgreSQL 10.0. I will also share the performance comparison between Hash and Btree Indexes, both with respect to transactions per second and space-efficiency. I will also outline the cases where hash indexes can be used instead of btree indexes. In this talk, I will discuss the write ahead logging for Hash Indexes, mainly focusing on challenges we have to overcome in doing so. Finally, I will talk about the work that can be done to further improve it in terms of features, performance and space usage.