Database System ImplementationFor junior, senior and graduate school-level, one or two term sequence Database Systems courses. Written in a very accessible style by three well-known computer scientists, this text explores the implementation of database systems in depth including storage structures, query processing, and transaction management. |
Contents
Table of Contents | 1 |
ixedLength Records into Blocks | 3 |
The Query Compiler | 7 |
Copyright | |
21 other sections not shown
Other editions - View all
Common terms and phrases
actions algorithm assume attribute average B-tree bit-vector bitmap index bits bucket bucket array buffer manager bytes CKPT commit components compute consider copy cylinder data block data disks data file data structures database element database systems DBMS deletion dimension discussed in Section disk blocks disk I/O's elevator algorithm Example execute Exercises for Section fields Figure hash function hash table header insert integer interior node join kd-tree key-pointer pairs leaf log record logical query plan main memory Megatron 747 milliseconds modulo-2 sum MovieStar multiway merge number of disk operations output overflow blocks phase pointers processor query plan range query record with key redundant disk relational algebra represent requests schedule schema search key secondary storage sector selection sequence serializable sorted sublists space sparse index Stars stored string Suppose swizzled T₁ T₂ tertiary storage timestamp track transaction tree tuples Two-Phase update write