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

Faster And Durable Hash Indexes

Formale Metadaten

Titel
Faster And Durable Hash Indexes
Alternativer Titel
Faster And Reliable Hash Indexes
Serientitel
Anzahl der Teile
19
Autor
Lizenz
CC-Namensnennung 3.0 Unported:
Sie dürfen das Werk bzw. den Inhalt zu jedem legalen Zweck nutzen, verändern und in unveränderter oder veränderter Form vervielfältigen, verbreiten und öffentlich zugänglich machen, sofern Sie den Namen des Autors/Rechteinhabers in der von ihm festgelegten Weise nennen.
Identifikatoren
Herausgeber
Erscheinungsjahr
Sprache

Inhaltliche Metadaten

Fachgebiet
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.