Dash: Scalable hashing on persistent memory
Byte-addressable persistent memory (PM) brings hash tables the potential of low latency,
cheap persistence and instant recovery. The recent advent of Intel Optane DC Persistent …
cheap persistence and instant recovery. The recent advent of Intel Optane DC Persistent …
{Write-Optimized} and {High-Performance} hashing index scheme for persistent memory
Non-volatile memory (NVM) as persistent memory is expected to substitute or complement
DRAM in memory hierarchy, due to the strengths of non-volatility, high density, and near …
DRAM in memory hierarchy, due to the strengths of non-volatility, high density, and near …
Blurring the lines between blockchains and database systems: the case of hyperledger fabric
A Sharma, FM Schuhknecht, D Agrawal… - Proceedings of the 2019 …, 2019 - dl.acm.org
Within the last few years, a countless number of blockchain systems have emerged on the
market, each one claiming to revolutionize the way of distributed transaction processing in …
market, each one claiming to revolutionize the way of distributed transaction processing in …
One-sided {RDMA-Conscious} extendible hashing for disaggregated memory
Memory disaggregation is a promising technique in datacenters with the benefit of improving
resource utilization, failure isolation, and elasticity. Hashing indexes have been widely used …
resource utilization, failure isolation, and elasticity. Hashing indexes have been widely used …
Building a bw-tree takes more than just buzz words
In 2013, Microsoft Research proposed the Bw-Tree (humorously termed the" Buzz Word
Tree''), a lock-free index that provides high throughput for transactional database workloads …
Tree''), a lock-free index that provides high throughput for transactional database workloads …
[HTML][HTML] A prefetching indexing scheme for in-memory database systems
Q Zhang, H Song, K Zhou, J Wei, C Xiao - Future Generation Computer …, 2024 - Elsevier
In-memory databases (IMDBs) store all working data in the main memory, making memory
access the dominant factor in system performance. Moreover, for modern multi-version …
access the dominant factor in system performance. Moreover, for modern multi-version …
Aria: a fast and practical deterministic OLTP database
© 2020, VLDB Endowment. Deterministic databases are able to efficiently run transactions
across different replicas without coordination. However, existing state-of-the-art deterministic …
across different replicas without coordination. However, existing state-of-the-art deterministic …
Durable transactional memory can scale with timestone
Non-volatile main memory (NVMM) technologies promise byte addressability and near-
DRAM access that allows developers to build persistent applications with common load and …
DRAM access that allows developers to build persistent applications with common load and …
Nap: A {Black-Box} Approach to {NUMA-Aware} Persistent Memory Indexes
We present Nap, a black-box approach that converts concurrent persistent memory (PM)
indexes into NUMA-aware counterparts. Based on the observation that real-world workloads …
indexes into NUMA-aware counterparts. Based on the observation that real-world workloads …
LiveGraph: A transactional graph storage system with purely sequential adjacency list scans
The specific characteristics of graph workloads make it hard to design a one-size-fits-all
graph storage system. Systems that support transactional updates use data structures with …
graph storage system. Systems that support transactional updates use data structures with …