Research Article
Reverse Skyline Computation over Sliding Windows
Algorithm 2
Find predecessor of new point.
initialize ; | find the -tree set that point belongs to; | for each in do | insert all entries in the root of into a heap by descending order of ; | while is not empty do | remove the top entry from ; | if is an intermediate entry then | if . then | ; | break; | for each child of do | if . then | insert into by descending order of ; | else if then | ; | break; | return ; |
|