1558601902,Transaction Processing: Concepts and Techniques,Transaction,Processing:,Concepts,and,Techniques,buy,book,books,purchase,read,Jim Gray,Andreas Reuter
Books
Books
Sign In | View Cart Cart | Wish List | Help
ToysHealthPersonalAdultBaby
ToysHealthPersonalAdultBaby
Home & Garden
Checkout Now »
Cart Cart Cart
0 Items
Cart
100% Safe and Private!
Search     for:    

Books
Browse All Topics    New Releases    Coming Soon

All Topics > Computers & Internet > Databases > Distributed Databases
 
Browse similar subjects

Shipping

All orders
shipped by
airmail!

Click here for our
Shipping Policies!

 


Quotations

"Anyone nit-picking enough to write a letter of correction to an editor doubtless deserves the error that provoked it."

  Alvin Toffler

 

 

Transaction Processing:
Concepts and Techniques

 
  by Jim Gray, Andreas Reuter
 
 
 Take A Trip Around The Word
Take A Trip Around The Word
Product
Take A Trip Around The Word
Take A Trip Around The Word
Take A Trip Around The Word
  
  
  
Take A Trip Around The Word
Take A Trip Around The Word 


ZIN Product Number: 10430886

 
eBay (last 12 months)
Auctions: 14
Price Range: $0.09 - 0.02
 
Craigslist (last 12 months)
Classifieds: 6
Price Range: $0.01 - 0.01
 
Amazon Used (last 12 months)
Auctions: 32
Price Range: $0.02 - 0.09
 
ZooScape (last 12 months)
Auctions: 0
Price Range: N/A
 
 
Google listings (non-affiliate) 36
MSN listings (non-affiliate) 19
Yahoo listings (non-affiliate) 77
 


 FastFind Line
Inverse Black Hole
By the Numbers
By the Numbers
Cover To Cover
Cover to Cover
Reader's Corner
Reader's Corner
Table of Contents
Table of Contents
Related Reading
Related Reading
Inverse Black Hole
FastFind Line
 
 
By The Numbers
 Product Details

  Format: Textbook Hardcover, 1st ed., 1070 pages
  Publisher: Morgan Kaufmann Publishers
  ISBN: 1558601902
  Release Date: Jan 5, 2001


 
 
Cover to Cover
 Annotation
A comprehensive presentation of the key concepts and techniques of transaction processing. The authors provide a description of the transaction concepts and how it fits in a distributed computing environment, as well as a thorough discussion of the complex issues related to transaction recovery. The book will be invaluable to anyone interested in using or implementing distributed systems or client server systems.

 
 
The Reader's Corner
  Product Review
 
 Be the first to rate this book!     Number of Reviews: 0
 
 
 
Table of Contents
 Transaction Processing: Concepts and Techniques
