You can store the representation
of a decision tree in an in-memory table on the server and at the
same time score the input table. This process generates two temporary
tables: the temporary table with the tree representation and the temporary
table with the scoring results.
This enables you to
compute decision trees for high-cardinality problems. The results
from tree building and tree scoring are available to you without transferring
large amounts of data between the SAS client and the server. You can
query the tree (for a drill-down, for example) and query the scoring
information efficiently, using the storing and querying features of
the server. Also, by storing them as temporary tables, you can process
them with other IMSTAT procedure statements.