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

From: Chapman Flack <chap(at)anastigmatix(dot)net>
To: Peter Geoghegan <pg(at)bowt(dot)ie>, Andrey Borodin <x4mmm(at)yandex-team(dot)ru>
Cc: Stefan Keller <sfkeller(at)gmail(dot)com>, Oleg Ivanov <o(dot)ivanov(at)postgrespro(dot)ru>, Oleg Bartunov <obartunov(at)gmail(dot)com>, Nikolay Samokhvalov <samokhvalov(at)gmail(dot)com>, Pgsql Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: ML-based indexing ("The Case for Learned Index Structures", a paper from Google)
Date: 2021-04-20 19:35:00
Message-ID: 607F2CE4.80107@anastigmatix.net
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On 04/20/21 15:24, Peter Geoghegan wrote:
> data structures that work well don't need anybody to make a case for them.
> They simply work well for the task they were designed for.

How would showing that to be true for data structure X be different from
making a case for data structure X?

Regards,
-Chap

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Daniel Carter 2021-04-20 19:44:23 Re: PATCH: Add GSSAPI ccache_name option to libpq
Previous Message Peter Geoghegan 2021-04-20 19:24:29 Re: ML-based indexing ("The Case for Learned Index Structures", a paper from Google)