<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: lmwnshn</title><link>https://news.ycombinator.com/user?id=lmwnshn</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 15 Jun 2026 15:25:34 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=lmwnshn" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by lmwnshn in "Codex is now in the ChatGPT mobile app"]]></title><description><![CDATA[
<p>I've been coding on Android for a few months, mostly while walking around outside or showering. I'm on a mix of Tailscale + Termux + ssh server + tmux + codex CLI, Tailscale is great.<p>I think you may be able to optimize your workflow more by drafting your prompt in ChatGPT first; get it to expand out the intent for you. Doing that has made phone coding a lot more tolerable for me.<p>I like to think that I've given phone coding a fair shot (and I continue to do it), but I agree with the other poster that there's something about the lack of a keyboard that really gets to me :) I wish I knew what it was.</p>
]]></description><pubDate>Fri, 15 May 2026 05:10:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=48144786</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=48144786</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48144786</guid></item><item><title><![CDATA[New comment by lmwnshn in "Databases in 2025: A Year in Review"]]></title><description><![CDATA[
<p>It is an undergrad course, though it is cross-listed for masters students as well. At CMU, the prerequisites chain looks like this: 15-122 (intro imperative programming, zero background assumed, taken by first semester CS undergrads) -> 15-213 (intro systems programming, typically taken by the end of the second year) -> 15-445 (intro to database systems, typically taken in the third or fourth year). So in theory, it's about one year of material away from zero experience.</p>
]]></description><pubDate>Mon, 05 Jan 2026 19:37:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=46503630</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=46503630</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46503630</guid></item><item><title><![CDATA[New comment by lmwnshn in "DOOMscrolling: The Game"]]></title><description><![CDATA[
<p>Check out the full version of Towards Scalable Dataframe Systems from VLDB 2020 [0]. They propose an algebra for dataframes and section 4.4's example succinctly describes the pivot operator.<p>[0] <a href="https://arxiv.org/abs/2001.00888" rel="nofollow">https://arxiv.org/abs/2001.00888</a></p>
]]></description><pubDate>Thu, 11 Sep 2025 13:13:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=45211214</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=45211214</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45211214</guid></item><item><title><![CDATA[New comment by lmwnshn in "Congress moves to reject bulk of White House's proposed NASA cuts"]]></title><description><![CDATA[
<p><a href="https://csstipendrankings.org/" rel="nofollow">https://csstipendrankings.org/</a></p>
]]></description><pubDate>Wed, 16 Jul 2025 13:48:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=44582374</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=44582374</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44582374</guid></item><item><title><![CDATA[New comment by lmwnshn in "Databases in 2024: A Year in Review"]]></title><description><![CDATA[
<p>Slow is relative, but you might want to check out Garnet [0] for ideas. Previous discussion at [1], current compatibility at [2].<p>[0] <a href="https://www.microsoft.com/en-us/research/blog/introducing-garnet-an-open-source-next-generation-faster-cache-store-for-accelerating-applications-and-services/" rel="nofollow">https://www.microsoft.com/en-us/research/blog/introducing-ga...</a><p>[1] <a href="https://news.ycombinator.com/item?id=39752504">https://news.ycombinator.com/item?id=39752504</a><p>[2] <a href="https://microsoft.github.io/garnet/docs/commands/api-compatibility" rel="nofollow">https://microsoft.github.io/garnet/docs/commands/api-compati...</a></p>
]]></description><pubDate>Thu, 02 Jan 2025 02:16:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=42571024</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=42571024</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42571024</guid></item><item><title><![CDATA[New comment by lmwnshn in "Databases in 2024: A Year in Review"]]></title><description><![CDATA[
<p>Pretty much. Plus, from my perspective - if a company is willing to screw over your advisor/professor, you know that they won't hesitate to screw you over too.</p>
]]></description><pubDate>Thu, 02 Jan 2025 01:56:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=42570935</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=42570935</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42570935</guid></item><item><title><![CDATA[New comment by lmwnshn in "Databases in 2024: A Year in Review"]]></title><description><![CDATA[
<p>> ... you should not recruit the university department/group/students against your peers ...<p>As a student who chose to stay at CMU for a PhD because of this group, it is quite the opposite situation - you may also misunderstand the nature of the "ban" (students can still apply directly to the company).<p>From the student perspective, we benefit from knowing the reputation of potential employers. For example: CompanyX went back on their promises so don't trust them unless they give it to you right away, CompanyY has a culture of being stingy, the people who went to CompanyZ love it there, and so on.<p>So it's more like (1) providing additional data about the company's past behavior, and (2) not actively giving the company a platform. I personally find this great for students.</p>
]]></description><pubDate>Thu, 02 Jan 2025 01:44:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=42570889</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=42570889</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42570889</guid></item><item><title><![CDATA[New comment by lmwnshn in "An Empirical Evaluation of Columnar Storage Formats [pdf]"]]></title><description><![CDATA[
<p>You're correct, but for additional context, this paper will actually be presented at VLDB 2024 [0].<p>> All papers published in this issue will be presented at the 50th International Conference on Very Large Data Bases, Guangzhou, China, 2024.<p>And that's because in the submission guidelines [1],<p>> The last three revision deadlines will be May 15, June 1, and July 15, 2023. Note that the June deadline is on the 1st instead of the 15th, and it is the final revision deadline for consideration to present at VLDB 2023; submissions received after this deadline will roll over to VLDB 2024.<p>So whether it is (2023) or (2024) is a little ambiguous.<p>[0] <a href="https://www.vldb.org/pvldb/vol17/FrontMatterVol17No2.pdf" rel="nofollow">https://www.vldb.org/pvldb/vol17/FrontMatterVol17No2.pdf</a><p>[1] <a href="https://vldb.org/pvldb/volumes/16/submission" rel="nofollow">https://vldb.org/pvldb/volumes/16/submission</a></p>
]]></description><pubDate>Thu, 16 May 2024 05:13:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=40375403</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=40375403</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40375403</guid></item><item><title><![CDATA[New comment by lmwnshn in "Tax prep companies: $90M lobbying against free tax-filing"]]></title><description><![CDATA[
<p>For an eh in the other direction: I overpaid PA state taxes in 2020 by a decent chunk. The last time I called, they said that they're still processing amended returns from 2019 (which you can verify by going to their "Where's my refund" page and looking at the year dropdown).</p>
]]></description><pubDate>Sun, 03 Sep 2023 03:37:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=37367509</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=37367509</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37367509</guid></item><item><title><![CDATA[New comment by lmwnshn in "Database Gyms [pdf]"]]></title><description><![CDATA[
<p>[first author here] I'm not sure why this is on the front page. Speaking only on my own behalf, I like to think of this as a paper that's motivated by problems that I kept running into while re-implementing papers related to self-driving database systems [0] research.<p>My TLDR would be: existing research has focused on trying to develop better models of database system behavior, but look at recent trends in modeling. Transformers, foundation models, AutoML -- modeling is increasingly "solved", as long as you have the right training data. Training data is the bottleneck now. How can we optimize the training data collection pipeline? Can we engineer training data that generalizes better? What opportunities arise when you control the entire pipeline?<p>Elaborating on that, I think you can abstract existing training data collection pipelines into these four modules:<p>- [Synthesizer]: The field has standardized on the use of various synthetic workloads (e.g., TPC-C, TPC-H, DSB) and common workload trace formats for real-world workloads (e.g., postgres_log, MySQL general query log). Research on workload forecasting and dataset scaling exists. In 2023, why can't I say "assuming trends hold, show me what my workload and database state will look like 3 months from now"?<p>- [Trainer]: Given a workload and state (e.g., from the Synthesizer), existing research executes the workload on the state to produce training data. But executing workloads in real-time kind of sucks. Maybe you have a workload trace that's one month long, well, I don't want to wait one month for training data. But I can't just smash all the queries together either, that wouldn't be representative of actual deployment conditions. So right now, I'm intrigued by the idea of executing workloads in faster than real-time. Think of a fast-forward button on physics simulators, where you can reduce simulation fidelity in exchange for speed. Can we do that for databases? I'm also interested in playing tricks to help the training data generalize across different hardware, and in general, there seems to be a lot of unexplored opportunity here. Actively working on this!<p>- [Planner]: Given the training data (e.g., from the Trainer) and an objective function (e.g., latency, throughput), you might consider a set of tuning actions that improve the objective (e.g., build some indexes, change some knob settings). But how should you represent these actions? For example, a number of papers one-hot encode the possible set of indexes, but (1) you cannot actually do this in practice, there are too many indexes, and (2) you lose the notion of "distance" between your actions (e.g., indexes on the same table should probably be considered "related" in some way). Our research group is currently exploring some ideas here.<p>- [Decider]: Finally, once you're done applying all this domain-specific stuff to encode the states and actions, you're solidly in the realm of "learning to pick the best action" and can probably hand it off to a ML library. Why reinvent the wheel? :P That said, you can still do interesting work here (e.g., UDO is intelligent about batched action evaluation), but it's not something that I'm currently that interested in (relative to the other stuff above, which is more of an uncharted territory).<p>If anyone is at SIGMOD this week, I'm happy to chat! :)<p>[0] <a href="https://db.cs.cmu.edu/papers/2017/p42-pavlo-cidr17.pdf" rel="nofollow noreferrer">https://db.cs.cmu.edu/papers/2017/p42-pavlo-cidr17.pdf</a></p>
]]></description><pubDate>Mon, 19 Jun 2023 17:06:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=36393573</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=36393573</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36393573</guid></item><item><title><![CDATA[New comment by lmwnshn in "Building a new database management system in academia (2017)"]]></title><description><![CDATA[
<p>You may be interested in DuckDB's CIDR talk on the little miracles that made it possible. [0]<p>[0] <a href="https://twitter.com/motherduck/status/1615487300523429889" rel="nofollow noreferrer">https://twitter.com/motherduck/status/1615487300523429889</a></p>
]]></description><pubDate>Fri, 16 Jun 2023 20:08:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=36363096</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=36363096</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36363096</guid></item><item><title><![CDATA[New comment by lmwnshn in "Everything you always wanted to know about mathematics (2013) [pdf]"]]></title><description><![CDATA[
<p>My link replaces; we did not use OP's book when I took the course.<p>That said, OP's book looks more conversational in tone, which I personally have a slight preference for.</p>
]]></description><pubDate>Thu, 25 May 2023 14:13:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=36070985</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=36070985</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36070985</guid></item><item><title><![CDATA[New comment by lmwnshn in "Everything you always wanted to know about mathematics (2013) [pdf]"]]></title><description><![CDATA[
<p>Judging by the URL, this book was used for CMU's 15-151 / 21-128, which is a first-semester course for CS and math undergrads. Nowadays, the course uses [0].<p>[0] <a href="https://infinitedescent.xyz/" rel="nofollow">https://infinitedescent.xyz/</a></p>
]]></description><pubDate>Thu, 25 May 2023 13:16:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=36070342</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=36070342</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36070342</guid></item><item><title><![CDATA[New comment by lmwnshn in "The part of Postgres we hate the most: Multi-version concurrency control"]]></title><description><![CDATA[
<p>You can do the projects (the autograder is public) and join a discord community of non-CMU people that are following along too! e.g., [0] for Fall 2022.<p>[0] <a href="https://15445.courses.cs.cmu.edu/fall2022/faq.html#q8" rel="nofollow">https://15445.courses.cs.cmu.edu/fall2022/faq.html#q8</a></p>
]]></description><pubDate>Sun, 30 Apr 2023 21:16:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=35766700</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=35766700</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=35766700</guid></item><item><title><![CDATA[New comment by lmwnshn in "Why do older grad students become bitter?"]]></title><description><![CDATA[
<p>(for CS) You can find more numbers from Jeff Huang's Computer Science Open Data, which posts verified stipends: [0]<p>[0] <a href="https://jeffhuang.com/computer-science-open-data/#verified-computer-science-phd-stipends" rel="nofollow">https://jeffhuang.com/computer-science-open-data/#verified-c...</a></p>
]]></description><pubDate>Fri, 17 Mar 2023 12:13:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=35196018</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=35196018</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=35196018</guid></item><item><title><![CDATA[New comment by lmwnshn in "Ask HN: Which MOOCs in Math/CS are worth still worth taking in 2022?"]]></title><description><![CDATA[
<p><a href="https://15445.courses.cs.cmu.edu/fall2022/faq.html#q7" rel="nofollow">https://15445.courses.cs.cmu.edu/fall2022/faq.html#q7</a></p>
]]></description><pubDate>Tue, 30 Aug 2022 16:28:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=32652243</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=32652243</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=32652243</guid></item><item><title><![CDATA[New comment by lmwnshn in "Notes on Theory of Distributed Systems [pdf]"]]></title><description><![CDATA[
<p>More entertainment than how-to guide, and oriented more towards developers than ops, but if you haven't read "Scalability! But at what COST?" [0], I think you'll enjoy it.<p>[0] <a href="https://www.frankmcsherry.org/graph/scalability/cost/2015/01/15/COST.html" rel="nofollow">https://www.frankmcsherry.org/graph/scalability/cost/2015/01...</a></p>
]]></description><pubDate>Wed, 24 Aug 2022 22:03:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=32586374</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=32586374</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=32586374</guid></item><item><title><![CDATA[New comment by lmwnshn in "Does my data fit in RAM?"]]></title><description><![CDATA[
<p>To add to this thread, some people have done this exploration before, see slides 11 and 20 of [0] or Figure 1 of [1]. Could you just throw more RAM at your problems in a disk-backed system? In practice, probably. But there are distinct advantages to designing upfront for an in-memory scenario.<p>[0] <a href="https://15721.courses.cs.cmu.edu/spring2020/slides/02-inmemory.pdf" rel="nofollow">https://15721.courses.cs.cmu.edu/spring2020/slides/02-inmemo...</a><p>[1] <a href="https://15721.courses.cs.cmu.edu/spring2020/papers/02-inmemory/hstore-lookingglass.pdf" rel="nofollow">https://15721.courses.cs.cmu.edu/spring2020/papers/02-inmemo...</a></p>
]]></description><pubDate>Wed, 03 Aug 2022 00:20:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=32326112</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=32326112</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=32326112</guid></item><item><title><![CDATA[New comment by lmwnshn in "TerraUSD crash led to vanished savings, shattered dreams"]]></title><description><![CDATA[
<p>I think you're thinking of a ROSCA [0], e.g., from Poor Economics [1],<p>> In Africa, the most popular instruments are rotating savings and credit associations (ROSCAs) - more commonly known as "merry-go-rounds" in English-speaking Africa and as tontines in Francophone countries. ROSCA members meet at regular intervals, and all deposit the same amount of money into a common pot at every meeting. Each time, on a rotating basis, one member gets the whole pot.<p>[0] <a href="https://en.wikipedia.org/wiki/Rotating_savings_and_credit_association" rel="nofollow">https://en.wikipedia.org/wiki/Rotating_savings_and_credit_as...</a><p>[1] <a href="https://en.wikipedia.org/wiki/Poor_Economics" rel="nofollow">https://en.wikipedia.org/wiki/Poor_Economics</a></p>
]]></description><pubDate>Wed, 22 Jun 2022 05:18:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=31832316</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=31832316</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=31832316</guid></item><item><title><![CDATA[New comment by lmwnshn in "AlloyDB for PostgreSQL under the hood: Columnar engine"]]></title><description><![CDATA[
<p>Supposedly, it is significantly slower than SingleStore on various TPC-H SF-10 queries [0].<p>[0] <a href="https://twitter.com/DomenicRavita/status/1529963959465435154" rel="nofollow">https://twitter.com/DomenicRavita/status/1529963959465435154</a></p>
]]></description><pubDate>Fri, 27 May 2022 12:32:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=31528802</link><dc:creator>lmwnshn</dc:creator><comments>https://news.ycombinator.com/item?id=31528802</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=31528802</guid></item></channel></rss>