16What is the typical height of a B+ tree indexing millions of rows?A1 level alwaysB3 to 4 levelsCHundreds of levelsDMillions of levelsView AnswerDiscussWorkspaceReportSaveEasy
17A clustered index:AIs stored separately from the table with pointersBIs used only for textCCan exist many times per tableDDetermines the physical order of rows in the tableView AnswerDiscussWorkspaceReportSaveEasy
18Extendible hashing grows by:ADeleting old bucketsBDoubling a directory and splitting bucketsCAdding tree levelsDRebuilding the whole fileView AnswerDiscussWorkspaceReportSaveEasy
19Which query is LEAST likely to use a B-tree index on name?AWHERE name LIKE '%son'BWHERE name LIKE 'As%'CORDER BY nameDWHERE name = 'Asha'View AnswerDiscussWorkspaceReportSaveMedium