| Popis: |
Reverse skyline queries are difficult to process because of the massive amount of computations for checking candidates because existing algorithms for reverse skylines are generally based on pre-processing. Although pre-processing reduces the number of computations on processing queries, it requires re-computations of pre-processed result every time data change. To overcome this limitation, we propose an efficient algorithm to reduce the number of computation in processing reverse skyline queries with a two-phased refinement step. Before refining the final result from candidates, the proposed algorithm has an additional refinement step for decreasing the number of candidates, so that it can handle reverse skyline queries more effectively without any pre-processing. Since not based on pre-processing, our algorithm is more suitable for frequently updated data. Experimental results show that the performance of the proposed algorithm is better than those of the existing pre-processing-based ones. |
