News for hackers. Stuff that matters.

A comment on PGM Indexes: Learned indexes that match B-tree performance with 83x less space.

Re:PGM Indexes: Learned indexes that match B-tree performanc... by dmos62 on Monday January 25, 2021 @07:09AM (#25902255)
I've only heard of B-trees in passing. In what kinds of situations are these data structures used?
[ Parent | on HN ]
Re:PGM Indexes: Learned indexes that match B-tree performanc... by lincolnq on Monday January 25, 2021 @07:45AM (#25902507)
Databases. If you want to be able to quickly do a lot of useful operations on large amounts of data, B-trees and their variants (B+ trees) are the way to go. Using a B-tree, you can find an entry, sort and do range queries by key, and inserts and deletes are fast.
[ Parent | on HN ]