Jussi Saurio ae22468d8b Merge 'Order by heap sort' from Nikita Sivukhin ...

This PR implements simple heap-sort approach for query plans like
`SELECT ... FROM t WHERE ... ORDER BY ... LIMIT N` in order to maintain
small set of top N elements in the ephemeral B-tree and avoid sort and
materialization of whole dataset.
I removed all optimizations not related to this particular change in
order to make branch lightweight.

Reviewed-by: Jussi Saurio <jussi.saurio@gmail.com>

Closes #3726

2025-10-23 15:00:42 +03:00

..

builder.rs

Implement crude way of making opening subtransaction conditional

2025-10-22 23:40:45 +03:00

execute.rs

Merge 'Order by heap sort' from Nikita Sivukhin

2025-10-23 15:00:42 +03:00

explain.rs

Rename is_scope to deferred and invert respective boolean logic

2025-10-22 23:40:44 +03:00

insn.rs

Rename is_scope to deferred and invert respective boolean logic

2025-10-22 23:40:44 +03:00

likeop.rs

Rename OwnedValue -> Value

2025-05-15 09:59:46 +03:00

metrics.rs

add metrics and implement the .stats command

2025-08-18 09:11:06 -05:00

mod.rs

Merge 'Order by heap sort' from Nikita Sivukhin

2025-10-23 15:00:42 +03:00

sorter.rs

Merge branch 'main' into order-by-heap-sort

2025-10-22 11:44:55 +04:00