Submit Search
Upload
Ch13
•
0 likes
•
484 views
S
Subhankar Chowdhury
Follow
Data base Chapter 13
Read less
Read more
Education
Report
Share
Report
Share
1 of 55
Download now
Download to read offline
Recommended
Ch13
Ch13
Welly Dian Astika
No more struggles with Apache Spark workloads in production
No more struggles with Apache Spark workloads in production
Chetan Khatri
Writing MapReduce Programs using Java | Big Data Hadoop Spark Tutorial | Clou...
Writing MapReduce Programs using Java | Big Data Hadoop Spark Tutorial | Clou...
CloudxLab
Perly Parallel Processing of Fixed Width Data Records
Perly Parallel Processing of Fixed Width Data Records
Workhorse Computing
Introduction to Spark
Introduction to Spark
Sriram Kailasam
Unsupervised Learning with Apache Spark
Unsupervised Learning with Apache Spark
DB Tsai
Cs341
Cs341
Serghei Urban
Data Structures and Performance for Scientific Computing with Hadoop and Dumb...
Data Structures and Performance for Scientific Computing with Hadoop and Dumb...
Austin Benson
Recommended
Ch13
Ch13
Welly Dian Astika
No more struggles with Apache Spark workloads in production
No more struggles with Apache Spark workloads in production
Chetan Khatri
Writing MapReduce Programs using Java | Big Data Hadoop Spark Tutorial | Clou...
Writing MapReduce Programs using Java | Big Data Hadoop Spark Tutorial | Clou...
CloudxLab
Perly Parallel Processing of Fixed Width Data Records
Perly Parallel Processing of Fixed Width Data Records
Workhorse Computing
Introduction to Spark
Introduction to Spark
Sriram Kailasam
Unsupervised Learning with Apache Spark
Unsupervised Learning with Apache Spark
DB Tsai
Cs341
Cs341
Serghei Urban
Data Structures and Performance for Scientific Computing with Hadoop and Dumb...
Data Structures and Performance for Scientific Computing with Hadoop and Dumb...
Austin Benson
Map/Reduce intro
Map/Reduce intro
CARLOS III UNIVERSITY OF MADRID
The Pregel Programming Model with Spark GraphX
The Pregel Programming Model with Spark GraphX
Andrea Iacono
Mapreduce by examples
Mapreduce by examples
Andrea Iacono
Hadoop exercise
Hadoop exercise
Subhas Kumar Ghosh
Distributed approximate spectral clustering for large scale datasets
Distributed approximate spectral clustering for large scale datasets
Bita Kazemi
Temporal Pattern Mining
Temporal Pattern Mining
Prakhar Dhama
Scalable and Adaptive Graph Querying with MapReduce
Scalable and Adaptive Graph Querying with MapReduce
Kyong-Ha Lee
Introduction to Map-Reduce
Introduction to Map-Reduce
Brendan Tierney
Apache Tajo: Query Optimization Techniques and JIT-based Vectorized Engine
Apache Tajo: Query Optimization Techniques and JIT-based Vectorized Engine
DataWorks Summit
SASUM: A Sharing-based Approach to Fast Approximate Subgraph Matching for Lar...
SASUM: A Sharing-based Approach to Fast Approximate Subgraph Matching for Lar...
Kyong-Ha Lee
CS 542 -- Query Execution
CS 542 -- Query Execution
J Singh
Db2425082511
Db2425082511
IJMER
Using SweetSpotSimilarity for Solr Fulltext Indexing
Using SweetSpotSimilarity for Solr Fulltext Indexing
Jay Luker
Apache Solr as a compressed, scalable, and high performance time series database
Apache Solr as a compressed, scalable, and high performance time series database
Florian Lautenschlager
Run time administration
Run time administration
Arjun Srivastava
Unit 2 part-2
Unit 2 part-2
vishal choudhary
Mapreduce Algorithms
Mapreduce Algorithms
Amund Tveit
Unit 3 writable collections
Unit 3 writable collections
vishal choudhary
Aug17presentation.v2 2009-aug09-lblc sseminar
Aug17presentation.v2 2009-aug09-lblc sseminar
balmanme
Os5
Os5
gopal10scs185
RDBMS, theory class - 1 (UIU CSI 221)
RDBMS, theory class - 1 (UIU CSI 221)
Muhammad T Q Nafis
Ch9
Ch9
Subhankar Chowdhury
More Related Content
What's hot
Map/Reduce intro
Map/Reduce intro
CARLOS III UNIVERSITY OF MADRID
The Pregel Programming Model with Spark GraphX
The Pregel Programming Model with Spark GraphX
Andrea Iacono
Mapreduce by examples
Mapreduce by examples
Andrea Iacono
Hadoop exercise
Hadoop exercise
Subhas Kumar Ghosh
Distributed approximate spectral clustering for large scale datasets
Distributed approximate spectral clustering for large scale datasets
Bita Kazemi
Temporal Pattern Mining
Temporal Pattern Mining
Prakhar Dhama
Scalable and Adaptive Graph Querying with MapReduce
Scalable and Adaptive Graph Querying with MapReduce
Kyong-Ha Lee
Introduction to Map-Reduce
Introduction to Map-Reduce
Brendan Tierney
Apache Tajo: Query Optimization Techniques and JIT-based Vectorized Engine
Apache Tajo: Query Optimization Techniques and JIT-based Vectorized Engine
DataWorks Summit
SASUM: A Sharing-based Approach to Fast Approximate Subgraph Matching for Lar...
SASUM: A Sharing-based Approach to Fast Approximate Subgraph Matching for Lar...
Kyong-Ha Lee
CS 542 -- Query Execution
CS 542 -- Query Execution
J Singh
Db2425082511
Db2425082511
IJMER
Using SweetSpotSimilarity for Solr Fulltext Indexing
Using SweetSpotSimilarity for Solr Fulltext Indexing
Jay Luker
Apache Solr as a compressed, scalable, and high performance time series database
Apache Solr as a compressed, scalable, and high performance time series database
Florian Lautenschlager
Run time administration
Run time administration
Arjun Srivastava
Unit 2 part-2
Unit 2 part-2
vishal choudhary
Mapreduce Algorithms
Mapreduce Algorithms
Amund Tveit
Unit 3 writable collections
Unit 3 writable collections
vishal choudhary
Aug17presentation.v2 2009-aug09-lblc sseminar
Aug17presentation.v2 2009-aug09-lblc sseminar
balmanme
Os5
Os5
gopal10scs185
What's hot
(20)
Map/Reduce intro
Map/Reduce intro
The Pregel Programming Model with Spark GraphX
The Pregel Programming Model with Spark GraphX
Mapreduce by examples
Mapreduce by examples
Hadoop exercise
Hadoop exercise
Distributed approximate spectral clustering for large scale datasets
Distributed approximate spectral clustering for large scale datasets
Temporal Pattern Mining
Temporal Pattern Mining
Scalable and Adaptive Graph Querying with MapReduce
Scalable and Adaptive Graph Querying with MapReduce
Introduction to Map-Reduce
Introduction to Map-Reduce
Apache Tajo: Query Optimization Techniques and JIT-based Vectorized Engine
Apache Tajo: Query Optimization Techniques and JIT-based Vectorized Engine
SASUM: A Sharing-based Approach to Fast Approximate Subgraph Matching for Lar...
SASUM: A Sharing-based Approach to Fast Approximate Subgraph Matching for Lar...
CS 542 -- Query Execution
CS 542 -- Query Execution
Db2425082511
Db2425082511
Using SweetSpotSimilarity for Solr Fulltext Indexing
Using SweetSpotSimilarity for Solr Fulltext Indexing
Apache Solr as a compressed, scalable, and high performance time series database
Apache Solr as a compressed, scalable, and high performance time series database
Run time administration
Run time administration
Unit 2 part-2
Unit 2 part-2
Mapreduce Algorithms
Mapreduce Algorithms
Unit 3 writable collections
Unit 3 writable collections
Aug17presentation.v2 2009-aug09-lblc sseminar
Aug17presentation.v2 2009-aug09-lblc sseminar
Os5
Os5
Viewers also liked
RDBMS, theory class - 1 (UIU CSI 221)
RDBMS, theory class - 1 (UIU CSI 221)
Muhammad T Q Nafis
Ch9
Ch9
Subhankar Chowdhury
Recommender systems using collaborative filtering
Recommender systems using collaborative filtering
D Yogendra Rao
BIS05 Introduction to SQL
BIS05 Introduction to SQL
Prithwis Mukerjee
Query processing and Query Optimization
Query processing and Query Optimization
Niraj Gandha
Introduction to Data Warehousing
Introduction to Data Warehousing
Edureka!
Types of Database Models
Types of Database Models
Murassa Gillani
Top 5 Computer Crime's
Top 5 Computer Crime's
Mar Soriano
Data mining & data warehousing
Data mining & data warehousing
Shubha Brota Raha
DML Commands
DML Commands
Randy Riness @ South Puget Sound Community College
Collaborative Filtering and Recommender Systems By Navisro Analytics
Collaborative Filtering and Recommender Systems By Navisro Analytics
Navisro Analytics
Data warehousing and Data mining
Data warehousing and Data mining
Bahria University ,
Query processing and optimization (updated)
Query processing and optimization (updated)
Ravinder Kamboj
Computer crime
Computer crime
Anika Rahman Orin
Object oriented database model
Object oriented database model
PAQUIAAIZEL
Object Oriented Dbms
Object Oriented Dbms
maryeem
Types Of Computer Crime
Types Of Computer Crime
Alexander Zhuravlev
SQL : introduction
SQL : introduction
Shakila Mahjabin
Data models
Data models
Anuj Modi
SQL Basics
SQL Basics
Hammad Rasheed
Viewers also liked
(20)
RDBMS, theory class - 1 (UIU CSI 221)
RDBMS, theory class - 1 (UIU CSI 221)
Ch9
Ch9
Recommender systems using collaborative filtering
Recommender systems using collaborative filtering
BIS05 Introduction to SQL
BIS05 Introduction to SQL
Query processing and Query Optimization
Query processing and Query Optimization
Introduction to Data Warehousing
Introduction to Data Warehousing
Types of Database Models
Types of Database Models
Top 5 Computer Crime's
Top 5 Computer Crime's
Data mining & data warehousing
Data mining & data warehousing
DML Commands
DML Commands
Collaborative Filtering and Recommender Systems By Navisro Analytics
Collaborative Filtering and Recommender Systems By Navisro Analytics
Data warehousing and Data mining
Data warehousing and Data mining
Query processing and optimization (updated)
Query processing and optimization (updated)
Computer crime
Computer crime
Object oriented database model
Object oriented database model
Object Oriented Dbms
Object Oriented Dbms
Types Of Computer Crime
Types Of Computer Crime
SQL : introduction
SQL : introduction
Data models
Data models
SQL Basics
SQL Basics
Similar to Ch13
Algorithm ch13.ppt
Algorithm ch13.ppt
Dreamless2
VNSISPL_DBMS_Concepts_ch13
VNSISPL_DBMS_Concepts_ch13
sriprasoon
Korth_Query_processing.pptx
Korth_Query_processing.pptx
DrSonuMittal
ch12.ppt
ch12.ppt
rsingh5987
1a_query_processing_sil_7ed_ch15.ppt
1a_query_processing_sil_7ed_ch15.ppt
rsingh5987
1a_query_processing_sil_7ed_ch15.pptx
1a_query_processing_sil_7ed_ch15.pptx
DrSonuMittal
ch13
ch13
KITE www.kitecolleges.com
Ch21
Ch21
Subhankar Chowdhury
Lesson11 transactions
Lesson11 transactions
teddy demissie
Ch12
Ch12
Subhankar Chowdhury
Query processing System
Query processing System
Department of Computer Science, Bharathidasan University, Tiruchirappalli
Ch19
Ch19
Subhankar Chowdhury
Introduction To DBMS
Introduction To DBMS
rafat_mentor
Large-Scale Text Processing Pipeline with Spark ML and GraphFrames: Spark Sum...
Large-Scale Text Processing Pipeline with Spark ML and GraphFrames: Spark Sum...
Spark Summit
Ch1
Ch1
nishant choudhari
Ch1
Ch1
Subhankar Chowdhury
Ch4
Ch4
Subhankar Chowdhury
Overview of query evaluation
Overview of query evaluation
avniS
13. Query Processing in DBMS
13. Query Processing in DBMS
koolkampus
Ch23
Ch23
Anirudh Sriram
Similar to Ch13
(20)
Algorithm ch13.ppt
Algorithm ch13.ppt
VNSISPL_DBMS_Concepts_ch13
VNSISPL_DBMS_Concepts_ch13
Korth_Query_processing.pptx
Korth_Query_processing.pptx
ch12.ppt
ch12.ppt
1a_query_processing_sil_7ed_ch15.ppt
1a_query_processing_sil_7ed_ch15.ppt
1a_query_processing_sil_7ed_ch15.pptx
1a_query_processing_sil_7ed_ch15.pptx
ch13
ch13
Ch21
Ch21
Lesson11 transactions
Lesson11 transactions
Ch12
Ch12
Query processing System
Query processing System
Ch19
Ch19
Introduction To DBMS
Introduction To DBMS
Large-Scale Text Processing Pipeline with Spark ML and GraphFrames: Spark Sum...
Large-Scale Text Processing Pipeline with Spark ML and GraphFrames: Spark Sum...
Ch1
Ch1
Ch1
Ch1
Ch4
Ch4
Overview of query evaluation
Overview of query evaluation
13. Query Processing in DBMS
13. Query Processing in DBMS
Ch23
Ch23
More from Subhankar Chowdhury
Ch20
Ch20
Subhankar Chowdhury
Ch17
Ch17
Subhankar Chowdhury
Ch16
Ch16
Subhankar Chowdhury
Ch15
Ch15
Subhankar Chowdhury
Ch14
Ch14
Subhankar Chowdhury
Ch11
Ch11
Subhankar Chowdhury
Ch10
Ch10
Subhankar Chowdhury
Ch8
Ch8
Subhankar Chowdhury
Ch7
Ch7
Subhankar Chowdhury
Ch6
Ch6
Subhankar Chowdhury
Ch5
Ch5
Subhankar Chowdhury
Ch3
Ch3
Subhankar Chowdhury
Ch2
Ch2
Subhankar Chowdhury
Ch22
Ch22
Subhankar Chowdhury
More from Subhankar Chowdhury
(14)
Ch20
Ch20
Ch17
Ch17
Ch16
Ch16
Ch15
Ch15
Ch14
Ch14
Ch11
Ch11
Ch10
Ch10
Ch8
Ch8
Ch7
Ch7
Ch6
Ch6
Ch5
Ch5
Ch3
Ch3
Ch2
Ch2
Ch22
Ch22
Recently uploaded
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
National Information Standards Organization (NISO)
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13
Steve Thomason
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory Inspection
SafetyChain Software
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
dawncurless
Sanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdf
sanyamsingh5019
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
Maestría en Comunicación Digital Interactiva - UNR
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
ciinovamais
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
QucHHunhnh
Web & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdf
Jayanti Pande
Sports & Fitness Value Added Course FY..
Sports & Fitness Value Added Course FY..
Disha Kariya
1029 - Danh muc Sach Giao Khoa 10 . pdf
1029 - Danh muc Sach Giao Khoa 10 . pdf
QucHHunhnh
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
SoniaTolstoy
JAPAN: ORGANISATION OF PMDA, PHARMACEUTICAL LAWS & REGULATIONS, TYPES OF REGI...
JAPAN: ORGANISATION OF PMDA, PHARMACEUTICAL LAWS & REGULATIONS, TYPES OF REGI...
anjaliyadav012327
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
GeoBlogs
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
VS Mahajan Coaching Centre
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
eniolaolutunde
Arihant handbook biology for class 11 .pdf
Arihant handbook biology for class 11 .pdf
chloefrazer622
Interactive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communication
nomboosow
Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3
JemimahLaneBuaron
9548086042 for call girls in Indira Nagar with room service
9548086042 for call girls in Indira Nagar with room service
discovermytutordmt
Recently uploaded
(20)
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
The Most Excellent Way | 1 Corinthians 13
The Most Excellent Way | 1 Corinthians 13
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory Inspection
Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
Sanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdf
Código Creativo y Arte de Software | Unidad 1
Código Creativo y Arte de Software | Unidad 1
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
Web & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdf
Sports & Fitness Value Added Course FY..
Sports & Fitness Value Added Course FY..
1029 - Danh muc Sach Giao Khoa 10 . pdf
1029 - Danh muc Sach Giao Khoa 10 . pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
BASLIQ CURRENT LOOKBOOK LOOKBOOK(1) (1).pdf
JAPAN: ORGANISATION OF PMDA, PHARMACEUTICAL LAWS & REGULATIONS, TYPES OF REGI...
JAPAN: ORGANISATION OF PMDA, PHARMACEUTICAL LAWS & REGULATIONS, TYPES OF REGI...
Paris 2024 Olympic Geographies - an activity
Paris 2024 Olympic Geographies - an activity
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
Arihant handbook biology for class 11 .pdf
Arihant handbook biology for class 11 .pdf
Interactive Powerpoint_How to Master effective communication
Interactive Powerpoint_How to Master effective communication
Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3
9548086042 for call girls in Indira Nagar with room service
9548086042 for call girls in Indira Nagar with room service
Ch13
1.
Chapter 13: Query Processing
Aug 10, 2006 Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See www.dbbook.com for conditions on reuse
2.
Chapter 13: Query Processing
s Overview s Measures of Query Cost s Selection Operation s Sorting s Join Operation s Other Operations s Evaluation of Expressions Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
3.
Basic Steps in Query Processing
1. Parsing and translation 2. Optimization 3. Evaluation Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
4.
Basic Steps in Query Processing
(Cont.) s Parsing and translation q translate the query into its internal form. This is then translated into relational algebra. q Parser checks syntax, verifies relations s Evaluation q The queryexecution engine takes a queryevaluation plan, executes that plan, and returns the answers to the query. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
5.
Basic Steps in Query Processing :
Optimization s A relational algebra expression may have many equivalent expressions q E.g., σbalance<2500(∏balance(account)) is equivalent to ∏balance(σbalance<2500(account)) s Each relational algebra operation can be evaluated using one of several different algorithms q Correspondingly, a relationalalgebra expression can be evaluated in many ways. s Annotated expression specifying detailed evaluation strategy is called an evaluationplan. q E.g., can use an index on balance to find accounts with balance < 2500, q or can perform complete relation scan and discard accounts with balance ≥ 2500 Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
6.
Basic Steps: Optimization (Cont.)
s Query Optimization: Amongst all equivalent evaluation plans choose the one with lowest cost. q Cost is estimated using statistical information from the database catalog e.g. number of tuples in each relation, size of tuples, etc. s In this chapter we study q How to measure query costs q Algorithms for evaluating relational algebra operations q How to combine algorithms for individual operations in order to evaluate a complete expression s In Chapter 14 q We study how to optimize queries, that is, how to find an evaluation plan with lowest estimated cost Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
7.
Measures of Query Cost
s Cost is generally measured as total elapsed time for answering query q Many factors contribute to time cost disk accesses, CPU, or even network communication s Typically disk access is the predominant cost, and is also relatively easy to estimate. Measured by taking into account q Number of seeks * averageseekcost + Number of blocks read * averageblockreadcost + Number of blocks written * averageblockwritecost Cost to write a block is greater than cost to read a block – data is read back after being written to ensure that the write was successful q Assumption: single disk Can modify formulae for multiple disks/RAID arrays Or just use singledisk formulae, but interpret them as measuring resource consumption instead of time Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
8.
Measures of Query Cost (Cont.)
s For simplicity we just use the number of block transfers from disk and the number of seeks as the cost measures q tT – time to transfer one block q tS – time for one seek q Cost for b block transfers plus S seeks b * tT + S * tS s We ignore CPU costs for simplicity q Real systems do take CPU cost into account s We do not include cost to writing output to disk in our cost formulae s Several algorithms can reduce disk IO by using extra buffer space q Amount of real memory available to buffer depends on other concurrent queries and OS processes, known only during execution We often use worst case estimates, assuming only the minimum amount of memory needed for the operation is available s Required data may be buffer resident already, avoiding disk I/O q But hard to take into account for cost estimation Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
9.
Selection Operation
s File scan – search algorithms that locate and retrieve records that fulfill a selection condition. s Algorithm A1 (linear search). Scan each file block and test all records to see whether they satisfy the selection condition. q Cost estimate = br block transfers + 1 seek br denotes number of blocks containing records from relation r q If selection is on a key attribute, can stop on finding record cost = (br /2) block transfers + 1 seek q Linear search can be applied regardless of selection condition or ordering of records in the file, or availability of indices Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
10.
Selection Operation (Cont.)
s A2 (binary search). Applicable if selection is an equality comparison on the attribute on which file is ordered. q Assume that the blocks of a relation are stored contiguously q Cost estimate (number of disk blocks to be scanned): cost of locating the first tuple by a binary search on the blocks log2(br) * (tT + tS) If there are multiple records satisfying selection – Add transfer cost of the number of blocks containing records that satisfy selection condition – Will see how to estimate this cost in Chapter 14 Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
11.
Selections Using Indices
s Index scan – search algorithms that use an index q selection condition must be on searchkey of index. s A3 (primary index on candidate key, equality). Retrieve a single record that satisfies the corresponding equality condition q Cost = (hi + 1) * (tT + tS) s A4 (primary index on nonkey, equality) Retrieve multiple records. q Records will be on consecutive blocks Let b = number of blocks containing matching records q Cost = hi * (tT + tS) + tS + tT * b s A5 (equality on searchkey of secondary index). q Retrieve a single record if the searchkey is a candidate key Cost = (h + 1) * (t + t ) i T S q Retrieve multiple records if searchkey is not a candidate key each of n matching records may be on a different block Cost = (hi + n) * (tT + tS) – Can be very expensive! Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
12.
Selections Involving Comparisons
s Can implement selections of the form σA≤V (r) or σA ≥ V(r) by using q a linear file scan or binary search, q or by using indices in the following ways: s A6 (primary index, comparison). (Relation is sorted on A) For σA ≥ V(r) use index to find first tuple ≥ v and scan relation sequentially from there For σA≤V (r) just scan relation sequentially till first tuple > v; do not use index s A7 (secondary index, comparison). For σA ≥ V(r) use index to find first index entry ≥ v and scan index sequentially from there, to find pointers to records. For σA≤V (r) just scan leaf pages of index finding pointers to records, till first entry > v In either case, retrieve records that are pointed to – requires an I/O for each record – Linear file scan may be cheaper Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
13.
Implementation of Complex Selections
s Conjunction: σθ1∧ θ2∧. . . θn(r) s A8 (conjunctive selection using one index). q Select a combination of θi and algorithms A1 through A7 that results in the least cost for σθi (r). q Test other conditions on tuple after fetching it into memory buffer. s A9 (conjunctive selection using multiplekey index). q Use appropriate composite (multiplekey) index if available. s A10 (conjunctive selection by intersection of identifiers). q Requires indices with record pointers. q Use corresponding index for each condition, and take intersection of all the obtained sets of record pointers. q Then fetch records from file q If some conditions do not have appropriate indices, apply test in memory. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
14.
Algorithms for Complex Selections
s Disjunction:σθ1∨ θ2 ∨. . . θn (r). s A11 (disjunctive selection by union of identifiers). q Applicable if all conditions have available indices. Otherwise use linear scan. q Use corresponding index for each condition, and take union of all the obtained sets of record pointers. q Then fetch records from file s Negation: σ¬θ(r) q Use linear scan on file q If very few records satisfy ¬θ, and an index is applicable to θ Find satisfying records using index and fetch from file Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
15.
Sorting
s We may build an index on the relation, and then use the index to read the relation in sorted order. May lead to one disk block access for each tuple. s For relations that fit in memory, techniques like quicksort can be used. For relations that don’t fit in memory, external sortmerge is a good choice. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
16.
External SortMerge
Let M denote memory size (in pages). 1. Create sorted runs. Let i be 0 initially. Repeatedly do the following till the end of the relation: (a) Read M blocks of relation into memory (b) Sort the inmemory blocks (c) Write sorted data to run Ri; increment i. Let the final value of i be N 2. Merge the runs (next slide)….. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
17.
External SortMerge (Cont.)
1. Merge the runs (Nway merge). We assume (for now) that N < M. 1. Use N blocks of memory to buffer input runs, and 1 block to buffer output. Read the first block of each run into its buffer page 2. repeat 1. Select the first record (in sort order) among all buffer pages 2. Write the record to the output buffer. If the output buffer is full write it to disk. 3. Delete the record from its input buffer page. If the buffer page becomes empty then read the next block (if any) of the run into the buffer. 3. until all input buffer pages are empty: Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
18.
External SortMerge (Cont.)
s If N ≥ M, several merge passes are required. q In each pass, contiguous groups of M 1 runs are merged. q A pass reduces the number of runs by a factor of M 1, and creates runs longer by the same factor. E.g. If M=11, and there are 90 runs, one pass reduces the number of runs to 9, each 10 times the size of the initial runs q Repeated passes are performed till all runs have been merged into one. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
19.
Example: External Sorting Using SortMerge Database System Concepts 5th Edition.
13.<number> ©Silberschatz, Korth and Sudarshan
20.
External Merge Sort (Cont.)
s Cost analysis: q Total number of merge passes required: logM–1(br/M). q Block transfers for initial run creation as well as in each pass is 2br for final pass, we don’t count write cost – we ignore final write cost for all operations since the output of an operation may be sent to the parent operation without being written to disk Thus total number of block transfers for external sorting: br ( 2 logM–1(br / M) + 1) q Seeks: next slide Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
21.
External Merge Sort (Cont.)
s Cost of seeks q During run generation: one seek to read each run and one seek to write each run 2 br / M q During the merge phase Buffer size: bb (read/write bb blocks at a time) Need 2 br / bb seeks for each merge pass – except the final one which does not require a write Total number of seeks: 2 br / M + br / bb (2 logM–1(br / M) 1) Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
22.
Join Operation
s Several different algorithms to implement joins q Nestedloop join q Block nestedloop join q Indexed nestedloop join q Mergejoin q Hashjoin s Choice based on cost estimate s Examples use the following information q Number of records of customer: 10,000 depositor: 5000 q Number of blocks of customer: 400 depositor: 100 Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
23.
NestedLoop Join
s To compute the theta join r θ s for each tuple tr in r do begin for each tuple ts in s do begin test pair (tr,ts) to see if they satisfy the join condition θ if they do, add tr • ts to the result. end end s r is called the outer relation and s the inner relation of the join. s Requires no indices and can be used with any kind of join condition. s Expensive since it examines every pair of tuples in the two relations. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
24.
NestedLoop Join (Cont.)
s In the worst case, if there is enough memory only to hold one block of each relation, the estimated cost is nr ∗ bs + br block transfers, plus nr + br seeks s If the smaller relation fits entirely in memory, use that as the inner relation. q Reduces cost to br + bs block transfers and 2 seeks s Assuming worst case memory availability cost estimate is q with depositor as outer relation: 5000 ∗ 400 + 100 = 2,000,100 block transfers, 5000 + 100 = 5100 seeks q with customer as the outer relation 10000 ∗ 100 + 400 = 1,000,400 block transfers and 10,400 seeks s If smaller relation (depositor) fits entirely in memory, the cost estimate will be 500 block transfers. s Block nestedloops algorithm (next slide) is preferable. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
25.
Block NestedLoop Join
s Variant of nestedloop join in which every block of inner relation is paired with every block of outer relation. for each block Br of r do begin for each block Bs of s do begin for each tuple tr in Br do begin for each tuple ts in Bs do begin Check if (tr,ts) satisfy the join condition if they do, add tr • ts to the result. end end end end Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
26.
Block NestedLoop Join (Cont.)
s Worst case estimate: br ∗ bs + br block transfers + 2 * br seeks q Each block in the inner relation s is read once for each block in the outer relation (instead of once for each tuple in the outer relation s Best case: br + bs block transfers + 2 seeks. s Improvements to nested loop and block nested loop algorithms: q In block nestedloop, use M — 2 disk blocks as blocking unit for outer relations, where M = memory size in blocks; use remaining two blocks to buffer inner relation and output Cost = br / (M2) ∗ bs + br block transfers + 2 br / (M2) seeks q If equijoin attribute forms a key on inner relation, stop inner loop on first match q Scan inner loop forward and backward alternately, to make use of the blocks remaining in buffer (with LRU replacement) q Use index on inner relation if available (next slide) Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
27.
Indexed NestedLoop Join
s Index lookups can replace file scans if q join is an equijoin or natural join and q an index is available on the inner relation’s join attribute Can construct an index just to compute a join. s For each tuple tr in the outer relation r, use the index to look up tuples in s that satisfy the join condition with tuple tr. s Worst case: buffer has space for only one page of r, and, for each tuple in r, we perform an index lookup on s. s Cost of the join: br (tT + tS) + nr ∗ c q Where c is the cost of traversing index and fetching all matching s tuples for one tuple or r q c can be estimated as cost of a single selection on s using the join condition. s If indices are available on join attributes of both r and s, use the relation with fewer tuples as the outer relation. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
28.
Example of NestedLoop Join Costs
s Compute depositor customer, with depositor as the outer relation. s Let customer have a primary B+tree index on the join attribute customername, which contains 20 entries in each index node. s Since customer has 10,000 tuples, the height of the tree is 4, and one more access is needed to find the actual data s depositor has 5000 tuples s Cost of block nested loops join q 400*100 + 100 = 40,100 block transfers + 2 * 100 = 200 seeks assuming worst case memory may be significantly less with more memory s Cost of indexed nested loops join q 100 + 5000 * 5 = 25,100 block transfers and seeks. q CPU cost likely to be less than that for block nested loops join Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
29.
MergeJoin
1. Sort both relations on their join attribute (if not already sorted on the join attributes). 2. Merge the sorted relations to join them 1. Join step is similar to the merge stage of the sortmerge algorithm. 2. Main difference is handling of duplicate values in join attribute — every pair with same value on join attribute must be matched 3. Detailed algorithm in book Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
30.
MergeJoin (Cont.)
s Can be used only for equijoins and natural joins s Each block needs to be read only once (assuming all tuples for any given value of the join attributes fit in memory s Thus the cost of merge join is: br + bs block transfers + br / bb + bs / bb seeks q + the cost of sorting if relations are unsorted. s hybrid mergejoin: If one relation is sorted, and the other has a secondary B+tree index on the join attribute q Merge the sorted relation with the leaf entries of the B+tree . q Sort the result on the addresses of the unsorted relation’s tuples q Scan the unsorted relation in physical address order and merge with previous result, to replace addresses by the actual tuples Sequential scan more efficient than random lookup Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
31.
HashJoin
s Applicable for equijoins and natural joins. s A hash function h is used to partition tuples of both relations q Intuition: partitions fit in memory s h maps JoinAttrs values to {0, 1, ..., n}, where JoinAttrs denotes the common attributes of r and s used in the natural join. q r0, r1, . . ., rn denote partitions of r tuples Each tuple tr ∈ r is put in partition ri where i = h(tr [JoinAttrs]). q r0,, r1. . ., rn denotes partitions of s tuples Each tuple ts ∈s is put in partition si, where i = h(ts [JoinAttrs]). s Note: In book, r is denoted as Hri, s is denoted as Hsi and i i n is denoted as nh. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
32.
HashJoin (Cont.) Database System Concepts 5th Edition.
13.<number> ©Silberschatz, Korth and Sudarshan
33.
HashJoin (Cont.)
s r tuples in ri need only to be compared with s tuples in si Need not be compared with s tuples in any other partition, since: q an r tuple and an s tuple that satisfy the join condition will have the same value for the join attributes. q If that value is hashed to some value i, the r tuple has to be in ri and the s tuple in si. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
34.
HashJoin Algorithm
The hashjoin of r and s is computed as follows. 1. Partition the relation s using hashing function h. 1. When partitioning a relation, one block of memory is reserved as the output buffer for each partition, and one block for input 2. If extra memory is available, allocate bb blocks as buffer for input and each output 2. Partition r similarly. 3. … next slide .. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
35.
Hash Join (Cont.)
Hash Join Algorithm (cont) 1. For each partition i: (a) Load si into memory and build an inmemory hash index on it using the join attribute. q This hash index uses a different hash function than the earlier one h. (b) Read the tuples in ri from the disk one by one. q For each tuple tr probe the inmemory hash index to find all matching tuples ts in si q For each matching tuple ts in si q output the concatenation of the attributes of tr and ts Relation s is called the build input and r is called the probe input. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
36.
HashJoin algorithm (Cont.)
s The value n and the hash function h is chosen such that each si should fit in memory. q Typically n is chosen as bs/M * f where f is a “fudge factor”, typically around 1.2 q The probe relation partitions si need not fit in memory s Recursive partitioning required if number of partitions n is greater than number of pages M of memory. q instead of partitioning n ways, use M – 1 partitions for s q Further partition the M – 1 partitions using a different hash function q Use same partitioning method on r q Rarely required: e.g., recursive partitioning not needed for relations of 1GB or less with memory size of 2MB, with block size of 4KB. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
37.
Handling of Overflows
s Partitioning is said to be skewed if some partitions have significantly more tuples than some others s Hashtable overflow occurs in partition si if si does not fit in memory. Reasons could be q Many tuples in s with same value for join attributes q Bad hash function s Overflow resolution can be done in build phase q Partition si is further partitioned using different hash function. q Partition ri must be similarly partitioned. s Overflow avoidance performs partitioning carefully to avoid overflows during build phase q E.g. partition build relation into many partitions, then combine them s Both approaches fail with large numbers of duplicates q Fallback option: use block nested loops join on overflowed partitions Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
38.
Cost of HashJoin
s If recursive partitioning is not required: cost of hash join is 3(br + bs) +4 ∗ nh block transfers + 2( br / bb + bs / bb) seeks s If recursive partitioning required: q number of passes required for partitioning build relation s is logM–1(bs) – 1 q best to choose the smaller relation as the build relation. q Total cost estimate is: 2(br + bs logM–1(bs) – 1 + br + bs block transfers + 2(br / bb + bs / bb) logM–1(bs) – 1 seeks s If the entire build input can be kept in main memory no partitioning is required q Cost estimate goes down to br + bs. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
39.
Example of Cost of HashJoin
customer depositor s Assume that memory size is 20 blocks s bdepositor= 100 and bcustomer = 400. s depositor is to be used as build input. Partition it into five partitions, each of size 20 blocks. This partitioning can be done in one pass. s Similarly, partition customer into five partitions,each of size 80. This is also done in one pass. s Therefore total cost, ignoring cost of writing partially filled blocks: q 3(100 + 400) = 1500 block transfers + 2( 100/3 + 400/3) = 336 seeks Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
40.
Hybrid Hash–Join
s Useful when memory sized are relatively large, and the build input is bigger than memory. s Main feature of hybrid hash join: Keep the first partition of the build relation in memory. s E.g. With memory size of 25 blocks, depositor can be partitioned into five partitions, each of size 20 blocks. q Division of memory: The first partition occupies 20 blocks of memory 1 block is used for input, and 1 block each for buffering the other 4 partitions. s customer is similarly partitioned into five partitions each of size 80 q the first is used right away for probing, instead of being written out s Cost of 3(80 + 320) + 20 +80 = 1300 block transfers for hybrid hash join, instead of 1500 with plain hashjoin. s Hybrid hashjoin most useful if M >> bs Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
41.
Complex Joins
s Join with a conjunctive condition: r θ1∧ θ 2∧... ∧ θ n s q Either use nested loops/block nested loops, or q Compute the result of one of the simpler joins r θi s final result comprises those tuples in the intermediate result that satisfy the remaining conditions θ1 ∧ . . . ∧ θi –1 ∧ θi +1 ∧ . . . ∧ θn s Join with a disjunctive condition r θ1 ∨ θ2 ∨... ∨ θn s q Either use nested loops/block nested loops, or q Compute as the union of the records in individual joins r θ i s: (r θ1 s) ∪ (r θ2 s) ∪ . . . ∪ (r θn s) (applies only to the set version of union!) Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
42.
Other Operations
s Duplicate elimination can be implemented via hashing or sorting. q On sorting duplicates will come adjacent to each other, and all but one set of duplicates can be deleted. q Optimization: duplicates can be deleted during run generation as well as at intermediate merge steps in external sortmerge. q Hashing is similar – duplicates will come into the same bucket. s Projection: q perform projection on each tuple q followed by duplicate elimination. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
43.
Other Operations : Aggregation
s Aggregation can be implemented in a manner similar to duplicate elimination. q Sorting or hashing can be used to bring tuples in the same group together, and then the aggregate functions can be applied on each group. q Optimization: combine tuples in the same group during run generation and intermediate merges, by computing partial aggregate values For count, min, max, sum: keep aggregate values on tuples found so far in the group. – When combining partial aggregate for count, add up the aggregates For avg, keep sum and count, and divide sum by count at the end Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
44.
Other Operations : Set Operations
s Set operations (∪, ∩ and ): can either use variant of mergejoin after sorting, or variant of hashjoin. s E.g., Set operations using hashing: 1. Partition both relations using the same hash function 2. Process each partition i as follows. 1. Using a different hashing function, build an inmemory hash index on ri. 2. Process si as follows q r ∪ s: 1. Add tuples in si to the hash index if they are not already in it. 2. At end of si add the tuples in the hash index to the result. q r ∩ s: 1. output tuples in si to the result if they are already there in the hash index q r – s: 1. for each tuple in si, if it is there in the hash index, delete it from the index. 2. At end of si add remaining tuples in the hash index to the result. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
45.
Other Operations : Outer Join
s Outer join can be computed either as q A join followed by addition of nullpadded nonparticipating tuples. q by modifying the join algorithms. s Modifying merge join to compute r s q In r s, non participating tuples are those in r – ΠR(r s) q Modify mergejoin to compute r s: During merging, for every tuple tr from r that do not match any tuple in s, output tr padded with nulls. q Right outerjoin and full outerjoin can be computed similarly. s Modifying hash join to compute r s q If r is probe relation, output nonmatching r tuples padded with nulls q If r is build relation, when probing keep track of which r tuples matched s tuples. At end of si output nonmatched r tuples padded with nulls Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
46.
Evaluation of Expressions
s So far: we have seen algorithms for individual operations s Alternatives for evaluating an entire expression tree q Materialization: generate results of an expression whose inputs are relations or are already computed, materialize (store) it on disk. Repeat. q Pipelining: pass on tuples to parent operations even as an operation is being executed s We study above alternatives in more detail Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
47.
Materialization
s Materialized evaluation: evaluate one operation at a time, starting at the lowestlevel. Use intermediate results materialized into temporary relations to evaluate nextlevel operations. s E.g., in figure below, compute and store σ balance<2500 (account ) then compute the store its join with customer, and finally compute the projections on customername. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
48.
Materialization (Cont.)
s Materialized evaluation is always applicable s Cost of writing results to disk and reading them back can be quite high q Our cost formulas for operations ignore cost of writing results to disk, so Overall cost = Sum of costs of individual operations + cost of writing intermediate results to disk s Double buffering: use two output buffers for each operation, when one is full write it to disk while the other is getting filled q Allows overlap of disk writes with computation and reduces execution time Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
49.
Pipelining
s Pipelined evaluation : evaluate several operations simultaneously, passing the results of one operation on to the next. s E.g., in previous expression tree, don’t store result of σ balance< 2500 (account ) q instead, pass tuples directly to the join.. Similarly, don’t store result of join, pass tuples directly to projection. s Much cheaper than materialization: no need to store a temporary relation to disk. s Pipelining may not always be possible – e.g., sort, hashjoin. s For pipelining to be effective, use evaluation algorithms that generate output tuples even as tuples are received for inputs to the operation. s Pipelines can be executed in two ways: demand driven and producer driven Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
50.
Pipelining (Cont.)
s In demand driven or lazy evaluation q system repeatedly requests next tuple from top level operation q Each operation requests next tuple from children operations as required, in order to output its next tuple q In between calls, operation has to maintain “state” so it knows what to return next s In producerdriven or eager pipelining q Operators produce tuples eagerly and pass them up to their parents Buffer maintained between operators, child puts tuples in buffer, parent removes tuples from buffer if buffer is full, child waits till there is space in the buffer, and then generates more tuples q System schedules operations that have space in output buffer and can process more input tuples s Alternative name: pull and push models of pipelining Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
51.
Pipelining (Cont.)
s Implementation of demanddriven pipelining q Each operation is implemented as an iterator implementing the following operations open() – E.g. file scan: initialize file scan » state: pointer to beginning of file – E.g.merge join: sort relations; » state: pointers to beginning of sorted relations next() – E.g. for file scan: Output next tuple, and advance and store file pointer – E.g. for merge join: continue with merge from earlier state till next output tuple is found. Save pointers as iterator state. close() Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
52.
Evaluation Algorithms for Pipelining
s Some algorithms are not able to output results even as they get input tuples q E.g. merge join, or hash join q intermediate results written to disk and then read back s Algorithm variants to generate (at least some) results on the fly, as input tuples are read in q E.g. hybrid hash join generates output tuples even as probe relation tuples in the inmemory partition (partition 0) are read in q Pipelined join technique: Hybrid hash join, modified to buffer partition 0 tuples of both relations inmemory, reading them as they become available, and output results of any matches between partition 0 tuples When a new r0 tuple is found, match it with existing s0 tuples, output matches, and save it in r0 Symmetrically for s0 tuples Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
53.
End of Chapter Database System Concepts, 5th Ed.
©Silberschatz, Korth and Sudarshan See www.dbbook.com for conditions on reuse
54.
Figure 13.2 Database System Concepts 5th Edition.
13.<number> ©Silberschatz, Korth and Sudarshan
55.
Complex Joins
s Join involving three relations: loan depositor customer s Strategy 1. Compute depositor customer; use result to compute loan (depositor customer) s Strategy 2. Computer loan depositor first, and then join the result with customer. s Strategy 3. Perform the pair of joins at once. Build and index on loan for loannumber, and on customer for customername. q For each tuple t in depositor, look up the corresponding tuples in customer and the corresponding tuples in loan. q Each tuple of deposit is examined exactly once. s Strategy 3 combines two operations into one specialpurpose operation that is more efficient than implementing two joins of two relations. Database System Concepts 5th Edition. 13.<number> ©Silberschatz, Korth and Sudarshan
Download now