Demo Data from VLDB 2026 / reviewers in the wild / expert
Chinmay Kulkarni 0002
dblp:23/4804-2 · also Chinmay Satish Kulkarni
· DBLP profile ↗
5ranked-venue papers
3as first author
2since 2021 · last 2021
0000-0003-3363-2576ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 3 · 2 first-author · 1 since 2021Systems, architecture and hardware · 1Databases, 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
5 papers |
Storage systems · 55% Cloud and datacenter computing · 42% Distributed systems · 3% | |
| Software engineering, system software, and programming languages
1 paper |
Operating systems · 100% |
Topics — the 15 heaviest of 18, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems
key-value storage |
0.8 | 2 | 2021 | Achieving High Throughput and Elasticity in a Larger-than-Memory Store · Proc. VLDB Endow. 2021 Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017 |
Cloud and datacenter computing
cloud storage |
0.5 | 1 | 2021 | Achieving High Throughput and Elasticity in a Larger-than-Memory Store · Proc. VLDB Endow. 2021 |
Storage systems › key-value storage
distributed key-value store |
0.5 | 1 | 2021 | Achieving High Throughput and Elasticity in a Larger-than-Memory Store · Proc. VLDB Endow. 2021 |
Cloud and datacenter computing › datacenter storage
elastic storage |
0.5 | 1 | 2021 | Achieving High Throughput and Elasticity in a Larger-than-Memory Store · Proc. VLDB Endow. 2021 |
Storage systems › data placement
adaptive data placement |
0.4 | 1 | 2020 | Adaptive Placement for In-memory Storage Functions · USENIX ATC 2020 |
Cloud and datacenter computing
resource management |
0.4 | 1 | 2020 | Adaptive Placement for In-memory Storage Functions · USENIX ATC 2020 |
Storage systems › storage performance
low-latency storage |
0.3 | 1 | 2018 | Splinter: Bare-Metal Extensions for Multi-Tenant Low-Latency Storage · OSDI 2018 |
Cloud and datacenter computing
cluster resource management and scheduling |
0.3 | 1 | 2017 | Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017 |
Storage systems › key-value storage
in-memory key-value store |
0.3 | 1 | 2017 | Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017 |
Cloud and datacenter computing › virtualization › virtual machine migration
live migration |
0.3 | 1 | 2017 | Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017 |
Distributed systems
replication |
0.1 | 1 | 2021 | NrOS: Effective Replication and Sharing in an Operating System · OSDI 2021 |
Storage systems › storage hierarchy
tiered storage |
0.1 | 1 | 2021 | Achieving High Throughput and Elasticity in a Larger-than-Memory Store · Proc. VLDB Endow. 2021 |
Storage systems › storage architecture
in-memory storage |
0.1 | 1 | 2020 | Adaptive Placement for In-memory Storage Functions · USENIX ATC 2020 |
Cloud and datacenter computing › multi-tenancy
multi-tenant storage |
0.1 | 1 | 2018 | Splinter: Bare-Metal Extensions for Multi-Tenant Low-Latency Storage · OSDI 2018 |
Storage systems
storage reliability |
0.1 | 1 | 2017 | Rocksteady: Fast Migration for Low-latency In-memory Storage · SOSP 2017 |
Methods — techniques the papers use, named apart from their topics
distributed reconfiguration · 0.5consistent hashing · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | NrOS: Effective Replication and Sharing in an Operating System
Ankit Bhardwaj 0002, Chinmay Kulkarni 0002, Reto Achermann, Irina Calciu, Sanidhya Kashyap, Ryan Stutsman, Amy Tai, Gerd Zellweger |
OSDI | 2 |
| 2021 | Achieving High Throughput and Elasticity in a Larger-than-Memory StoreabstractMillions of sensors, mobile applications and machines now generate billions of events. Specialized many-core key-value stores (KVSs) can ingest and index these events at high rates (over 100 Mops/s on one machine) if events are generated on the same machine; however, to be practical and cost-effective they must ingest events over the network and scale across cloud resources elastically. We present Shadowfax, a new distributed KVS based on FASTER, that transparently spans DRAM, SSDs, and cloud blob storage while serving 130 Mops/s/VM over commodity Azure VMs using conventional Linux TCP. Beyond high single-VM performance, Shadowfax uses a unique approach to distributed reconfiguration that avoids any server-side key ownership checks or cross-core coordination both during normal operation and migration. Hence, Shadowfax can shift load in 17 s to improve system throughput by 10 Mops/s with little disruption. Compared to the state-of-the-art, it has 8x better throughput (than Seastar+memcached) and avoids costly I/O to move cold data during migration. On 12 machines, Shadowfax retains its high throughput to perform 930 Mops/s, which, to the best of our knowledge, is the highest reported throughput for a distributed KVS used for large-scale data ingestion and indexing. Chinmay Kulkarni 0002, Badrish Chandramouli, Ryan Stutsman |
Proc. VLDB Endow. | 1 |
| 2020 | Adaptive Placement for In-memory Storage Functions
Ankit Bhardwaj 0002, Chinmay Kulkarni 0002, Ryan Stutsman |
USENIX ATC | 2 |
| 2018 | Splinter: Bare-Metal Extensions for Multi-Tenant Low-Latency Storage
Chinmay Kulkarni 0002, Sara Moore, Mazhar Naqvi, Tian Zhang 0005, Robert Ricci, Ryan Stutsman |
OSDI | 1 |
| 2017 | Rocksteady: Fast Migration for Low-latency In-memory StorageabstractScalable in-memory key-value stores provide low-latency access times of a few microseconds and perform millions of operations per second per server. With all data in memory, these systems should provide a high level of reconfigurability. Ideally, they should scale up, scale down, and rebalance load more rapidly and flexibly than disk-based systems. Rapid reconfiguration is especially important in these systems since a) DRAM is expensive and b) they are the last defense against highly dynamic workloads that suffer from hot spots, skew, and unpredictable load. However, so far, work on in-memory key-value stores has generally focused on performance and availability, leaving reconfiguration as a secondary concern. Chinmay Kulkarni 0002, Aniraj Kesavan, Tian Zhang 0005, Robert Ricci, Ryan Stutsman |
SOSP | 1 |