In 1C, bypassing the result of the query, you can bypass the query hierarchically. Each final result contains, in addition to the fields, a nested result, which can also be bypassed in a loop. I suspect that in bare SQL the situation is similar. Tell me how competently in the code to bypass the result of the query using groupings.

    1 answer 1

    If you mean that in 1C a query can return a hierarchical answer - not a one-dimensional flat structure, but a kind of two-dimensional table, then there is no such thing in bare SQL .

    SQL obeys the rules of standard relational algebra, where the result of operations on tables (relational in terms of relational algebra) are always only tables — that is, a flat data structure.

    In JDBC, the ResultSet class (or rather, the interface) describes exactly the classic flat table.

    In different SQL dialects, there are things similar to two-dimensional queries or OLAP cubes, but this is still not supported in JDBC.