The                          scheme uses a page table containing pointers to all pages; the page table itself and all updated pages are copied to a new location.

Related MCQs

• Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.
•                      scheme that records only information about dirty pages and associated information and does not even require of writing dirty pages to disk.
• The                                      contains a list of pages that have been updated in the database buffer.
• If access paths are available on all the conditions of a disjunctive selection, each index is scanned for pointers to tuples that satisfy the individual condition. This is satisfied by
• In a(n) ____ backup of the database, only the last modifications to the database are copied.
• In a                clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
• In a _______ clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
• An                          consists of a search-key value and pointers to one or more records with that value as their search-key value.
• An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value.
• The        algorithm scans each index for pointers to tuples that satisfy an individual condition.