Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Karan Newatia

dblp:304/2470 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2023
0009-0003-6219-340XORCID · corroborated

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

Software engineering, systems software and programming languages · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 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.

Network and information security
2 papers
Privacy and data protection · 84% Cryptographic primitives and cryptanalysis · 16%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 87% Distributed systems · 13%
Databases, data mining, and information retrieval
2 papers
Distributed and cloud data management · 57% Graph data management · 43%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
1.222023
Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy · SOSP 2023
Mycelium: Large-Scale Distributed Graph Queries with Differential Privacy · SOSP 2021
Distributed and cloud data management › cloud database
database-as-a-service
0.712023
Solver-In-The-Loop Cluster Resource Management for Database-as-a-Service · Proc. VLDB Endow. 2023
Privacy and data protection › privacy-preserving data analysis
federated analytics
0.712023
Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy · SOSP 2023
Privacy and data protection
privacy-preserving data analysis
0.712023
Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy · SOSP 2023
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.712023
Solver-In-The-Loop Cluster Resource Management for Database-as-a-Service · Proc. VLDB Endow. 2023
Cloud and datacenter computing › multi-tenancy
tenant placement
0.712023
Solver-In-The-Loop Cluster Resource Management for Database-as-a-Service · Proc. VLDB Endow. 2023
Graph data management › graph query processing
distributed graph queries
0.512021
Mycelium: Large-Scale Distributed Graph Queries with Differential Privacy · SOSP 2021
Cryptographic primitives and cryptanalysis
homomorphic encryption
0.512021
Mycelium: Large-Scale Distributed Graph Queries with Differential Privacy · SOSP 2021
Distributed systems › distributed database
distributed query processing
0.212023
Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy · SOSP 2023
Privacy and data protection
privacy-preserving computation
0.112021
Mycelium: Large-Scale Distributed Graph Queries with Differential Privacy · SOSP 2021

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

query planning · 1.3differential privacy · 1.3cryptographic primitives · 1.3constraint solving · 1.3combinatorial optimization · 1.3verifiable secret redistribution · 1.0mix network · 1.0homomorphic encryption · 1.0
YearPublicationVenuePosition
2023 Arboretum: A Planner for Large-Scale Federated Analytics with Differential Privacy
abstract
Federated analytics is a way to answer queries over sensitive data that is spread across multiple parties, without sharing the data or collecting it in a single place. Prior work has developed solutions that can scale to large deployments with millions of devices but, due to the distributed nature of federated analytics, these solutions can support only a limited class of queries - typically various forms of numerical queries, which can be answered with lightweight cryptographic primitives. Supporting richer queries, such as categorical queries, requires heavier cryptography, whose cost can quickly exceed even the resources of a powerful data center.
Elizabeth Margolin, Karan Newatia, Edo Roth, Andreas Haeberlen
SOSP2
2023 Solver-In-The-Loop Cluster Resource Management for Database-as-a-Service
abstract
In Database-as-a-Service (DBaaS) clusters, resource management is a complex optimization problem that assigns tenants to nodes, subject to various constraints and objectives. Tenants share resources within a node, however, their resource demands can change over time and exhibit high variance. As tenants may accumulate large state, moving them to a different node becomes disruptive, making intelligent placement decisions crucial to avoid service disruption. Placement decisions need to account for dynamic changes in tenant resource demands, different causes of service disruption, and various placement constraints, giving rise to a complex search space. In this paper, we show how to bring combinatorial solvers to bear on this problem, formulating the objective of minimizing service disruption as an optimization problem amenable to fast solutions. We implemented our approach in the Service Fabric cluster manager codebase. Experiments show significant reductions in constraint violations and tenant moves, compared to the previous state-of-the-art, including the unmodified Service Fabric cluster manager, as well as recent research on DBaaS tenant placement.
Arnd Christian König, Karan Newatia, Luke Marshall, Vivek R. Narasayya
Proc. VLDB Endow.3
2021 Mycelium: Large-Scale Distributed Graph Queries with Differential Privacy
abstract
This paper introduces Mycelium, the first system to process differentially private queries over large graphs that are distributed across millions of user devices. Such graphs occur, for instance, when tracking the spread of diseases or malware. Today, the only practical way to query such graphs is to upload them to a central aggregator, which requires a great deal of trust from users and rules out certain types of studies entirely. With Mycelium, users' private data never leaves their personal devices unencrypted, and each user receives strong privacy guarantees. Mycelium does require the help of a central aggregator with access to a data center, but the aggregator merely facilitates the computation by providing bandwidth and computation power; it never learns the topology of the graph or the underlying data. Mycelium accomplishes this with a combination of homomorphic encryption, a verifiable secret redistribution scheme, and a mix network based on telescoping circuits. Our evaluation shows that Mycelium can answer a range of different questions from the medical literature with millions of devices.
Edo Roth, Karan Newatia, Yiping Ma 0001, Ke Zhong, Sebastian Angel, Andreas Haeberlen
SOSP2