Chapter 2. Table and Index Organization
Published Online: 27 JAN 2005
DOI: 10.1002/0471721379.ch2
Copyright © 2005 John Wiley & Sons, Inc.
Book Title
Relational Database Index Design and the Optimizers: DB2, Oracle, SQL Server, et al.
Additional Information
How to Cite
Lahdenmäki, T. and Leach, M. (2005) Table and Index Organization, in Relational Database Index Design and the Optimizers: DB2, Oracle, SQL Server, et al., John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/0471721379.ch2
Publication History
- Published Online: 27 JAN 2005
- Published Print: 24 JUN 2005
ISBN Information
Print ISBN: 9780471719991
Online ISBN: 9780471721376
- Summary
- Chapter
Keywords:
- index and table physical organization;
- index and table pages;
- index and table rows;
- buffer pools;
- disk cache;
- disk I/Os;
- random I/Os;
- sequential I/Os;
- assisted random reads;
- assisted sequential reads;
- skip-sequential;
- list prefetch;
- data block prefetching;
- synchronous I/Os;
- asynchronous I/Os;
- database management systems;
- SQL Server;
- Oracle;
- DB2 for z/OS;
- DB2 for LUW;
- table clustering;
- index-only tables;
- page adjacency;
- clustering;
- B-tree indexes;
- bitmap indexes;
- hashing
Summary
What we need to know about the physical organization of indexes and tables; the structure and use of the index and table pages, index and table rows, buffer pools and disk cache. The characteristics of disk I/Os; random and sequential; assisted random and sequential reads - skip-sequential, list prefetch and data block prefetching; the significance of synchronous and asynchronous I/Os. The similarities and differences between database management systems; pages and table clustering, index rows, index-only tables, page adjacency; the very confusing but important issue of the term “Cluster”. Alternatives to B-tree indexes; bitmap indexes and hashing.