Reverse Skyline Computation over Sliding Windows

Algorithm 3

Remove and compute .

initialize sets ;

find the -tree set that point belongs to;

for  each    in    do

 insert all entries in the root of into a heap ;

 while    is not empty  do

  remove the top entry from ;

  if    is an intermediate entry  then

   if    then

    remove all points in from ;

   else

    for  each child    of    do

     if    then

      insert into ;

  else if    then

   remove from ;

  else if    then

   remove from ;

 balance in a bottom-up fashion;

return  ;