LAE

Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.

Originally posted by: felfajar

Just out of curiosity, does anyone know what sorting algorithm does the Sort Node use

thanks

Felipe

Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.

Originally posted by: stonysmith

Others may correct me, but I was told that it actually uses several different methods.
As it is first pre-processing the data, it detects what method it thinks is best, and chooses the next method appropriately.
For example, if it detects on the first pass that the records are already sorted, it doesn't try to do any further sorting on them.

I (think) that it chooses among like five different methods.

Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.

Originally posted by: ThomasT

Cool,
So you could set sort to true within an X-ref for example without risking adding extra workload to the graph?

Note: This was originally posted by an inactive account. Content was preserved by moving under an admin account.

Originally posted by: stonysmith

Originally posted by: ThomasT
					

Cool, So you could set sort to true within an X-ref for example without risking adding extra workload to the graph?
			

That's quite a different question.. you MUST sort before a join (if the data is not already sorted).
Then, any sort does "add extra workload" ... it's dependent upon how big your data is. The bigger your data, the more resources required for the sort.

There is (usually) no need to do your own sort in front of an Xref.. you can just use the internal one.