Database System Implementation
副标题：无
分类号：
ISBN：9787111091615
微信扫一扫,移动浏览光盘
简介
Three well-known computer scientis at Stanford UniveEity-Hector Garcia-Molina. Jeffrey D. Ullman, and Jennifer Widom-have written one of the most comprehensive books on database system implementation.Hector Garcia-Molina pioneered Database System Implementation at Stanford as a second database systems course for computer science majors and industry-based professionals. It focuses on the implementation of database systems,including storage structures, query processing. and transaction management. This book is valuable as an academic textbook or a professional reference.
This text covers a broad spectrum of knowledge and technology This carefully class-tested, highly readable presentation provides students or professionals with the next level of study. Written from the point of view of the database designer, user, and application programmer, this book provides practical advice from well-known experts on how to implement state-of-the-art database systems.
目录
1 introduction to dbms implementation
1.1 introducing: the megatron 2000 database system
1.1.1 megatron 2000 implementation details
l.1.2 how megatron 2000 executes queries
1.1.3 what's wrong with megatron 2000?
1.2 overview of a database management system
1.2.1 datadefinition language commands
1.2.2 overview of query processing
1.2.3 main--memory buffers and the buffer manager
1.2.4 thansaction processing
1.2.5 the query processor
1.3 outline of this book
1.3. 1 prerequisites
1.3.2 storage-- m anagement overview
1.3.3 query-proce8sing overview
1.3.4 thansaction- p rocessing overview
1.3.5 information integration overview
1.4 review of database models and languages
1.4.1 relational model review
1.4.2 sql review
.1.4.3 re1ational and object-oriented data
1.5 summary of chapter 1
1.6 references for chapter 1
2 data storage
2.1 the memory hierarchy
2.1.1 cache
2.1.2 main memory
2.1.3 virtual memory
2.1.4 secondary storage
2.1.5 tertiary storage
2.1.6 volatile and nonvolatile storage
2.1.7 exercises for section 2.1
2.2 disks
2.2.1 mechanics of disks
2.2.2 the disk controller
2.2.3 disk storage characteristics
2.2.4 disk access characteristics
2.2.5 writing blocks
2.2.6 modifying blocks
2.2.7 exercises for section 2.2
2.3 using secondary storage effectively
2.3.1 the i/o model of computation
2.3.2 sorting data in secondajry storage
2.3.3 merge-sort
2.3.4 two-phase, multiway merge--sort
2.3.5 extension of multiway merging to larger relatbos
2.3.6 exercises for section 2.3
2.4 improving the access time of secondary storage
2.4.1 organizing data by cylinders
2.4.2 using multiple disks
2.4.3 mirroring disks
2.4.4 disk scheduling and the elevator algorithm
2.4.5 prefetching and large-scale buffering
2.4.6 summajry.of strategies and nadeoffe
2.4.7 exercises for section 2.4
2.5 disk failures
2.5.1 1ntermittent falures
2.5.2 checksums
2.5.3 stable storage
2.5.4 error-handling capabilities of stable storage
2.5.5 exercises for section 2.5
2.6 recovery from disk crashes
2.6.1 the failure model for disks
2.6.2 mirroring as a redundancy technique
2.6.3 paxity blocks
2.6.4 an improvment: raid 5
2.6.5 coping with multiple disk cfashes
2.6.6 exercises for section 2.6
2.7 summary.of chapter 2
2.8 references for chapter 2
3 representing datu elements
3.1 data elements and fields
3.1.1 representing relational database elements
3.1.2 representing objects
3.1.3 representing data elements
3.2 records
3.2.1 building fixed-length records
3.2.2 record headers
3.2.3 packing fixed-length records into blocks
3.2.4 exercises for section 3.2
3.3 represention block and record addresses
3.3.1 client--server systems
3.3.2 logicaj and structured addresses.
3.3.3 pointer swizzling
3.3.4 returning blocks to disk
3.3.5 pinned records and blocks
3.3.6 exercises for section 3.3
3.4 variable-length data and records
3.4.1 records with variable-length fields
3.4.2 records with repeating fields
3.4.3 variable-format records
3.4.4 records that do not fit in a block
3.4.5 blobs
3.4.6 exercises for section 3.4
3.5 record modifications
3.5.1 insertion
3.5.2 deletion
3.5.3 update
3.5.4 exercises for section 3.5
3.6 summary of chapter 3
3.7 references for chapter 3
4 index structure8
4.1 indexes on sequential files
4.1.1 sequential files
4.1.2 dense indexes
4.1.3 sparse indexes
4.1.4 multiple levels of index
4.1.5 indexes with duplicate search keys
4.1.6 managing indexes during data modifications
4.1.7 exercises for section 4.1
4.2 secondary indexes
4.2.1 design of secondary indexes
4.2.2 applications of secondary indexes
4.2.3 indirection in secondaxy indexes
4.2.4 document retrieval and inverted indexes
4.2.5 exercises for section 4.2
4.3 b-nees
4.3.l the structure of b--trees
4.3.2 applications of b-trees
4.3.3 lookup in b-trees
4.3.4 range queries
4.3.5 insertion into b-nees
4.3.6 deletion nom b-nees
4.3.7 efficiency of b-trees
4.3.8 exercises for section 4.3
4.4 hash tables
4.4.1 secondary-storage hash tables
4.4.2 insertion into a hash table
4.4.3 hash-table deletion
4.4.4 efficiency of hash table indexes
4.4.5 extensible hash tables
4.4.6 insertion into extensible hash tables
4.4.7 linear hash tables
4.4.8 insertion 1nto linear hash tables
4.4.9 exercises for section 4.4
4.5 summary of chapter 4
4.6 references for chapter 4
5 multidimensional indexes
5.1 applications needing multiple dimensions
5.1.1 gwaphic information system8
5.1.2 data cubes
5.1.3 multidimensional queries in sql
5.1.4 executing range queries using conventional 1ndexes
5.1.5 executing nearest--neighbor queries using conventionalindexes
5.1.6 other limitations of conventional indexes
5.1.7 overview of multidimensional index strllctures
5.1.8 exercises for section 5.1
5.2 hash-like structures for multidimensional data
5.2.l grid files
5.2.2 lookup in a grid file
5.2.3 insertion into grid files
5.2.4 performance of grid files
5.2.5 patitioned hash minctions
5.2.6 comparison of grid files and partitioned hashing
5.2.7 exercises for section 5.2
5.3 thee-like structures for multidimensional data
5.3.l multiple-key indexes
5.3.2 performance of multipleskey indexes
5.3.3 kdnees
5.3.4 operations on kdnees
5.3.5 adapting kdthees to secondary storage
5.3.6 quad thees
5.3.7 rtrees
5.3.8 operations on rtrees
5.3.9 exercises for section 5.3
5.4 bitmap indexes
5.4.1 motivation for bitmap indexes
5.4.2 compressed bitmaps
5.4.3 operating.on run-lengt h- encoded bit- vectors
5.4.4 managing bitmap indexes
5.4.5 exercises for section 5.4
5.5 summary of chapter 5
5.6 references for chapter 5
6 query execution
6.1 an algebra for queries
6.1.1 union, intersection, and difference
6.1.2 the selection operator
6.1.3 the projection operator
6.1.4 the product of relations
6.1.5 joins
6.1.6 duplicate elimination
6.1.7 grouping and aggregaion
6.1.8 the sorting operator
6.1.9 expression nees
6. 1. l0 exercises for section 6.1
6.2 introduction to physical-query-plan operators
6.2.l scanning tables
6.2.2 sorting while scanning tables
6.2.3 the model of computation for physical operators
6.2.4 parameters for measuring costs
6.2.5 i/o cost for scan operators
6.2.6 iterators for implementation of physical operators
6.3 one-pass algorithms for database operations
6.3.l one--pass algorithms for tuplesat-atime operations
6.3.2 one-pass algorithms for unary, fullrelation operai
6.3.3 one-pass algorithms for binary operations
6.3.4 exercises for section 6.3
6.4 nested-loop joins
6.4.1 tuple-based nested-loop join
6.4.2 an iterator for thple--based nested--loop join
6.4.3 a block-based nested--loop join algorithm
6.4.4 analysis of nested-loop join
6.4.5 summary of algorithms so far
6.4.6 exercises for section 6.4
6.5 twcapass algorithms based on sorting
6.5.1 duplicate elimination using sorting
6.5.2 grouping and aggregation using sorting
6.5.3 a sort-based union algorithm
6.5.4 sort-based algorithms for intersection and difference
6.5.5 a simple sort--based join algorithm
6.5.6 analysis of simple sort-join
6.5.7 a more efficient sort-based join
6.5.8 summary of sort-based algorithms
6.5.9 exercises for section 6.5
6.6 two-pass algorithms based on hashing
6.6.1 partitioning relations by hashing
6.6.2 a hash-based algorithm for duplicate elimination
6.6.3 a hash--based algorithm for grouping and aggrgation
6.6.4 hash-based algorithms for union, intersection, and dif ference
6.6.5 the hash-join algorithm
6.6.6 saving some disk i/o's
6.6.7 summary of hash-based algorithms
6.6.8 exercises for section 6.6
6.7 index-based algorithms
6.7.1 clustering and nonclustering indexes
6.7.2 index--based selection
6.7.3 joining by using an index
6.7.4 joins using a sorted index
6.7.5 exercises for section 6.7
6.8 buffer management
6.8.l buffer management architecture
6.8.2 buffer manapement strategies
6.8.3 the relationship between physical operator selection and buffer management
6.8.4 exercises for section 6.8
6.9 algorithms using more than two passes
6.9.1 multipass sort-based algorithms
6.9.2 performance of multipass, sort--based algorithms
6.9.3 multipass hash-based algorithms
6.9.4 performance of multipass hash-based algorithms
6.9.5 exercises for section 6.9
6.l0 paxajlel algorithms for relational operations.
6.10.1 models of paxallelism
6.10.2 tuple-at-atime operations in parallel
6.10.3 parallel algorithms for full--relation operations
6.l0.4 performance of parallel algorithms
6.10.5 exercises for section 6.10
6.1l summajry of chapter 6
6.12 references for chapter 6
7 the query compiler
7.1 parsing
7.1.1 syntax analysis and parse nees
7.1.2 a grammar for a simple subset of sql
7.1.3 the preprocessor
7.1.4 exercises for section 7.1
7.2 algebraic laws for improving query plans
7.2.1 commutative and associative laws
7.2.2 laws involving selection
7.2.3 pushing selections
7.2.4 laws involving projection
7.2.5 laws about joins and products
7.2.6 laws involving duplicate elimination
7.2.7 laws lnvolving grouping and aggregation
7.2.8 exercises for section 7.2
7.3 from pajrse thees to logical query plans
7.3.1 conversion to relational algebra
7.3.2 removing subqueries nom conditions
7.3.3 improving the logical query plan
7.3.4 grouping associative/commutat ive o perators
7.3.5 exercises for section 7.3
7.4 estimating the cost of operations
7.4.1 estimating sizes of illtermediate ffelations
7.4.2 estimating the size of a projection
7.4.3 estimating the size of a selectbo
7.4.4 estimating the size of a join
7.4.5 natural joins with multiple join attributes
7.4.6 joins of many relations
7.4.7 estim8ting sizes for other operations
7.4.8 exercises for section 7.4
7.5 introduction to cost-based plan selection
7.5.1 obtaining estimates for size parameters
7.5.2 incremental computation of statistics
7.5.3 heuristics for reducing the cost of logical query p
7.5.4 approaches to enumerating physical plans
7.5.5 exercises for section 7.5
7.6 choosing an order for joins
7.6.1 significance of left and mght join arguments
7.6.2 join nees
7.6.3 left-deep join nees
7.6.4 dynarnic programming to select a join order and gr
7.6.5 dynamic programming with more detailed cost fu
7.6.6 a greedy algorithm for selecting a join order
7.6.7 exercises for section 7.6
7.7 completing the physical-query--plan selection
7.7.l choosing a selection method
7.7.2 choosing a join method
7.7.3 pipelining versus materialization
7.7.4 pipelining unary operations
7.7.5 pipelining binary operations
7.7.6 notation for physical query plajns
7.7.7 ordering of physical operations
7.7.8 exercises for section 7.7
7.8 summary of chapter 7
7.9 references for chapter 7
8 coping with system failures
8.l issues and models for resilient operation
8.1.1 failure modes
8.1.2 more about nansactions
8.1.3 correct execution of nansactions
8.1.4 the primitive operations of transactions
8.1.5 exercises for section 8.1
8.2 undo logging
8.2.1 log records
8.2.2 the undthlogging rules
8.2.3 recovery using undo logging
8.2.4 checkpointing
8.2.5 nonquiescent checkpointing
8.2.6 exercises for section 8.2
8.3 redo logging
8.3.1 the redo--logging rule
8.3.2 retiovery with redo logging
8.3.3 checkpointing a redo log
8.3.4 recovery with a checkpointed redo log
8.3.5 exercises for section 8.3
8.4 undo/redo logging
8.4.1 the undo/redo rules
8.4.2 recovery with undo/redo logging
8.4.3 checkpointing ajn undo/redo log
8.4.4 exercises for section 8.4
8.5 protecting against media failures
8.5.1 the archive
8.5.2 nonquiescent archiving
8.5.3 recovery using an archive and log
8.5.4 exercises for section 8.5
8.6 summaxy of chapter 8
8.7 references for chapter 8
9 concurrency control
9.1 serial and serializable schedules
9.l.1 schedules
9.1.2 serial schedules
9.1.3 serializable schedules
9.l.4 the effect of transaction semantics
9.1.5 a notation for nansactions and schedules
9.1.6 exercises for section 9.1
9.2 conflict - serializability
9.2.1 confiicts
9.2.2 precedence graphs and a test for conflict-serializability
9.2.3 why the precedence--graph test works
9.2.4 exercises for section 9.2
9.3 enforcing serializability by locks
9.3.1 locks
9.3.2 the locking scheduler
9.3.3 two--phase locking
9.3.4 why two-phase locking works
9.3.5 exercises for section 9.3
9.4 locking systems with several lock modes
9.4.1 shared and exclusive locks
9.4.2 compatibility matrices
9.4.3 upgrading locks
9.4.4 update locks
9.4.5 increment locks
9.4.6 exercises for section 9.4
9.5 an architecture for a locking scheduler
9.5.1 a scheduler that inserts lock actions
9.5.2 the lock table
9.5.3 exercises for section 9.5
9.6 managing hierarchies of databajse elements
9.6.1 locks with multiple granularity
9.6.2 warning locks
9.6.3 phantoms and handling insertions correctly
9.6.4 exercises for section 9-6
9.7 the tree protocol
9.7.1 motivation for nee-based locking
9.7.2 rules for access to tree-structured data
9.7.3 why the nee protocol works
9.7.4 exercises for section 9.7
9.8 concurrency control by timestamps
9.8.1 timestamps
9.8.2 physically unrealizable behaviors
9.8.3 problems with dirty data
9.8.4 the rules for timestamp-based scheduling
9.8.5 multiversion timestamps
9.8.6 timestaznps and locking
9.8.7 exercises for section 9.8
9.9 concurrency control by validation
9.9.1 architecture of a validation-based scheduler
9.9.2 the validation rules
9.9.3 comparison of three concurrency-control mechanisms
9.9.4 exercises for section 9.9
9.10 summary of chapter 9
9.1l references for chapter 9
10 more about nansaction managemeot
10.1 thansactions that read uncommitted data
10.1.1 the dirty-data problem
10.1.2 cascading rollback
10.1.3 managing rollbacks
10.1.4 group commit
10.1.5 logical logging
10.1.6 exercises for section 10.1
10.2 view serializability
10.2.1 view equivalence
l0.2.2 polygraphs and the test for view-serializability
10.2.3 testing for view-serializability
10.2.4 exercises for section 10.2
10.3 resolving deadlocks
l0.3.l deedlock detection by timeout
l0.3.2 the waits-for graph
10.3.3 deadlock prevention by ordering elements
10.3.4 detecting deadlocks by timestamps
10.3.5 comparison of deadloch management methods
l0.3.6 exercises for section 10.3
10.4 distributed databases
10.4.1 distribution of data
10.4.2 distributed nansactions
10.4.3 data replication
10.4.4 distributed query optimization
10.4.5 exercises for section 10.4
10.5 distributed commit
10.5.1 supporting distributed atomicity
10.5.2 twcrphase commit
l0.5.3 recovery of distributed' thansactions
l0.5.4 exercises for section 10.5
10.6 distributed locking
10.6.1 centralized lock systems
10.6.2 a cost model for distributed locking algorithms
10.6.3 locking replicated elements
10.6.4 primary-copy locking
10.6.5 global locks wom local locks
l0.6.6 exercises for section 10.6
10.7 long--duration nansactions
10.7.1 problems of long nansactions
10.7.2 sasas
10.7.3 compensating nansactions
10.7.4 why compensating nansactions work
10.7.5 exercises for section 10.7
10.8 summary of chapter 10
l0.9 references for chapter 10
11 information integration
1l.1 modes of information illtegration
11.1.1 problems of information integration
11.1.2 federated database systems
11.1.3 data waehouses
11.1.4 mediators
11.1.5 exercises for section 11. 1
11.2 wrappers in mediator-based systems
11.2.1 templates for query patterns
l1.2.2 wrapper generators
11.2.3 filters
11.2.4 other operations at the wrapper
11.2.5 exercises for section l1 .2
11.3 on--line anajytic processing
11.3.1 olap applications
11.3.2 a multidimensional view of olap data
11.3.3 stajr schemas
11.3.4 slicing and dicing
11.3.5 exercises for section 11.3
l1.4 data cubes
11.4.l the cube operator
11.4.2 cube implementation by materialized views
11.4.3 the lattice of views
11.4.4 exercises for section 11.4
11.5 data mining
11.5.1 data-mining applications
11.5.2 association-rule mining
11.5.3 the a-priori algorithm
11.6 summary of chapter 11
11.7 references for chapter 11
index
1.1 introducing: the megatron 2000 database system
1.1.1 megatron 2000 implementation details
l.1.2 how megatron 2000 executes queries
1.1.3 what's wrong with megatron 2000?
1.2 overview of a database management system
1.2.1 datadefinition language commands
1.2.2 overview of query processing
1.2.3 main--memory buffers and the buffer manager
1.2.4 thansaction processing
1.2.5 the query processor
1.3 outline of this book
1.3. 1 prerequisites
1.3.2 storage-- m anagement overview
1.3.3 query-proce8sing overview
1.3.4 thansaction- p rocessing overview
1.3.5 information integration overview
1.4 review of database models and languages
1.4.1 relational model review
1.4.2 sql review
.1.4.3 re1ational and object-oriented data
1.5 summary of chapter 1
1.6 references for chapter 1
2 data storage
2.1 the memory hierarchy
2.1.1 cache
2.1.2 main memory
2.1.3 virtual memory
2.1.4 secondary storage
2.1.5 tertiary storage
2.1.6 volatile and nonvolatile storage
2.1.7 exercises for section 2.1
2.2 disks
2.2.1 mechanics of disks
2.2.2 the disk controller
2.2.3 disk storage characteristics
2.2.4 disk access characteristics
2.2.5 writing blocks
2.2.6 modifying blocks
2.2.7 exercises for section 2.2
2.3 using secondary storage effectively
2.3.1 the i/o model of computation
2.3.2 sorting data in secondajry storage
2.3.3 merge-sort
2.3.4 two-phase, multiway merge--sort
2.3.5 extension of multiway merging to larger relatbos
2.3.6 exercises for section 2.3
2.4 improving the access time of secondary storage
2.4.1 organizing data by cylinders
2.4.2 using multiple disks
2.4.3 mirroring disks
2.4.4 disk scheduling and the elevator algorithm
2.4.5 prefetching and large-scale buffering
2.4.6 summajry.of strategies and nadeoffe
2.4.7 exercises for section 2.4
2.5 disk failures
2.5.1 1ntermittent falures
2.5.2 checksums
2.5.3 stable storage
2.5.4 error-handling capabilities of stable storage
2.5.5 exercises for section 2.5
2.6 recovery from disk crashes
2.6.1 the failure model for disks
2.6.2 mirroring as a redundancy technique
2.6.3 paxity blocks
2.6.4 an improvment: raid 5
2.6.5 coping with multiple disk cfashes
2.6.6 exercises for section 2.6
2.7 summary.of chapter 2
2.8 references for chapter 2
3 representing datu elements
3.1 data elements and fields
3.1.1 representing relational database elements
3.1.2 representing objects
3.1.3 representing data elements
3.2 records
3.2.1 building fixed-length records
3.2.2 record headers
3.2.3 packing fixed-length records into blocks
3.2.4 exercises for section 3.2
3.3 represention block and record addresses
3.3.1 client--server systems
3.3.2 logicaj and structured addresses.
3.3.3 pointer swizzling
3.3.4 returning blocks to disk
3.3.5 pinned records and blocks
3.3.6 exercises for section 3.3
3.4 variable-length data and records
3.4.1 records with variable-length fields
3.4.2 records with repeating fields
3.4.3 variable-format records
3.4.4 records that do not fit in a block
3.4.5 blobs
3.4.6 exercises for section 3.4
3.5 record modifications
3.5.1 insertion
3.5.2 deletion
3.5.3 update
3.5.4 exercises for section 3.5
3.6 summary of chapter 3
3.7 references for chapter 3
4 index structure8
4.1 indexes on sequential files
4.1.1 sequential files
4.1.2 dense indexes
4.1.3 sparse indexes
4.1.4 multiple levels of index
4.1.5 indexes with duplicate search keys
4.1.6 managing indexes during data modifications
4.1.7 exercises for section 4.1
4.2 secondary indexes
4.2.1 design of secondary indexes
4.2.2 applications of secondary indexes
4.2.3 indirection in secondaxy indexes
4.2.4 document retrieval and inverted indexes
4.2.5 exercises for section 4.2
4.3 b-nees
4.3.l the structure of b--trees
4.3.2 applications of b-trees
4.3.3 lookup in b-trees
4.3.4 range queries
4.3.5 insertion into b-nees
4.3.6 deletion nom b-nees
4.3.7 efficiency of b-trees
4.3.8 exercises for section 4.3
4.4 hash tables
4.4.1 secondary-storage hash tables
4.4.2 insertion into a hash table
4.4.3 hash-table deletion
4.4.4 efficiency of hash table indexes
4.4.5 extensible hash tables
4.4.6 insertion into extensible hash tables
4.4.7 linear hash tables
4.4.8 insertion 1nto linear hash tables
4.4.9 exercises for section 4.4
4.5 summary of chapter 4
4.6 references for chapter 4
5 multidimensional indexes
5.1 applications needing multiple dimensions
5.1.1 gwaphic information system8
5.1.2 data cubes
5.1.3 multidimensional queries in sql
5.1.4 executing range queries using conventional 1ndexes
5.1.5 executing nearest--neighbor queries using conventionalindexes
5.1.6 other limitations of conventional indexes
5.1.7 overview of multidimensional index strllctures
5.1.8 exercises for section 5.1
5.2 hash-like structures for multidimensional data
5.2.l grid files
5.2.2 lookup in a grid file
5.2.3 insertion into grid files
5.2.4 performance of grid files
5.2.5 patitioned hash minctions
5.2.6 comparison of grid files and partitioned hashing
5.2.7 exercises for section 5.2
5.3 thee-like structures for multidimensional data
5.3.l multiple-key indexes
5.3.2 performance of multipleskey indexes
5.3.3 kdnees
5.3.4 operations on kdnees
5.3.5 adapting kdthees to secondary storage
5.3.6 quad thees
5.3.7 rtrees
5.3.8 operations on rtrees
5.3.9 exercises for section 5.3
5.4 bitmap indexes
5.4.1 motivation for bitmap indexes
5.4.2 compressed bitmaps
5.4.3 operating.on run-lengt h- encoded bit- vectors
5.4.4 managing bitmap indexes
5.4.5 exercises for section 5.4
5.5 summary of chapter 5
5.6 references for chapter 5
6 query execution
6.1 an algebra for queries
6.1.1 union, intersection, and difference
6.1.2 the selection operator
6.1.3 the projection operator
6.1.4 the product of relations
6.1.5 joins
6.1.6 duplicate elimination
6.1.7 grouping and aggregaion
6.1.8 the sorting operator
6.1.9 expression nees
6. 1. l0 exercises for section 6.1
6.2 introduction to physical-query-plan operators
6.2.l scanning tables
6.2.2 sorting while scanning tables
6.2.3 the model of computation for physical operators
6.2.4 parameters for measuring costs
6.2.5 i/o cost for scan operators
6.2.6 iterators for implementation of physical operators
6.3 one-pass algorithms for database operations
6.3.l one--pass algorithms for tuplesat-atime operations
6.3.2 one-pass algorithms for unary, fullrelation operai
6.3.3 one-pass algorithms for binary operations
6.3.4 exercises for section 6.3
6.4 nested-loop joins
6.4.1 tuple-based nested-loop join
6.4.2 an iterator for thple--based nested--loop join
6.4.3 a block-based nested--loop join algorithm
6.4.4 analysis of nested-loop join
6.4.5 summary of algorithms so far
6.4.6 exercises for section 6.4
6.5 twcapass algorithms based on sorting
6.5.1 duplicate elimination using sorting
6.5.2 grouping and aggregation using sorting
6.5.3 a sort-based union algorithm
6.5.4 sort-based algorithms for intersection and difference
6.5.5 a simple sort--based join algorithm
6.5.6 analysis of simple sort-join
6.5.7 a more efficient sort-based join
6.5.8 summary of sort-based algorithms
6.5.9 exercises for section 6.5
6.6 two-pass algorithms based on hashing
6.6.1 partitioning relations by hashing
6.6.2 a hash-based algorithm for duplicate elimination
6.6.3 a hash--based algorithm for grouping and aggrgation
6.6.4 hash-based algorithms for union, intersection, and dif ference
6.6.5 the hash-join algorithm
6.6.6 saving some disk i/o's
6.6.7 summary of hash-based algorithms
6.6.8 exercises for section 6.6
6.7 index-based algorithms
6.7.1 clustering and nonclustering indexes
6.7.2 index--based selection
6.7.3 joining by using an index
6.7.4 joins using a sorted index
6.7.5 exercises for section 6.7
6.8 buffer management
6.8.l buffer management architecture
6.8.2 buffer manapement strategies
6.8.3 the relationship between physical operator selection and buffer management
6.8.4 exercises for section 6.8
6.9 algorithms using more than two passes
6.9.1 multipass sort-based algorithms
6.9.2 performance of multipass, sort--based algorithms
6.9.3 multipass hash-based algorithms
6.9.4 performance of multipass hash-based algorithms
6.9.5 exercises for section 6.9
6.l0 paxajlel algorithms for relational operations.
6.10.1 models of paxallelism
6.10.2 tuple-at-atime operations in parallel
6.10.3 parallel algorithms for full--relation operations
6.l0.4 performance of parallel algorithms
6.10.5 exercises for section 6.10
6.1l summajry of chapter 6
6.12 references for chapter 6
7 the query compiler
7.1 parsing
7.1.1 syntax analysis and parse nees
7.1.2 a grammar for a simple subset of sql
7.1.3 the preprocessor
7.1.4 exercises for section 7.1
7.2 algebraic laws for improving query plans
7.2.1 commutative and associative laws
7.2.2 laws involving selection
7.2.3 pushing selections
7.2.4 laws involving projection
7.2.5 laws about joins and products
7.2.6 laws involving duplicate elimination
7.2.7 laws lnvolving grouping and aggregation
7.2.8 exercises for section 7.2
7.3 from pajrse thees to logical query plans
7.3.1 conversion to relational algebra
7.3.2 removing subqueries nom conditions
7.3.3 improving the logical query plan
7.3.4 grouping associative/commutat ive o perators
7.3.5 exercises for section 7.3
7.4 estimating the cost of operations
7.4.1 estimating sizes of illtermediate ffelations
7.4.2 estimating the size of a projection
7.4.3 estimating the size of a selectbo
7.4.4 estimating the size of a join
7.4.5 natural joins with multiple join attributes
7.4.6 joins of many relations
7.4.7 estim8ting sizes for other operations
7.4.8 exercises for section 7.4
7.5 introduction to cost-based plan selection
7.5.1 obtaining estimates for size parameters
7.5.2 incremental computation of statistics
7.5.3 heuristics for reducing the cost of logical query p
7.5.4 approaches to enumerating physical plans
7.5.5 exercises for section 7.5
7.6 choosing an order for joins
7.6.1 significance of left and mght join arguments
7.6.2 join nees
7.6.3 left-deep join nees
7.6.4 dynarnic programming to select a join order and gr
7.6.5 dynamic programming with more detailed cost fu
7.6.6 a greedy algorithm for selecting a join order
7.6.7 exercises for section 7.6
7.7 completing the physical-query--plan selection
7.7.l choosing a selection method
7.7.2 choosing a join method
7.7.3 pipelining versus materialization
7.7.4 pipelining unary operations
7.7.5 pipelining binary operations
7.7.6 notation for physical query plajns
7.7.7 ordering of physical operations
7.7.8 exercises for section 7.7
7.8 summary of chapter 7
7.9 references for chapter 7
8 coping with system failures
8.l issues and models for resilient operation
8.1.1 failure modes
8.1.2 more about nansactions
8.1.3 correct execution of nansactions
8.1.4 the primitive operations of transactions
8.1.5 exercises for section 8.1
8.2 undo logging
8.2.1 log records
8.2.2 the undthlogging rules
8.2.3 recovery using undo logging
8.2.4 checkpointing
8.2.5 nonquiescent checkpointing
8.2.6 exercises for section 8.2
8.3 redo logging
8.3.1 the redo--logging rule
8.3.2 retiovery with redo logging
8.3.3 checkpointing a redo log
8.3.4 recovery with a checkpointed redo log
8.3.5 exercises for section 8.3
8.4 undo/redo logging
8.4.1 the undo/redo rules
8.4.2 recovery with undo/redo logging
8.4.3 checkpointing ajn undo/redo log
8.4.4 exercises for section 8.4
8.5 protecting against media failures
8.5.1 the archive
8.5.2 nonquiescent archiving
8.5.3 recovery using an archive and log
8.5.4 exercises for section 8.5
8.6 summaxy of chapter 8
8.7 references for chapter 8
9 concurrency control
9.1 serial and serializable schedules
9.l.1 schedules
9.1.2 serial schedules
9.1.3 serializable schedules
9.l.4 the effect of transaction semantics
9.1.5 a notation for nansactions and schedules
9.1.6 exercises for section 9.1
9.2 conflict - serializability
9.2.1 confiicts
9.2.2 precedence graphs and a test for conflict-serializability
9.2.3 why the precedence--graph test works
9.2.4 exercises for section 9.2
9.3 enforcing serializability by locks
9.3.1 locks
9.3.2 the locking scheduler
9.3.3 two--phase locking
9.3.4 why two-phase locking works
9.3.5 exercises for section 9.3
9.4 locking systems with several lock modes
9.4.1 shared and exclusive locks
9.4.2 compatibility matrices
9.4.3 upgrading locks
9.4.4 update locks
9.4.5 increment locks
9.4.6 exercises for section 9.4
9.5 an architecture for a locking scheduler
9.5.1 a scheduler that inserts lock actions
9.5.2 the lock table
9.5.3 exercises for section 9.5
9.6 managing hierarchies of databajse elements
9.6.1 locks with multiple granularity
9.6.2 warning locks
9.6.3 phantoms and handling insertions correctly
9.6.4 exercises for section 9-6
9.7 the tree protocol
9.7.1 motivation for nee-based locking
9.7.2 rules for access to tree-structured data
9.7.3 why the nee protocol works
9.7.4 exercises for section 9.7
9.8 concurrency control by timestamps
9.8.1 timestamps
9.8.2 physically unrealizable behaviors
9.8.3 problems with dirty data
9.8.4 the rules for timestamp-based scheduling
9.8.5 multiversion timestamps
9.8.6 timestaznps and locking
9.8.7 exercises for section 9.8
9.9 concurrency control by validation
9.9.1 architecture of a validation-based scheduler
9.9.2 the validation rules
9.9.3 comparison of three concurrency-control mechanisms
9.9.4 exercises for section 9.9
9.10 summary of chapter 9
9.1l references for chapter 9
10 more about nansaction managemeot
10.1 thansactions that read uncommitted data
10.1.1 the dirty-data problem
10.1.2 cascading rollback
10.1.3 managing rollbacks
10.1.4 group commit
10.1.5 logical logging
10.1.6 exercises for section 10.1
10.2 view serializability
10.2.1 view equivalence
l0.2.2 polygraphs and the test for view-serializability
10.2.3 testing for view-serializability
10.2.4 exercises for section 10.2
10.3 resolving deadlocks
l0.3.l deedlock detection by timeout
l0.3.2 the waits-for graph
10.3.3 deadlock prevention by ordering elements
10.3.4 detecting deadlocks by timestamps
10.3.5 comparison of deadloch management methods
l0.3.6 exercises for section 10.3
10.4 distributed databases
10.4.1 distribution of data
10.4.2 distributed nansactions
10.4.3 data replication
10.4.4 distributed query optimization
10.4.5 exercises for section 10.4
10.5 distributed commit
10.5.1 supporting distributed atomicity
10.5.2 twcrphase commit
l0.5.3 recovery of distributed' thansactions
l0.5.4 exercises for section 10.5
10.6 distributed locking
10.6.1 centralized lock systems
10.6.2 a cost model for distributed locking algorithms
10.6.3 locking replicated elements
10.6.4 primary-copy locking
10.6.5 global locks wom local locks
l0.6.6 exercises for section 10.6
10.7 long--duration nansactions
10.7.1 problems of long nansactions
10.7.2 sasas
10.7.3 compensating nansactions
10.7.4 why compensating nansactions work
10.7.5 exercises for section 10.7
10.8 summary of chapter 10
l0.9 references for chapter 10
11 information integration
1l.1 modes of information illtegration
11.1.1 problems of information integration
11.1.2 federated database systems
11.1.3 data waehouses
11.1.4 mediators
11.1.5 exercises for section 11. 1
11.2 wrappers in mediator-based systems
11.2.1 templates for query patterns
l1.2.2 wrapper generators
11.2.3 filters
11.2.4 other operations at the wrapper
11.2.5 exercises for section l1 .2
11.3 on--line anajytic processing
11.3.1 olap applications
11.3.2 a multidimensional view of olap data
11.3.3 stajr schemas
11.3.4 slicing and dicing
11.3.5 exercises for section 11.3
l1.4 data cubes
11.4.l the cube operator
11.4.2 cube implementation by materialized views
11.4.3 the lattice of views
11.4.4 exercises for section 11.4
11.5 data mining
11.5.1 data-mining applications
11.5.2 association-rule mining
11.5.3 the a-priori algorithm
11.6 summary of chapter 11
11.7 references for chapter 11
index
Database System Implementation
- 名称
- 类型
- 大小
光盘服务联系方式: 020-38250260 客服QQ：4006604884
云图客服：
用户发送的提问，这种方式就需要有位在线客服来回答用户的问题，这种 就属于对话式的,问题是这种提问是否需要用户登录才能提问
Video Player
×
Audio Player
×
pdf Player
×
