2018 IEEE 34th International Conference on Data Engineering (ICDE) 2018
DOI: 10.1109/icde.2018.00026
|View full text |Cite
|
Sign up to set email alerts
|

LeanStore: In-Memory Data Management beyond Main Memory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
14
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 67 publications
(14 citation statements)
references
References 28 publications
0
14
0
Order By: Relevance
“…[12] propose a design that uses pointer swizzling to eliminate buffer pool overheads for memory resident data, in which raw pointers to loaded pieces are kept as reference to avoid lookup in separate queues managed by the buffer pool. LeanStore [17] uses pointer swizzling and replacement strategy by identifying infrequently accessed pages and an epoch-based technique to pin pages and achieve performance comparable to main memory systems. In HANA's NSE, the read optimized section of a hybrid column benefits from the NSE architecture and is managed by NSE's buffer cache for better tuning and optimizations that are only applicable to paged resources.…”
Section: Related Workmentioning
confidence: 99%
“…[12] propose a design that uses pointer swizzling to eliminate buffer pool overheads for memory resident data, in which raw pointers to loaded pieces are kept as reference to avoid lookup in separate queues managed by the buffer pool. LeanStore [17] uses pointer swizzling and replacement strategy by identifying infrequently accessed pages and an epoch-based technique to pin pages and achieve performance comparable to main memory systems. In HANA's NSE, the read optimized section of a hybrid column benefits from the NSE architecture and is managed by NSE's buffer cache for better tuning and optimizations that are only applicable to paged resources.…”
Section: Related Workmentioning
confidence: 99%
“…Because SSDs provide block-wise access, and data needs to be loaded into DRAM before it can be processed, a number of high-performance storage engines have recently been proposed to exploit fast SSDs [7,31,39,50]. Using techniques like pointer swizzling [31] and scalable optimistic synchronization [32,33], systems like LeanStore [31] offer transparent buffer management with very little overhead. This SSD-optimized approach is a new database architecture that significantly differs from both the disk-based and the in-memory designs.…”
Section: Introductionmentioning
confidence: 99%
“…It extends the scalable logging scheme proposed by Wang and Johnson [52] with a novel continuous checkpointing algorithm, an efficient page provisioning strategy, and an optimized cross-log commit protocol. We integrate all these components into LeanStore [31], a lightweight buffer manager that uses pointer swizzling and optimistic synchronization. The resulting system can sustain transaction rates close to that of a pure in-memory system when all data fits in DRAM, as well as handle out-of-memory workloads transparently.…”
Section: Introductionmentioning
confidence: 99%
“…The B+tree is organized such that nodes are represented by pages, which are the unit of data movement and buffering. Optimizations like pointer swizzling [8] and low-overhead replacement policies [10] may apply. The atomicity and durability of writes to pages buffered in DRAM is guaranteed by write-ahead logging (WAL).…”
Section: Introductionmentioning
confidence: 99%