@ Pasma and Hainaut,
Thanks again, that looks promising !
Jonathan
Message: 42
Date: Wed, 15 Feb 2017 21:10:10 +0100
From: "E.Pasma"
To: SQLite mailing list
Subject: Re: [sqlite] Group contiguous rows (islands)
Message-ID: <55fa9699-22fe-4dd9-9b86-36a190485...@concepts.nl>
Co
Jean-Luc Hainaut:
On 15/02/2017 18:34, E.Pasma wrote:
Hello, the query below is simpler. May be slower. But looks pretty
relational. Thanks, E Pasma.
create table T(date integer,test char(12));
insert into T
values (1,'clim'),(3,'clim'),(7,'amb'),(10,'amb'),(12,'xxx'),
(13,'clim'),(15,'c
On 15/02/2017 18:34, E.Pasma wrote:
Hello, the query below is simpler. May be slower. But looks pretty
relational. Thanks, E Pasma.
create table T(date integer,test char(12));
insert into T
values (1,'clim'),(3,'clim'),(7,'amb'),(10,'amb'),(12,'xxx'),
(13,'clim'),(15,'clim'),(20,'clim'),(22,
15 feb 2017, Jean-Luc Hainaut:
You could try this, inspired by classic algorithms of temporal
databases:
create table T(date integer,test char(12));
insert into T
values (1,'clim'),(3,'clim'),(7,'amb'),(10,'amb'),(12,'xxx'),
(13,'clim'),(15,'clim'),(20,'clim'),(22,'amb'),(25,'amb');
create
@ Simon,
Thanks for the input ! I was afraid someone was going to mention the dreaded
recursive CTEs.
Jonathan
***
This e-mail message is intended only for the addressee(s) and contains
information which may be confi
nual" grouping
Jonathan
--
Message: 79
Date: Wed, 15 Feb 2017 11:16:24 +0100
From: Clemens Ladisch
To: sqlite-users@mailinglists.sqlite.org
Subject: Re: [sqlite] Group contiguous rows (islands)
Message-ID:
Content-Type: text/plain; charset=us-ascii
Rossel, Jonathan wrote:
> Other database eng
On 15 Feb 2017, at 11:58am, Petite Abeille wrote:
> On Feb 15, 2017, at 11:16 AM, Clemens Ladisch wrote:
>
>> SQLite does not have windowing functions.
>
> A continuous/continual tragedy indeed :|
Windowing breaks the philosophy behind SQL. Rows are meant to be members of a
set, and your o
> On Feb 15, 2017, at 11:16 AM, Clemens Ladisch wrote:
>
> SQLite does not have windowing functions.
A continuous/continual tragedy indeed :|
Still, worthwhile mentioning The Tabibitosan Method, for reference purpose:
http://www.orchestrapit.co.uk/?p=53
https://community.oracle.com/message/39
You could try this, inspired by classic algorithms of temporal databases:
create table T(date integer,test char(12));
insert into T
values (1,'clim'),(3,'clim'),(7,'amb'),(10,'amb'),(12,'xxx'),
(13,'clim'),(15,'clim'),(20,'clim'),(22,'amb'),(25,'amb');
create table TT(seq integer not null prima
Rossel, Jonathan wrote:
> Other database engines have solutions for this task (like windowing in
> postgre) but I wonder if there is an efficient recipe in SQLite.
SQLite does not have windowing functions. So the most efficient method
would be to read the data with a simple ORDER BY, and do the g
Dear all,
I need to perform a kind of partial GROUP BY to determine the beginnings and
ends of sets of identical data. I can't use a full GROUP BY because these sets
can be repeated and their repetition must be conserved. Other database engines
have solutions for this task (like windowing in po
11 matches
Mail list logo
