Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: Optomized Range Searching....

Re: Optomized Range Searching....

From: Jan Hidders <hidders_at_wsinis12.win.tue.nl>
Date: 15 Aug 2000 11:34:43 GMT
Message-ID: <8nb9sj$8a2$1@news.tue.nl>

On 14 Aug 2000 23:19:14 -0500, Art Pollard <pollarda_at_lextek.com> wrote:
>
>I am wondering if there are any papers on ways
>to optomize range searching. (Specifically numerical
>range searching.) For example, if a database user
>requested all books under $100, it could make for
>a lot of traversing in the BTree or other index when
>you consider all decimal places that are possible.

Maybe I am misunderstanding you, but usually you just look up the page that contains the upperbound and the page that contains the lowerbound. The pages "in between" will then contain records that fall within the range. So, you just have to traverse the tree two times.

Kind regards,

Received on Tue Aug 15 2000 - 06:34:43 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US