Oren Eini
Oren Eini is a senior developer / architect, focusing on architecture, data access and best practices. Most often, he is working on building complex business systems using .Net 2.0, NHibernate and Castle's Frameworks, providing training and guidance for the use of Object Relational Mapping, Inversion of Control, Domain Driven Design and other exciting topics. Oren is an active member in several leading Open Source projects, including (but not limited :-) ) NHibernate, Castle and Rhino Mocks.
Ayende @ Rahien | 12 Dec 2019 12:00
Oren Eini writes "....A common question I field on many customer inquiries is comparing RavenDB to one relational database or another. Recently we got a whole spate of questions on RavenDB vs. PostgreSQL and I though that it might be easier to just post about it here..."
Read more » Notes on RavenDB vs. PostgreSQL
Ayende @ Rahien | 06 Dec 2019 12:00
Oren Eini writes "....After a long journey, I have an actual data structure implemented. I only lightly tested it, and didn’t really do too much with it. In fact, as it current stands, I didn’t even implement a way to delete the table. I relied on closing the process to..."
Read more » Extendible hash table–Destruction
Ayende @ Rahien | 05 Dec 2019 12:00
Oren Eini writes "....The naïve overflow handling I wrote previously kept me up at night. I really don’t like it. I finally figured out what I could do to handle this in an elegant fashion.The idea is to:Find the furthest non overflow piece from the current one.Read its..."
Read more » Extendible hash table–Deletion II
Ayende @ Rahien | 04 Dec 2019 12:00
Oren Eini writes "....In the world of design (be it software or otherwise), being able to make assumptions is a good thing. If I can’t assume something, I have to handle it. For example, if I can assume a competent administrator, I don’t need to write code to handle a..."
Read more » Making assumptions, design decisions and critical functionality
Ayende @ Rahien | 03 Dec 2019 12:00
Oren Eini writes "....Building data structures is fun, until you need to actually implement all the non core stuff. In the previous post, we covered iteration, but now we have to deal with the most annoying of features, deletions. In some data structures, implementing..."
Read more » Extendible hash table–Deletion I
Ayende @ Rahien | 02 Dec 2019 12:00
Oren Eini writes "....I run perf tests and memory utilization tests on my implementation and finally got it to the right place. But the API I have is pretty poor. I can put a key and value, or get the value by key. But we probably want a few more features.I changed the..."
Read more » Extendible hash table–iteration
Ayende @ Rahien | 29 Nov 2019 12:00
Oren Eini writes "....I did a video cast when Chen a few weeks ago. I think it went quite well.Oren shares his story on how he taught himself how to code in "Prison" and became an open-source developer, coding a prison management system and how he founded Hibernating..."
Read more » Chen Ravid and Oren Eini - Value Open Source Videocast
Ayende @ Rahien | 28 Nov 2019 12:00
Oren Eini writes "....In the previous post, I wrote about how I changed the structure of the hash leaf page to increase data density. I managed to get it down to 32MB range when I’m using random keys. That is a pretty great number, for memory usage, but what is the cost..."
Read more » Building extendible hash leaf page–Part III, optimization phase
Ayende @ Rahien | 27 Nov 2019 12:00
Oren Eini writes "....I wrote before about an idea for designing the leaf page of an extendible hash page. The idea was to arrange things on a cache line size, which would reduce how much we’ll need to search inside the page. On the other hand, it means that we might..."
Read more » Building extendible hash leaf page–Part II
Ayende @ Rahien | 19 Nov 2019 12:00
Oren Eini writes "....An extendible hash is composed of a directory section, which point to leaf pages, and the leaf pages, where the actual data resides.
My current implementation is incredibly naïve, though. The leaf page has an array of records (two int64 values,..."
Read more » Building extendible hash leaf page
