epub

4 SELECT * FROM R 1) 2) n a m e 3-1 M o v i e S t a r M o v i e S t a r 4-1 4-1

4 89 1) 2) 3) B 4) 4.1 K K 4.1.1 4-2 4-2

90 S Q L 2. 3. 4 ( ) ( ) 4. 1. 2 4. 1. 3 10 2 0 1 10 10 4.1.2 3. 3 4. 3 I / O 4. 1 4-3 4-2 10-4. 1. 6 K K K 1) 2) K n l o g 2n

4 91 3) K I / O 4. 2 4-3 1 000 000 4096 10 400 M B 30 8 4096 100-10 000 40 MB l o g 2 1 0000 13 13 1 4 1 / 2 1 / 4 3 / 4 1 / 8 3 / 8 5 / 8 7 / 8 I / O 14

92 ( ) ( ) 4. 1. 4 4. 3 B B 4.1.3 4-4 - 4. 3 4-4 4. 1 10-10 3 0 5 0 7 0 5 ~ 8 90 110 1 30

4 93 150 ~ 4. 4 4. 2 100 000 100-1000 4 M B K K I / O K K K 3. 2 3. 4 4.1.4 4. 2 4. 4 I / O 4-5 4-4 4-4 10 4. 3 B 4. 5 4. 4 1000 1 0 10 K K B B B I / O B K K B K I / O I /

94 4-5 4.1.5 K K K K K K 4-6 4. 6 4-6 20 2 20

4 95 20 30 20 4-6 4-7 4-6 - 4-7

96 K E 1 K E 2 E 2 E 1 E 2 E 1 K 4. 7 4-7 20 E 1 20 2 E 2 20 K 10 E 1 E 2 10 4-8 K a) K b) K K K 4-8

4 97 4.8 4-8 K= 20 20 20 K= 30 30 K= 25 b 25 20 3 25 4.1.6 3. 5 1) 2) 4. 1. 4 3) - 4-9

98 4-9 4-9 4. 9 4-3 30 4-10 30 40 3 30 4. 1 0 4-4 30 3-17 30 4-11 30 4

4 99 40 4-11 30 40 4-10 30 4-11 30 40 4-12

100 4-12 40 40 4-12 4. 11 4-11 30 40 15 10 2 15 4-13 20 15 20 20 4 2 4-13

4 101 40 2 4. 1 2 4. 11 30 20 1-14 4-11 15 4. 11 4-1 4 15 10 2 1 1 4-14 * 4. 11 3 10 n

102 a) b) n 4. 1. 2 30 200 80 % 4. 1. 1! 4. 1. 3 4. 1. 1 *!! 4. 1. 4 3 10 4. 1. 1 1 / 3 1 / 3 1 / K I / O K! 4. 1. 5 4. 1. 4 a) - b) 4-7 c) 4-8! 4. 1. 6 4. 1. 7 4-13 60 7 0 8 0 21 2 2 29 *a) b) / c) *! 4. 1. 8 n 2 4.2 4. 1 4. 1 4. 4 3-1 M o v i e S t a r n a m e D B M S

4 103 b i r t h d a t e S Q L 4.2.1-4.1 4. 1 3 4-1 5 10 4. 1. 5 4-15

104 20 I / O 4-15 4. 1. 4-4.2.2 4. 1 4 t i t l e y e a r M o v i e n a m S t u d i o M o v i e s t u d i o N a m e S t u d i o n a m e,z z z D i s n e y t i t l e y e a r s t u d i o N a m e 4. 1. 5 I / O M o v i e Star Wa r s

4 105 H o l l y w o o d M o v i e S t u d i o M o i v e S t u d i o M o v i e S t u d i o S t u d i o M o v i e 4-16 studio 1 studio 2 studio 3 studio 4 1 2 3 4 4-16 I / O I / O M o v i e. t i t l e M o i v e S t u d i o S t u d i o S t u d i o. n a m e 4.2.3 4-15 n n 4-17 K - K K 4. 1 5 4-17 50 60 4-17

