[sqlite] Contstant WHERE terms still require table scan?

On 06/12/2015 05:45 PM, nomad at null.net wrote: > On Fri Jun 12, 2015 at 09:49:29AM +, Hick Gunter wrote: >> Seems the correct code is already generated... > Thanks Hick, that shows a bit more detail I didn't think to look for. > It seems that this only works for bind values, as the

[sqlite] Is recursive CTE fully capable?

Interesting. SQL has been Turing complete since PSM was added to the 1992 standard. (Not SQLite). I guess they mean "Turing complete with respect to the relation datatype". Andl already supports windowing (but not on SQLite). The Andl implementation of recursion queries is nearly done. I read

[sqlite] Virtual tables/xBestIndex: Is this a bug?

Thanks, Dan. I grabbed the fix and tried it out - works great, and a much better fix than what I suggested (not shocking). It really cleans up xBestIndex. In my simple cases, it's like the usable flag is now superfluous; xBestIndex is only getting passed usable constraints (and not getting

[sqlite] Is recursive CTE fully capable?

Appropriate just means: set up the data structures any way you like in order to capture the right info and support suitable queries. I'm not trying to find a shortcut to solving NP complete problems. If I did, I probably wouldn't post it here. The question is: are there problems for which: a) a

[sqlite] Contstant WHERE terms still require table scan?

On Fri Jun 12, 2015 at 09:49:29AM +, Hick Gunter wrote: > Seems the correct code is already generated... Thanks Hick, that shows a bit more detail I didn't think to look for. It seems that this only works for bind values, as the comparison and goto statements aren't present when the term is

[sqlite] Contstant WHERE terms still require table scan?

> This would potentially allow me to shortcut some largish UNION > statements. I should clarify: I don't want to have to force my callers to use their own if/then/else statements in order to pick a specific query. I want a single general-purpose query they can call that shortcuts based on a bind

[sqlite] Contstant WHERE terms still require table scan?

I'm wondering if it would be possible to optimize the query planner for situations where one of the WHERE clauses is a constant that evaluates to false? CREATE TABLE x( id INTEGER PRIMARY KEY ); EXPLAIN QUERY PLAN SELECT x.id FROM x WHERE 1=0

[sqlite] Contstant WHERE terms still require table scan?

As Dan pointed out, the check is there in line 1. I think it is a result of the query compiler very cleverly separating out the constant expressions and computing those once, before any table gets opened. Im 3.7.14 (the version I am using), it also leaves in the check at each record, which is

[sqlite] Is recursive CTE fully capable?

On 12 Jun 2015, at 4:48am, Igor Tandetnik wrote: > http://assets.en.oreilly.com/1/event/27/High%20Performance%20SQL%20with%20PostgreSQL%20Presentation.pdf > "With CTE and Windowing, SQL is Turing Complete." But SQLite doesn't have Windowing, right ? Or does it ? Simon.

[sqlite] confusing error msgs

On 12 June 2015 at 06:42, Hick Gunter wrote: > You are creating each table in a separate file; a foreign key may only > reference a table in the same file. > > Your type declarations are faulty in that you are omitting an opening > parenthesis in a DECIMAL 4,3) declaration. > > SQLite does not

[sqlite] Is recursive CTE fully capable?

The question I'm trying to ask is whether recursive CTE (either as defined in the standard or as implemented in SQLite) carries the full capability of evaluating recursive queries on appropriate data structures, or are there queries that are beyond what it can do? As far as I can see recursive

[sqlite] Contstant WHERE terms still require table scan?

Seems the correct code is already generated... asql> explain select rowid from x where 1=?; addr opcode p1p2p3p4 p5 comment - - -- - 0 Trace 0 0 000 NULL 1

[sqlite] SQLITE_THREADSAFE in VxWorks

Hello, I'm new. If the compiler option SQLITE_THREADSAFE = 1 or 2 in VxWorks, what happens next? If error: does this mean that does not support pthread? I think not. If Success: how SQLITE design multicore multithreading by the Semaphore? Well, do you successfully compiled it with

[sqlite] Is recursive CTE fully capable?

On 6/12/2015 5:33 AM, Simon Slavin wrote: > > On 12 Jun 2015, at 4:48am, Igor Tandetnik wrote: > >> http://assets.en.oreilly.com/1/event/27/High%20Performance%20SQL%20with%20PostgreSQL%20Presentation.pdf >> "With CTE and Windowing, SQL is Turing Complete." > > But SQLite doesn't have Windowing,

[sqlite] CTE/Sudoku talk (was User-defined types -- in Andl)

Good evening gentlemen. The talks are streaming DIRECTLY to YouTube. So they will be available permanently, but maybe not immediately after the talk is over (YT transcode time, and they may not auto-publish until given direct blessing to do so). But if you're in the area, I STRONGLY

[sqlite] confusing error msgs

You are creating each table in a separate file; a foreign key may only reference a table in the same file. Your type declarations are faulty in that you are omitting an opening parenthesis in a DECIMAL 4,3) declaration. SQLite does not constrain sizes, a TEXT(10) or a CHAR(1) variable my

[sqlite] Is recursive CTE fully capable?

On 12 Jun 2015, at 1:08am, david at andl.org wrote: > The question I'm trying to ask is whether recursive CTE (either as defined > in the standard or as implemented in SQLite) carries the full capability of > evaluating recursive queries on appropriate data structures, or are there > queries

[sqlite] Is recursive CTE fully capable?

On 6/11/2015 8:08 PM, david at andl.org wrote: > The question I'm trying to ask is whether recursive CTE (either as defined > in the standard or as implemented in SQLite) carries the full capability of > evaluating recursive queries on appropriate data structures, or are there > queries that are