Cover Image

How to Write to SSDs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lee, Bohyun, Ziegler, Tobias, Leis, Viktor
Format:	Preprint
Published:	2026
Subjects:	Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

High-Performance DBMSs with io_uring: When and How to use it
by: Jasny, Matthias, et al.
Published: (2025)

GateANN: I/O-Efficient Filtered Vector Search on SSDs
by: Lee, Nakyung, et al.
Published: (2026)

Towards Efficient Flash Caches with Emerging NVMe Flexible Data Placement SSDs
by: Allison, Michael, et al.
Published: (2025)

An Adaptive Hotspot-Aware Index for Oscillating Write-Heavy and Read-Heavy Workloads
by: Xing, Lu, et al.
Published: (2024)

O^3-LSM: Maximizing Disaggregated LSM Write Performance via Three-Layer Offloading
by: Lin, Qi, et al.
Published: (2026)

Write-Read Decoupling in Modern Large-Scale Search Engines: Architectures, Techniques, and Emerging Approaches
by: Liang, Xin, et al.
Published: (2026)

BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation
by: Li, Ming, et al.
Published: (2025)

Design and Reliability of a User Space Write-Ahead Log in Rust
by: Pellegatti, Vitor K. F., et al.
Published: (2025)

LakeVilla: A Modular and Non-Invasive Toolbox for Lakehouse Transactions
by: Götz, Tobias, et al.
Published: (2025)

Metadata-driven Table Union Search: Leveraging Semantics for Restricted Access Data Integration
by: Martorana, Margherita, et al.
Published: (2025)

Integrating Knowledge Graphs and Visualization Dashboards for Advance Data Discovery in VESA
by: Betz, Pawandeep Kaur, et al.
Published: (2024)

Evaluating Data Quality Tools: Measurement Capabilities and LLM Integration
by: Rehberger, Tobias, et al.
Published: (2026)

Tursio Database Search: How far are we from ChatGPT?
by: Jain, Sulbha, et al.
Published: (2026)

How to Define the Quality of Data? A Feature-Based Literature Survey
by: Matoni, Markus, et al.
Published: (2025)

How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice
by: Mo, Dingheng, et al.
Published: (2025)

How to Mine Potentially Popular Items? A Reverse MIPS-based Approach
by: Amagata, Daichi, et al.
Published: (2025)

Using Microsoft Access XP: A How-To-Do-It Manual for Librarians. How-To-Do-It Manuals for Librarians, Number 120.
by: Butler, E. Sonny, et al.
Published: (2002)

How Good are Learned Cost Models, Really? Insights from Query Optimization Tasks
by: Heinrich, Roman, et al.
Published: (2025)

Using Microsoft Access: A How-To-Do-It Manual for Librarians. How-To-Do-It Manuals for Librarians, Number 76.
by: Butler, E. Sonny
Published: (1997)

GTX: A Write-Optimized Latch-free Graph Data System with Transactional Support -- Extended Version
by: Zhou, Libin, et al.
Published: (2024)

Optimizing Context-Enhanced Relational Joins
by: Sanca, Viktor, et al.
Published: (2023)

Efficient Fault Tolerance for Pipelined Query Engines via Write-ahead Lineage
by: Wang, Ziheng, et al.
Published: (2024)

How to get Rid of SQL, Relational Algebra, the Relational Model, ERM, and ORMs in a Single Paper -- A Thought Experiment
by: Dittrich, Jens
Published: (2025)

SigSPARQL: Signals as a First-Class Citizen When Querying Knowledge Graphs
by: Schwarzinger, Tobias, et al.
Published: (2025)

Efficient Data Access Paths for Mixed Vector-Relational Search
by: Sanca, Viktor, et al.
Published: (2024)

A New Normalization Form for Limited Distinct Attributes
by: Snell, Niko S., et al.
Published: (2025)

ExtGraph: A Fast Extraction Method of User-intended Graphs from a Relational Database
by: Park, Jeongho, et al.
Published: (2025)

MobileRAG: A Fast, Memory-Efficient, and Energy-Efficient Method for On-Device RAG
by: Park, Taehwan, et al.
Published: (2025)

How Hard is it to Decide if a Fact is Relevant to a Query?
by: Bienvenu, Meghyn, et al.
Published: (2026)

Efficient Query Repair for Aggregate Constraints
by: Algarni, Shatha, et al.
Published: (2025)

DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search
by: Wei, Jiuqi, et al.
Published: (2024)

How Robust Are Router-LLMs? Analysis of the Fragility of LLM Routing Capabilities
by: Kassem, Aly M., et al.
Published: (2025)

Leveraging I/O Stalls for Efficient Scheduling in ANNS
by: Zhang, Juncheng, et al.
Published: (2026)

RESYSTANCE: Unleashing Hidden Performance of Compaction in LSM-trees via eBPF
by: Byun, Hongsu, et al.
Published: (2026)

Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
by: Wei, Jiuqi, et al.
Published: (2024)

GraphMatch: Subgraph Query Processing on FPGAs
by: Dann, Jonas, et al.
Published: (2024)

RTCUDB: Building Databases with RT Processors
by: Shi, Xuri, et al.
Published: (2024)

PrepBench: How Far Are We from Natural-Language-Driven Data Preparation?
by: Xu, Jingzhe, et al.
Published: (2026)

Shape-Agnostic Table Overlap Discovery: A Maximum Common Subhypergraph Approach
by: Lee, Ge, et al.
Published: (2026)

PDET-LSH: Scalable In-Memory Indexing for High-Dimensional Approximate Nearest Neighbor Search with Quality Guarantees
by: Wei, Jiuqi, et al.
Published: (2026)