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.

Unmesh Jagtap

dblp:135/4708 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
parallel query processing
0.212013
Adaptive and Big Data Scale Parallel Execution in Oracle · Proc. VLDB Endow. 2013
Query processing and optimization › query execution
SQL operators
0.212013
Adaptive and Big Data Scale Parallel Execution in Oracle · Proc. VLDB Endow. 2013
Cloud and datacenter computing
big data analytics
0.012013
Adaptive and Big Data Scale Parallel Execution in Oracle · Proc. VLDB Endow. 2013

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

runtime data distribution · 0.3multi-stage parallelization · 0.3
YearPublicationVenuePosition
2013 Adaptive and Big Data Scale Parallel Execution in Oracle
abstract
This paper showcases some of the newly introduced parallel execution methods in Oracle RDBMS. These methods provide highly scalable and adaptive evaluation for the most commonly used SQL operations - joins, group-by, rollup/cube, grouping sets, and window functions. The novelty of these techniques is their use of multi-stage parallelization models, accommodation of optimizer mistakes, and the runtime parallelization and data distribution decisions. These parallel plans adapt based on the statistics gathered on the real data at query execution time. We realized enormous performance gains from these adaptive parallelization techniques. The paper also discusses our approach to parallelize queries with operations that are inherently serial. We believe all these techniques will make their way into big data analytics and other massively parallel database systems.
Srikanth Bellamkonda, Hua-Gang Li, Unmesh Jagtap, Yali Zhu, Vince Liang, Thierry Cruanes
Proc. VLDB Endow.3