Vinay Banakar

dblp:237/9788 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · unresolved

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

Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1

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 · 93% Performance modeling and evaluation · 7%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 100%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 5 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › non-volatile memory storage
byte-addressable storage
0.712023
WiscSort: External Sorting For Byte-Addressable Storage · Proc. VLDB Endow. 2023
Storage systems › out-of-core computation
external sorting
0.712023
WiscSort: External Sorting For Byte-Addressable Storage · Proc. VLDB Endow. 2023
Storage systems › key-value storage
key-value separation
0.712023
WiscSort: External Sorting For Byte-Addressable Storage · Proc. VLDB Endow. 2023
Storage systems
key-value storage
0.712023
WiscSort: External Sorting For Byte-Addressable Storage · Proc. VLDB Endow. 2023
Database system architecture and tuning
database benchmarking
0.412020
Understanding and Benchmarking the Impact of GDPR on Database Systems · Proc. VLDB Endow. 2020

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

benchmarking · 0.9thread pool sizing · 0.7interference-aware scheduling · 0.7
YearPublicationVenuePosition
2023 WiscSort: External Sorting For Byte-Addressable Storage
abstract
We present WiscSort, a new approach to high-performance concurrent sorting for existing and future byte-addressable storage (BAS) devices. WiscSort carefully reduces writes, exploits random reads by splitting keys and values during sorting, and performs interference-aware scheduling with thread pool sizing to avoid I/O bandwidth degradation. We introduce the BRAID model which encompasses the unique characteristics of BAS devices. Many state-of-the-art sorting systems do not comply with the BRAID model and deliver sub-optimal performance, whereas WiscSort demonstrates the effectiveness of complying with BRAID. We show that WiscSort is 2-7 x faster than competing approaches on a standard sort benchmark. We evaluate the effectiveness of key-value separation on different key-value sizes and compare our concurrency optimizations with various other concurrency models. Finally, we emulate generic BAS devices and show how our techniques perform well with various combinations of hardware properties.
Vinay Banakar, Yuvraj Patel, Kimberly Keeton, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
Proc. VLDB Endow.1
2020 Understanding and Benchmarking the Impact of GDPR on Database Systems
abstract
The General Data Protection Regulation (GDPR) provides new rights and protections to European people concerning their personal data. We analyze GDPR from a systems perspective, translating its legal articles into a set of capabilities and characteristics that compliant systems must support. Our analysis reveals the phenomenon of metadata explosion, wherein large quantities of metadata needs to be stored along with the personal data to satisfy the GDPR requirements. Our analysis also helps us identify new workloads that must be supported under GDPR. We design and implement an open-source benchmark called GDPRbench that consists of workloads and metrics needed to understand and assess personal-data processing database systems. To gauge the readiness of modern database systems for GDPR, we follow best practices and developer recommendations to modify Redis, PostgreSQL, and a commercial database system to be GDPR compliant. Our experiments demonstrate that the resulting GDPR-compliant systems achieve poor performance on GPDR workloads, and that performance scales poorly as the volume of personal data increases. We discuss the real-world implications of these .ndings, and identify research challenges towards making GDPR-compliance efficient in production environments. We release all of our so.ware artifacts and datasets at h.p://www:gdprbench:org
Supreeth Shastri, Vinay Banakar, Melissa Wasserman, Arun Kumar 0001, Vijay Chidambaram
Proc. VLDB Endow.2
2019 Analyzing the Impact of GDPR on Storage Systems
Aashaka Shah, Vinay Banakar, Supreeth Shastri, Melissa Wasserman, Vijay Chidambaram
HotStorage2