Performance needs of many database applications dictate that the entire database be stored in main memory. The Dali system is a main memory storage manager designed to provide the persistence, availability and safety guarantees one typically expects from a diskresident database, while at the same time providing very high performance by virtue of being tuned to support in-memory data. Dali follo...

This paper presents a simple and effective method to reduce the size of log data for recovery in main memory databases. Fuzzy checkpointing is known to be very efficient in main memory databases due to asynchronous backup activities. By this feature, most recovery works in the past have used only physical logging schemes. Since the size of physical log records is quite large, physical logging s...

We present a detail performance study of three main memory recovery algorithms: Levy and Silberschatz's Log-Driven Backups, Jagadish, Silberschatz and Sudarshan's Recovery from Main Memory Lapses, and Kumar's Partial Recovery through simulation modeling. Our results show that load balancing signiicantly aaects the performance, and group commit is an eeective way to reduce disk I/O operations in...

Multi-tenant main memory index is an important tool to accelerate data access to software as a service. Establishing main memory indexes for each tenant occupies lots of memory space and results in performance bottleneck. The data schemas and access patterns of different tenants are similar, which provides the conditions for tenants storing their index entries with shared structure in main memo...

Although the distributed database systems has been studyed for a long time, there has been only few commercial systems available. The main reason for this is that the distributed commit processing costs too much which results in little or no performance gain compared with single node database system. In this paper, we note the diierence in the update and logging policy between disk based databa...

Management of graph-shaped data gained a momentum to both industry and research. Traversal queries through a graph-shaped dataset are easy to express, and can be efficiently executed using graph databases. High-performance traversals through graphshaped data is claimed to be enabled by native graph storage (i.e., encoding data using graph data structures), and native graph processing (i.e., ope...

The engineering of large software systems is greatly simplified if individual modules can be constructed separately and later linked together. This also permits the reuse of modules developed previously, and the use of libraries and other modules built by others, thus reducing the total software development cost. To facilitate the necessary cooperation, a flexible linking mechanism should be pr...

The continuous increase in compute speed and main-memory capacity of modern servers triggered the development of a new generation of in-memory database systems. These systems completely rewrote the traditional database architecture to use main memory as primary storage. Discarding several now obsolete abstractions of disk-based database systems enabled unprecedented query performance on a singl...

We study indexing techniques for main memory, including hash indexes, binary search trees, T-trees, B+-trees, interpolation search, and binary search on arrays. In a decision-support context, our primary concerns are the lookup time, and the space occupied by the index structure. Our goal is to provide faster lookup times than binary search by paying attention to reference locality and cache be...

Dieser Beitrag beschreibt, wie durch den Einsatz von Fehlertoleranz Festplatten durch eine schnellere aber fehleranfälligere Technologie ersetzt werden können, um die Geschwindigkeit von Datenbanken in eventbasierten Systemen zu steigern. 1 Einführung und Grundlagen Während sich in den letzten Jahren die Speicherkapazität dramatisch erhöht hat, konnte die Zugriffszeit von Festplatten kaum verbe...