05.11.2015
•
Views
CHAPTER 10 ■ DATABASE TABLES 401 "DNAME" VARCHAR2(14), "LOC" VARCHAR2(13), "EMPS" "OPS$TKYTE"."EMP_TAB_TYPE" , PRIMARY KEY ("DEPTNO") USING INDEX PCTFREE 10 INITRANS 2 MAXTRANS 255 TABLESPACE "USERS" ENABLE ) PCTFREE 10 PCTUSED 40 INITRANS 1 MAXTRANS 255 NOCOMPRESS LOGGING TABLESPACE "USERS" NESTED TABLE "EMPS" STORE AS "EMPS_NT" (PCTFREE 10 PCTUSED 40 INITRANS 1 MAXTRANS 255 LOGGING TABLESPACE "USERS" ) RETURN AS VALUE The only new thing here so far is the RETURN AS VALUE. It is used to describe how the nested table is returned to a client application. By default, Oracle will return the nested table by value to the client; the actual data will be transmitted with each row. This can also be set to RETURN AS LOCATOR, meaning the client will get a pointer to the data, not the data itself. If—and only if—the client dereferences this pointer will the data be transmitted to it. So, if you believe the client will typically not look at the rows of a nested table for each parent row, you can return a locator instead of the values, saving on the network round-trips. For example, if you have a client application that displays the lists of departments and when the user doubleclicks a department it shows the employee information, you may consider using the locator. This is because the details are usually not looked at—that is the exception, not the rule. So, what else can we do with the nested table? First, the NESTED_TABLE_ID column must be indexed. Since we always access the nested table from the parent to the child, we really need that index. We can index that column using CREATE INDEX, but a better solution is to use an IOT to store the nested table. The nested table is another perfect example of what an IOT is excellent for. It will physically store the child rows co-located by NESTED_TABLE_ID (so retrieving the table is done with less physical I/O). It will remove the need for the redundant index on the RAW(16) column. Going one step further, since the NESTED_TABLE_ID will be the leading column in the IOT’s primary key, we should also incorporate index key compression to suppress the redundant NESTED_TABLE_IDs that would be there otherwise. In addition, we can incorporate our UNIQUE and NOT NULL constraint on the EMPNO column into the CREATE TABLE command. Therefore, if we take the preceding CREATE TABLE and modify it slightly, as follows: ops$tkyte@ORA10G> CREATE TABLE "OPS$TKYTE"."DEPT_AND_EMP" 2 ("DEPTNO" NUMBER(2, 0), 3 "DNAME" VARCHAR2(14), 4 "LOC" VARCHAR2(13), 5 "EMPS" "EMP_TAB_TYPE") 6 PCTFREE 10 PCTUSED 40 INITRANS 1 MAXTRANS 255 LOGGING 7 STORAGE(INITIAL 131072 NEXT 131072 8 MINEXTENTS 1 MAXEXTENTS 4096 9 PCTINCREASE 0 FREELISTS 1 FREELIST GROUPS 1 10 BUFFER_POOL DEFAULT) 11 TABLESPACE "USERS" 12 NESTED TABLE "EMPS" 13 STORE AS "EMPS_NT" 14 ( (empno NOT NULL, unique (empno), primary key(nested_table_id,empno))
402 CHAPTER 10 ■ DATABASE TABLES 15 organization index compress 1 ) 16 RETURN AS VALUE 17 / Table created. we now get the following set of objects. Instead of having a conventional table EMP_NT, we have an IOT EMPS_NT as signified by the index structure overlaid on the table in Figure 10-12. Figure 10-12. Nested table implemented as an IOT Where the EMPS_NT is an IOT using compression, it should take less storage than the original default nested table and it has the index we badly need. Nested Tables Wrap-Up I do not use nested tables as a permanent storage mechanism myself, for the following reasons: • The unnecessary storage overhead of the RAW(16) columns that are added. Both the parent and child table will have this extra column. The parent table will have an extra 16-byte RAW for each nested table column it has. Since the parent table typically already has a primary key (DEPTNO in my examples), it makes sense to use this key in the child tables, not a system-generated key. • The unnecessary overhead of the additional unique constraint on the parent table, when it typically already has a unique constraint. • The nested table is not easily used by itself, without using unsupported constructs (NESTED_TABLE_GET_REFS). It can be un-nested for queries, but not mass updates. I have yet to find a table in real life that isn’t queried “by itself.”
-
Page 2 and 3:
Expert Oracle Database Architecture
-
Page 4 and 5:
Contents Foreword . . . . . . . . .
-
Page 6 and 7:
■CONTENTS v Block Buffer Cache .
-
Page 8 and 9:
■CONTENTS vii ■CHAPTER 9 Redo a
-
Page 10 and 11:
■CONTENTS ix ■CHAPTER 12 Dataty
-
Page 12 and 13:
Foreword “THINK.” In 1914, Thom
-
Page 14 and 15:
■FOREWORD xiii Tom is an aficiona
-
Page 16 and 17:
About the Technical Reviewers ■JO
-
Page 18 and 19:
Introduction The inspiration for th
-
Page 20 and 21:
■INTRODUCTION xix • Exposure to
-
Page 22 and 23:
■INTRODUCTION xxi Chapter 3: File
-
Page 24 and 25:
■INTRODUCTION xxiii Next up are t
-
Page 26 and 27:
Setting Up Your Environment In this
-
Page 28 and 29:
■SETTING UP YOUR ENVIRONMENT xxvi
-
Page 30 and 31:
■SETTING UP YOUR ENVIRONMENT xxix
-
Page 32 and 33:
■SETTING UP YOUR ENVIRONMENT xxxi
-
Page 34 and 35:
■SETTING UP YOUR ENVIRONMENT xxxi
-
Page 36 and 37:
■SETTING UP YOUR ENVIRONMENT xxxv
-
Page 38 and 39:
■SETTING UP YOUR ENVIRONMENT xxxv
-
Page 40 and 41:
■SETTING UP YOUR ENVIRONMENT xxxi
-
Page 42 and 43:
■SETTING UP YOUR ENVIRONMENT xli
-
Page 44 and 45:
■SETTING UP YOUR ENVIRONMENT xlii
-
Page 46 and 47:
CHAPTER 1 ■ ■ ■ Developing Su
-
Page 48 and 49:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 50 and 51:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 52 and 53:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 54 and 55:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 56 and 57:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 58 and 59:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 60 and 61:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 62 and 63:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 64 and 65:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 66 and 67:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 68 and 69:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 70 and 71:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 72 and 73:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 74 and 75:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 76 and 77:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 78 and 79:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 80 and 81:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 82 and 83:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 84 and 85:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 86 and 87:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 88 and 89:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 90 and 91:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 92:
CHAPTER 1 ■ DEVELOPING SUCCESSFUL
-
Page 95 and 96:
50 CHAPTER 2 ■ ARCHITECTURE OVERV
-
Page 97 and 98:
52 CHAPTER 2 ■ ARCHITECTURE OVERV
-
Page 99 and 100:
54 CHAPTER 2 ■ ARCHITECTURE OVERV
-
Page 101 and 102:
56 CHAPTER 2 ■ ARCHITECTURE OVERV
-
Page 103 and 104:
58 CHAPTER 2 ■ ARCHITECTURE OVERV
-
Page 105 and 106:
60 CHAPTER 2 ■ ARCHITECTURE OVERV
-
Page 107 and 108:
62 CHAPTER 2 ■ ARCHITECTURE OVERV
-
Page 110 and 111:
CHAPTER 3 ■ ■ ■ Files In this
-
Page 112 and 113:
CHAPTER 3 ■ FILES 67 Without a pa
-
Page 114 and 115:
CHAPTER 3 ■ FILES 69 and even dat
-
Page 116 and 117:
CHAPTER 3 ■ FILES 71 all operatio
-
Page 118 and 119:
CHAPTER 3 ■ FILES 73 *.cluster_da
-
Page 120 and 121:
CHAPTER 3 ■ FILES 75 ops$tkyte@OR
-
Page 122 and 123:
CHAPTER 3 ■ FILES 77 • To maint
-
Page 124 and 125:
CHAPTER 3 ■ FILES 79 • Resource
-
Page 126 and 127:
CHAPTER 3 ■ FILES 81 3 l_dummy nu
-
Page 128 and 129:
CHAPTER 3 ■ FILES 83 Trace Files
-
Page 130 and 131:
CHAPTER 3 ■ FILES 85 _qerixAlloca
-
Page 132 and 133:
CHAPTER 3 ■ FILES 87 6 ( 7 TYPE O
-
Page 134 and 135:
CHAPTER 3 ■ FILES 89 A Brief Revi
-
Page 136 and 137:
CHAPTER 3 ■ FILES 91 Redundant Ar
-
Page 138 and 139:
CHAPTER 3 ■ FILES 93 (data from m
-
Page 140 and 141:
CHAPTER 3 ■ FILES 95 dictionary t
-
Page 142 and 143:
CHAPTER 3 ■ FILES 97 ■Note df i
-
Page 144 and 145:
CHAPTER 3 ■ FILES 99 “accidenta
-
Page 146 and 147:
CHAPTER 3 ■ FILES 101 So, at the
-
Page 148 and 149:
CHAPTER 3 ■ FILES 103 Password Fi
-
Page 150 and 151:
CHAPTER 3 ■ FILES 105 USER is "SY
-
Page 152 and 153:
CHAPTER 3 ■ FILES 107 Flashback L
-
Page 154 and 155:
CHAPTER 3 ■ FILES 109 of the requ
-
Page 156 and 157:
CHAPTER 3 ■ FILES 111 IMPDP, howe
-
Page 158 and 159:
CHAPTER 3 ■ FILES 113 tkyte@ORA10
-
Page 160 and 161:
CHAPTER 4 ■ ■ ■ Memory Struct
-
Page 162 and 163:
CHAPTER 4 ■ MEMORY STRUCTURES 117
-
Page 164 and 165:
CHAPTER 4 ■ MEMORY STRUCTURES 119
-
Page 166 and 167:
CHAPTER 4 ■ MEMORY STRUCTURES 121
-
Page 168 and 169:
CHAPTER 4 ■ MEMORY STRUCTURES 123
-
Page 170 and 171:
CHAPTER 4 ■ MEMORY STRUCTURES 125
-
Page 172 and 173:
CHAPTER 4 ■ MEMORY STRUCTURES 127
-
Page 174 and 175:
CHAPTER 4 ■ MEMORY STRUCTURES 129
-
Page 176 and 177:
CHAPTER 4 ■ MEMORY STRUCTURES 131
-
Page 178 and 179:
CHAPTER 4 ■ MEMORY STRUCTURES 133
-
Page 180 and 181:
CHAPTER 4 ■ MEMORY STRUCTURES 135
-
Page 182 and 183:
CHAPTER 4 ■ MEMORY STRUCTURES 137
-
Page 184 and 185:
CHAPTER 4 ■ MEMORY STRUCTURES 139
-
Page 186 and 187:
CHAPTER 4 ■ MEMORY STRUCTURES 141
-
Page 188 and 189:
CHAPTER 4 ■ MEMORY STRUCTURES 143
-
Page 190 and 191:
CHAPTER 4 ■ MEMORY STRUCTURES 145
-
Page 192 and 193:
CHAPTER 4 ■ MEMORY STRUCTURES 147
-
Page 194 and 195:
CHAPTER 4 ■ MEMORY STRUCTURES 149
-
Page 196 and 197:
CHAPTER 4 ■ MEMORY STRUCTURES 151
-
Page 198 and 199:
CHAPTER 4 ■ MEMORY STRUCTURES 153
-
Page 200 and 201:
CHAPTER 5 ■ ■ ■ Oracle Proces
-
Page 202 and 203:
CHAPTER 5 ■ ORACLE PROCESSES 157
-
Page 204 and 205:
CHAPTER 5 ■ ORACLE PROCESSES 159
-
Page 206 and 207:
CHAPTER 5 ■ ORACLE PROCESSES 161
-
Page 208 and 209:
CHAPTER 5 ■ ORACLE PROCESSES 163
-
Page 210 and 211:
CHAPTER 5 ■ ORACLE PROCESSES 165
-
Page 212 and 213:
CHAPTER 5 ■ ORACLE PROCESSES 167
-
Page 214 and 215:
CHAPTER 5 ■ ORACLE PROCESSES 169
-
Page 216 and 217:
CHAPTER 5 ■ ORACLE PROCESSES 171
-
Page 218 and 219:
CHAPTER 5 ■ ORACLE PROCESSES 173
-
Page 220 and 221:
CHAPTER 5 ■ ORACLE PROCESSES 175
-
Page 222 and 223:
CHAPTER 5 ■ ORACLE PROCESSES 177
-
Page 224 and 225:
CHAPTER 5 ■ ORACLE PROCESSES 179
-
Page 226 and 227:
CHAPTER 5 ■ ORACLE PROCESSES 181
-
Page 228 and 229:
CHAPTER 6 ■ ■ ■ Locking and L
-
Page 230 and 231:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 232 and 233:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 234 and 235:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 236 and 237:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 238 and 239:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 240 and 241:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 242 and 243:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 244 and 245:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 246 and 247:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 248 and 249:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 250 and 251:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 252 and 253:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 254 and 255:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 256 and 257:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 258 and 259:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 260 and 261:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 262 and 263:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 264 and 265:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 266 and 267:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 268 and 269:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 270 and 271:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 272 and 273:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 274 and 275:
CHAPTER 6 ■ LOCKING AND LATCHING
-
Page 276 and 277:
CHAPTER 7 ■ ■ ■ Concurrency a
-
Page 278 and 279:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 280 and 281:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 282 and 283:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 284 and 285:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 286 and 287:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 288 and 289:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 290 and 291:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 292 and 293:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 294 and 295:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 296 and 297:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 298 and 299:
CHAPTER 7 ■ CONCURRENCY AND MULTI
-
Page 300 and 301:
CHAPTER 8 ■ ■ ■ Transactions
-
Page 302 and 303:
CHAPTER 8 ■ TRANSACTIONS 257 •
-
Page 304 and 305:
CHAPTER 8 ■ TRANSACTIONS 259 So,
-
Page 306 and 307:
CHAPTER 8 ■ TRANSACTIONS 261 X --
-
Page 308 and 309:
CHAPTER 8 ■ TRANSACTIONS 263 “s
-
Page 310 and 311:
CHAPTER 8 ■ TRANSACTIONS 265 busi
-
Page 312 and 313:
CHAPTER 8 ■ TRANSACTIONS 267 Many
-
Page 314 and 315:
CHAPTER 8 ■ TRANSACTIONS 269 ops$
-
Page 316 and 317:
CHAPTER 8 ■ TRANSACTIONS 271 last
-
Page 318 and 319:
CHAPTER 8 ■ TRANSACTIONS 273 Dist
-
Page 320 and 321:
CHAPTER 8 ■ TRANSACTIONS 275 Auto
-
Page 322 and 323:
CHAPTER 8 ■ TRANSACTIONS 277 3 Au
-
Page 324 and 325:
CHAPTER 8 ■ TRANSACTIONS 279 5 pr
-
Page 326:
CHAPTER 8 ■ TRANSACTIONS 281 scot
-
Page 329 and 330:
284 CHAPTER 9 ■ REDO AND UNDO cri
-
Page 331 and 332:
286 CHAPTER 9 ■ REDO AND UNDO Fir
-
Page 333 and 334:
288 CHAPTER 9 ■ REDO AND UNDO The
-
Page 335 and 336:
290 CHAPTER 9 ■ REDO AND UNDO We
-
Page 337 and 338:
292 CHAPTER 9 ■ REDO AND UNDO Wha
-
Page 339 and 340:
294 CHAPTER 9 ■ REDO AND UNDO row
-
Page 341 and 342:
296 CHAPTER 9 ■ REDO AND UNDO If
-
Page 343 and 344:
298 CHAPTER 9 ■ REDO AND UNDO ops
-
Page 345 and 346:
300 CHAPTER 9 ■ REDO AND UNDO Inv
-
Page 347 and 348:
302 CHAPTER 9 ■ REDO AND UNDO The
-
Page 349 and 350:
304 CHAPTER 9 ■ REDO AND UNDO 41
-
Page 351 and 352:
306 CHAPTER 9 ■ REDO AND UNDO ins
-
Page 353 and 354:
308 CHAPTER 9 ■ REDO AND UNDO So,
-
Page 355 and 356:
310 CHAPTER 9 ■ REDO AND UNDO ops
-
Page 357 and 358:
312 CHAPTER 9 ■ REDO AND UNDO ops
-
Page 359 and 360:
314 CHAPTER 9 ■ REDO AND UNDO •
-
Page 361 and 362:
316 CHAPTER 9 ■ REDO AND UNDO ...
-
Page 363 and 364:
318 CHAPTER 9 ■ REDO AND UNDO •
-
Page 365 and 366:
320 CHAPTER 9 ■ REDO AND UNDO bac
-
Page 367 and 368:
322 CHAPTER 9 ■ REDO AND UNDO As
-
Page 369 and 370:
324 CHAPTER 9 ■ REDO AND UNDO ops
-
Page 371 and 372:
326 CHAPTER 9 ■ REDO AND UNDO wil
-
Page 373 and 374:
328 CHAPTER 9 ■ REDO AND UNDO Thi
-
Page 375 and 376:
330 CHAPTER 9 ■ REDO AND UNDO ops
-
Page 377 and 378:
332 CHAPTER 9 ■ REDO AND UNDO Whe
-
Page 379 and 380:
334 CHAPTER 9 ■ REDO AND UNDO Tha
-
Page 381 and 382:
336 CHAPTER 9 ■ REDO AND UNDO tou
-
Page 383 and 384:
338 CHAPTER 10 ■ DATABASE TABLES
-
Page 385 and 386:
340 CHAPTER 10 ■ DATABASE TABLES
-
Page 387 and 388:
342 CHAPTER 10 ■ DATABASE TABLES
-
Page 389 and 390:
344 CHAPTER 10 ■ DATABASE TABLES
-
Page 391 and 392:
346 CHAPTER 10 ■ DATABASE TABLES
-
Page 393 and 394:
348 CHAPTER 10 ■ DATABASE TABLES
-
Page 395 and 396:
350 CHAPTER 10 ■ DATABASE TABLES
-
Page 397 and 398:
352 CHAPTER 10 ■ DATABASE TABLES
-
Page 399 and 400:
354 CHAPTER 10 ■ DATABASE TABLES
-
Page 401 and 402:
356 CHAPTER 10 ■ DATABASE TABLES
-
Page 403 and 404:
358 CHAPTER 10 ■ DATABASE TABLES
-
Page 405 and 406:
360 CHAPTER 10 ■ DATABASE TABLES
-
Page 407 and 408:
362 CHAPTER 10 ■ DATABASE TABLES
-
Page 409 and 410:
364 CHAPTER 10 ■ DATABASE TABLES
-
Page 411 and 412:
366 CHAPTER 10 ■ DATABASE TABLES
-
Page 413 and 414:
368 CHAPTER 10 ■ DATABASE TABLES
-
Page 415 and 416:
370 CHAPTER 10 ■ DATABASE TABLES
-
Page 417 and 418:
372 CHAPTER 10 ■ DATABASE TABLES
-
Page 419 and 420:
374 CHAPTER 10 ■ DATABASE TABLES
-
Page 421 and 422:
376 CHAPTER 10 ■ DATABASE TABLES
-
Page 423 and 424:
378 CHAPTER 10 ■ DATABASE TABLES
-
Page 425 and 426:
380 CHAPTER 10 ■ DATABASE TABLES
-
Page 427 and 428:
382 CHAPTER 10 ■ DATABASE TABLES
-
Page 429 and 430:
384 CHAPTER 10 ■ DATABASE TABLES
-
Page 431 and 432:
386 CHAPTER 10 ■ DATABASE TABLES
-
Page 433 and 434:
388 CHAPTER 10 ■ DATABASE TABLES
-
Page 435 and 436:
390 CHAPTER 10 ■ DATABASE TABLES
-
Page 437 and 438:
392 CHAPTER 10 ■ DATABASE TABLES
-
Page 439 and 440:
394 CHAPTER 10 ■ DATABASE TABLES
-
Page 441 and 442:
396 CHAPTER 10 ■ DATABASE TABLES
-
Page 443 and 444:
398 CHAPTER 10 ■ DATABASE TABLES
-
Page 445:
400 CHAPTER 10 ■ DATABASE TABLES
-
Page 449 and 450:
404 CHAPTER 10 ■ DATABASE TABLES
-
Page 451 and 452:
406 CHAPTER 10 ■ DATABASE TABLES
-
Page 453 and 454:
408 CHAPTER 10 ■ DATABASE TABLES
-
Page 455 and 456:
410 CHAPTER 10 ■ DATABASE TABLES
-
Page 457 and 458:
412 CHAPTER 10 ■ DATABASE TABLES
-
Page 459 and 460:
414 CHAPTER 10 ■ DATABASE TABLES
-
Page 461 and 462:
416 CHAPTER 10 ■ DATABASE TABLES
-
Page 463 and 464:
418 CHAPTER 10 ■ DATABASE TABLES
-
Page 466 and 467:
CHAPTER 11 ■ ■ ■ Indexes Inde
-
Page 468 and 469:
CHAPTER 11 ■ INDEXES 423 value of
-
Page 470 and 471:
CHAPTER 11 ■ INDEXES 425 One of t
-
Page 472 and 473:
CHAPTER 11 ■ INDEXES 427 We then
-
Page 474 and 475:
CHAPTER 11 ■ INDEXES 429 we ended
-
Page 476 and 477:
CHAPTER 11 ■ INDEXES 431 The data
-
Page 478 and 479:
CHAPTER 11 ■ INDEXES 433 if ( (++
-
Page 480 and 481:
CHAPTER 11 ■ INDEXES 435 Table 11
-
Page 482 and 483:
CHAPTER 11 ■ INDEXES 437 When Sho
-
Page 484 and 485:
CHAPTER 11 ■ INDEXES 439 an 8KB b
-
Page 486 and 487:
CHAPTER 11 ■ INDEXES 441 select *
-
Page 488 and 489:
CHAPTER 11 ■ INDEXES 443 select *
-
Page 490 and 491:
CHAPTER 11 ■ INDEXES 445 Indicate
-
Page 492 and 493:
CHAPTER 11 ■ INDEXES 447 an index
-
Page 494 and 495:
CHAPTER 11 ■ INDEXES 449 Table 11
-
Page 496 and 497:
CHAPTER 11 ■ INDEXES 451 9 1, 'M'
-
Page 498 and 499:
CHAPTER 11 ■ INDEXES 453 column w
-
Page 500 and 501:
CHAPTER 11 ■ INDEXES 455 Bitmap j
-
Page 502 and 503:
CHAPTER 11 ■ INDEXES 457 INSERT a
-
Page 504 and 505:
CHAPTER 11 ■ INDEXES 459 7 l_last
-
Page 506 and 507:
CHAPTER 11 ■ INDEXES 461 ops$tkyt
-
Page 508 and 509:
CHAPTER 11 ■ INDEXES 463 If we co
-
Page 510 and 511:
CHAPTER 11 ■ INDEXES 465 ops$tkyt
-
Page 512 and 513:
CHAPTER 11 ■ INDEXES 467 Caveat o
-
Page 514 and 515:
CHAPTER 11 ■ INDEXES 469 ops$tkyt
-
Page 516 and 517:
CHAPTER 11 ■ INDEXES 471 Frequent
-
Page 518 and 519:
CHAPTER 11 ■ INDEXES 473 select *
-
Page 520 and 521:
CHAPTER 11 ■ INDEXES 475 If you s
-
Page 522 and 523:
CHAPTER 11 ■ INDEXES 477 we’ll
-
Page 524 and 525:
CHAPTER 11 ■ INDEXES 479 Predicat
-
Page 526 and 527:
CHAPTER 11 ■ INDEXES 481 ops$tkyt
-
Page 528 and 529:
CHAPTER 11 ■ INDEXES 483 ops$tkyt
-
Page 530 and 531:
CHAPTER 11 ■ INDEXES 485 This dem
-
Page 532 and 533:
CHAPTER 11 ■ INDEXES 487 SELECT /
-
Page 534 and 535:
CHAPTER 12 ■ ■ ■ Datatypes Ch
-
Page 536 and 537:
CHAPTER 12 ■ DATATYPES 491 • TI
-
Page 538 and 539:
CHAPTER 12 ■ DATATYPES 493 (in th
-
Page 540 and 541:
CHAPTER 12 ■ DATATYPES 495 That d
-
Page 542 and 543:
CHAPTER 12 ■ DATATYPES 497 ops$tk
-
Page 544 and 545:
CHAPTER 12 ■ DATATYPES 499 Table
-
Page 546 and 547:
CHAPTER 12 ■ DATATYPES 501 The IN
-
Page 548 and 549:
CHAPTER 12 ■ DATATYPES 503 ops$tk
-
Page 550 and 551:
CHAPTER 12 ■ DATATYPES 505 • BI
-
Page 552 and 553:
CHAPTER 12 ■ DATATYPES 507 NUMBER
-
Page 554 and 555:
CHAPTER 12 ■ DATATYPES 509 MSG NU
-
Page 556 and 557:
CHAPTER 12 ■ DATATYPES 511 They a
-
Page 558 and 559:
CHAPTER 12 ■ DATATYPES 513 ■Not
-
Page 560 and 561:
CHAPTER 12 ■ DATATYPES 515 Coping
-
Page 562 and 563:
CHAPTER 12 ■ DATATYPES 517 Note t
-
Page 564 and 565:
CHAPTER 12 ■ DATATYPES 519 We are
-
Page 566 and 567:
CHAPTER 12 ■ DATATYPES 521 Format
-
Page 568 and 569:
CHAPTER 12 ■ DATATYPES 523 ops$tk
-
Page 570 and 571:
CHAPTER 12 ■ DATATYPES 525 You ca
-
Page 572 and 573:
CHAPTER 12 ■ DATATYPES 527 month
-
Page 574 and 575:
CHAPTER 12 ■ DATATYPES 529 DT2-DT
-
Page 576 and 577:
CHAPTER 12 ■ DATATYPES 531 DT TS
-
Page 578 and 579:
CHAPTER 12 ■ DATATYPES 533 ops$tk
-
Page 580 and 581:
CHAPTER 12 ■ DATATYPES 535 Since
-
Page 582 and 583:
CHAPTER 12 ■ DATATYPES 537 ops$tk
-
Page 584 and 585:
CHAPTER 12 ■ DATATYPES 539 ops$tk
-
Page 586 and 587:
CHAPTER 12 ■ DATATYPES 541 suppor
-
Page 588 and 589:
CHAPTER 12 ■ DATATYPES 543 Concep
-
Page 590 and 591:
CHAPTER 12 ■ DATATYPES 545 We can
-
Page 592 and 593:
CHAPTER 12 ■ DATATYPES 547 buffer
-
Page 594 and 595:
CHAPTER 12 ■ DATATYPES 549 Note t
-
Page 596 and 597:
CHAPTER 12 ■ DATATYPES 551 13 dbm
-
Page 598 and 599:
CHAPTER 12 ■ DATATYPES 553 equall
-
Page 600 and 601:
CHAPTER 12 ■ DATATYPES 555 ROWID/
-
Page 602 and 603:
CHAPTER 13 ■ ■ ■ Partitioning
-
Page 604 and 605:
CHAPTER 13 ■ PARTITIONING 559 6 (
-
Page 606 and 607:
CHAPTER 13 ■ PARTITIONING 561 els
-
Page 608 and 609:
CHAPTER 13 ■ PARTITIONING 563 BIG
-
Page 610 and 611:
CHAPTER 13 ■ PARTITIONING 565 Enh
-
Page 612 and 613:
CHAPTER 13 ■ PARTITIONING 567 Tab
-
Page 614 and 615:
CHAPTER 13 ■ PARTITIONING 569 tha
-
Page 616 and 617:
CHAPTER 13 ■ PARTITIONING 571 PAR
-
Page 618 and 619:
CHAPTER 13 ■ PARTITIONING 573 35
-
Page 620 and 621:
CHAPTER 13 ■ PARTITIONING 575 If
-
Page 622 and 623:
CHAPTER 13 ■ PARTITIONING 577 We
-
Page 624 and 625:
CHAPTER 13 ■ PARTITIONING 579 14
-
Page 626 and 627:
CHAPTER 13 ■ PARTITIONING 581 ops
-
Page 628 and 629:
CHAPTER 13 ■ PARTITIONING 583 In
-
Page 630 and 631:
CHAPTER 13 ■ PARTITIONING 585 ops
-
Page 632 and 633:
CHAPTER 13 ■ PARTITIONING 587 | S
-
Page 634 and 635:
CHAPTER 13 ■ PARTITIONING 589 12
-
Page 636 and 637:
CHAPTER 13 ■ PARTITIONING 591 ops
-
Page 638 and 639:
CHAPTER 13 ■ PARTITIONING 593 •
-
Page 640 and 641:
CHAPTER 13 ■ PARTITIONING 595 Now
-
Page 642 and 643:
CHAPTER 13 ■ PARTITIONING 597 the
-
Page 644 and 645:
CHAPTER 13 ■ PARTITIONING 599 imp
-
Page 646 and 647:
CHAPTER 13 ■ PARTITIONING 601 OLT
-
Page 648 and 649:
CHAPTER 13 ■ PARTITIONING 603 5 s
-
Page 650 and 651:
CHAPTER 13 ■ PARTITIONING 605 Sur
-
Page 652 and 653:
CHAPTER 13 ■ PARTITIONING 607 On
-
Page 654 and 655:
CHAPTER 13 ■ PARTITIONING 609 Row
-
Page 656 and 657:
CHAPTER 13 ■ PARTITIONING 611 So,
-
Page 658 and 659:
CHAPTER 13 ■ PARTITIONING 613 Aud
-
Page 660 and 661:
CHAPTER 14 ■ ■ ■ Parallel Exe
-
Page 662 and 663:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 664 and 665:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 666 and 667:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 668 and 669:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 670 and 671:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 672 and 673:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 674 and 675:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 676 and 677:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 678 and 679:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 680 and 681:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 682 and 683:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 684 and 685:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 686 and 687:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 688 and 689:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 690 and 691:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 692 and 693:
CHAPTER 14 ■ PARALLEL EXECUTION 6
-
Page 694 and 695:
CHAPTER 15 ■ ■ ■ Data Loading
-
Page 696 and 697:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 698 and 699:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 700 and 701:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 702 and 703:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 704 and 705:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 706 and 707:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 708 and 709:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 710 and 711:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 712 and 713:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 714 and 715:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 716 and 717:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 718 and 719:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 720 and 721:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 722 and 723:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 724 and 725:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 726 and 727:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 728 and 729:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 730 and 731:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 732 and 733:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 734 and 735:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 736 and 737:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 738 and 739:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 740 and 741:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 742 and 743:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 744 and 745:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 746 and 747:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 748:
CHAPTER 15 ■ DATA LOADING AND UNL
-
Page 751 and 752:
706 ■INDEX autonomous transaction
-
Page 753 and 754:
708 ■INDEX CREATE ANY DIRECTORY f
-
Page 755 and 756:
710 ■INDEX dedicated server, 57-5
-
Page 757 and 758:
712 ■INDEX flat files, 66, 113-14
-
Page 759 and 760:
714 ■INDEX job queue coordinator
-
Page 761 and 762:
716 ■INDEX MAXTRANS parameter, 21
-
Page 763 and 764:
718 ■INDEX parameter files (PFILE
-
Page 765 and 766:
720 ■INDEX REUSE option, 97 REUSE
-
Page 767 and 768:
722 ■INDEX System Global Area (SG
-
Page 769:
724 ■INDEX utility background pro
Change language