John,
I've tried the following test program (in pseudo code):
for(i = 0; i < 10; i++){
insert row with new primary key;
rowid[i] = last_row_id();
}
for(;;){
for(i = 0; i < 10; i++){
r = random(10);
delete from table where id = rowid[r];
insert row;
rowid[r] = last
On 2005-05-29T18:20:33-0400, John Ruttenberg wrote:
> I timed it. It takes just under a second for 1M calls to rand(). This didn't
> change over thousands of repetitions.
Ok.
> > You mean an update? How do you select a random row? In particular is
> > that a constant (in time) operation?
>
>
Allan Wind:
> On 2005-05-29T11:51:27-0400, John Ruttenberg wrote:
> Content-Description: message body text
> > I have a benchmark program that demonstrates significant performace
> > degradation over time. Here is what this benchmark does:
> >
> > 1. Create a table with a primary integer key
On 2005-05-29T11:51:27-0400, John Ruttenberg wrote:
Content-Description: message body text
> I have a benchmark program that demonstrates significant performace
> degradation over time. Here is what this benchmark does:
>
> 1. Create a table with a primary integer key and a blob value.
>
I have a benchmark program that demonstrates significant performace
degradation over time. Here is what this benchmark does:
1. Create a table with a primary integer key and a blob value.
2. Populate the table with 1M rows. In all cases the blobs are strings
with random lengths be
5 matches
Mail list logo
