-
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:
- (2.1)
Show the R-tree if we
inserts the following
rectangle R20:
- (2.2)
Show the R-tree if we
inserts the following
rectangle R20:
Notice the bounding box R4 has increased.
- (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
δ operator as
an iterator
I.e.:
- Write the pseudo code for the
open( ) method (10 pts)
open( ) { create an empty search structure H; R.open( ); } - Write the pseudo code for the
getNext( ) method (10 pts)
getNext( ) { while ( true ) { r = R.getNext( ); if ( r == NotFound ) { return (NotFound); // Done } if ( r not found in search structure H ) { insert r into search structure H; return r; } // If execution reaches here, r is a duplicate // and we loop back and try again } } - Write the pseudo code for the
close( ) method (5 pts)
close( ) { de-allocate search structure H; R.close( ); }
- Write the pseudo code for the
open( ) method (10 pts)
- Implement the one-pass
∩S operator as
an iterator
I.e.:
- Write the pseudo code for the
open( ) method (10 pts)
open( ) { create an empty search structure H; // Build search index on all tuple in S S.open( ); while ( (s = S.getNext( )) != NotFound ) { insert s into search structure H; } S.close( ); // Prepare to output tuples by getNext() R.open( ); } - Write the pseudo code for the
getNext( ) method (10 pts)
getNext( ) { while (true) { r = R.getNext( ); if ( r == NotFound ) { return NotFound; // Done } if ( r found in search structure H ) { return r; } // If execution reaches here, r is not in ∩set // and we loop back and try again } } - Write the pseudo code for the
close( ) method (5 pts)
close( ) { de-allocate search structure H; R.close( ); }
- Write the pseudo code for the
open( ) method (10 pts)