数据库系统概念(databasesystemconcepts)英文第六版课后练习题答案第12章.pdfVIP

12 C H A P T E R Query Processing Practice Exercises 12.1 Assume (for simplicity in this exercise) that only one tuple fits in a block and memory holds at most 3 blocks. Show the runs created on each pass of the sort-merge algorithm, when applied to sort the following tuples on the first attribute: (kangaroo, 17), (wallaby, 21), (emu, 1), (wombat, 13), (platypus, 3), (lion, 8), (warthog, 4), (zebra, 11), (meerkat, 6), (hyena, 9), (hornbill, 2), (baboon, 12). Answer: We will refer to the tuples (kangaroo, 17) through (baboon, 12) using tuple numbers t1 through t12 . We refer to the j th run used by the i th pass, as rij . The initial sorted runs have three blocks each. They are: r = {t , t , t } 11 3 1 2 r = {t , t , t } 12 6 5 4 r = {t , t , t } 13 9 7 8 r14 = {t12 , t11 , t10 } Each pass merges three runs. Therefore the runs after the end of the first pass are: r = {t , t , t , t , t , t , t , t , t } 21 3 1 6 9 5 2 7 4 8 r22 = {t12 , t11 , t10 } At the end of the second pass, the tuples are completely sorted into one run: r = {t , t , t , t , t , t , t , t , t , t , t , t } 31 12 3 11 10 1 6 9 5 2 7 4 8