Principles of Distributed Database SystemsIntroduces and explains the theory, algorithms, and methods that underlie distributed DBMS, emphasizing the principles that guide the design of such systems more than their use. Useful as a text for a one- or two-semester graduate-level course. The bibliography is extensive. Annotation copyright Boo |
From inside the book
Results 1-3 of 22
Page 163
... assertion definition time for each assertion and each update type ( insert , delete ) . These pretests are enforced at run time . This method ac- cepts multirelation , monovariable assertions , possibly with aggregates . The principle ...
... assertion definition time for each assertion and each update type ( insert , delete ) . These pretests are enforced at run time . This method ac- cepts multirelation , monovariable assertions , possibly with aggregates . The principle ...
Page 164
... assertions to enforce is minimized since only the compiled assertions of type u need be checked . Second , the cost of enforcing a compiled assertion is less than that of enforcing I since differential relations are , in general , much ...
... assertions to enforce is minimized since only the compiled assertions of type u need be checked . Second , the cost of enforcing a compiled assertion is less than that of enforcing I since differential relations are , in general , much ...
Page 165
... assertions , and the enforcement of these as- sertions . Definition of distributed integrity assertions . An integrity assertion is sup- posed to be expressed in tuple relational calculus . Each assertion is seen as a query ...
... assertions , and the enforcement of these as- sertions . Definition of distributed integrity assertions . An integrity assertion is sup- posed to be expressed in tuple relational calculus . Each assertion is seen as a query ...
Contents
INTRODUCTION | 1 |
OVERVIEW OF RELATIONAL DBMS | 17 |
REVIEW OF COMPUTER NETWORKS | 42 |
Copyright | |
14 other sections not shown
Other editions - View all
Common terms and phrases
abort application approach architecture area networks assertions buffer manager buffer pages Cartesian product centralized Chapter commit communication cost complex objects conceptual schema consider constraints coordinator data item data server database log DBMSs deadlock defined discussed distributed database distributed DBMS distributed query ENAME entity Example execution failures Figure function global conceptual schema graph horizontal fragmentation implemented integrity interface issues JNAME join algorithm kernel language layer local area networks minterm node operating system parallel participant partition performance predicates problem processor protocol query optimization query processing R₁ recovery relational algebra relational calculus relational database reliability replicated result schedule Section selection semantic semijoin serializability shared-nothing specified stable database storage stored strategy techniques timestamp tion transaction manager transitive transitive closure tuples update Valduriez wide area networks write