Karteikarten
Tree Indexing
Karten in diesem Stapel (7)
- 1What is multilevel indexing?indexing the list of index entries itself
- 2Choose the answers that fit the statement. Non-leaf pages contain [index entries/separators], whereas leaf pages contain [index entries/separators].separators
index entries - 3The height of an index tree is a) (log_F N) b) (log_F N) - 1 c) (log_N F) + 1 d) (log_F N) + 1d) (log_F N) + 1
- 4True or false: the number of pages that need to be transferred when looking for a specific index entry is equal to the height of the index.True
- 5If F = 100 and N = 10 000, where F is the fan-out and N is the number of leaf pages, what is the height of the index?3
- 6True or false: in an ISAM tree, inserts and deletes affect only leaf pages.True
- 7What is a B+ tree?A dynamic index structure where the tree structure is adjusted as data entries are inserted/deleted.
Informationen
- Beschreibung
- File and Database Management Karteikarten am Tree Indexing, erstellt von Chuck H am 13/04/2019.
- Erstellt von
- Chuck H
- Aufrufe
- 1
- Bewertung