lec13 - Outline One dimension queries Nearest neighbor...

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

View Full Document Right Arrow Icon
Outline One dimension queries Nearest neighbor queries Range queries Queries in higher dimensions Range-trees Strip range queries Rectangle range queries Other Applications Lecture 13, Data Structure: Applications p. 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Queries in 1D Nearest-neighbor queries Definition: given a query point q , find the value v in the table, such that | q - v | is minimized The predecessor or the successor Range queries Definition: given a one-dimensional range ( a,b ), report all points in the table in this range Lecture 13, Data Structure: Applications p. 2
Background image of page 2
Range Queries — 1D Use symbol-tables: tree traversal Each node: correspond a range Node color: white, black, or grey White: its range is disjoint with the query range Grey: its range intersects the query range Black: its range is contained in the query range Tree traversal: start from the root, deter- mine the color of the root, and recursively process the children if necessary
Background image of page 3

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

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

This note was uploaded on 07/17/2010 for the course CS 240 taught by Professor Ortiz during the Spring '09 term at Waterloo.

Page1 / 11

lec13 - Outline One dimension queries Nearest neighbor...

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

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