Re: A DBMS implementation Question

From: Jason W. Paul <>
Date: Fri, 28 Feb 2003 15:13:05 -0500
Message-ID: <3e5fc2d3$0$59341$>

Just slap another index on the age column. Every single RDBMS package that I can think of allows for multiple indexes.

"owen" <> wrote in message
> Some small rational dbms use B tree for indexing. I found a problem
> the condition that the key for the table is a multiple key. For
> , there is a table which is denoted as emp(no, age, name), and (no +
> age) is the key for indexing.In the B Tree, the values of "no" and
> are transfered to String and merge together, such as the key value
> (1, 20, "abc") is "00010020",and the the B Tree of the table is
> established by the sequence of the key.
> Now , I have a problem , if I want to query all the people
> age are more than 20 , which is described as "select * from emp
> where age > 20", i can't use b tree for indexing, if i use ,
> number of records that i must scan may be very large, how to
> the problem.
> The problem can be expressed as "how to deal with scaning the
> using non-primary key or non-key field".
> thanks!!
> --
> Posted via
Received on Fri Feb 28 2003 - 21:13:05 CET

Original text of this message