Relational database index design and the optimizers: DB2, Oracle, SQL server, et al.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Hoboken, NJ
Wiley
2005
|
| Schlagworte: | |
| Online-Zugang: | Contributor biographical information Publisher description lizenzfrei Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | XVII, 310 S. graph. Darst. 24 cm |
| ISBN: | 0471719994 9780471719991 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036743671 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 101027s2005 d||| b||| 00||| eng d | ||
| 020 | |a 0471719994 |c cloth |9 0-471-71999-4 | ||
| 020 | |a 9780471719991 |9 978-0-471-71999-1 | ||
| 035 | |a (OCoLC)249561152 | ||
| 035 | |a (DE-599)GBV395868998 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 082 | 0 | |a 005.7565 | |
| 084 | |a ST 270 |0 (DE-625)143638: |2 rvk | ||
| 100 | 1 | |a Lahdenmäki, Tapio |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Relational database index design and the optimizers |b DB2, Oracle, SQL server, et al. |c Tapio Lahdenmäki ; Michael Leach |
| 264 | 1 | |a Hoboken, NJ |b Wiley |c 2005 | |
| 300 | |a XVII, 310 S. |b graph. Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 650 | 0 | 7 | |a Relationale Datenbank |0 (DE-588)4049358-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Indizierung |g Informatik |0 (DE-588)4385466-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Leistungssteigerung |0 (DE-588)4167306-2 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4006432-3 |a Bibliografie |2 gnd-content | |
| 689 | 0 | 0 | |a Relationale Datenbank |0 (DE-588)4049358-1 |D s |
| 689 | 0 | 1 | |a Indizierung |g Informatik |0 (DE-588)4385466-7 |D s |
| 689 | 0 | 2 | |a Leistungssteigerung |0 (DE-588)4167306-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Leach, Michael |e Verfasser |4 aut | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0612/2004021914-b.html |y Contributor biographical information |z lizenzfrei | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0612/2004021914-d.html |y Publisher description |z lizenzfrei | |
| 856 | 4 | |u http://www.loc.gov/catdir/toc/ecip051/2004021914.html |z lizenzfrei |3 Inhaltsverzeichnis | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020661104&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020661104 | ||
Datensatz im Suchindex
| _version_ | 1804143402390913024 |
|---|---|
| adam_text | IMAGE 1
RELATIONAL DATABASE
INDEX DESIGN AND THE OPTIMIZERS DB2, ORACLE, SQL SERVER, ET AL.
TAPIO LAHDENMAEKI MICHAEL LEACH
(C^WILEYIX/INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION
IMAGE 2
CONTENTS
PREFACE XV
1 INTRODUCTION 1
ANOTHER BOOK ABOUT SQL PERFORMANCE! 1
INADEQUATE INDEXING 3
MYTHS AND MISCONCEPTIONS 4
MYTH 1: NO MORE THAN FIVE INDEX LEVELS 5
MYTH 2: NO MORE THAN SIX INDEXES PER TABLE 6
MYTH 3: VOLATILE COLUMNS SHOULD NOT BE INDEXED 6 EXAMPLE 7
DISK DRIVE UTILIZATION 7
SYSTEMATIC INDEX DESIGN 8
2 TABLE AND INDEX ORGANIZATION 11
INTRODUCTION 11
INDEX AND TABLE PAGES 12
INDEX ROWS 12
INDEX STRUCTURE 13
TABLE ROWS 13
BUFFER POOLS AND DISK I/OS 13
READS FROM THE DBMS BUFFER POOL 14
RANDOM I/O FROM DISK DRIVES 14
READS FROM THE DISK SERVER CACHE 15
SEQUENTIAL READS FROM DISK DRIVES 16
ASSISTED RANDOM READS 16
ASSISTED SEQUENTIAL READS 19
SYNCHRONOUS AND ASYNCHRONOUS I/OS 19
HARDWARE SPECIFICS 20
DBMS SPECIFICS 21
PAGES 21
TABLE CLUSTERING 22
INDEX ROWS 23
V
IMAGE 3
VI CONTENTS
TABLE ROWS 23
INDEX-ONLY TABLES 23
PAGE ADJACENCY 24
ALTERNATIVES TO B-TREE INDEXES 25
MANY MEANINGS OF CLUSTER 26
3 SQL PROCESSING 29
INTRODUCTION 29
PREDICATES 30
OPTIMIZERS AND ACCESS PATHS 30
INDEX SLICES AND MATCHING COLUMNS 31
INDEX SCREENING AND SCREENING COLUMNS 32 ACCESS PATH TERMINOLOGY 33
MONITORING THE OPTIMIZER 34
HELPING THE OPTIMIZER (STATISTICS) 34
HELPING THE OPTIMIZER (NUMBER OF FETCH CALLS) 35 WHEN THE ACCESS PATH IS
CHOSEN 36
FILTER FACTORS 37
FILTER FACTORS FOR COMPOUND PREDICATES 37
IMPACT OF FILTER FACTORS ON INDEX DESIGN 39
MATERIALIZING THE RESULT ROWS 42
CURSOR REVIEW 42
ALTERNATIVE 1: FETCH CALL MATERIALIZES ONE RESULT ROW 43 ALTERNATIVE 2:
EARLY MATERIALIZATION 44
WHAT EVERY DATABASE DESIGNER SHOULD REMEMBER 44 EXERCISES 44
4 DERIVING THE IDEAL INDEX FOR A SELECT 47
INTRODUCTION 47
BASIC ASSUMPTIONS FOR DISK AND CPU TIMES 48
INADEQUATE INDEX 48
THREE-STAR I N D E X - T HE IDEAL INDEX FOR A SELECT 49
HOW THE STARS ARE ASSIGNED 50
RANGE PREDICATES AND A THREE-STAR INDEX 52
ALGORITHM TO DERIVE THE BEST INDEX FOR A SELECT 54
CANDIDATE A 54
CANDIDATE B 55
SORTING IS FAST TODAY-WHY DO WE NEED CANDIDATE B? 55
IMAGE 4
IDEAL INDEX FOR EVERY SELECT? 56
TOTALLY SUPERFLUOUS INDEXES 57
PRACTICALLY SUPERFLUOUS INDEXES 57
POSSIBLY SUPERFLUOUS INDEXES 58
COST OF AN ADDITIONAL INDEX 58
RESPONSE TIME 58
DRIVE LOAD 59
DISK SPACE 61
RECOMMENDATION 62
EXERCISES 62
5 PROACTIVE INDEX DESIGN
DETECTION OF INADEQUATE INDEXING 63
BASIC QUESTION (BQ) 63
WARNING 64
QUICK UPPER-BOUND ESTIMATE (QUBE) 65
SERVICE TIME 65
QUEUING TIME 66
ESSENTIAL CONCEPT: TOUCH 67
COUNTING TOUCHES 69
FETCH PROCESSING 70
QUBE EXAMPLES FOR THE MAIN ACCESS TYPES 71
CHEAPEST ADEQUATE INDEX OR BEST POSSIBLE INDEX: EXAMPLE 1 75
BASIC QUESTION FOR THE TRANSACTION 78
QUICK UPPER-BOUND ESTIMATE FOR THE TRANSACTION 78 CHEAPEST ADEQUATE
INDEX OR BEST POSSIBLE INDEX 79 BEST INDEX FOR THE TRANSACTION 79
SEMIFAT INDEX (MAXIMUM INDEX SCREENING) 80 FAT INDEX (INDEX ONLY) 80
CHEAPEST ADEQUATE INDEX OR BEST POSSIBLE INDEX: EXAMPLE 2 82
BASIC QUESTION AND QUBE FOR THE RANGE TRANSACTION 82 BEST INDEX FOR THE
TRANSACTION 83
SEMIFAT INDEX (MAXIMUM INDEX SCREENING) 84 FAT INDEX (INDEX ONLY) 85
CONTENTS VH
63
WHEN TO USE THE QUBE 86
IMAGE 5
VIII CONTENTS
6 FACTORS AFFECTING THE INDEX DESIGN PROCESS 87
I/O TIME ESTIMATE VERIFICATION 87
MULTIPLE THIN INDEX SLICES 88
SIMPLE IS BEAUTIFUL (AND SAFE) 90
DIFFICULT PREDICATES 91
LIKE PREDICATE 91
OR OPERATOR AND BOOLEAN PREDICATES 92
IN PREDICATE 93
FILTER FACTOR PITFALL 94
FILTER FACTOR PITFALL EXAMPLE 96
BEST INDEX FOR THE TRANSACTION 99
SEMIFAT INDEX (MAXIMUM INDEX SCREENING) 100 FAT INDEX (INDEX ONLY) 101
SUMMARY 101
EXERCISES 102
7 REACTIVE INDEX DESIGN 105
INTRODUCTION 105
EXPLAIN DESCRIBES THE SELECTED ACCESS PATHS 106
FUELL TABLE SCAN OR FUELL INDEX SCAN 106
SORTING RESULT ROWS 106
COST ESTIMATE 107
DBMS-SPECIFIC EXPLAIN OPTIONS AND RESTRICTIONS 108
MONITORING REVEALS THE REALITY 108
EVOLUTION OF PERFORMANCE MONITORS 109
LRT-LEVEL EXCEPTION MONITORING 111
AVERAGES PER PROGRAM ARE NOT SUFFICIENT 111
EXCEPTION REPORT EXAMPLE: ONE LINE PER SPIKE 111 CULPRITS AND VICTIMS
112
PROMISING AND UNPROMISING CULPRITS 114 PROMISING CULPRITS 114
TUNING POTENTIAL 116
UNPROMISING CULPRITS 120
VICTIMS 121
FINDING THE SLOW SQL CALLS 123
IMAGE 6
CONTENTS IX
CALL-LEVEL EXCEPTION MONITORING 123
ORACLE EXAMPLE 126
SQL SERVER EXAMPLE 129
CONCLUSION 131
DBMS-SPECIFIC MONITORING ISSUES 131
SPIKE REPORT 132
EXERCISES 133
8 INDEXING FOR TABLE JOINS 135
INTRODUCTION 135
TWO SIMPLE JOINS 136
EXAMPLE 8.1: CUSTOMER OUTER TABLE 137
EXAMPLE 8.2: INVOICE OUTER TABLE 138
IMPACT OF TABLE ACCESS ORDER ON INDEX DESIGN 139
CASE STUDY 140
CURRENT INDEXES 143
IDEAL INDEXES 149
IDEAL INDEXES WITH ONE SCREEN PER TRANSACTION MATERIALIZED 153 IDEAL
INDEXES WITH ONE SCREEN PER TRANSACTION MATERIALIZED AND FF PITFALL 157
BASIC JOIN QUESTION (BJQ) 158
CONCLUSION: NESTED-LOOP JOIN 160
PREDICTING THE TABLE ACCESS ORDER 161
MERGE SCAN JOINS AND HASH JOINS 163
MERGE SCAN JOIN 163
EXAMPLE 8.3: MERGE SCAN JOIN 163
HASH JOINS 165
PROGRAM C: MS/HJ CONSIDERED BY THE OPTIMIZER (CURRENT INDEXES) 166 IDEAL
INDEXES 167
NESTED-LOOP JOINS VERSUS MS/HJ AND IDEAL INDEXES 170
NESTED-LOOP JOINS VERSUS MS/HJ 170
IDEAL INDEXES FOR JOINS 171
JOINING MORE THAN TWO TABLES 171
WHY JOINS OFTEN PERFORM POORLY 174
FUZZY INDEXING 174
OPTIMIZER MAY CHOOSE THE WRONG TABLE ACCESS ORDER 175 OPTIMISTIC TABLE
DESIGN 175
IMAGE 7
X CONTENTS
DESIGNING INDEXES FOR SUBQUERIES 175 DESIGNING INDEXES FOR UNIONS 176
TABLE DESIGN CONSIDERATIONS 176
REDUNDANT DATA 176
UNCONSCIOUS TABLE DESIGN 180
EXERCISES 183
9 STAR JOIN CONSIDERATIONS 185
INTRODUCTION 185
INDEXES ON DIMENSION TABLES 187
HUGE IMPACT OF THE TABLE ACCESS ORDER 188
INDEXES ON FACT TABLES 190
SUMMARY TABLES 192
10 MULTIPLE INDEX ACCESS 195
INTRODUCTION 195
INDEX ANDING 195
INDEX ANDING WITH QUERY TABLES 197 MULTIPLE INDEX ACCESS AND FACT TABLES
198 MULTIPLE INDEX ACCESS WITH BITMAP INDEXES 198
INDEX ORING 199
INDEX JOIN 200
EXERCISES 201
11 INDEXES AND REORGANIZATION 203
PHYSICAL STRUCTURE OF A B-TREE INDEX 203
HOW THE DBMS FINDS AN INDEX ROW 204
WHAT HAPPENS WHEN A ROW IS INSERTED? 205 ARE LEAF PAGE SPLITS SERIOUS?
206
WHEN SHOULD AN INDEX BE REORGANIZED? 208
INSERT PATTERNS 208
VOLATILE INDEX COLUMNS 216
LONG INDEX ROWS 218
EXAMPLE: ORDER-SENSITIVE BATCH JOB 219
TABLE DISORGANIZATION (WITH A CLUSTERING INDEX) 222 TABLE
DISORGANIZATION (WITHOUT CLUSTERING INDEX STARTING WITH CNO) 223
IMAGE 8
CONTENTS XI
TABLE ROWS STORED IN LEAF PAGES 223
SQL SERVER 223
ORACLE 224
COST OF INDEX REORGANIZATION 225
SPLIT MONITORING 226
SUMMARY 227
12 DBMS-SPECIFIC INDEXING RESTRICTIONS 231
INTRODUCTION 231
NUMBER OF INDEX COLUMNS 231
TOTAL LENGTH OF THE INDEX COLUMNS 232
VARIABLE-LENGTH COLUMNS 232 NUMBER OF INDEXES PER TABLE 232
MAXIMUM INDEX SIZE 232
INDEX LOCKING 232
INDEX ROW SUPPRESSION 233
DBMS INDEX CREATION EXAMPLES 234
13 DBMS-SPECIFIC INDEXING OPTIONS 237
INTRODUCTION 237
INDEX ROW SUPPRESSION 237
ADDITIONAL INDEX COLUMNS AFTER THE INDEX KEY 238 CONSTRAINTS TO ENFORCE
UNIQUENESS 240 DBMS ABLE TO READ AN INDEX IN BOTH DIRECTIONS 240 INDEX
KEY TRANCATION 241
FUNCTION-BASED INDEXES 241
INDEX SKIP SCAN 242
BLOCK INDEXES 243
DATA-PARTITIONED SECONDARY INDEXES 243 EXERCISES 244
14 OPTIMIZERS ARE NOT PERFECT 245
INTRODUCTION 245
OPTIMIZERS DO NOT ALWAYS SEE THE BEST ALTERNATIVE 246
MATCHING AND SCREENING PROBLEMS 246 NON-BT 247
UNNECESSARY SORT 250
UNNECESSARY TABLE TOUCHES 251
IMAGE 9
XII CONTENTS
OPTIMIZERS COST ESTIMATES MAY BE VERY WRONG 252
RANGE PREDICATES WITH HOST VARIABLES 252 SKEWED DISTRIBUTION 253
CORRELATED COLUMNS 255
CAUTIONARY TALE OF PARTIAL INDEX KEYS 256
COST ESTIMATE FORMULAS 259
ESTIMATING I/O TIME 259
ESTIMATING CPU TIME 261
HELPING THE OPTIMIZER WITH ESTIMATE-RELATED PROBLEMS 261
DO OPTIMIZER PROBLEMS AFFECT INDEX DESIGN? 265
EXERCISES 265
15 ADDITIONAL ESTIMATION CONSIDERATIONS 267
ASSUMPTIONS BEHIND THE QUBE FORMULA 267
NONLEAF INDEX PAGES IN MEMORY 268
EXAMPLE 268
IMPACT OF THE DISK SERVER READ CACHE 269
BUFFER SUBPOOLS 270
LONG ROWS 272
SLOW SEQUENTIAL READ 272
WHEN THE ACTUAL RESPONSE TIME CAN BE MUCH SHORTER THAN THE QUBE 272
LEAF PAGES AND TABLE PAGES REMAIN IN THE BUFFER POOL 273 IDENTIFYING
THESE CHEAP RANDOM TOUCHES 275 ASSISTED RANDOM READS 275
ASSISTED SEQUENTIAL READS 278
ESTIMATING CPU TIME (CQUBE) 278
CPU TIME PER SEQUENTIAL TOUCH 278
CPU TIME PER RANDOM TOUCH 279
CPU TIME PER FETCH CALL 281
CPU TIME PER SORTED ROW 282
CPU ESTIMATION EXAMPLES 282
FAT INDEX OR IDEAL INDEX 283
NESTED-LOOP LOIN (AND DENORMALIZATION) OR MS/HJ 283 MERGE SCAN AND HASH
LOIN COMPARISON 286
SKIP-SEQUENTIAL 287
CPU TIME STILL MATTERS 288
IMAGE 10
CONTENTS XIII
16 ORGANIZING THE INDEX DESIGN PROCESS 289
INTRODUCTION 289
COMPUTER-ASSISTED INDEX DESIGN 290 NINE STEPS TOWARD EXCELLENT INDEXES
292
REFERENCES 295
GLOSSARY 297
INDEX DESIGN APPROACH 297
GENERAL 299
INDEX 305
|
| any_adam_object | 1 |
| author | Lahdenmäki, Tapio Leach, Michael |
| author_facet | Lahdenmäki, Tapio Leach, Michael |
| author_role | aut aut |
| author_sort | Lahdenmäki, Tapio |
| author_variant | t l tl m l ml |
| building | Verbundindex |
| bvnumber | BV036743671 |
| classification_rvk | ST 270 |
| ctrlnum | (OCoLC)249561152 (DE-599)GBV395868998 |
| dewey-full | 005.7565 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.7565 |
| dewey-search | 005.7565 |
| dewey-sort | 15.7565 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02077nam a2200457 c 4500</leader><controlfield tag="001">BV036743671</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">101027s2005 d||| b||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471719994</subfield><subfield code="c">cloth</subfield><subfield code="9">0-471-71999-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780471719991</subfield><subfield code="9">978-0-471-71999-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)249561152</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV395868998</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.7565</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 270</subfield><subfield code="0">(DE-625)143638:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lahdenmäki, Tapio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Relational database index design and the optimizers</subfield><subfield code="b">DB2, Oracle, SQL server, et al.</subfield><subfield code="c">Tapio Lahdenmäki ; Michael Leach</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ</subfield><subfield code="b">Wiley</subfield><subfield code="c">2005</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 310 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Relationale Datenbank</subfield><subfield code="0">(DE-588)4049358-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Indizierung</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4385466-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Leistungssteigerung</subfield><subfield code="0">(DE-588)4167306-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4006432-3</subfield><subfield code="a">Bibliografie</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Relationale Datenbank</subfield><subfield code="0">(DE-588)4049358-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Indizierung</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4385466-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Leistungssteigerung</subfield><subfield code="0">(DE-588)4167306-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Leach, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0612/2004021914-b.html</subfield><subfield code="y">Contributor biographical information</subfield><subfield code="z">lizenzfrei</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0612/2004021914-d.html</subfield><subfield code="y">Publisher description</subfield><subfield code="z">lizenzfrei</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/toc/ecip051/2004021914.html</subfield><subfield code="z">lizenzfrei</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020661104&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020661104</subfield></datafield></record></collection> |
| genre | (DE-588)4006432-3 Bibliografie gnd-content |
| genre_facet | Bibliografie |
| id | DE-604.BV036743671 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:47:05Z |
| institution | BVB |
| isbn | 0471719994 9780471719991 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020661104 |
| oclc_num | 249561152 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | XVII, 310 S. graph. Darst. 24 cm |
| publishDate | 2005 |
| publishDateSearch | 2005 |
| publishDateSort | 2005 |
| publisher | Wiley |
| record_format | marc |
| spelling | Lahdenmäki, Tapio Verfasser aut Relational database index design and the optimizers DB2, Oracle, SQL server, et al. Tapio Lahdenmäki ; Michael Leach Hoboken, NJ Wiley 2005 XVII, 310 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references and index Relationale Datenbank (DE-588)4049358-1 gnd rswk-swf Indizierung Informatik (DE-588)4385466-7 gnd rswk-swf Leistungssteigerung (DE-588)4167306-2 gnd rswk-swf (DE-588)4006432-3 Bibliografie gnd-content Relationale Datenbank (DE-588)4049358-1 s Indizierung Informatik (DE-588)4385466-7 s Leistungssteigerung (DE-588)4167306-2 s DE-604 Leach, Michael Verfasser aut http://www.loc.gov/catdir/enhancements/fy0612/2004021914-b.html Contributor biographical information lizenzfrei http://www.loc.gov/catdir/enhancements/fy0612/2004021914-d.html Publisher description lizenzfrei http://www.loc.gov/catdir/toc/ecip051/2004021914.html lizenzfrei Inhaltsverzeichnis GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020661104&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Lahdenmäki, Tapio Leach, Michael Relational database index design and the optimizers DB2, Oracle, SQL server, et al. Relationale Datenbank (DE-588)4049358-1 gnd Indizierung Informatik (DE-588)4385466-7 gnd Leistungssteigerung (DE-588)4167306-2 gnd |
| subject_GND | (DE-588)4049358-1 (DE-588)4385466-7 (DE-588)4167306-2 (DE-588)4006432-3 |
| title | Relational database index design and the optimizers DB2, Oracle, SQL server, et al. |
| title_auth | Relational database index design and the optimizers DB2, Oracle, SQL server, et al. |
| title_exact_search | Relational database index design and the optimizers DB2, Oracle, SQL server, et al. |
| title_full | Relational database index design and the optimizers DB2, Oracle, SQL server, et al. Tapio Lahdenmäki ; Michael Leach |
| title_fullStr | Relational database index design and the optimizers DB2, Oracle, SQL server, et al. Tapio Lahdenmäki ; Michael Leach |
| title_full_unstemmed | Relational database index design and the optimizers DB2, Oracle, SQL server, et al. Tapio Lahdenmäki ; Michael Leach |
| title_short | Relational database index design and the optimizers |
| title_sort | relational database index design and the optimizers db2 oracle sql server et al |
| title_sub | DB2, Oracle, SQL server, et al. |
| topic | Relationale Datenbank (DE-588)4049358-1 gnd Indizierung Informatik (DE-588)4385466-7 gnd Leistungssteigerung (DE-588)4167306-2 gnd |
| topic_facet | Relationale Datenbank Indizierung Informatik Leistungssteigerung Bibliografie |
| url | http://www.loc.gov/catdir/enhancements/fy0612/2004021914-b.html http://www.loc.gov/catdir/enhancements/fy0612/2004021914-d.html http://www.loc.gov/catdir/toc/ecip051/2004021914.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020661104&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT lahdenmakitapio relationaldatabaseindexdesignandtheoptimizersdb2oraclesqlserveretal AT leachmichael relationaldatabaseindexdesignandtheoptimizersdb2oraclesqlserveretal |