106 I / O 4-17 4. 1 6 4. 14 Movie(title, year, length, stadioname) s t u d i o N a m e y e a r D i s n e y 1 995 4-18 s t u d i o N a m e D i s n e y I/O

4 107 y e a r 1995 1995 D i s n e y studio Movie year Disney 1995 4-18 4.2.4 W W W D o c Doc(hascat, hasdog, ) h a s c a t c a D o c F A L S E T R U E 4. 2. 3

108 4. 17 4-19 4-19 4-19 c a t c a t d o g d o 1) 2) We b H T M L X M L

4 109 1) 4. 17 d o g d o g d o g s 2) t h e a n d 4. 1 8 4-20 H T M L a) ( t i t l e ) b) 4-19 ( ) c a t c a t d o g d o g c a t * 4. 2. 1! 4. 2. 2 4. 1. 1 3 10 K K- v 1

110 2 3 K v 1 / 3 1 / 2 1 / 3 3 v K v I / O *! 4. 2. 3 4-16 10 1 m I / O I / O 4. 2. 4 3 10 50 4-1 7 *a) 10 3000!b)! 4. 2. 5 4. 2. 4 a 1 0 I / O I / O I / 4. 2. 6 4. 2. 4 3 10-50 4. 16 m o v i e s t u d i o N a m e y e a r 51 D i s n e y 101 1 995 D i s n e y 4. 16 1995 D i s n e y I / O *a) 1995 D i s n e y b) s t u d i o N a m e D i s n e y 1 995 D i s n e y c) b y e a r 1995 4.2.7 1000 1 0000 10-50 Z i p f i a n 7. 4. 3 Z i p f i a n i 100000 i i= 1 2 10000 *a) *b) c) d) 400 b e) 400 c

4 111 4. 2. 8 4-20 * a ) c a t d o g b ) c a t d o g c) d o g c a t 4-20 4.3 B B B + B B B + B 4.3.1 B B B B 4-21 4-22 4-23 B B

112 B n B n n+ 1 B 4. 1 B n n+ 1 n 4. 1 9 4096 4 8 4n+ 8 (n+ 1 ) 4 096 n n = 340 B B n (n +1)/2 i n+ 1 B (n +1)/2 n j j 1 K 1 K 2 K j - 1 B K 1 B K 1 K 2 j B K j - 1 K 1 K j - 1 B B 57 81 95 57 81 95 4-21 B B B

4 113 4. 2 0 B n= 3 4 4-21 57 8 1 9 5 n= 3 4-21 95 9 K 57 57 K 81 81 K 95 K 95 4-22 B 4-22 57 8 1 9 5 B 57 B n= 3 57 57 57 4. 2 1 4-23 B + 4. 20 2 4 7 3 4 12 13 4-21 4-22 B B B+

114 4-23 B+ 7 7 7 11 7 13 4 23 13 1 7 1 9 23 31 31 43 43 4.3.2 B B 4. 1 4. 2 1) B 2) B + 3) B + K B 4-24 4. 1. 5

4 115 4. 3. 1 K 1, K 2 K n, K i i+ 1 i+ K i K i i+ 1 K i 4.22 4-24 B 4-24 B 4-23 11 1 1 9 2 9 3 1 23 17 1 13 37 23 17 23 13 24 3 6 24 24 37 24

116 4.3.3 B B B K i K i K 1, K 2,, K n 4. 3. 1 K K<K 1 K 1 K K 2 4. 2 3 4-23 B 40 13 13 4 0 23 3 1 4 3 31 4 0 4 3 31 3 7 4 0 40 4 40 4 37 37 3 4.3.4 B W h e r e = < > K B [a, b] a a b

