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

Home -> Community -> Usenet -> c.d.o.server -> Re: R-tree vs. B-tree

Re: R-tree vs. B-tree

From: Andrew Mobbs <andrewm_at_chiark.greenend.org.uk>
Date: 31 Jan 2002 12:22:09 +0000 (GMT)
Message-ID: <nos*82Kfp@news.chiark.greenend.org.uk>


Joe Aloka K'Odingo <jkoding2_at_ch.csc.com> wrote:
>Hi Folks!
>
>What's the difference between a B-tree and an R-tree, and why would one use
>one as opposed to the other?

R-Trees are used for spatial searches, e.g. "is this object contained within this rectangle?".

You can get Guttman's original paper on R-Trees at: http://www.es.ucsc.edu/~tonig/rtrees/rtrees.pdf

-- 
Andrew Mobbs - http://www.chiark.greenend.org.uk/~andrewm/
Received on Thu Jan 31 2002 - 06:22:09 CST

Original text of this message

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