head     1.5;
branch   ;
access   ;
symbols  ;
locks    ; strict;
comment  @# @;


1.5
date     91.03.20.01.13.09;  author kemnitz;  state Exp;
branches ;
next     1.4;

1.4
date     91.03.19.15.58.23;  author mao;  state Exp;
branches ;
next     1.3;

1.3
date     91.03.19.15.51.34;  author kemnitz;  state Exp;
branches ;
next     1.2;

1.2
date     91.03.19.15.08.40;  author kemnitz;  state Exp;
branches ;
next     1.1;

1.1
date     91.03.19.00.24.34;  author kemnitz;  state Exp;
branches ;
next     ;


desc
@@


1.5
log
@Uses "box overlap" operator so that rtree is interesting...
@
text
@/* 
 * here is the same query on the same class without the index
 */

retrieve (slow_emp4000.all) where slow_emp4000.location && "(24000,24000,26000,26000)"
\p
@


1.4
log
@there are 4000 tuples, not 1000 tuples, in the rtree example.
@
text
@d5 1
a5 1
retrieve (slow_emp4000.all) where slow_emp4000.location ~= "(101,1700,66,1700)"
@


1.3
log
@demo shuffling
@
text
@d5 1
a5 1
retrieve (slow_emp1000.all) where slow_emp1000.location ~= "(101,1700,66,1700)"
@


1.2
log
@reorganized demo scripts
@
text
@d1 2
a2 2
/*
 * and here is the third one; has a class as an argument
d5 1
a5 1
retrieve (emp.name) where overpaid(emp)
@


1.1
log
@Initial revision
@
text
@d1 2
a2 2
/* 
 * this one is inherited
d4 2
a5 1
retrieve (stud_emp.all) where overpaid (stud_emp)
@
