Database System Concepts |
From inside the book
Results 1-3 of 78
Page 309
... block transfers between the disk and memory . One way to reduce the number of disk accesses is to keep as many blocks as possible in main memory . The goal is to maximize the chance that , when a block is accessed , it is already in ...
... block transfers between the disk and memory . One way to reduce the number of disk accesses is to keep as many blocks as possible in main memory . The goal is to maximize the chance that , when a block is accessed , it is already in ...
Page 311
... blocks containing customer tuples . We need to examine every block of customer tuples once for each tuple of the borrower relation . When processing of a customer block is completed , we know that that block will not be accessed again ...
... blocks containing customer tuples . We need to examine every block of customer tuples once for each tuple of the borrower relation . When processing of a customer block is completed , we know that that block will not be accessed again ...
Page 514
... block to a consistent state . To do so , the system must maintain two physical blocks for each logical database block ; in the case of mirrored disks , both blocks are at the same location ; in the case of remote backup , one of the blocks ...
... block to a consistent state . To do so , the system must maintain two physical blocks for each logical database block ; in the case of mirrored disks , both blocks are at the same location ; in the case of remote backup , one of the blocks ...
Other editions - View all
Common terms and phrases
account-number algorithm allow attributes B-tree balance bank block borrower branch-city branch-name Brooklyn bucket buffer candidate key Chapter clause compute concurrency conflict serializable consider constraints contains customer-city customer-name customer-street data item data model database system Datalog decomposition defined delete depositor disk domain domain relational calculus Downtown E-R diagram employee ensure entity set example execution foreign key functional dependencies graph hash implementation insert Jones loan-number lock log records main memory manager multivalued multivalued dependencies node null values object object-oriented operation outer join parallel partitioning performance Perryridge branch pointers primary key processor protocol query Find query optimization r₁ read(A relation schema relational algebra relationship set result retrieve rule schedule search-key value Section serializability server shown in Figure specify stored structure superkey T₁ techniques timestamp transaction tuple relational calculus update view relation weak entity weak entity set write