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 | 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, for..."
Read more » Building extendible hash leaf page
Ayende @ Rahien | 18 Nov 2019 12:00
Oren Eini writes "....I’m continuing to explore the use of extendible hashing and I run into an interesting scenario. The whole point of using a hash table is to reduce the cost of lookups to O(1). When using persistent data structures, the usual cost that we care about..."
Read more » Optimizing access patterns for extendible hashing
Ayende @ Rahien | 15 Nov 2019 12:00
Oren Eini writes "....After my post yesterday, I dug a lot deeper into extendible hashing. There is a wealth of information on the topic. What is more interesting, from my point of view, is just how freaking elegant this data structure is.I spent a few hours implementing..."
Read more » Digging into extendible hashing
Ayende @ Rahien | 14 Nov 2019 12:00
Oren Eini writes "....There is a specific scenario that I run into that could be really helped by an O(1) lookup cost on a disk persistent data structure. Voron, our storage engine library, is built on top of a whole big pile of B+Trees, which has an O(logN) lookup cost...."
Read more » Researching a disk based hash table
Ayende @ Rahien | 12 Nov 2019 12:00
Oren Eini writes "....I run into this blog post talking about how to handle optimistic concurrency in MongoDB and it brought to mind a very fundamental difference in the design philosophy between RavenDB and MongoDB. If you’ll read the associated blog post, you’ll see..."
Read more » re: Document-Level Optimistic Concurrency in MongoDB
Ayende @ Rahien | 11 Nov 2019 12:00
Oren Eini writes "....A couple of weeks ago I started to talk about the implementation details of building a persistent data structure in RavenDB. As it turns out, I had some evenings available and I was able to sit down and actually write out the code for it. The..."
Read more » Voron’s Roaring Set: Part II–Implementation
Ayende @ Rahien | 07 Nov 2019 12:00
Oren Eini writes "....Trevor asked a really interesting question in the mailing list. Assume that we have the following model:And what we want to do is to be able to add a note to a book. The API looks like so:public void SubmitNote(string isbn, string note);The..."
Read more » Upsert patching in RavenDB
Ayende @ Rahien | 06 Nov 2019 12:00
Oren Eini writes "....After build an R client for RavenDB, I decided to see what it would take to build a basic RavenDB client for PHP in the same manner. It turned out to be fairly simple, and you can find the relevant code here.Here are some basic CRUD operations:As..."
Read more » Using RavenDB in PHP
Ayende @ Rahien | 05 Nov 2019 12:00
Oren Eini writes "....I was reminded recently that the RavenDB documentation aren’t putting enough emphasis on the fact that RavenDB can run as an in memory database. In fact, topologies that other databases seem to think are fancy are trivial in RavenDB. You..."
Read more » The futility of using RavenDB as an in memory database
Ayende @ Rahien | 04 Nov 2019 12:00
Oren Eini writes "....R is a popular environment for working with data, mostly for statistical analysis and exploration. It is widely used by data scientists, statistician and people who get a pile of data and need to figure out how to get something out of it.RavenDB..."
Read more » Accessing RavenDB data from R