by Jim Gray and Andreas Reuter
    FOREWORD BY BRUCE LINDSAY
    PREFACE
    PART ONE - The Basics of Transaction Processing
    1 INTRODUCTION
      1.1 Historical Perspective
      1.2 What Is a Transaction Processing System?
        1.2.1 The End User's View of a Transaction Processing System
        1.2.2 The Administrator/Operator's View of a TP System
        1.2.3 Application Designer's View of a TP System
        1.2.4 The Resource Manager's View of a TP System
        1.2.5 TP System Core Services
      1.3 A Transaction Processing System Feature List
        1.3.1 Application Development Features
        1.3.2 Repository Features
        1.3.3 TP Monitor Features
        1.3.4 Data Communications Features
        1.3.5 Database Features
        1.3.6. Operations Features
        1.3.7 Education and Testing Features
        1.3.8 Features Summary
      1.4 Summary
      1.5 Historical Notes
      Exercises
      Answers

    2 BASIC COMPUTER SCIENCE TERMINOLOGY
      2.1 Introduction
        2.1.1 Units
      2.2 Basic Hardware
        2.2.1 Memories
        2.2.2 Processors
        2.2.3 Communications Hardware
        2.2.4 Hardware Architectures
      2.3 Basic Software - Address Spaces, Processes, Sessions
        2.3.1 Address Spaces
        2.3.2 Processes, Protection Domains, and Threads
        2.3.3 Messages and Sessions
      2.4 Generic System Issues
        2.4.1 Clients and Servers
        2.4.2 Naming
        2.4.3 Authentication
        2.4.4 Authorization
        2.4.5 Scheduling and Performance
        2.4.6 Summary
      2.5 Files
        2.5.1 File Operations
        2.5.2 File Organizations
        2.5.3 Distributed Files
        2.5.4 SQL
      2.6 Software Performance
      2.7 Transaction Processing Standards
        2.7.1 Portability versus Interoperability Standards
        2.7.2 APIs and FAPs
        2.7.3 LU6.2, a de facto Standard
        2.7.4 OSI-TP with X/Open DTP, a de jure Standard
      2.8 Summary
      Exercises
      Answers

    PART TWO - The Basics of Fault Tolerance
    3 FAULT TOLERANCE
      3.1 Introduction
        3.1.1 A Crash Course in Simple Probability
        3.1.2 An External View of Fault Tolerance
      3.2 Definitions
        3.2.1. Fault, Failure, Availability, Reliability
        3.2.2 Taxonomy of Fault Avoidance and Fault Tolerance
        3.2.3 Repair, Failfast, Modularity, Recursive Design
      3.3 Empirical Studies
        3.3.1 Outages Are Rare Events
        3.3.2 Studies of Conventional Systems
        3.3.3 A Study of Fault-Tolerant System
      3.4 Typical Module Failure Rates
      3.5 Hardware Approaches to Fault Tolerance
        3.5.1 The Basic N-Plex Idea: How to Build Failfast Modules
        3.5.2 Failfast versus Failvote Voters in an N-Plex
        3.5.3 N-Plex plus Repair Results in High Availability
        3.5.4 The Voter's Problem
        3.5.5 Summary
      3.6 Software Is the Problem
        3.6.1 N-Version Programming and Software Fault Tolerance
        3.6.2 Transactions and Software Fault Tolerance
        3.6.3 Summary
      3.7 Fault Modeal and Software Fault Masking
        3.7.1 An Overview of the Model
        3.7.2 Building Highly Available Storage
        3.7.3 Highly Available Processes
        3.7.4 Reliable Messages via Sessions and Process Pairs
        3.7.5 Summary of the Process-Message-Storage Model
      3.8 General Principles
      3.9 A Cautionary Tale - System Delusion
      3.10 Summary
      3.11 Historical Notes
      Exercises
      Answers

    PART THREE - Transaction-Oriented Computing
    4 TRANSACTION MODELS
      4.1 Introduction
        4.1.1 About this Chapter
      4.2 Atomic Actions and Flat Transaction
        4.2.1 Disk Writes as Atomic Actions
        4.2.2 A Classification of Action Types
        4.2.3 Flat Transactions
        4.2.4 Limitations of Flat Transactions
      4.3 Spheres of Control
        4.3.1 Definition of Spheres of Control
        4.3.2 Dynamic Behavior of Spheres of Control
        4.3.3 Summary
      4.4 A Notation for Explaining Transaction Models
        4.4.1 What is Required to Describe Transaction Models?
        4.4.2 Elements of the Notation
        4.4.3 Defining Transaction Models by a Set of Simple Rules
      4.5 Flat Transactions with Savepoints
        4.5.1 About Savepoints
        4.5.2 Developing the Rules for the Savepoint Model
        4.5.3 Persistent Savepoints
      4.6 Chained Transactions
      4.7 Nested Transactions
        4.7.1 Definition of the Nexting Structure
        4.7.2 Using Nested Transactions
        4.7.3 Emulating Nested Transactions by Savepoints
      4.8 Distributed Transactions
      4.9 Multi-Level Transactions
        4.9.1 The Role of a Compensating Transaction
        4.9.2 The Use of Multi-Level Transactions
      4.10 Open Nested Transactions
      4.11 Long-Lived transactions
        4.11.1 Transaction Processing Context
        4.11.2 The Mini-Batch
        4.11.3 Sagas
      4.12 Exotics
      4.13 Summary
      4.14 Historical Notes
      Exercises
      Answers

    5 TRANSACTION PROCESSING MONITORS - An Overview
      5.1 Introduction
      5.2 The Role of TP Monitors in Transaction Systems
        5.2.1 The Transaction -Oriented Computing Style
        5.2.2 The Transaction Processing Services
        5.2.3 TP System Process Structure
        5.2.4 Summary
      5.3 The Structure of a TP Monitor
        5.3.1 The TP Monitor Components
        5.3.2 Components of the Transaction Services
        5.3.3 TP Monitor Support for the Resource Manager Interfaces
      5.4 Transactional Remote Procedure Calls: The Basic Idea
        5.4.1 Who Participates in Remote Procedure Calls?
        5.4.2 Address Space Structure Required for RPC Handling
        5.4.3 The Dynamics of Remote Procedure Calls
        5.4.4 Summary
      5.5 Examples of the Transaction-Oriented Programming Style
        5.5.1 The Basic Processing Loop
        5.5.2 Attaching Resource Managers to Transactions: The Simple Cases
        5.5.3 Attaching Resource Managers To Transactions: The Sophisticated Case
        5.5.4 Using Persistent Savepoints
      5.6 Terminological Wrap-Up
      5.7 Historical Notes
      Exercises
      Answers

    6 TRANSACTION PROCESSING MONITORS
      6.1 Introduction
      6.2 Transactional Remote Procedures Calls
        6.2.1 The Resource Manager Interface
        6.2.2 What the Resource Manager Has to Do in Support of Transactions
        6.2.3 Interfaces between resource Managers and the TP Monitor
        6.2.4 Resource Manager Calls versus Resource Manager Sessions
        6.2.5 Summary
      6.3. Functional Principles of the TP Monitor
        6.3.1 The Central Data Structures of the TPOS
        6.3.2 Data Structures Owned by the TP Monitor
        6.3.3. A Guided Tour Along the TRPC Path
        6.3.4 Aborts Racing TRPCs
        6.3.5 Summary
      6.4 Managing Request and Response Queues
        6.4.1 Short-Term Queues for Mapping Resource Manager Invocations
        6.4.2 Durable Request Queues for Asynchronous Transaction Processing
        6.4.3 Summary
      6.5 Other Tasks of the TP Monitor
        6.5.1 Load Balancing
        6.5.2 Authentication and Authorization
        6.5.3 Restart Processing
      6.6 Summary
      6.7 Historical Notes
      Exercises
      Answers

    PART FOUR - Concurrency Control
    7 ISOLATION CONCEPTS
      7.1 Overview
      7.2 Introduction to Isolation
      7.3 The Dependency Model of Isolation
        7.3.1 Static versus Dynamic Allocation
        7.3.2 Transaction Dependencies
        7.3.3 The Three Bad Dependencies
        7.3.4 The Case for a Formal Model of Isolation
      7.4 Isolation: The Application Programmer's View
      7.5 Isolation Theorems
        7.5.1 Actions and Transactions
        7.5.2 Well-Formed and Two-Phased Transactions
        7.5.3 Transaction Histories
        7.5.4 Legal Histories and Lock Compatibility
        7.5.5 Versions, Dependencies, and the Dependency Graph
        7.5.6 Equivalent and Isolated Histories: BEFORE, AFTER, and Wormholes
        7.5.7 Wormholes Are Not Isolated
        7.5.8 Summary of Definitions
        7.5.9 Summary of the Isolation Theorems
      7.6 Degrees of Isolation
        7.6.1 Degrees of Isolation Theorem
        7.6.2 SQL and Degrees of Isolation
        7.6.3 Pros and Cons of Low Degrees of Isolation
        7.6.4 Exotic SQL Isolation - Read-Past and Notify Locks
      7.7 Phantoms and Predicate Locks
        7.7.1 The Problem with Predicate Locks
      7.8 Granular Locks
        7.8.1 Three Locking and Intent Lock Modes
        7.8.2 Update Mode Locks
        7.8.3 Granular Locking Summary
        7.8.4 Key-Range Locking
        7.8.5 Dynamic Key-Range Locks: Previous-Key and Next-Key Locking
        7.8.6 Key-Range Locks Need DAG Locking
        7.8.7 The DAG Locking Protocol
        7.8.8 Formal Definition of Granular Locks on a DAG
      7.9 Locking Heuristics
      7.10 Nested Transaction Locking
      7.11 Scheduling and Deadlock
        7.11.1 The Convoy Phenomenon
        7.11.2 Deadlock Avoidance versus Toleration
        7.11.3 The Wait-for Graph and Deadlock Detector
        7.11.4 Distributed Deadlock
        7.11.5 Probability of Deadlock
      7.12 Exotics
        7.12.1 Field Calls
        7.12.2 Escrow Locking and Other Field Call Refinements
        7.12.3 Optimistic and Timestamp Locking
        7.12.4 Time Domain Addressing
      7.13 Summary
      7.14 Historical Notes
      Exercises
      Answers

    8 LOCK IMPLEMENTATION
      8.1 About This Chapter
        8.1.2 The Need for Parallelism within the Lock Manager
        8.1.3 The Resource Manager and Lock Manager Address Space
      8.2 Atomic Machine Instructions
      8.3 Semaphores
        8.3.1 Exclusive Semaphores
        8.3.2 Crabbing: Traversing Shared Data Structures
        8.3.3 Shared Semaphores
        8.3.4 Allocating Shared Storage
        8.3.5 Semaphores and Exceptions
      8.4 Lock Manager
        8.4.1 Lock Names
        8.4.2 Lock Queues and Scheduling
        8.4.3 Lock Duration and Lock Counts
        8.4.4 Lock Manager Interface and Data Structures
        8.4.5 Lock Manager Intern


         
 
