Subject | Re: [IBO] Re: IBO TTable replacement ? |
---|---|
Author | Jason Wharton |
Post date | 2001-01-25T01:40:37Z |
In the next version of IBO I will have it so that it will be quick like the
BDE is.
For now that is the best IBO can do. I suggest that you use an input
parameter and select only the rows of interest.
IBO v4 will for sure support what you are looking for...
Jason Wharton
CPS - Mesa AZ
http://www.ibobjects.com
BDE is.
For now that is the best IBO can do. I suggest that you use an input
parameter and select only the rows of interest.
IBO v4 will for sure support what you are looking for...
Jason Wharton
CPS - Mesa AZ
http://www.ibobjects.com
----- Original Message -----
From: "luis forra" <luis.forra@...>
To: <IBObjects@egroups.com>
Sent: Wednesday, January 24, 2001 4:32 PM
Subject: [IBO] Re: IBO TTable replacement ?
> --- In IBObjects@egroups.com, "Jason Wharton" <jwharton@i...> wrote:
> > Yes, use the TIBOTable component.
> >
> > Jason Wharton
> > CPS - Mesa AZ
> > http://www.ibobjects.com
> >
> >
> > ----- Original Message -----
> > From: "luis forra" <luis.forra@u...>
> > To: <IBObjects@egroups.com>
> > Sent: Wednesday, January 24, 2001 11:57 AM
> > Subject: [IBO] IBO TTable replacement ?
> >
> >
> > > Does IBO have a TTable replacement with suport for
> > > FindKey,
> > > FindNearest (using two cursors "SELECT PK,... WHERE PK < :LK
> ORDER BY
> > > PK DESC" and "SELECT PK,... WHERE PK >= :LK ORDER BY PK") ,
> > > GoBottom ( using "SELECT PK,... ORDER BY PK DESC") ?
> > >
> > > Best regards
> > >
> > > Luis Forra
>
>
> The behaviour of TIBOTable is diferent. If I have
> 25000 rows in a Table and I do a FindNearest with TIOBTable to the
> last row I get 250000 fetch's with TTable I get very few fetch's.
>
> It seem also that that this code is faster:
>
> IBOTable.FindNearest(['LAST_PK']);
> IBOTable.Close;
> IBOTable.Open;
> IBOTable.FindNearest(['LAST_PK']);
>
> than :
>
> IBOTable.FindNearest(['LAST_PK']);
> IBOTable.FindNearest(['LAST_PK']);
>
> Best regards
>
> Luis Forra
> ---
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>