Add a new cost, cardinality and ordering for a particular join set. Does not verify that the new cost is less than any previously added cost -- simply adds or replaces an existing plan for the specified join set @param s the set of joins for which a new ordering (plan) is be
(Set<LogicalJoinNode> s, double cost, int card, Vector<LogicalJoinNode> order)
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected