
Online graph analytics and large-scale interactive applications such as social media networks require low-latency data access to billions of small data objects. As a consequence, more and more distributed in-memory systems are proposed allowing to keep all data always in memory. However, these systems also need fault-tolerance mechanisms to mask node failures and power outages. We propose a novel two-level logging architecture with backup-side version control combining faulttolerance with a high throughput when working with many small data objects while having a minimal memory overhead. In order to prevent unlimited growth of logs we use a highly concurrent log cleaning approach. All proposed concepts have been implemented within the DXRAM system and evaluated using the Yahoo! Cloud Serving Benchmark and RAMCloud's Log Cleaner benchmark. The experiments show that our solution has less memory overhead and outperforms state-of-the-art inmemory systems like RAMCloud, Redis, and Aerospike, for the target application domains.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
