<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: defufna</title><link>https://news.ycombinator.com/user?id=defufna</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 08 Apr 2026 12:55:03 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=defufna" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Show HN: VeloxDB Fast Object oriented DB for C#]]></title><description><![CDATA[
<p>This is a project I have been working on with some friends for some time. We left our jobs in March to pursue it full-time, and now we have something to show.<p>We built a database called VeloxDB (Velox means speed in Latin). VeloxDB is a fast, object-oriented, in-memory database for C# with an emphasis on correctness.<p>Let me give a quick breakdown of all the terms involved:<p>• "Fast": The whole database is built with performance in mind. We achieve 2.5 million ACID write transactions with an AWS c6a.8xlarge compute instance.<p>• "Object-oriented": The DB offers an object-oriented interface, giving you an ORM-like experience. Your code is deployed within the database, reducing the overhead of communicating with the database to a minimum.<p>• "In-memory": The entire dataset has to fit in memory, so if you have a 30GB database, you need 30GB of RAM. The data is still persisted on disk, so there is no data loss if the server crashes.<p>• "For C#": The ORM API is primarily designed for C#, although it should work with any .NET language (F#/VB).<p>• "Emphasis on correctness": The database is fully ACID, with no eventual consistency.<p>The database is still in beta phase, and any feedback is very welcome! The source can be found at <a href="https://github.com/VeloxDB/VeloxDB">https://github.com/VeloxDB/VeloxDB</a>.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=34398514">https://news.ycombinator.com/item?id=34398514</a></p>
<p>Points: 4</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 16 Jan 2023 09:02:50 +0000</pubDate><link>https://vlxdb.com/</link><dc:creator>defufna</dc:creator><comments>https://news.ycombinator.com/item?id=34398514</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=34398514</guid></item><item><title><![CDATA[VeloxDB – fast Object oriented database for .NET]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.vlxdb.com/">https://www.vlxdb.com/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=34275281">https://news.ycombinator.com/item?id=34275281</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 06 Jan 2023 14:57:01 +0000</pubDate><link>https://www.vlxdb.com/</link><dc:creator>defufna</dc:creator><comments>https://news.ycombinator.com/item?id=34275281</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=34275281</guid></item><item><title><![CDATA[New comment by defufna in "A Kernel Engineer at Microsoft's Answer to “What Do You Think about ReactOS?”"]]></title><description><![CDATA[
<p>Your interview analogy is a bad one. Because they are not trying to make their solutions as similar as possible to each other.<p>If you had interviewee A write some piece of code, and then said to interviewee B "I want you to solve this problem as close as possible as the person before you did it, here is their executable", you'd be quite surprised what they could do. Especially if interviewee B is Alex Ionescu.</p>
]]></description><pubDate>Thu, 04 Jul 2019 09:13:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=20352925</link><dc:creator>defufna</dc:creator><comments>https://news.ycombinator.com/item?id=20352925</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=20352925</guid></item></channel></rss>