Skip to search formSkip to main contentSkip to account menu

LevelDB

LevelDB is an open source on-disk key-value store written by Google fellows Jeffrey Dean and Sanjay Ghemawat. Inspired by Bigtable, LevelDB is hosted… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
AndroidBerkeley DBBitcoinC++

Broader (1)

NoSQL

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
GRuB: Gas-Efficient Blockchain Storage via Workload-Adaptive Data Replication
Modern Blockchains support the execution of user programs, called smart contracts. As a trusted computing platform, smart… 
2017
2017
Kinetic Action : Micro and Macro Benchmark-based Performance Analysis of Kinetic Drives Against LevelDB-based Servers
  • 2017
  • Corpus ID: 37431448
There is an unprecedented growth in the amount of unstructured data. Therefore, key-value object storage is becoming extremely… 
2016
2016
Aergia : Haskell Distributed In-Memory Key-Value Store
Distributed database systems have become increasingly popular in the past years and are used widely throughout the information… 
2016
2016
NVHT: An Efficient Key-Value Storage Library for Non-Volatile Memory
Modern Non-Volatile Memory (NVM) promises persistence, byte-addressability and DRAM-like read and write latency, which offers… 
2016
2016
Re-enabling high-speed caching for LSM-trees
LSM-tree has been widely used in cloud computing systems by Google, Facebook, and Amazon, to achieve high performance for write… 
2015
2015
MemcacheDB persistent implementation using LevelDB
Memcached is a data caching system which well known as in-memory database that provide faster data access compare with on-disk… 
2015
2015
Reducing Disk Storage with SQLite into BitCoin Architecture
For the past five years, the bitcoin network constantly experience a growth in its size as more communities turn to accept the… 
2014
2014
A Log-Structured File System Based on LevelDB
Traditional file systems have some shortages in storing small files, such as randomness of data layout, waste of disk space and… 
2012
2012
Persistence and Node FailureRecovery in Strongly Consistent Key-Value Datastore
Consistency preservation of replicated data is a critical aspect for distributed databaseswhich are strongly consistent. Further… 
2012
2012
O2-Tree: A Fast Memory Resident Index for NoSQL Data-Store
Modern computer architecture with 64-bit addressing has now become commonplace. The consequence is that sufficiently large… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)