lec40 - R-Trees Extension of B+-trees. Collection of...

Info iconThis preview shows pages 1–14. Sign up to view the full content.

View Full Document Right Arrow Icon
R-Trees Extension of B+-trees. Collection of d-dimensional rectangles. A point in d-dimensions is a trivial rectangle.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Non-rectangular Data Non-rectangular data may be represented by minimum bounding rectangles (MBRs).
Background image of page 2
Operations Insert Delete Find all rectangles that intersect a query rectangle. Good for large rectangle collections stored on disk.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
R-Trees—Structure Data nodes (leaves) contain rectangles. Index nodes (non-leaves) contain MBRs for data in subtrees. MBR for rectangles or MBRs in a non-root node is stored in parent node.
Background image of page 4
R-Trees—Structure R-tree of order M. Each node other than the root has between m <= ceil(M/2) and M rectangles/MBRs. Assume m = ceil(M/2) henceforth. Typically, m = ceil(M/2). Root has between 1 and M rectangles/MBRs. Each index node has as many MBRs as children. All data nodes are at the same level.
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example R-tree of order 4. Each node may have up to 4 rectangles/MBRs.
Background image of page 6
Example Possible partitioning of our example data into 12 leaves.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example Possible R-tree of order 4 with 12 leaves. a b c d e f g h i j k l m n o p Leaves are data nodes that contain 4 input rectangles each. a-p are MBRs
Background image of page 8
Example Possible corresponding grouping. a b c d m a b cd e f g h i j k l m n o p
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example a b c d m e f n Possible corresponding grouping. a b cd e f g h i j k l m n o p
Background image of page 10
Example a b c d m e f n h g i o p Possible corresponding grouping. a b cd e f g h i j k l m n o p
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Query Report all rectangles that intersect a given rectangle.
Background image of page 12
Start at root and find all MBRs that overlap query. Search corresponding subtrees recursively.
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 14
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/07/2010 for the course COT 5536 taught by Professor Sartajsahani during the Spring '10 term at University of Florida.

Page1 / 44

lec40 - R-Trees Extension of B+-trees. Collection of...

This preview shows document pages 1 - 14. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online