4 117 1) b 2) b a B b 4. 2 4 4-23 B 10 2 5 10 10 11 10 11 13 1 7 1 9 25 23 29 25 11 23 4.3.5 B B 4. 1. 4 4. 1 B B n N n n+ 1 M N N (n +1)/2 - N - M N - (n +1)/2 N n n+ 1 N n+ 2 1 ) M N

118 2) (n+1)/2 n (n+1)/2 M 3) n/2 N n/2 M N M K M K N M M M K N M 4. 2 5 4-23 B 40 4. 3. 3 4. 23 n= - 3 1 3 7 4 0 4 1 40 4 1 4-25 4-25 40 40 4 1 23 3 1 4 3 40 4

4 119 P 1 P 2 P 3 P 4 P 5 13 2 3 3 1 40 4 3 23 3 1 4 0 4 3 40 40 4-26 40 4-26 40 4.3.6 B K B 4. 3. 3 B B N

120 1 N - N N N M N M M N M 2 N N M B 4. 2 6 4-23 B 40 7 4-27 7 - B 4-27 5 7 11 13 1 7 1 9

4 121 5 5 4-28 4-28 11 4-29 11

122 4-28 4-29 13 1 7 1 9 13 23 4.3.7 B B I / O n 10 B I / O B I / O B I / O B 3 B 4. 2 7 4. 19 340 255 255 2 = 65025 255 3 1. 66 1 0 7 1. 66 1 0 7 3 B B 3 I / O B 3 B B I / O I / B B - B B B B

4 123 4. 3. 1 10 99 100 B 70 % 69 70 B 1 1 000 000 2 I / O *a) 10 B b) a 10 c) a B!d) B 10 70 % 7 *e) B 4. 3. 2 1000 4. 3. 1 4. 3. 3 4 12 16 384 4. 3. 4 B 1 2 *a) n= 10 1 11 b) n=11 11 12 4. 3. 5 4-23 a) 41 b) 40 c) 20 3 0 d) 30 e) 30 f) 1 g) 14 1 6 h) 23 i) 23! 4. 3. 6 4-21 4-22 B 4. 3. 7 B *a) b) c)

124! 4. 3. 8 4. 26-4. 3. 9 3 4 B *!a) 6!!b) 10!!c) 15 *! 4. 3. 10 B 3 4 2 2 1 2 3 4 5 6, B!! 4. 3. 11 B + N m m 1) 70 + 0. 05m 70 0. 05 m 2) a+bl o g 2 m a b 3) a 70 4) l o g m N a) m b) 70 m 4.4 0 B 1 B 0 B 1 K h K h 4.4.1

4 125 h i i i i 4. 2 8 4-3 0 B= 4 h 0 3 4-30 a f h(d) = 0 h(c) =h(e) = 1 h(b) = 2 hh(a) =h(f) = 3 4-30 4-30 4. 4. 5 4. 4. 4 K / B K B B 4. 4. 5 B 2 B 4.4.2 K h(k) h(k) 4. 2 9 4-30 g h(g) = 1 1 1 g 4-31

126 4-31 4.4.3 K h(k) K 4. 3 0 4-32 4-31 c h(c) = 1 c 1 g a 3 4-32 4.4.4 I / O I / B B 4. 3. 4 I / O

4 127 B B B 1 4. 4. 5 2 4. 4. 7 B B 1 4.4.5 1) 2) 2 3) 4) h K K 32 K i i 2 i 4. 3 1 4-3 3 K= 4 h i= 1 0 1 4-33 0 1 0001 1001 11 00 4-33 1 4. 31 4.4.6 K

128 h(k) i i B B B i B j 1) j<i (a) B (b) j+ 1 B 0 B 1 (c) j+ 1 (d) B B j+ 1 B B j 2) j=i i 1 2 i+ 1 w i w0 w1 0 1 w B i j 4. 3 2 4-33 1010 1 j=i= 1 4-34 i 2 0 1 1 10 11 2 4-34

