Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maximilian Berens

dblp:195/7316 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
0000-0003-4197-9422ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 since 2021

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 61% Memory systems · 30% Hardware reliability and fault tolerance · 9%
Databases, data mining, and information retrieval
2 papers
Indexing and storage engines · 44% Query processing and optimization · 44% Database system architecture and tuning · 13%

Topics — the 4 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization › range query
high-dimensional range query
0.912025
Index Intersection for High-Dimensional Range Queries · Proc. VLDB Endow. 2025
Storage systems
computational storage
0.912025
Beyond Bandwidth Doubling: Embrace Bit-Flips and Unlock Processing-in-NAND · ICDE 2025
Storage systems
flash and SSD
0.912025
Beyond Bandwidth Doubling: Embrace Bit-Flips and Unlock Processing-in-NAND · ICDE 2025
Memory systems
processing-in-memory
0.912025
Beyond Bandwidth Doubling: Embrace Bit-Flips and Unlock Processing-in-NAND · ICDE 2025

Methods — techniques the papers use, named apart from their topics

bloom filter · 1.7binary sketch · 1.7
YearPublicationVenuePosition
2025 Beyond Bandwidth Doubling: Embrace Bit-Flips and Unlock Processing-in-NAND
abstract
NVMe SSDs offer unprecedented capacity and bandwidth and upcoming PCIe standards promise even more. However, the underlying technology, NAND memory, already struggles with significant heat and power consumption challenges. Just like microprocessors before, NAND also experiences Dark Silicon, preventing performance from improving at the same pace as capacity. Much of the power (and thus heat) within a NAND chip results from transferring data at a high rate, another symptom of a compute-centric style of processing. Therefore, we argue for data-centric Processing-in-NAND (PiN). However, PiN comes with significant challenges, such as limited capabilities and the need to cope with bit-flip errors. Even beyond Processing-in-Memory (PiM), databases may soon have to accept that memory is not error-free, an assumption that comes at a significant cost in power, capacity and performance. Our discussion indicates that no PiN design will serve as a singular, universally applicable solution to the limit of bandwidth scaling. Instead, successful integration into database architecture requires carefully identifying PiN-compatible functionality and abstractions, and cooperation with other innovations, such as Computational Storage and CXL. Lastly, we analyze the fundamental error tolerance of Bloom filters and binary sketches as PiM-compatible data structures, which we believe may be of independent interest.
Maximilian Berens, Yun-Chih Chen, Jian-Jia Chen, Jens Teubner
ICDE1
2025 Index Intersection for High-Dimensional Range Queries
Maximilian Berens, Jens Teubner
Proc. VLDB Endow.1
2022 Uniform probabilistic generation of relation instances satisfying a functional dependency
Maximilian Berens, Joachim Biskup, Marcel Preuß
Inf. Syst.1