Hi legolas,
Did you try SQL Workbech/J at http://www.sql-workbench.net
Works very well with Derby for me.
Jon
On 1/27/07, legolas [EMAIL PROTECTED] wrote:
Hi
Thank you for reading my post.
is there any graphical query builder available for derby something like Ms
sql server query builder ?
On Monday 05 February 2007 4:51 pm, Nurullah Akkaya wrote:
i am using derby in embedded mode.
i have a table of 100 million records when i do a select i get 600k
to 1million records table structure is as follows
[SNIP]
99 percent of the time i select ( above query ) based on the wordId i
Nurullah Akkaya wrote:
i am using derby in embedded mode.
i have a table of 100 million records when i do a select i get 600k to
1million records table structure is as follows
Are you saying that a single select query may return 1 million records?
I am not surprised if that takes more than
It is not quite clear to me what you are trying to achieve. Why do
you want a sequential read? Scanning the entire table of 100
million records should take longer time than looking up a record
using a index on wordid. Have you retrieved the query plan and
made sure the index on wordid
Sorry to top post, on my crackberry...
I think you missed my point.
Select the count of your documents that use the word 'the'.
Ok so let's say that you want to search for all of the documents that use the
word 'the'.
You first lookup the integer representation of the word. Let's say that its =
Nurullah Akkaya wrote:
It is not quite clear to me what you are trying to achieve. Why do
you want a sequential read? Scanning the entire table of 100 million
records should take longer time than looking up a record using a
index on wordid. Have you retrieved the query plan and made sure
On Feb 6, 2007, at 11:25 AM, Michael Segel wrote:
Sorry to top post, on my crackberry...
I think you missed my point.
Select the count of your documents that use the word 'the'.
Ok so let's say that you want to search for all of the documents
that use the word 'the'.
You first lookup the
To answer your question on compound index. It just means to define an index
which includes more than one column. eg
**
CREATE TABLE t1(c1 INT, c2 INT, c3 INT, c4 INT)
CREATE INDEX i1_2_4 ON t1(c1, c4, c2)
**
HTH,
Mamta
On 2/6/07, Nurullah Akkaya [EMAIL PROTECTED] wrote:
On Feb 6, 2007, at
It sounds like the issue is the structure of the rows on the data
pages. IIUC, once a row is stored on a data page, it's going to be
there for a long long time. So as you add new rows, they are added to
data pages where there is free space. The only way to move a row is
to delete it and
for who ever searches these archives creating a composite index that
includes all the columns i query solved the problem. i can read 2.7
million records in 11 seconds another query that selects around 800k
records dropped to about 4 secs.
On Feb 6, 2007, at 12:40 PM, Craig L Russell
Yup.
That's cause you're not actually the database tables. You're only hitting
the index. ;-)
Kinda fun, aint it?
_
From: Nurullah Akkaya [mailto:[EMAIL PROTECTED]
Sent: Tuesday, February 06, 2007 4:52 PM
To: Derby Discussion
Subject: Re: keeping the table ordered
for who
On 2/6/07, Nurullah Akkaya [EMAIL PROTECTED] wrote:
for who ever searches these archives creating a composite index that
includes all the columns i query solved the problem. i can read 2.7million
records in 11 seconds another query that selects around 800k
records dropped to about 4 secs.
12 matches
Mail list logo
