Lukas Eder
Lukas Eder
In 12c, recursive subquery factoring (CTE, WITH clause) has received a new feature specifying whether the recursive search should be performed `DEPTH` or `BREADTH` first: ![image](https://cloud.githubusercontent.com/assets/734593/25141825/0e5e155c-2465-11e7-81b9-d6f7944fd94c.png) https://docs.oracle.com/database/121/SQLRF/img_text/search_clause.htm
The SQL standard specifies: ``` sql ::= | UNION [ ALL | DISTINCT ] [ ] | EXCEPT [ ALL | DISTINCT ] [ ] ... ::= CORRESPONDING [ BY...
If we implemented this, it would be even simpler to select from / join in-memory data in the form of `Result`: ``` java Result result = ctx.fetch("..."); ctx.selectFrom(result) .where(...) .fetch();...
This type is useful in similar ways as the new `Results` type (#4502) when several cursors are fetched from a routine or a batch, but because they're potentially big, they...
When a stored procedure returns large result sets, it is unwise to fetch them all in memory eagerly as jOOQ currently does. We should introduce a new `executeLazy()` method, that...
A few databases (Access, Firebird) do not support `INTERSECT`, and `EXCEPT`. These constructs can be emulated, however as follows: ### INTERSECT ``` sql select distinct a.* from a inner join...
MySQL's `STRAIGHT_JOIN` can be supported in all dialects. It's just an `INNER JOIN` with an implied join order hint. We can emulate it with hints in some dialects (e.g. Oracle,...
Similar to the already supported `UNION ALL` clause, the SQL standard also defines `[ INTERSECT | EXCEPT ] ALL` clauses. This should be supported by jOOQ, as well. ### Emulation...
VoltDB has a community edition on docker: https://hub.docker.com/r/voltdb/voltdb-community It is licensed AGPL, which raises a few questions on whether we can effectively integration test a dialect with VoltDB's community edition...