This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: a) (20, 110) and b) (40, 400) CS4482/6492 Advanced Database Systems Tutorial 11 3. Place the following data about some computers and their characteristics in a quad tree with dimensions speed and ram. Assume the range for speed is 1.00 to 5.00, and for ram it is 500 to 3500. The maximum number of points in a leaf node is 2. 4. Consider the following R-tree and the corresponding distribution of data items (rectangles) and bounding boxes. Consider a query with a query region that coincides with R9. Which nodes will be searched to find all data items that overlap the query region?...
View Full Document
This note was uploaded on 01/11/2012 for the course CS CS4482 taught by Professor Drlee during the Winter '11 term at City University of Hong Kong.
- Winter '11