<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learned Indexes for a Google-scale Disk-based Database · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2012.12501/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2012.12501/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learned Indexes for a Google-scale Disk-based Database — mentioned by kevindamm</title><link>https://news.ycombinator.com/item?id=44379593</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.12501:44379593</guid><pubDate>Wed, 25 Jun 2025 17:07:51 GMT</pubDate><description>&lt;p&gt;In theory, you can treat the objects as i.i.d. giving them a uniform prior. In practice, of course only the inputs are inputs and if you were to take that into account then you could avoid collisions, but as you say, you can&amp;#x27;t really know that ahead of time. Unless you can, such as when there is structure to the inputs or some other source of non-uniformity that you can account for. The topic of learned indexes is worth investigating if you&amp;#x27;re interested: https://arxiv.org/abs/1712.01208 https://arxiv.org/abs/2012.12501&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.12501/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item><item><title>Learned Indexes for a Google-scale Disk-based Database — HN submission</title><link>https://news.ycombinator.com/item?id=41786222</link><guid isPermaLink="false">urn:hackerpapers:submission:2012.12501:41786222</guid><pubDate>Wed, 09 Oct 2024 10:17:44 GMT</pubDate><description>&lt;p&gt;Learned Indexes for a Google-Scale Disk-Based Database&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2012.12501/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item><item><title>Learned Indexes for a Google-scale Disk-based Database — mentioned by robertsdionne</title><link>https://news.ycombinator.com/item?id=32192010</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.12501:32192010</guid><pubDate>Fri, 22 Jul 2022 14:10:45 GMT</pubDate><description>&lt;p&gt;Also, Learned Indexes Structures: The Case for Learned Index Structures: https://arxiv.org/abs/1712.01208 Learned Indexes for a Google-scale Disk-based Database: https://arxiv.org/abs/2012.12501 And Noms/Dolt Prolly Trees: How to Chunk Your Database into a Merkle Tree: https://dolthub.com/blog/2022-06-27-prolly-chunker/&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.12501/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item><item><title>Learned Indexes for a Google-scale Disk-based Database — mentioned by bmc7505</title><link>https://news.ycombinator.com/item?id=30357546</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.12501:30357546</guid><pubDate>Wed, 16 Feb 2022 08:23:16 GMT</pubDate><description>&lt;p&gt;&amp;gt; It seems wildly impracticable to productionize at the moment (excepting Google, perhaps). There were a couple related papers [1, 2] from Google on learning to index a few years ago. In fact, I&amp;#x27;m a little surprised they weren&amp;#x27;t cited. [1]: https://dl.acm.org/doi/pdf/10.1145/3183713.3196909 [2]: https://arxiv.org/pdf/2012.12501.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.12501/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item><item><title>Learned Indexes for a Google-scale Disk-based Database — mentioned by Traudl</title><link>https://news.ycombinator.com/item?id=25927557</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.12501:25927557</guid><pubDate>Wed, 27 Jan 2021 12:48:02 GMT</pubDate><description>&lt;p&gt;It looks like it found its way into Google Bigtable though: https://arxiv.org/abs/2012.12501&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.12501/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DB</category></item></channel></rss>
