The Partitioned Data Model
The Partitioned Data Model
One goal in designing for high transaction throughput is reducing the time that users must wait for shared resources.
While many elements of a transaction processing system can be duplicated, one resource that must be shared is the database. Users compete for a shared database in three ways:
•For use of the disk
•For locks on database records
•For the CPU resources needed to access the database
This competition can be alleviated by spreading the database across several backend nodes, each node being responsible for a subset of the data, or partition. RTR enables you to implement this partitioned data model, shown roughly in Figure
Object-Oriented Programming
The C++ foundation classes map traditional RTR functional programming concepts into an
Architectural Concepts