Demo Data from EDBT 2026 / reviewers in the wild / expert
Adrien Lespinasse
dblp:180/8563
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Database system architecture and tuning · 50% Indexing and storage engines · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Indexing and storage engines › b+-tree
persistent b+-tree |
0.3 | 1 | 2017 | Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems · Proc. VLDB Endow. 2017 |
Memory systems
non-volatile memory |
0.1 | 1 | 2017 | Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems · Proc. VLDB Endow. 2017 |
Memory systems › non-volatile memory
storage class memory |
0.1 | 1 | 2017 | Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems · Proc. VLDB Endow. 2017 |
Methods — techniques the papers use, named apart from their topics
defragmentation · 0.6concurrency control · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Memory Management Techniques for Large-Scale Persistent-Main-Memory SystemsabstractStorage Class Memory (SCM) is a novel class of memory technologies that promise to revolutionize database architectures. SCM is byte-addressable and exhibits latencies similar to those of DRAM, while being non-volatile. Hence, SCM could replace both main memory and storage, enabling a novel single-level database architecture without the traditional I/O bottleneck. Fail-safe persistent SCM allocation can be considered conditio sine qua non for enabling this novel architecture paradigm for database management systems. In this paper we present PAllocator, a fail-safe persistent SCM allocator whose design emphasizes high concurrency and capacity scalability. Contrary to previous works, PAllocator thoroughly addresses the important challenge of persistent memory fragmentation by implementing an efficient defragmentation algorithm. We show that PAllocator outperforms state-of-the-art persistent allocators by up to one order of magnitude, both in operation throughput and recovery time, and enables up to 2.39x higher operation throughput on a persistent B-Tree. Ismail Oukid, Daniel Booss, Adrien Lespinasse, Wolfgang Lehner, Thomas Willhalm, Grégoire Gomes |
Proc. VLDB Endow. | 3 |
| 2016 | On testing persistent-memory-based softwareabstractLeveraging Storage Class Memory (SCM) as a universal memory--i.e. as memory and storage at the same time--has deep implications on database architectures. It becomes possible to store a single copy of the data in SCM and directly operate on it at a fine granularity. However, exposing the whole database with direct access to the application dramatically increases the risk of data corruption. In this paper we propose a lightweight on-line testing framework that helps find and debug SCM-related errors that can occur upon software or power failures. Our testing framework simulates failures in critical code paths and achieves fast code coverage by leveraging call stack information to limit duplicate testing. It also partially covers the errors that might arise as a result of reordered memory operations. We show through an experimental evaluation that our testing framework is fast enough to be used with large software systems and discuss its use during the development of our in-house persistent SCM allocator. Ismail Oukid, Daniel Booss, Adrien Lespinasse, Wolfgang Lehner |
DaMoN | 3 |