Learning objectives
What you will be able to explain
- Which statement about database pages matches the lecture slides?
- In a slotted-page layout, how is a tuple ID represented?
- What is a key consequence of column layout (DSM) highlighted in the slides?
- Which row is consistent with the 'NSM vs. DSM vs. PAX' comparison table?
- CLOCK replacement is presented as what kind of strategy?
- In CLOCK eviction search, what happens when the pointer sees a page with reference bit = 1?
Section 01
Which statement about database pages matches the lecture slides? to What is a key consequence of column layout (DSM) highlighted in the slides?
01
Which statement about database pages matches the lecture slides?
The slides state that pages are fixed-sized blocks, have a header and data portion, and each page has a unique PageID.
Source: 02_Data_Layouts.pdf, page 10
02
In a slotted-page layout, how is a tuple ID represented?
The slotted-page structure slide explicitly shows tupleID as pageID + slotID.
Source: 02_Data_Layouts.pdf, page 11
03
What is a key consequence of column layout (DSM) highlighted in the slides?
The column-layout slide states: 'Column layout requires tuple reconstruction!'.
Source: 02_Data_Layouts.pdf, page 31
Section 02
Which row is consistent with the 'NSM vs. DSM vs. PAX' comparison table? to In CLOCK eviction search, what happens when the pointer sees a page with reference bit = 1?
01
Which row is consistent with the 'NSM vs. DSM vs. PAX' comparison table?
The table lists inter-record spatial locality as No (NSM), Yes (DSM), Yes (PAX).
Source: 02_Data_Layouts.pdf, page 45
02
CLOCK replacement is presented as what kind of strategy?
The slides describe CLOCK as a commonly implemented, efficient approximation and explicitly characterize it as approximate LRU.
Source: 03_Caching.pdf, pages 20 and 25
03
In CLOCK eviction search, what happens when the pointer sees a page with reference bit = 1?
The algorithm steps say: if the page bit is 1, set it to 0 and continue rotation; if 0, evict and load.
Source: 03_Caching.pdf, page 26
Section 03
In the PostgreSQL buffer manager slide, what is the 'Buffer table' used for? to Which dynamic hash-table variants are explicitly listed in the lecture?
01
In the PostgreSQL buffer manager slide, what is the 'Buffer table' used for?
The slide states that the buffer table is a hash table for efficient lookup of stored pages by tag/content_id.
Source: 03_Caching.pdf, page 32
02
For hash-table indexing, what output range does the hash function h(K) produce?
The basic principle slide defines h(K) output as an integer between 0 and B-1, with B being the number of buckets.
Source: 06_Indexing 3_hash_tables.pdf, page 8
03
Which dynamic hash-table variants are explicitly listed in the lecture?
The 'Static vs. Dynamic Hash Tables' slide lists extensible hashing and linear hashing.
Source: 06_Indexing 3_hash_tables.pdf, page 20
Section 04
Which task is assigned to preprocessing (not plain parsing) in query processing? to In the System-R style dynamic-programming section, which search-space restriction is emphasized?
01
Which task is assigned to preprocessing (not plain parsing) in query processing?
Preprocessing includes semantic correctness checks (e.g., relation/view existence, attribute/type checks).
Source: 09_Query_Optimization.pdf, pages 10 and 11
02
What is the Selinger-style enhancement over basic dynamic programming in the slides?
The slide states Selinger-style optimization keeps track of interesting orders, not only the best-cost plan.
Source: 09_Query_Optimization.pdf, page 49
03
In the System-R style dynamic-programming section, which search-space restriction is emphasized?
The slides mention a heuristic limitation to only left-deep trees in this setting.
Source: 09_Query_Optimization.pdf, pages 59 and 80
Section 05
When is a schedule conflict-serializable according to the lecture? to Which statement correctly describes Strict 2PL?
01
When is a schedule conflict-serializable according to the lecture?
The conflict-serializable slide states the criterion directly: precedence graph must be cycle-free.
Source: 10_Concurrency Control.pdf, page 36
02
What guarantee does Two-Phase Locking (2PL) provide in the slides?
The 2PL slide explicitly states that 2PL guarantees serializability.
Source: 10_Concurrency Control.pdf, page 47
03
Which statement correctly describes Strict 2PL?
Strict 2PL is defined with delayed release of exclusive locks until commit/abort acknowledgement; it ensures recoverable schedules (while deadlocks may still occur).
Source: 10_Concurrency Control.pdf, page 53
Section 06
What compatibility fact is explicitly stated for intention locks? to According to the isolation-level slide, what does READ COMMITTED allow?
01
What compatibility fact is explicitly stated for intention locks?
The example slide explicitly states that IS and IX are compatible with each other.
Source: 10_Concurrency Control.pdf, page 58
02
In deadlock detection, what indicates that a deadlock exists?
The deadlock-detection slide states that cycles in the waits-for graph mean deadlocks.
Source: 10_Concurrency Control.pdf, page 66
03
According to the isolation-level slide, what does READ COMMITTED allow?
READ COMMITTED is listed as disallowing dirty reads but still allowing fuzzy reads and phantoms.
Source: 10_Concurrency Control.pdf, page 70
Knowledge check
Turn understanding into recall.
The quiz now follows the same concepts in scored form. You can return to this lesson from the quiz whenever a gap appears.