The Rebirth of the In-Memory Database

Trends in software tend to go in cycles. Ideas are reinvented with the wisdom of the past, reappearing youthful and rejuvenated in the context of a new era. Yet behind these evolving rhythms often lie the same fundamentals that have echoed through the software world since its formative years more than a quarter of a century ago. The fundamentals of software rarely change. When reinvention does arrive it comes from the context of the new era: the capabilities of our hardware and the types of problems we wish to solve. These are the variables that drive evolution.

After more than a quarter of a century of domination, the Internet era is changing our requirements and driving the reinvention of the traditional database. None of the fundamentals have changed of course; we just have more data, more users and, currently, a larger number of simpler, OLTP use-cases. As a result we’re more likely to forgo some degree of consistency to get what we want. Distribution is at the core of the technologies of the moment, with solutions architecting their way around the limitations of our hardware stack. But, almost in spite of this, hardware is changing and in some very significant ways. Terabyte memory architectures, solid-state drives and Phase-Change Memory are remoulding the hardware-landscape into one where address-spaces are both vast and durable.

Terabyte memory architectures, solid-state drives and Phase-Change Memory are remoulding the hardware-landscape into one where address-spaces are both vast and durable.

So my conjecture is this: whilst the disruption of late may have been lead by the ‘big-data’ driven, Internet behemoths, the next set of disruptive technologies may well come from OLAP space. Enterprise users’ need for fast analytical processing will drive the reinvention of in-memory databases: technologies that store data entirely within the address space, leveraging new physical storage mechanisms to provide far faster results to business queries whilst maintaining the degree of durability that we expect from traditional databases.

The argument for using in-memory solutions is simple: If data storage requirements can be constrained to a single address-space the complexity of the problem domain is dramatically reduced. The knowledge of any piece of data is microseconds, or even nanoseconds, away. There is no need to page information into and out of memory; it is all there at your fingertips, ready to be processed. Probably most dominant is the fact that the data structures used do not need to be optimised for disk. Disks being particularly tricky to design for due to the huge discrepency between their random and sequential performance.

Yet despite these advantages in-memory databases have had relatively limited market penetration. Oracle’s TimesTen is a good example, infiltrating only a limited number of specialist markets. This is likely due to the two fundamental issues with single machine, in-memory solutions. The lack of durability: what happens when you pull the plug and the ‘one more bit’ problem: what happens when your database becomes one bit larger than the memory on the on which it is running?

The last few years have seen the introduction of a group of distributed, in-memory products that improve on the standard in-memory database through the use of a Shared-Nothing architecture [13, 14]. Being distributed solves both the aforementioned problems: the ‘one more bit’ problem is solved by simply adding more machines, more partitions (shards) and implicitly more bits. Durability is also less of a concern as redundant copies of the data can be spread around the cluster making it far less sensitive to single machine failure. Data-caching products like Oracle Coherence have been doing this for some years. More recently we’re seeing fully blown ACID compliant software like the Stonebreaker-inspired VoltDB [3]: an in-memory, distributed database with both scalability and fault tolerance. SAP is also making significant inroads with Hana, their distributed in-memory database [5,6] (with one of the SAP founders, Hasso Plattner, explaining their vision in some detail in his book [7]). Finally Exasol has recently taken poll position in the TPC-H benchmarks with its lightning fast distributed in-memory database [16,17].

However the move to distribution comes with drawbacks: Like all Shared-Nothing solutions (including all the NoSQL ones) complex queries will always crosscut the partitioning strategy implying some form of distributed join. Cross-machine joins imply the shipping of data/keys across the network to facilitate the join’s computation. This is the Achilles Heal of the Shared Nothing architecture, although to be honest there are others. If complex query-patterns, with distributed joins are necessary, we’re thrown back down the road along which we came:- as with the case of the traditional database, we again need to mediate between different storage media – only this time the traditional disk is replaced by data in a different partition, on a different machine. This is alas somewhat akin to having remote data access again!

The point is that by distributing an in-memory database over a set of machines some imporntant problems are solved, but more are created. The simplest solution is to avoid the kind of queries that need cross-partition joins. This is the solution propagated by the NoSQL movement. Another method is to use a technique like the Connected Replication Pattern [9] to avoid key shipping. However ultimately there may be no need to do either.

