There is a table with such a structure
COL1 | COL2 | COL3 -----+------+----- a | d | t -----+------+----- d | t | a -----+------+----- a | t | d -----+------+----- m | n | l -----+------+----- l | m | n
Records that can be obtained from other records by permuting values ββin columns should be displayed only once. In this case, the answer will be:
COL1 | COL2 | COL3 -----+------+----- a | d | t -----+------+----- l | m | n
It is necessary to solve the problem using standard SQL
Tell me where to start and how to organize an algorithm.