Related Reading
 Find similiar books in these subject areas:

All Topics > Computers & Internet > Databases > Distributed Databases
All Topics > Computers & Internet > Databases > General
All Topics > Computers & Internet > General


 
 
 People like you also bought:

Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery, by Gottfried Vossen

Professional SQL Server 2000 Programming, by Robert Vieira

Database: Principles, Programming, Performance 2ND, by Patrick O'Neill

Pattern-Oriented Software Architecture: Patterns for Concurrent and Networked Objects, Vol. 2 2ND, by Douglas C. Schmidt

Distributed Algorithms, by Nancy A. Lynch

Databases and Transaction Processing: An Application-Oriented Approach, by Arthur J. Bernstein

Applied Microsoft .NET Framework Programming , by Jeffrey  Richter

How to Break Software: A Practical Guide to Testing with CD-ROM, by James A. Whittaker

 
 
 Keywords
Transaction systems (Computer, Distributed Computer Systems, Computer Bks - Data Base Management, Computers, Database Management - General, Data Processing - General, Transaction systems (Computer systems), Transaction systems (Computer systems)

 
 
 FastFind Line
Inverse Black Hole
By the Numbers
By the Numbers
Cover To Cover
Cover to Cover
Reader's Corner
Reader's Corner
Table of Contents
Table of Contents
Related Reading
Related Reading
Inverse Black Hole
FastFind Line
 
 


Make $1 per sale -
Link to ZooScape.com!


About Us   |   Our Policies   |   Your Cart   |   Contact Us   |   Help
ZooScape.com

Copyright 1995 - 2009 - ZooScape.com
 
ZooScape.com