Best solution I've been able to come up with is this, which
does N selects where N is the path length from the start
to the furthest leaf. Can anyone suggest anything better?
/**
* Process all descendants of a specified row in a table
* with a recursive key relationship. A method
Hi,
I am struggling to emit DDL of a Derby database programmatically. So far, I was
using dblook tool at the command prompt to generate the DDL. Now, I need to do
it through code, and I can't find a method in the dblook class that I could
invoke to accomplish this task.
Sorry, if this
Hi John,
Well I would prefer a structure, that I could put into a
Nasi-Schneidermann-Diagramm.
So instead of using while (true) and fleeing out of it like hell with a break
or a return I would do something like this:
PreparedStatement stat;
try
{
stat = connection.prepareStatement(
On 10/15/12 4:03 AM, Dinesh Bajaj wrote:
Hi,
I am struggling to emit DDL of a Derby database programmatically. So
far, I was using dblook tool at the command prompt to generate the
DDL. Now, I need to do it through code, and I can't find a method in
the dblook class that I could invoke to
On 15.10.2012 13:03, Dinesh Bajaj wrote:
Hi,
I am struggling to emit DDL of a Derby database programmatically. So
far, I was using dblook tool at the command prompt to generate the
DDL. Now, I need to do it through code, and I can't find a method in
the dblook class that I could invoke to
Hi Rick,
I missed your response altogether. Yes, what you suggest works. Thanks!
-Dinesh
From: Rick Hillegas rick.hille...@oracle.com
To: derby-user@db.apache.org
Sent: Monday, 15 October 2012 6:13 PM
Subject: Re: How to emit DDL programmatically using