Whilst increases in clock speed may have all but petered out, transistor density continues to increase exponentially in accordance with Moore’s Law. Processor power, memory and network speeds all show significant gains [1]. By comparison the data storage requirements for most enterprise databases are relatively small. 82% of databases were under 1TB in one relatively recent study [8] and increase relatively slowly at around 10% per annum [2], significantly less than rate of hardware progression. At the time of writing £20,000 will buy you a 40-core machine with 512GB of RAM and a 10GE network interface. The next few years should see machines with upward of a hundred cores, terabytes of RAM and 100GE connectivity in the ‘commodity space’. The implication is a world where the increasing capability of individual hardware units could overtake our need for physical resources, at least in OLAP and enterprise markets where databases are rarely more than a few terabytes.

However Moore’s Law is not the only catalyst of change. Solid-state media is encroaching on the performance of RAM. Fusion IO [10] – a performance leading SSD technology that uses PCI interface – supports read latency in the tens of microseconds and around 5Gb/s of throughput (although this is limited to about 1Gb/s from a single thread [11]). That’s still a couple of orders of magnitude slower than RAM but an order of magnitude faster than disk for sequential read and significantly more than that for random access [15]. Phase Change Memory [12], with an anticipated arrival date in 2015, is predicted to scrape another order of magnitude from this difference.

The problem is that current database technologies can’t take advantage of these fast media. A recent study by HP shows that, whilst FusionIO will provide up to three orders of magnitude better performance compared to disk for random read operations, performance on the standard TPC-H benchmark showed no visible improvement [15] (although other studies have shown marginal improvements [18]).

So what does all this mean? Firstly, it seems plausible that, ultimately, in-memory databases will replace disk-resident ones as the de facto standard. The advantages of knowing that all data is in memory are hard to understate. The need for intermediate results, and the temporary spaces to compose them, is hugely reduced as there is simply no need to mediate data between RAM and disk (or other media). Distribution will of course remain for large storage requirements, particularly in the short term, but the performance of a single address will likely prove compulsive to many enterprise users in the coming years. This has always been the sales pitch for Oracle’s Times Ten, but the key difference being its more general used as a bolt-on to an existing Oracle implementation. The next generation of solutions should be in-memory and stand-alone.

If this new class of solution does arrive it should also differentiate itself from its in-memory predesessors by the way it utilizes recent developments in fast-connected media such as FusionIO and Phase Change Memory (PCM), applying them to solve those two primary issues: ‘durability’ and the ‘one more bit’ problem. This is more than simply taking existing in-memory databases and adding flash-cards. Secondary storage may still be one or two orders of magnitude slower than RAM, but the traditional approach of paging data to and from disk via some in-memory user-space is far too inefficient and needs to be addressed. By re-architecting to take into consideration the different physical properties of solid-state media, in particular the hugely better performance for random access, we should see a different class of solution that is far more performant. This middle ground lies where data is primarily in memory and engineered to be durable through write-through and overflow into solid-state media. As technologies like PCM reduce the performance discrepancies between RAM and persistent storage this middle-ground approach will likely become more and more fruitful, maybe even bring with it a new era of database architecture.

Of course this is largely conjecture, but looking to the future it seems inevitable that the spinning magnetic disks we use today will seem as arcane to the engineer of the future as saving data to cassette seems today. Solid-state storage must ultimately prevail.

In memory databases are simply much faster. Hardware has progressed to the point that the typical enterprise database will fit in the memory of a well specified, commodity machine. With solid-state storage mitigating some of the previously prohibitive risks, in-memory (or at least single address-space) databases should become an increasingly compulsive option for enterprise users. The ease of selling a two order of magnitude performance improvement to an enterprise boardroom is self-evident and it is this that should drive the reinvention of this technology.


See Also:
A Case for Flash Memory SSD in Enterprise Database Applications:
Non-linear growth in biological databases:

