Hi Bryan,
thank you for your answer. My problem is the following: You may think about a
table with a column (among others) that contains a large amount of
unstructured data. These data will to a large extent (but perhaps not
completely) be replaced by structured data (in some user defined data
Hi,
just to make sure, that I understand what is going on:
Suppose I have some table with a variable length column type, e.g. a
varchar(1). The data in this column are large, say, on average of about
9000 characters.
Then I replace the data and they are on average only 10 characters long.
I have created a sequence using
CREATE SEQUENCE GPS.SDSID
AS INTEGER
START WITH 1
INCREMENT BY 1
NO CYCLE;
and get values using
NEXT VALUE FOR GPS.SDSID
in separate SELECT statements with jdbc. The corresponding connection has
autocommit = true.
As long as d
Am Montag, 20. Februar 2012, 08:44:58 schrieb Kristian Waagan:
> When you say stops, do you mean the thread is blocking/hanging?
> If so, can you obtain a stack trace?
No, it seems to be terminated somehow before the shutdown operation can be
finished. When I put a Thread.sleep(250) after the new
Hi,
I am using Derby DB in an embedded environment. I am shutting down the DB and
the system using the following two methods (I have ommitted all try-catch-
finally stuff, logging etc.)
Shutting down the DB, where fDS is an EmbeddedDataSource40:
public void shutdownDB() {
fDS.setShutdow
Is there a way to use an R-Tree with derby db? (Or a GiST?)
In [1] R-Trees are mentioned on page 55. Is it possible to add one's own
implementation on top of derby, if it is not added to derby? How would one do
this?
/Karl
[1] http://db.apache.org/derby/binaries/ApacheDerbyInternals_1_1.pdf
Am Mittwoch, 9. November 2011, 11:51:43 schrieb Knut Anders Hatlen:
> Karl Weber writes:
> > Hi,
> >
> > Derby does support UDTs. One can use any java.io.Serializable java class
> > as a UDT.
> >
> > On the other hand, derby does not support SQL ARRAY ty
Hi,
Derby does support UDTs. One can use any java.io.Serializable java class as a
UDT.
On the other hand, derby does not support SQL ARRAY types.
However, every java array is an object that implements java.io.Serializable,
so can one define a UTD of the form
CREATE TYPE APP.DARRAY
EXT
Hi Mike,
Am Samstag, 22. Oktober 2011, 00:24:06 schrieb Mike Matrigali:
> There are a number of factors:
>
[...]
>
> 3) Each record has overhead and each field has overhead that is variable.
Could you elaborate a litte bit more on that? I already asked about this some
while ago [1], in particu
Hi,
I wonder, how much space derby will use on disk for each row of a table, and
how much space will be used for each field (column value).
Is it possible to give rules of the following kind:
Every field of type INTEGER will take N bytes (N=4?),
every field of type VARCHAR(X) will take I*X+J b
10 matches
Mail list logo
