<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: flyingsilverfin</title><link>https://news.ycombinator.com/user?id=flyingsilverfin</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Tue, 07 Apr 2026 10:28:22 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=flyingsilverfin" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by flyingsilverfin in "Grafeo – A fast, lean, embeddable graph database built in Rust"]]></title><description><![CDATA[
<p>I run the development of TypeDB, which doesnt use Cypher but works really well as a graph database. Certainly it, and other graph databases like neo4j, are used in production at scale. However, a lot of oss databases are open core on some level, it just depends on where they draw the line. We draw it at clustering/high availability for the time being, the rest is in the CE version.</p>
]]></description><pubDate>Sun, 22 Mar 2026 07:33:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=47475283</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=47475283</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47475283</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Show HN: TypeDB Studio's AI agent for schema exploration and query generation"]]></title><description><![CDATA[
<p>Hi HN, I'm CTO at TypeDB. We shipped an agent mode in our web Studio that lets you describe what you want in plain English and get executable database queries back. The blog calls it "vibe querying," which is a little tongue-in-cheek, but the workflow is what you expect: ask a question, get TypeQL, run it, iterate.<p>TypeDB's data model has a strict schema, higher-level abstractions (role-based interfaces, subtyping & inheritance), and hypergraph structures (n-ary relations & relations in relations) built in. This combination enables better AI query generation.<p>It's like giving the LLM a strongly typed language instead of a loosely typed one. With a relational db, the model has to infer relationships from foreign keys and naming conventions. With graph databases, there's no enforced schema. In TypeDB, the schema says "friendship is a relation with two friends, each played by a person" — the LLM gets a constraint space to navigate rather than guess at. It still gets things wrong — the post shows a syntax error it had to recover from — but the error surface is smaller and more correctable.<p>Would love to hear your thoughts. Happy to answer anything about TypeDB as well!</p>
]]></description><pubDate>Wed, 25 Feb 2026 18:38:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=47155768</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=47155768</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47155768</guid></item><item><title><![CDATA[Show HN: TypeDB Studio's AI agent for schema exploration and query generation]]></title><description><![CDATA[
<p>Article URL: <a href="https://typedb.com/blog/vibe-querying-with-typedb-studio">https://typedb.com/blog/vibe-querying-with-typedb-studio</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47155752">https://news.ycombinator.com/item?id=47155752</a></p>
<p>Points: 4</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 25 Feb 2026 18:37:51 +0000</pubDate><link>https://typedb.com/blog/vibe-querying-with-typedb-studio</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=47155752</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47155752</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Why don't you use dependent types?"]]></title><description><![CDATA[
<p>Just spotted this! We (I'm CTO at TypeDB) just released some early benchmarks: <a href="https://typedb.com/blog/first-look-at-typedb-3-benchmarks/" rel="nofollow">https://typedb.com/blog/first-look-at-typedb-3-benchmarks/</a></p>
]]></description><pubDate>Wed, 05 Nov 2025 04:51:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=45819267</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=45819267</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45819267</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Making database systems usable"]]></title><description><![CDATA[
<p>I wanted to jump in here and say that what we're working on at typedb.com, in our 3.0 version (coming soon in alpha!), is that we're taking our earlier database query language and making it much more Programming-like: functions, errors containing stack traces, more sophisticated type inference, queries as streams/pipelines... I think it's super exciting and has a huge horizon for where it could go by meshing more ideas from PL design :)<p>Incidentally I think it also addresses what a lot of the comments here are talking about: not learning JOINs, indexing, build-in relation cardinality constraints, etc, but that's a separate point!</p>
]]></description><pubDate>Wed, 21 Aug 2024 21:03:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=41314172</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=41314172</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41314172</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "How to implement dependent type theory I (2012)"]]></title><description><![CDATA[
<p>We've started to formalise TypeQL (TypeDB's query language) using dependent type theory, which fit together very nicely. Interestingly, the formalisation shows us how to consistently and safely extend the language with new structures for higher levels of expressivity, which is a huge benefit of type theoretic formalisms of production languages IMO.</p>
]]></description><pubDate>Thu, 15 Jun 2023 08:22:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=36337755</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=36337755</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36337755</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Introduction to Datalog"]]></title><description><![CDATA[
<p>I work on TypeDB (<a href="https://vaticle.com/typedb" rel="nofollow">https://vaticle.com/typedb</a>), and it sits somewhere at this intersection. The exposed query language has elements of both logic programming constructs and graph-like structures. Both amount to a kind of "constraint" programming.</p>
]]></description><pubDate>Wed, 15 Feb 2023 13:41:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=34803631</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=34803631</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=34803631</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Reversing Lens-Induced Myopia (2018)"]]></title><description><![CDATA[
<p>I've had these for about 12 years, they don't get mentioned enough!<p>Downsides were that in the US there were expensive, and need proper daily cleaning, but the tradeoff is worth it - only need 1 pair per year - less waste too!<p>Going to get Lasik this year because they don't play nicely with travel in developing countries, but they were absolutely fantastic for school and university.</p>
]]></description><pubDate>Fri, 13 May 2022 09:08:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=31365018</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=31365018</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=31365018</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Ask HN: Why are relational DBs are the standard instead of graph-based DBs?"]]></title><description><![CDATA[
<p>I think that you're correct in your assessment of relational vs graph-like structures: it's closer to our data domains we model and think of, more flexible, etc. We may be seeing something similar in the ML world where things are moving from tabular-dominant data to being able to process graphs more natively. A table is just a very structured graph after all!<p>SQL is the standard because, as others have pointed out, it's so entrenched and also builds upon a solid theoretical foundation. And given its dominance, it has been optimised and performed extremely well until recently, where data complexity is catching up again.<p>Recent noSQL databases won't take over SQL because of the lack of schema/typing. They do scale nicely, but aren't as constrainable as SQL, which is a feature (compare building a large software in Python vs Rust or Java) that enforces safety and good abstractions. There are some newer DBs which are combining strict schemas with NoSQL, which is promising!<p>Disclaimer: I work on TypeDB (vaticle.com/typedb) which is a native ERA (entity-relation-attribute) model with strict typing via the schema.</p>
]]></description><pubDate>Mon, 04 Oct 2021 09:47:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=28744841</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=28744841</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=28744841</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Ask HN: Why are relational DBs are the standard instead of graph-based DBs?"]]></title><description><![CDATA[
<p>Haha! I love reading comments like these - check out TypeDB (vaticle.com/typedb)<p>disclaimer: work there</p>
]]></description><pubDate>Mon, 04 Oct 2021 08:39:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=28744458</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=28744458</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=28744458</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Launch HN: Heimdal (YC S21) – Carbon neutral cement"]]></title><description><![CDATA[
<p>Same question! As I understand it:
CO2 pulled out of the ocean is replenished by atmospheric CO2, because limestone in the ocean dissolves too slowly to make up for the imbalance and it more readily comes in from the air.
But if that's true, then the calcium will actually not be replenished quickly in the ocean (not sure what the significance of this is)!
If it were true that the calcium is dissolved fast enough to replenish, then there must also be CO2 released from underwater limestone? Which means extracting Ca and CO2 will not remove any atmospheric CO2 really.<p>Alternatively, we do end up extracting Ca from the ocean that is not replenished (there's probably so much we don't care) and rely on the atmospheric CO2 to correct ph balance of the ocean?</p>
]]></description><pubDate>Mon, 02 Aug 2021 22:57:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=28043736</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=28043736</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=28043736</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "'Miraculous' mosquito hack cuts dengue by 77%"]]></title><description><![CDATA[
<p>Fantastic, thank you!</p>
]]></description><pubDate>Sun, 13 Jun 2021 11:09:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=27491578</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=27491578</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=27491578</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "'Miraculous' mosquito hack cuts dengue by 77%"]]></title><description><![CDATA[
<p>Hi yes please that would be amazing! Some of my family is in the US so it wouldn't be too hard to drop by on the way there :)</p>
]]></description><pubDate>Thu, 10 Jun 2021 20:39:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=27465487</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=27465487</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=27465487</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "'Miraculous' mosquito hack cuts dengue by 77%"]]></title><description><![CDATA[
<p>Hiya - I don't live in a dengue hotspot country but have had it (grandparent lives in a tropical country) and would like to get Dengvaxia to make it a bit less risky to go back... do you know if your country would allow flying in to get the vaccine? May I ask which country it is?<p>Thanks!!</p>
]]></description><pubDate>Thu, 10 Jun 2021 10:57:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=27459232</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=27459232</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=27459232</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Differential Datalog"]]></title><description><![CDATA[
<p>You're not wrong - the other big difference between datalog and prolog is that datalog is a subset of prolog's functionality that enables forward-chaining to be safe (gets trickier with negation for example). I was mostly referring to the fact that Graql implements datalog semantics/capabilities, plus negation - but the execution strategy is backward-chaining.</p>
]]></description><pubDate>Sat, 20 Mar 2021 23:44:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=26526935</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=26526935</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=26526935</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Differential Datalog"]]></title><description><![CDATA[
<p>We don't do this right now - optimising for incremental changes  is actually better done by maintaining forward-chaining inferences (like the OP) rather than backward chaining, and then invalidating and updating just the inferences that have modified dependencies.
Which you want depends on use case often: if you have often changing data backward chaining is generally better, but if it's largely static you can get large performance wins by materialising all the inferences, once, via forward-chaining.</p>
]]></description><pubDate>Sat, 20 Mar 2021 23:42:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=26526928</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=26526928</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=26526928</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Differential Datalog"]]></title><description><![CDATA[
<p>The company I work for, Grakn Labs (grakn.ai), builds a database that does datalog + negation type rules! You can add/remove data as you go, and also add/remove rules in the schema over time.
The terminology the post here uses is different from ours, but roughly we do "Backward-chaining", which starts from the query to the set of facts that are inserted, which the article calls "top-down".</p>
]]></description><pubDate>Sat, 20 Mar 2021 12:15:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=26522662</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=26522662</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=26522662</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Graph theory, graph convolutional networks, knowledge graphs"]]></title><description><![CDATA[
<p>It's always funny to see people mentioning hypergraphs in relation to knowledge graphs, this is exactly what we do at Grakn Labs (disclaimer: work there) <a href="https://grakn.ai" rel="nofollow">https://grakn.ai</a><p>For others: we're also starting to look into ML on knowledge graphs, check out our initial work at <a href="https://github.com/graknlabs/kglib" rel="nofollow">https://github.com/graknlabs/kglib</a> :D</p>
]]></description><pubDate>Mon, 08 Feb 2021 11:25:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=26063180</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=26063180</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=26063180</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "CRDTs are the future"]]></title><description><![CDATA[
<p>If you look into Bazel (build system), you start getting to the point where everything including dependencies, build system, and deployments can be defined as "source" code and ideally should be treated as a first class software</p>
]]></description><pubDate>Tue, 29 Sep 2020 19:39:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=24632011</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=24632011</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=24632011</guid></item><item><title><![CDATA[New comment by flyingsilverfin in "Why Nasa Converted Its Lessons-Learned Database into a Knowledge Graph"]]></title><description><![CDATA[
<p>Grakn (Grakn.ai) offers a strongly typed graph database that is open source :) (disclaimer: work there)</p>
]]></description><pubDate>Thu, 07 Feb 2019 13:54:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=19105189</link><dc:creator>flyingsilverfin</dc:creator><comments>https://news.ycombinator.com/item?id=19105189</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=19105189</guid></item></channel></rss>