#Sql #cte #recursive
The basic algorithm for computing the content of the recursive table
is as follows:
- Run the initial-select and add the results to a queue.
- While the queue is not empty:
- Extract a single row from the queue.
- Insert that single row into the recursive table
- Pretend that the single row just extracted is the only row in the recursive table and run the recursive-select, adding all results to the queue.
If you want to change selection, open document below and click on "Move attachment"
SQLite Query Language: WITH clausebut it may not include an ORDER BY, LIMIT, or OFFSET. The recursive-select must be a simple select, not a compound. The recursive-select is allowed to include an ORDER BY, LIMIT, and/or OFFSET. <span>The basic algorithm for computing the content of the recursive table is as follows: Run the initial-select and add the results to a queue. While the queue is not empty: Extract a single row from the queue. Insert that single row into the recursive table Pretend that the single row just extracted is the only row in the recursive table and run the recursive-select, adding all results to the queue. The basic procedure above may modified by the following additional rules: If a UNION operator connects the initial-select with the recursive-select, then only add rows to the queue if n Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details