Appendix A
Notation Index
| B | A block in a DDG |
| Br | A branch in a block |
| CostRi | Cost rate of data set di in the DDG |
| CTT | Cost Transitive Tournament |
| CTT-SP | Cost Transitive Tournament-based Shortest Path |
| di | A data set, where the subscript i is the index number |
| DDG | Data Dependency Graph |
| DDG_LS | Linear DDG Segment |
| e<di, dj> | The edge from di to dj in the CTT |
| fi | A flag that denotes whether data set di is stored or deleted |
| genCost(di) | Generation cost of data set di |
| L<S1, S2> | Partition line between MCSSs S1and S2 in a two-dimensional PSS |
| MB | Main branch of a DDG |
| MCSS | Minimum Cost Storage Strategy |
| P<S1, S2> | Partition plane between MCSS S1and S2 in a three-dimensional PSS |
| Pmin<di, dj> | The shortest path from di to dj in the CTT |
| Pricecpu | The ... |
Get Computation and Storage in the Cloud now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
