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

Поиск
Список
Период
Сортировка
От Nikolay Samokhvalov
Тема ML-based indexing ("The Case for Learned Index Structures", a paperfrom Google)
Дата
Msg-id CANNMO+J1KeTSx5q5SYuwHf1v-gPRLrOZw1s7qOpqWx=3UMMvtg@mail.gmail.com
обсуждение исходный текст
Ответы Re: ML-based indexing ("The Case for Learned Index Structures", apaper from Google)  (Oleg Bartunov <obartunov@gmail.com>)
Список pgsql-hackers
Дерево обсуждения
Very interesting read: https://arxiv.org/abs/1712.01208


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?

В списке pgsql-hackers по дате отправления:

Предыдущее
От: Tom Lane
Дата:
Сообщение: Re: plpgsql test layout
Следующее
От: Robert Haas
Дата:
Сообщение: Re: [HACKERS] Moving relation extension locks out of heavyweight lock manager