Alexandre, thanks for the response.

I am thinking we may need to quickly access random data, so a hash
indexing scheme would be nice. The B*Tree also gives us the range
functionality we need. Also we may index a few attributes together as
a unit, so the compound indices sounds good.

Is there a way to do hash indexing? Is there a way to specify the
compound indexing?

Julian

--- In firebird-support@yahoogroups.com, Alexandre Benson Smith
<iblist@...> wrote:

>
> judlian23 wrote:
> > Hi all,
> >
> > I'm trying to decide whether or not to evaluate firebird.
> >
> > What types of indexing does it support? If you index on a particular
> > attribute, will firebird use a default index type? If so, can you
> > change the index type?
> >
> > I assume it uses a B tree scheme. Wikipedia says firebird supports
> > expression and reverse indexing.
> >
> > Please let me know.
> >
> > Thanks in advance.
> >
> > Julian
> >
>
> Others could probably explain in more details.
>
> But, firebird uses a b*tree variation, it uses prefix compression to
> make indices more dense, and the most important, FB indices could be
> combined to simulate compound indices on-the-fly and use more than one
> indice on the same table.
>
> Please, could you give more information about your needs for distinct
> indices implementations ?
>
> see you !
>
> --
> Alexandre Benson Smith
> Development
> THOR Software e Comercial Ltda
> Santo Andre - Sao Paulo - Brazil
> www.thorsoftware.com.br
>