Read as Needed: Building WiSER, a Flash-Optimized Search Engine
Jun He, Kan Wu, Sudarsun Kannan, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
Abstract
We describe WiSER, a clean-slate search engine designed to exploit high-performance SSDs with the philosophy "read as needed". WiSER utilizes many techniques to deliver high throughput and low latency with a relatively small amount of main memory; the techniques include an optimized data layout, a novel two-way cost-aware Bloom filter, adaptive prefetching, and space-time trade-offs. In a system with memory that is significantly smaller than the working set, these techniques increase storage space usage (up to 50%), but reduce read amplification by up to 3x, increase query throughput by up to 2.7x, and reduce latency by 16x when compared to the state-of-the-art Elasticsearch. We believe that the philosophy of "read as needed" can be applied to more applications as the read performance of storage devices keeps improving.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 33b45777-7f33-44f2-adf2-e78613e18703Cited by top-tier papers4
- D2FQ: Device-Direct Fair Queueing for NVMe SSDsJiwon Woo, Minwoo Ahn, Gyusun Lee, Jinkyu JeongFAST 2021 · 45 citations
- Pipette: efficient fine-grained reads for SSDsShuhan Bai, Hu Wan, Yun Huang, Xuan Sun et al.DAC 2022 · 2 citations
- Identifying On-/Off-CPU Bottlenecks Together with Blocked SamplesMinwoo Ahn, Jeongmin Han, Youngjin Kwon, Jinkyu JeongOSDI 2024 · 2 citations
- Crash Consistency in Block-Level Caching Systems: An Open CAS Case StudyShaohua Duan, Youmin ChenUSENIX ATC 2025 · 1 citation
Related papers
- Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM treesZichen Zhu, Yanpeng Wei, Ju Hyoung Mun, Manos AthanassoulisSIGMOD 2025 · 3 citations
- Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value StoresSiqiang Luo, Subarna Chatterjee, Rafael Ketsetsidis, Niv Dayan et al.SIGMOD 2020 · 91 citations
- Analysis and Evaluation of Using Microsecond-Latency Memory for In-Memory Indices and Caches in SSD-Based Key-Value StoresYosuke Bando, Akinobu Mita, Kazuhiro Hiwada, Shintaro Sano et al.SIGMOD 2026
- PinK: High-speed In-storage Key-value Store with Bounded TailsJunsu Im, Jinwook Bae, Chanwoo Chung, Arvind et al.USENIX ATC 2020 · 85 citations
- NobLSM: an LSM-tree with non-blocking writes for SSDsHaoran Dang, Chongnan Ye, Yanpeng Hu, Chundong WangDAC 2022 · 5 citations