4 129 0000 0 111 4-34 i= 2 0000 0 001 0111 01 1000 10 i 3 4-35 10 101 4-35 3 4.4.7 I / O 1) i 2) I / O 3) 2 20 20

130 i= 2 0 n 80 % 1 [ l o g 2n], n i K a 1 a 2 a i a 1 a 2 a i h(k) i a 1 a 2 a i m m<n m n m 2 i, m 2 i 1 a 1 1 0 4. 33 4-36 n= 2 4. 31 4-36 0 1 04-36 1 i( ) n r r/n n 1. 7n r 1. 7n 85 % 4.4.8 4. 4. 7 h(k) K h(k) n 1 0 r r/n 1a 2 a 3 a i 0a 2 a 3 a i i a 2 a 3 a i i n 2 i i 1 0

4 131 4. 3 4 4. 33 0101 4-36 1. 7 n 3 [ l o g 2 3 ] = 2 0 1 00 0 1 10 0 00 0000 00 0 1010 10 1 4-37 4-37 0001 01 01 5 / 3 1. 7 4-38 4-38 0111 11 11 01 11 0 1. 7 11 01 0001 0 10 0 1 0111 1111 01 4-39 4-39 1. 7 n 5 i 3 4. 3 5 4-37

132 i= 2 n= 3 1010 i= 2 10 m= 2 m<n 10 1010 4-39 1011 m= 3 m n 11 1 0 01 01 1011 4. 41 4-30 1) g j 0 3 2) a b 3) k n 0 3 4) c d 4. 4. 2! 4. 4. 3 *a) b) c)

4 133! 4.4.4 i h(i) =i 2 mod B *a) B= 10 b) B= 16 c) B 4. 4. 5 n 4. 4. 6 4 0 1 *a) 0000 0 0 0 11111 b) 0000 0 0011111 100 % c) 1111 111 00 0 0 0 d) 1111 11100 000 75 % * 4. 4. 7!! 4. 4. 8 c n r r=c k n k 4. 33 k= 2 c= 0. 85 1. 7 r= 1. 7n a) c k n b) λ i e λ λ i /i! c k n *! 4. 4. 9 100 0000 1000 100 4.5 - - -

134 K K B n n+ 1 B 4.6 B B a y e r M c C r e i g h t [ 2 ] B + B [ 3 ] B P e t e r s o n [ 8 ] [ 4 ] [ 7 [ 6 K n u t h ] B B + [ 6 ] 1 973 [ 9 ] [ 1 ] [ 5 1 R. Baeza-Yates, "Integrating contents and structure in text retrieval," SIGMOD Record 25:1 (1996), pp. 67-79 2 R. Bayer and E. M. McCreight, "Organization and maintenance of large ordered indexes,"" Acta Informatica 1:3 (1972), pp. 173-189 3 D. Comer."The ubiquitous B-tree," ComputlIng Surveys 11:2 (1979), pp. 121 13-1 4 R. Fagin, J. Nievergelt,N. Pippenger, and H. R. Strong, "Extendible hashing a fast access inethod for dynamic files,",

4 135 ACM Trans. on Database Systems 4:3 (1979). pp. 315-344 5 C. Faloutsos. "Access methods for text," Computing Surveys 17:1 (1985), pp. 49-74 6 D. E. Knuth. Thc Art of Computer Pro g r a m m i n g, Vol. III, S o rting and Scarchling. Thlird Editliotion, Addison-We s l e y, Reading MA, 1998 7 W. Litwin. "Linear hashing: a new tool for file and table addressing," Proc. hill. Cotif on Very Large Databases (1980) pp. 212-223 8 W. W. Petersoii. "Addressing for random access storage,"" IBM J. Resca,rch and Deveclopment 1:2 (1957). pp. 130-146 9 G. Salton. Introdactlion to ModCT-n Information Retrieval,McGraw-Hill, New York, 1983