ML-based indexing ("The Case for Learned Index Structures", a paper from Google)

From: Nikolay Samokhvalov <samokhvalov(at)gmail(dot)com>
To: pgsql-hackers(at)postgresql(dot)org
Subject: ML-based indexing ("The Case for Learned Index Structures", a paper from Google)
Date: 2017-12-11 20:11:50
Message-ID: CANNMO+J1KeTSx5q5SYuwHf1v-gPRLrOZw1s7qOpqWx=3UMMvtg@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Very interesting read: https://arxiv.org/abs/1712.01208

HN discussion: https://news.ycombinator.com/item?id=15894896

Some of the comments (from Twitter
https://twitter.com/schrockn/status/940037656494317568) "Jeff Dean and co
at GOOG just released a paper showing how machine-learned indexes can
replace B-Trees, Hash Indexes, and Bloom Filters. Execute 3x faster than
B-Trees, 10-100x less space. Executes on GPU, which are getting faster
unlike CPU. Amazing."

Can those ideas be applied to Postgres in its current state? Or it's not
really down-to-earth?

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Robert Haas 2017-12-11 20:15:50 Re: [HACKERS] Moving relation extension locks out of heavyweight lock manager
Previous Message Tom Lane 2017-12-11 20:11:41 Re: plpgsql test layout