Skip to content
yashk's iiitd notes
EXPLAIN
Initializing search
CSE112 CO
CSE202 DBMS
CSE222 ADA
Home
yashk's iiitd notes
CSE112 CO
CSE112 CO
Index
Computers
Computers
A Computer Program
Abstraction
Architecture And Organisation
Instruction Processing
Memory Implementation
ISA
ISA
Instruction
Instruction Set Architecture
RISC And CISC Paradigms
Assembly Language
Assembly Language
Addressing Modes
Calling Convention
Instruction Categories
Instruction Encoding
The Stack
Number Representation
Number Representation
Integer Representation
Real Number Representation
Overflows And Underflows
Cache And Memory
Cache And Memory
Cache Loading
Write Policy
Cache Associativity
Cache Structure
Cache Timing
Locality
Replacement Policy
Memory modes sorted by Bit Density (Ascending)
Pipelining And Hazards
Pipelining And Hazards
Pipelining
Pipeline Diagram Timing
Iron Law Of Processor Performance
Structural And Control Hazards
Dependencies And Data Hazards
Data Hazard Resolution
Out Of Order Processors
Out Of Order Processors
OOO Specs
I4
I2O2
I2OI
IO3
IO2I
Superscalar Processors
Superscalar Processors
Superscalar Pipeline
Issue Stage
Hazards
Alignment Constraints
Exceptions
Exceptions
Interrupt
Interrupt Handling
CSE202 DBMS
CSE202 DBMS
Index
Introduction
Introduction
Why Use DBMS
Data Definition Language
Data Manipulation Language
Database Users
Data Models
Relational Model
Database Applications
Database Engine
Database Architecture
Relational Model
Relational Model
Attributes
Database Schema
Union, Intersection, Difference Operations
Relational Query
Relation Implementation
Key
Select Operation
Project Operation
Assignment, Rename Operators
Cartesian Product, Join Operations
Database Design, E-R Model
Database Design, E-R Model
Roles
Relationship
Relationship Attributes
Total And Partial Participation
Weak Entity Set
Redundancy
Design Phases
Entity
Attributes
Relationship Degree
Cardinality
Primary Key
Entity Set Corelations
SQL
SQL
Domain Types
Data Manipulation
SQL Query
Select
String Operations
Where, From, And Others
Set Operations
Aggregation Functions
Nested And Set Queries
Database Modification
Create Table
Data Definition Language
Advanced SQL
Advanced SQL
Views
Joins
Integrity Constraints
Indices
Miscellaneous Datatypes
Authorisation
Transaction
Even More Advanced SQL
Even More Advanced SQL
For-each Loops
External Subroutines
Windowing
Functions
Trigger
Ranking
OLAP
Recursive Queries
Reduction To Schemas
Reduction To Schemas
Entity Set Corelations
Relation Schema
Entity Sets
Composite Attributes
Multivalued Attributes
Relationship Sets
Normalisation
Normalisation
Normalisation Theory, Dependencies
Anomalies
Design Guidelines
Lossy And Lossless Decompositions
Normalisation
First Normal Form (1NF)
Third Normal Form (3NF)
Second Normal Form (2NF)
Boyce-codd Normal Form
Keys And Attributes
Storage - Software
Storage - Software
File Organisation
Fixed-length Records
Variable-length Records
Sequential File Organisation
Clustering And Partitioning
Data Dictionary
Buffer-block Replacement Policies
Buffer
Column-oriented Storage
Storage - Hardware
Storage - Hardware
Introduction
Hard Disks
Disk Performance
RAID Level 0
RAID Level 1
RAID Level 5
Choice Of RAID Level
Optimisations
Disk Controller
RAID
RAID Level 6
Parallelism In RAID
Complex Datatypes
Complex Datatypes
Semi-structured Data
JSON
XML
Resource Description Format
Object-oriented Database
Textual Data
Hyperlink Ranking
Spatial Data
Hash-join
Indexing And Hashing
Indexing And Hashing
Ordered Indices
Indices
Dense And Sparse Indices
Index Update Algorithms
Operations On B+ Trees
Tree Building
Hashing
Index In SQL
Bitmap Indices
B+ Tree
Transactions
Transactions
Transaction
States Of Transaction
Recoverability
Concurrency
Weak Consistency
SQL-92 Levels Consistency
Serialisability
Schedule
Optimisation Algorithms
Optimisation Algorithms
EXPLAIN
EXPLAIN
Table of contents
Explain
Join
Indexed Nested Loop Join
Merge-join
Multi-query Optimisation
Evaluation Plans
Query Cost
File Scan
Index Scans
Comparison Selections
Conjunctive And Disjunctive Selections
Sorting
CSE222 ADA
CSE222 ADA
Index
Divide And Conquer
Divide And Conquer
Minimum Distances
Recurrences, Master Theorem
Selection
Inversion Counting
Dynamic Programming
Dynamic Programming
Balls Maximisation
Knapsack
Matrix Chaining
Sequence Alignment
Greedy Algorithms
Greedy Algorithms
Maximum Element Count
Minimal Partitioning
Minimum Weighted Completion Time
Graph Algorithms
Graph Algorithms
Depth First Search
Bridge Edge Detection
Dijkstra's Algorithm
Bellman-ford Algorithm
Kruskal's Algorithm
Home
Table of contents
Explain
EXPLAIN
¶
Explain
¶
The explain keyword outputs the execution plan provided by the query optimiser.