I have two questions on JOIN algorithms:
1.Lets say that I have two relations/tables R(A,B) and S(C,D) with Sorted indices on B and D respectively.
Say I perform an Index Nested Loop Join on B=D, will the resulting table be sorted according to B\D?
2. Is it safe to assume that in Simple Nested Loop Join, Page-Oriented Nested Loop Join and Block Nested Loop Join if the data entries are sorted in memory with respect to the field on which we are joining the two relations on, then the result will also be sorted with respect to that field or is the order of tuple/pages is arbitrary as opposed to lets say, reading the data from the lowest address to the highest?