day, February 03, 2017 3:55 AM
To: SQLite mailing list
Subject: Re: [sqlite] "DISTINCT" makes a query take 37 times as long
On Fri, Feb 3, 2017 at 12:27 AM, Kevin O'Gorman <kevinogorm...@gmail.com>
wrote:
> But the big thing is that I took a look at EXPLAIN QUERY PLAN using
iling list <sqlite-users@mailinglists.sqlite.org>
Betreff: Re: [sqlite] "DISTINCT" makes a query take 37 times as long
When I read this, it seemed like it made sense. The thing is, it does not
match up with reality.
First, the analysis of what happens when I pipe the results
On Fri, Feb 3, 2017 at 12:27 AM, Kevin O'Gorman
wrote:
> But the big thing is that I took a look at EXPLAIN QUERY PLAN using this
> ...
Maybe somebody can explain them to me, but it doesn't really matter whether
> I ever understand them. Perhaps Mr. Hipp can make use of
ng in paralell.
>
> Try EXPLAIN QUERY PLAN to see what the query planner is doing.
>
> -Ursprüngliche Nachricht-
> Von: sqlite-users [mailto:sqlite-users-boun...@mailinglists.sqlite.org]
> Im Auftrag von Kevin O'Gorman
> Gesendet: Donnerstag, 02. Februar 2017 03:28
> An: sq
On 2/2/17, Hick Gunter wrote:
> DISTINCT forces the query optimizer to create an intermediate table to hold
> the results and compare each row of the non-distinct result set with an
> automatically created index. It may also affect the query plan in a way that
> chooses
[mailto:sqlite-users-boun...@mailinglists.sqlite.org] Im
Auftrag von Kevin O'Gorman
Gesendet: Donnerstag, 02. Februar 2017 03:28
An: sqlite-users <sqlite-users@mailinglists.sqlite.org>
Betreff: [sqlite] "DISTINCT" makes a query take 37 times as long
I have a database of positions and move
On Wed, Feb 1, 2017 at 6:35 PM, Richard Hipp wrote:
> On 2/1/17, Kevin O'Gorman wrote:
> > I have a database of positions and moves in a strategic game, and I'm
> > searching for unsolved positions that have been connected to an immediate
> > ancestor.
On 2/1/17, Kevin O'Gorman wrote:
> I have a database of positions and moves in a strategic game, and I'm
> searching for unsolved positions that have been connected to an immediate
> ancestor. I'm using Python 3.5.2, and the code looks like
Please provide us with the
I have a database of positions and moves in a strategic game, and I'm
searching for unsolved positions that have been connected to an immediate
ancestor. I'm using Python 3.5.2, and the code looks like
#!/usr/bin/env python3
"""Output positions that are reachable but unsolved at census 18 or
9 matches
Mail list logo