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 13
Page 6
... shared- nothing architecture is one where each processor has its own primary and secondary memories as well as peripherals , and communicates with other processors over a very high speed bus . In this sense the shared - nothing ...
... shared- nothing architecture is one where each processor has its own primary and secondary memories as well as peripherals , and communicates with other processors over a very high speed bus . In this sense the shared - nothing ...
Page 464
... shared - nothing architectures . In what follows we discuss both of these ar- chitectures , although we focus on the shared - nothing architecture because it relies heavily on distributed database technology . In a shared - everything ...
... shared - nothing architectures . In what follows we discuss both of these ar- chitectures , although we focus on the shared - nothing architecture because it relies heavily on distributed database technology . In a shared - everything ...
Page 488
... shared - nothing architecture . In what follows we present two parallel algorithms for evaluating the transitive closure of a relation in a shared - nothing data server . These algorithms can be viewed as a parallel version of the ...
... shared - nothing architecture . In what follows we present two parallel algorithms for evaluating the transitive closure of a relation in a shared - nothing data server . These algorithms can be viewed as a parallel version of the ...
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