0:12 PM
Subject: RE: [sqlite] Finding linked peers
It's much easier to load all the data into a in-memory hierarchical
structure and work with it from memory than try to come up with individual
SQL statements. Some things you could do easily like find the leaf nodes
(i.e., use a sub-select
for identifying a release's
predecessor.
-Clark
- Original Message
From: Dennis Cote <[EMAIL PROTECTED]>
To: sqlite-users@sqlite.org
Sent: Tuesday, March 20, 2007 11:27:39 AM
Subject: Re: [sqlite] Finding linked peers
Clark Christensen wrote:
> So, finally, the question: What might the
Sample recusrive SQL from another database engine...
level is a built in field. This is very useful and powerful syntax allowing
one to build tree's (ie parent child relationships) inside of a table.
SELECT level,chld
FROM tbl1
START WITH value = 'some value'
07 1:57 PM
To: SQLite List
Subject: [sqlite] Finding linked peers
I'm having trouble wrapping my head around a solution here. Any advice is
appreciated.
I'm working on a SQLite-based app for keeping track of PC BIOS releases.
One obvious requirement is to be able to track and document change history.
Clark Christensen wrote:
So, finally, the question: What might the SQL look like to retrieve a list of
predecessors for 'PC1_v1.3'? Sure, I could prepare a stmt in the app (Perl),
and walk the chain in some fashion. Is this result even possible using plain
SQL?
Clark,
SQLite does not
I'm having trouble wrapping my head around a solution here. Any advice is
appreciated.
I'm working on a SQLite-based app for keeping track of PC BIOS releases. One
obvious requirement is to be able to track and document change history. So,
using this sample schema/data code:
create table
6 matches
Mail list logo
