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

Pratik Barhate

dblp:268/6682 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · unresolved

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

Databases, 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 50% Parallel and multicore computing · 50%
Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 100%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management
data partitioning
0.512021
Lachesis: Automated Partitioning for UDF-Centric Analytics · Proc. VLDB Endow. 2021
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.512021
Lachesis: Automated Partitioning for UDF-Centric Analytics · Proc. VLDB Endow. 2021
Parallel and multicore computing
data distribution
0.512021
Lachesis: Automated Partitioning for UDF-Centric Analytics · Proc. VLDB Endow. 2021

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

deep reinforcement learning · 1.0
YearPublicationVenuePosition
2021 Lachesis: Automated Partitioning for UDF-Centric Analytics
abstract
Partitioning is effective in avoiding expensive shuffling operations. However, it remains a significant challenge to automate this process for Big Data analytics workloads that extensively use user defined functions (UDFs), where sub-computations are hard to be reused for partitionings compared to relational applications. In addition, functional dependency that is widely utilized for partitioning selection is often unavailable in the unstructured data that is ubiquitous in UDF-centric analytics. We propose the Lachesis system, which represents UDF-centric workloads as workflows of analyzable and reusable sub-computations. Lachesis further adopts a deep reinforcement learning model to infer which sub-computations should be used to partition the underlying data. This analysis is then applied to automatically optimize the storage of the data across applications to improve the performance and users' productivity.
Jia Zou 0001, Amitabh Das, Pratik Barhate, Arun Iyengar, Binhang Yuan, Dimitrije Jankov, Chris Jermaine
Proc. VLDB Endow.3