1. A method of establishing a materialization schedule using a dynamic programming technique in a relational data base management system (RDBMS), the method comprising: receiving a query text; transforming the query text into a Rel directed acyclic graph (DAG); performing a bottom-up transversal of the Rel DAG to create a parallel Rel DAG; computing a column specific materialization schedule of the parallel Rel DAG; transforming the parallel Rel DAG into a DAG of function calls and data re-shuffling actions to create a parallel statement forest; generating a coordinator statement forest that invokes the function calls and the data re-shuffling actions according to the parallel statement forest; and transforming the parallel statement forest and the coordinator statement forest into a forest of binary association table (BAT) operator lists to compute an optimal materialization schedule for each column of a table.