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

Dinesh Das

dblp:80/2197 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
1since 2021 · last 2022
—ORCID · none

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

Databases, data management, data science and information retrieval · 8 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 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.

Databases, data mining, and information retrieval
7 papers
Database system architecture and tuning · 47% Query processing and optimization · 36% Distributed and cloud data management · 10%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning
main-memory database
0.732015
Distributed Architecture of Oracle Database In-memory · Proc. VLDB Endow. 2015
Query Optimization in Oracle 12c Database In-Memory · Proc. VLDB Endow. 2015
Oracle Database In-Memory: A dual format in-memory database · ICDE 2015
Query processing and optimization
query optimization
0.222015
Query Optimization in Oracle 12c Database In-Memory · Proc. VLDB Endow. 2015
Praire: A Rule Specification Framework for Query Optimizers · ICDE 1995
Database system architecture and tuning › main-memory database
distributed in-memory database
0.212015
Distributed Architecture of Oracle Database In-memory · Proc. VLDB Endow. 2015
Distributed and cloud data management
distributed query processing
0.212015
Distributed Architecture of Oracle Database In-memory · Proc. VLDB Endow. 2015
Query processing and optimization
parallel query processing
0.212015
Distributed Architecture of Oracle Database In-memory · Proc. VLDB Endow. 2015
Indexing and storage engines
columnar storage
0.112015
Oracle Database In-Memory: A dual format in-memory database · ICDE 2015
Query processing and optimization
cost model
0.112015
Query Optimization in Oracle 12c Database In-Memory · Proc. VLDB Endow. 2015
Database system architecture and tuning
hybrid transactional and analytical processing
0.112015
Distributed Architecture of Oracle Database In-memory · Proc. VLDB Endow. 2015
Transaction processing and concurrency control › consistency
transactional consistency
0.112015
Oracle Database In-Memory: A dual format in-memory database · ICDE 2015
Query processing and optimization › query rewriting
cost-based query rewriting
0.112006
Cost-Based Query Transformation in Oracle · VLDB 2006
Query processing and optimization › query rewriting
query transformation
0.112006
Cost-Based Query Transformation in Oracle · VLDB 2006
Query processing and optimization › query optimization › statistics management
optimizer statistics
0.012008
Optimizer plan change management: improved stability and performance in Oracle 11g · Proc. VLDB Endow. 2008
Query processing and optimization › query optimization
query tuning
0.012004
Automatic SQL Tuning in Oracle 10g · VLDB 2004

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

