Aerospike (database)

Aerospike Database is a flash memory and in-memory open source distributed key value NoSQL database management system, marketed by the company also named Aerospike. Aerospike was first known as Citrusleaf. In August 2012, the company - which had been providing its database since 2010 - rebranded both the company and software name to Aerospike. The name "Aerospike" is derived from the aerospike engine, a type of rocket nozzle that is able to maintain its output efficiency over a large range of altitudes, and is intended to refer to the software's ability to scale up. In 2012, Aerospike acquired AlchemyDB, and integrated the two databases' functions, including the addition of a relational data management system. On June 24, 2014, Aerospike was opensourced under the AGPL 3.0 license for the Aerospike database server and the Apache License Version 2.0 for its Aerospike client software development kit. Aerospike Database is modeled under the shared-nothing architecture and written in C. It operates in three layers: a data storage layer, a self-managed distribution layer, and a cluster-aware client layer. Aerospike uses hybrid memory architecture: the database indices are stored fully in main random-access memory, while the data is stored on a persistent device using the data layer. The data layer stores the data in solid-state drive, NVMe or Persistent memory. Reading the data is done using a direct access to the record position on disk using a direct pointer from the primary index, and data writes are optimized through large block writes to reduce latency. This architecture to fetch all records from the persistent device and void the use of data cache. Aerospike also provides the ability to store the data fully in RAM, thus acting as an in-memory database. In that case, data would be persisted to either SSD, NVMe, PMEM or traditional rotational media. Aerospike provides single-record ACID transactions. The distribution layer is responsible to replicate the data across nodes to ensure the durability and immediate consistency properties of the transaction.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (5)

Related people (3)

Related concepts (2)

Related courses (1)

Related lectures (9)

Flash-aware Database Transactions

Radu Ioan Stoica

Over the past 40 years, hard disks, the traditional building block of storage systems, have become increasingly slower when compared to the other system components such as the main memory and the CPU. Hard disks face mechanical constraints that cause their ...

EPFL2014

Forensic automatic speaker recognition using Bayesian interpretation and statistical compensation for mismatched conditions

Nowadays, state-of-the-art automatic speaker recognition systems show very good performance in discriminating between voices of speakers under controlled recording conditions. However, the conditions in which recordings are made in investigative activities ...

EPFL2005

The Database State Machine Approach

Rachid Guerraoui, André Schiper, Fernando Pedone

Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transactional mechanisms, such as atomic commitment. We present the Database State Mac ...

2003

ME-373: Finite element modelling and simulation

L'objectif de ce cours est d'apprendre à réaliser de manière rigoureuse et critique des analyses par éléments finis de problèmes concrets en mécanique des solides à l'aide d'un logiciel CAE moderne.

Key–value database

A key–value database, or key–value store, is a data storage paradigm designed for storing, retrieving, and managing associative arrays, and a data structure more commonly known today as a dictionary or hash table. Dictionaries contain a collection of objects, or records, which in turn have many different fields within them, each containing data. These records are stored and retrieved using a key that uniquely identifies the record, and is used to find the data within the database.

NoSQL

A NoSQL (originally referring to "non-SQL" or "non-relational") database provides a mechanism for storage and retrieval of data that is modeled in means other than the tabular relations used in relational databases. Such databases have existed since the late 1960s, but the name "NoSQL" was only coined in the early 21st century, triggered by the needs of Web 2.0 companies. NoSQL databases are increasingly used in big data and real-time web applications.

Finite Element Outputs ME-373: Finite element modelling and simulation

Covers the visualization and post-processing of finite element outputs in Abaqus/CAE 6.14-1, including stress extrapolation, averaging, and 3D field visualization.

Relational Databases: Fundamentals MOOC: Introduction to Geographic Information Systems (part 1)

Covers relational and spatial databases, including storage, management systems, ACID properties, historical typologies, primary and foreign keys, and spatial functions.

NoSQL Databases: Origins and Types MOOC: Geographical Information Systems 1

Covers the origins and types of NoSQL databases, focusing on MongoDB and CRUD operations.