Demo Data from VLDB 2026 / reviewers in the wild / expert
Omkar Desai
dblp:322/9797
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0002-5678-7434ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 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
2 papers |
Storage systems · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning and data management › data management for machine learning
data preparation for machine learning |
1.0 | 1 | 2026 | Preparation Meets Opportunity: Enhancing Data Preprocessing for ML Training With Seneca · FAST 2026 |
Storage systems
flash and SSD |
0.7 | 1 | 2023 | Leveraging Keys In Key-Value SSD for Production Workloads · HPDC 2023 |
Storage systems › indexing
index management |
0.7 | 1 | 2023 | Leveraging Keys In Key-Value SSD for Production Workloads · HPDC 2023 |
Storage systems › key-value storage
key-value SSD |
0.7 | 1 | 2023 | Leveraging Keys In Key-Value SSD for Production Workloads · HPDC 2023 |
Storage systems
key-value storage |
0.7 | 1 | 2023 | Leveraging Keys In Key-Value SSD for Production Workloads · HPDC 2023 |
Storage systems › data management
storage for machine learning |
0.3 | 1 | 2026 | Preparation Meets Opportunity: Enhancing Data Preprocessing for ML Training With Seneca · FAST 2026 |
Storage systems
storage reliability |
0.2 | 1 | 2023 | Leveraging Keys In Key-Value SSD for Production Workloads · HPDC 2023 |
Methods — techniques the papers use, named apart from their topics
prefix-based index partitioning · 0.7LSM-tree · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Preparation Meets Opportunity: Enhancing Data Preprocessing for ML Training With Seneca
Omkar Desai, Ziyang Jiao, Shuyi Pei, Janki Bhimani, Bryan S. Kim |
FAST | 1 |
| 2023 | Leveraging Keys In Key-Value SSD for Production WorkloadsabstractKey-Value SSDs reduce host-side resource utilization for unstructured data management by streamlining the I/O stack. However, designing a robust Key-Value SSD with resource constrained flash controllers has always been a challenge. The key-to-page (K2P) mapping inside KV-SSD, which consolidates multiple layers of indirection in the traditional block I/O storage, has its own shortcomings. The sparsely populated NVMe KV namespace leads to very large index, which cannot be optimized similar to hybrid- or block-FTL in block-SSDs. In addition, the background index management tasks (e.g. compaction on LSM-tree index) also lead to performance degradation. Moreover, existing KV index design is not equipped to tackle fast changing workload patterns. These shortcomings have stalled the adoption of KV-SSDs in production environments. In this work, we take the position that these shortcomings can be addressed by leveraging the information embedded inside keys about application keyspaces and groups as prefixes. The prefixes can be used to partition the monolithic large index into smaller ones. We demonstrate a naive prefix-based index partitioning mechanism inside KV-SSD that can reduce on-flash index accesses for multiple production workloads and discuss the shortcomings of this approach. Lastly, we discuss our proposed design of a society of indices that initialize, interact and evolve based on workload characteristics over time. Manoj Pravakar Saha, Omkar Desai, Bryan S. Kim, Janki Bhimani |
HPDC | 2 |
| 2022 | A principled approach for selecting block I/O tracesabstractWe present IOTAP, a tool that analyzes and profiles block I/O traces. IOTAP computes the (dis)similarities among a set of workloads and sets a guideline for selecting a subset of traces for benchmarking. By doing so, we avoid experimentally running all workloads or, even worse, arbitrarily selecting a subset that skews the results. We demonstrate the usefulness of IOTAP by comparing its results with experiments on real SSDs, achieving a high correlation of 0.92 for an NVMe SSD. Omkar Desai, Seungmin Shin, Bryan S. Kim |
HotStorage | 1 |