Database System ConceptsThis popular text in database systems is used in departments of computer science, computer engineering, and electrical engineering. The revision includes more material on SQL, relational models, logical databases, "QB" and "Datalog." |
From inside the book
Results 1-3 of 23
Page 377
... timestamp ( Q ) . Any transaction T ; with TS ( T ) > TS ( T3 ) must read the value of Q written by T3 , not the value written by T2 . This observation leads to a modified version of the timestamp - ordering protocol in which obsolete ...
... timestamp ( Q ) . Any transaction T ; with TS ( T ) > TS ( T3 ) must read the value of Q written by T3 , not the value written by T2 . This observation leads to a modified version of the timestamp - ordering protocol in which obsolete ...
Page 383
... timestamp is assigned in the same manner as described in Section 11.4 . With each data item Q , a sequence of ... timestamp ( Q ) , which denotes the timestamp of the transaction that created version Qk . • R - timestamp ( Q ) , which ...
... timestamp is assigned in the same manner as described in Section 11.4 . With each data item Q , a sequence of ... timestamp ( Q ) , which denotes the timestamp of the transaction that created version Qk . • R - timestamp ( Q ) , which ...
Page 506
... timestamp < x , y > visits that site and x is greater than the current value of LC . In this case , site S , advances its logical clock to the value x + 1 . If the system clock is used to generate timestamps , then timestamps are ...
... timestamp < x , y > visits that site and x is greater than the current value of LC . In this case , site S , advances its logical clock to the value x + 1 . If the system clock is used to generate timestamps , then timestamps are ...
Contents
Introduction | 1 |
EntityRelationship Model | 23 |
Relational Model | 53 |
Copyright | |
40 other sections not shown
Common terms and phrases
abort account-number algorithm allows attributes B-tree bank BCNF block borrow branch-city branch-name bucket buffer candidate key cascading rollback Chapter commit compute concurrency control conflict serializable consider constraints contains coordinator corresponding CustAcct customer-city customer-name data item data model database system DBTG deadlock decomposition defined delete discussed disk domain domain relational calculus Downtown E-R diagram employees ensure entity set example execution expression functional dependencies hash function implementation insert Johnson join loan loan-number log records main memory manager Mianus multivalued dependencies node object-oriented Perryridge branch pointer primary key query language r₁ R₂ read(A record type recovery relation scheme relational algebra relational database relationship set require result rule schedule search-key value Section serializability set occurrence shown in Figure stable storage Stonebraker stored strategy structure superkey T₁ T₂ techniques timestamp transaction tree-structure diagram tuple relational calculus update wait-for graph weak entity write write(Q