Posted on August 14th, 2011 in Analysis and Opinion, Distributed Data Storage

  1. Alex Williams August 18th, 2011
    14:54 GMT

    Great post. A question came up today that perhaps you can help answer. We saw the proliferation of in-memory databases in the last few years. Now with SSDs going down in cost and more and more SSD storage coming into play, will in-memory databases in the enterprise side stay relevant or we will we be seeing a shift towards SSD based ones?

    From what I read here, it is evident that solid state will prevail but there is an issue with database technologies unable to handle the fast media from solutions such as Fusion-io. This means a middle ground is inevitable, potentially leading to a new database architecture. Is that correct? I am writing a blog post on this topic and your insights would be invaluable.

  2. ben August 18th, 2011
    16:38 GMT

    In short you are right but I’ll address both your questions in one:

    Memory is still a lot faster than SSD, even Fusion IO. Several orders of magnitude (and whilst theoretical throughputs are similar they are not comparable in practical applications). Connecting a traditional DB to SSD storage gives you little (as the refs above prove). They are simply not architected to take advantage of the technology.

    In memory databases should be able to make a comeback simply due to the large address-spaces we are seeing today. SSD provides the mechanism for getting around the problems that have hindered in-memory solutions to date.

    For better solutions a couple of likely options:
    – A new architecture could leverage RAM primarily with SSD providing the durability and some extensibility. This changes the architecture to a single address space one which is far simpler and faster. The key point is all data is in RAM.
    – A different new architecture could leverage SSD technology directly without getting caught up with problems of big user spaces etc that plague traditional disk based architectures, instead treating SSD as an extended address space. The key point here is that the data lives on SSD.

    I hope that helps. Ping with a link to your article when you publish it ok.

  3. Josh Strike August 30th, 2011
    18:08 GMT

    Join statements are the whole point of relational databases. And partitioning or sharding of some sort is critical to large-scale performance. NoSQL offers no answers, because you can accomplish the same thing using file locks on flat files held on some intermediary server with really fast access, but all the important work is going on in the software layer, so your bottleneck just moves one step closer to the user, with more risk of failure.

    The solution we’ve worked out for large-scale projects is to include two keys on every large table — one for partitioning, and another for indexing — which often share the same data. For example, the index field is a datetime and the partition field is a date with the same info. That way, you can structure queries in a way where the broader one triggers the partitions and the next triggers the index scan. This is especially great for dates, because even if your search area includes something that spans two partitions, you won’t scan all of them to get the indices you need to scan. I’m not sure why I haven’t seen anything, ever, about this strategy, but it does radically speed up full index scans on partitioned tables.

  4. Toby DiPasquale September 3rd, 2011
    17:06 GMT

    Great stuff! One note, though: Vertica has had this replicated-dimensions, partitioned-facts grid layout since the beginning. My question would be, how do you deal with dimensions that don’t fit into RAM? E.g. lets say you’re building a warehouse for click log analysis. How would you deal with a dimension of referrer domains or user IDs that could easily get into the millions of rows? Any ideas?

  5. ben September 4th, 2011
    13:05 GMT

    Hi Josh. That sounds like an interesting approach. Have you thought about writing it up?

  6. ben September 4th, 2011
    13:18 GMT

    Hi Toby

    Thanks for that. I know Greenplum do but I didn’t know Vertica did.

    The problem that you state is a very real problem for us (my project is a distributed, in memory data store) so we use this pattern termed Connected-Replication. I’m in the process of writing it up but have spoken about it before (see here). Basically we track what is connected (via foreign keys) and only replicate entities that are ‘used’.

    So in your example you may have millions of users but they are unlikely to all be actively related to Facts. If purchases are your Fact we would only replicate those users that had active purchases. If a user logs in and creates a new purchase then their user will be replicated. In this manner the amount of data we replicate is significantly smaller.

  7. Corinna January 28th, 2015
    17:18 GMT

    Great post!

    You are writing about the “rebirth of In-Memory Databases”.
    Therefore, I am interested in who designed or populated the first approach in this technology – there must be at least one in the past.

    I know this post is quite a few years old, but I am looking forward for your reply.

  8. ben January 28th, 2015
    20:38 GMT

    Hi Corinna, I’m not sure what the first in memory database was. Looking here it Kognito claims 1989 or maybe IBM’s TPF from 1979!

  9. Deepak Goswami June 5th, 2018
    3:37 GMT

    In-memory databases should be ideal in cases where the data does not change but response for a short-period needs to be very fast. In a scenario like web-publication of examination results, this should be ideal. Here the durability is not an issue as the data has already been entered and available on hard-disk. It can be read initially to populate the in-memory database and then it will proceed.

  10. ✅ Withdrawing 54 801 US dollars. GЕТ >>> ✅ April 5th, 2024
    4:28 GMT


Have your say

XHTML: You can use these tags: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>

Safari hates me
IMPORTANT! To be able to proceed, you need to solve the following simple problem (so we know that you are a human) :-)

Add the numbers ( 3 + 4 ) and SUBTRACT two ?
Please leave these two fields as-is:

Talks (View on YouTube)