row-column dual format · 0.2query transformation · 0.2cost model · 0.2columnar storage · 0.2access path optimization · 0.2NUMA-aware execution · 0.2dynamic programming · 0.0algebraic framework · 0.0
YearPublicationVenuePosition
2022 Observability of SQL Hints in Oracle
abstract
Observability is a critical requirement of increasingly complex and cloud-first data management systems. In most commercial databases, this relies on telemetry like logs, traces, and metrics, which helps to identify, mitigate, and resolve issues expeditiously. SQL monitoring tools, for example, can show how a query is performing. One area that has received comparatively less attention is the observability of the query optimizer whose inner workings are often shrouded in mystery. Optimizer traces can illuminate the plan selection process for a query, but they are comprehensible only to human experts and are not easily machine-parsable to remediate sub-optimal plans. Hints are directives that guide the optimizer toward specific directions. While hints can be used manually, they are often used by automatic SQL plan management tools that can quickly identify and resolve regressions by selecting alternate plans. It is important to know when input hints are inapplicable so that the tools can try other strategies. For example, a manual hint may have syntax errors, or an index in an automatic hint may have been accidentally dropped. In this paper, we describe the design and implementation of Oracle's hint observability framework which provides a comprehensive usage report of all hints, manual or otherwise, used to compile a query. The report, which is available directly in the execution plan in a human-understandable and machine-readable format, can be used to automate any necessary corrective actions. This feature is available in Oracle Autonomous Database 19c.
Krishna Kantikiran Pasupuleti, Dinesh Das, Satyanarayana R. Valluri, Mohamed Zaït
CIKM2
2015 Oracle Database In-Memory: A dual format in-memory database
abstract
The Oracle Database In-Memory Option allows Oracle to function as the industry-first dual-format in-memory database. Row formats are ideal for OLTP workloads which typically use indexes to limit their data access to a small set of rows, while column formats are better suited for Analytic operations which typically examine a small number of columns from a large number of rows. Since no single data format is ideal for all types of workloads, our approach was to allow data to be simultaneously maintained in both formats with strict transactional consistency between them.
Tirthankar Lahiri, Shasank Chavan, Maria Colgan, Dinesh Das, Amit Ganesh, Mike Gleeson, Sanket Hase, Allison Holloway, Jesse Kamp, Teck-Hua Lee, Juan Loaiza, Neil MacNaughton, Vineet Marwah, Niloy Mukherjee, Atrayee Mullick, Sujatha Muthulingam, Vivekanandhan Raja, Marty Roth, Ekrem Soylemez, Mohamed Zaït
ICDE4
2015 Query Optimization in Oracle 12c Database In-Memory
abstract
Traditional on-disk row major tables have been the dominant storage mechanism in relational databases for decades. Over the last decade, however, with explosive growth in data volume and demand for faster analytics, has come the recognition that a different data representation is needed. There is widespread agreement that in-memory column-oriented databases are best suited to meet the realities of this new world. Oracle 12c Database In-memory, the industry's first dual-format database, allows existing row major on-disk tables to have complementary in-memory columnar representations. The new storage format brings new data processing techniques and query execution algorithms and thus new challenges for the query optimizer. Execution plans that are optimal for one format may be sub-optimal for the other. In this paper, we describe the changes made in the query optimizer to generate execution plans optimized for the specific format -- row major or columnar -- that will be scanned during query execution. With enhancements in several areas -- statistics, cost model, query transformation, access path and join optimization, parallelism, and cluster-awareness -- the query optimizer plays a significant role in unlocking the full promise and performance of Oracle Database In-Memory.
Dinesh Das, Mohamed Zaït, Satyanarayana R. Valluri, Nirav Vyas, Ramarajan Krishnamachari, Prashant Gaharwar, Jesse Kamp, Niloy Mukherjee
Proc. VLDB Endow.1
2015 Distributed Architecture of Oracle Database In-memory
abstract
Over the last few years, the information technology industry has witnessed revolutions in multiple dimensions. Increasing ubiquitous sources of data have posed two connected challenges to data management solutions -- processing unprecedented volumes of data, and providing ad-hoc real-time analysis in mainstream production data stores without compromising regular transactional workload performance. In parallel, computer hardware systems are scaling out elastically, scaling up in the number of processors and cores, and increasing main memory capacity extensively. The data processing challenges combined with the rapid advancement of hardware systems has necessitated the evolution of a new breed of main-memory databases optimized for mixed OLTAP environments and designed to scale. The Oracle RDBMS In-memory Option (DBIM) is an industry-first distributed dual format architecture that allows a database object to be stored in columnar format in main memory highly optimized to break performance barriers in analytic query workloads, simultaneously maintaining transactional consistency with the corresponding OLTP optimized row-major format persisted in storage and accessed through database buffer cache. In this paper, we present the distributed, highly-available, and fault-tolerant architecture of the Oracle DBIM that enables the RDBMS to transparently scale out in a database cluster, both in terms of memory capacity and query processing throughput. We believe that the architecture is unique among all mainstream in-memory databases. It allows complete application-transparent, extremely scalable and automated distribution of Oracle RDBMS objects in-memory across a cluster, as well as across multiple NUMA nodes within a single server. It seamlessly provides distribution awareness to the Oracle SQL execution framework through affinitized fault-tolerant parallel execution within and across servers without explicit optimizer plan changes or query rewrites.
Niloy Mukherjee, Shasank Chavan, Maria Colgan, Dinesh Das, Mike Gleeson, Sanket Hase, Allison Holloway, Hui Jin 0001, Jesse Kamp, Kartik Kulkarni, Tirthankar Lahiri, Juan Loaiza, Neil MacNaughton, Vineet Marwah, Atrayee Mullick, Andy Witkowski, Mohamed Zaït
Proc. VLDB Endow.4
2008 Optimizer plan change management: improved stability and performance in Oracle 11g
abstract
Execution plans for SQL statements have a significant impact on the overall performance of database systems. New optimizer statistics, configuration parameter changes, software upgrades and hardware resource utilization are among a multitude of factors that may cause the query optimizer to generate new plans. While most of these plan changes are beneficial or benign, a few rogue plans can potentially wreak havoc on system performance or availability, affecting critical and time-sensitive business application needs. The normally desirable ability of a query optimizer to adapt to system changes may sometimes cause it to pick a sub-optimal plan compromising the stability of the system. In this paper, we present the new SQL Plan Management feature in Oracle 11g. It provides a comprehensive solution for managing plan changes to provide stable and optimal performance for a set of SQL statements. Two of its most important goals are preventing sub-optimal plans from being executed while allowing new plans to be used if they are verifiably better than previous plans. This feature is tightly integrated with Oracle's query optimizer. SQL Plan Management is available to users via both command-line and graphical interfaces. We describe the feature and then, using an industrial-strength application suite, present experimental results that show that SQL Plan Management provides stable and optimal performance for SQL statements with no performance regressions.
Mohamed Ziauddin, Dinesh Das, Hong Su, Yali Zhu, Khaled Yagoub
Proc. VLDB Endow.2
2006 Cost-Based Query Transformation in Oracle
Rafi Ahmed, Allison W. Lee, Andrew Witkowski, Dinesh Das, Hong Su, Mohamed Zaït, Thierry Cruanes
VLDB4
2004 Automatic SQL Tuning in Oracle 10g
Benoît Dageville, Dinesh Das, Karl Dias, Khaled Yagoub, Mohamed Zaït, Mohamed Ziauddin
VLDB2
1995 Praire: A Rule Specification Framework for Query Optimizers
abstract
From our experience, current rule-based query optimizers do not provide a very intuitive and well-defined framework to define rules and actions. To remedy this situation, we propose an extensible and structured algebraic framework called Prairie for specifying rules. Prairie facilitates rule-writing by enabling a user to write rules and actions more quickly, correctly and in an easy-to-understand and easy-to-debug manner. Query optimizers consist of three major parts: a search space, a cost model and a search strategy. The approach we take is only to develop the algebra which defines the search space and the cost model and use the Volcano optimizer-generator as our search engine. Using Prairie as a front-end we translate Prairie rules to Volcano to validate our claim that Prairie makes it easier to write rules. We describe our algebra and present experimental results which show that using a high-level framework like Prairie to design large-scale optimizers does not sacrifice efficiency.>
Dinesh Das, Don S. Batory
ICDE1