mergejoin: maybe use binary search more often. Both in order to find the end of a sequence of equal value in l (if l is sorted), and in order to find a match in r if l is not sorted.
mergejoin: maybe use binary search more often.
Both in order to find the end of a sequence of equal value in l (if l
is sorted), and in order to find a match in r if l is not sorted.

zyzyis/monetdb,zyzyis/monetdb,zyzyis/monetdb,zyzyis/monetdb,zyzyis/monetdb,zyzyis/monetdb,zyzyis/monetdb,zyzyis/monetdb,zyzyis/monetdb,zyzyis/monetdb