- Consider the following
quad-tree
where the leaf nodes can hold
2 data records:
Show the result after inserting the record (70, 250) into the following quad-tree
- Consider the following R-tree where
the nodes can contain
3 bounding boxes:
If there are multiple bounding boxes possible, use the first possible bounding box in a node.
- (2.1)
Show the R-tree if we
inserts the following
rectangle R20:
Draw the new R-tree on your answer sheet and redraw some bounding boxes in the above figure if necessary
- (2.2)
Show the R-tree if we
inserts the following
rectangle R20:
Draw the new R-tree on your answer sheet and redraw some bounding boxes in the above figure if necessary
- (2.3)
Show the R-tree if we
inserts the following
rectangle R20:
Draw the new R-tree on your answer sheet and redraw some bounding boxes in the above figure if necessary
If you split a bonding box R#, call the new bounding boxes R#a and R#b. Make sure each new node contains exactly 2 bounding boxes.
- Implement the
one-pass δ algorithm as
an iterator
I.e.:
- Write the pseudo code for the open( ) method (10 pts)
- Write the pseudo code for the
getNext( ) method (10 pts)
- getNext( ) will return the next new tuple in the input relation !!!
- Write the pseudo code for the close( ) method (5 pts)
- Implement the
one-pass ∩S algorithm as
an iterator
I.e.:
- Write the pseudo code for the open( ) method (10 pts)
- Write the pseudo code for the
getNext( ) method (10 pts)
- getNext( ) will return the next tuple in the intersection !!
- Write the pseudo code for the close( ) method (5 pts)