In SDD-1, the query processing involves two steps, namely, the compilation of the transaction
that converts the transaction into a parallel program, and the execution of it. The key part of the
compilation is access planning in which an optimization procedure is determined that minimizes
the object program’s inter-site communication needs while maximizing its parallelism.
Access planning
The simplest way to execute a distributed transaction is to move all of its read set to a single DM and
then execute the transaction at that DM. This approach is very simple, but ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.