Efficient Processing of Ranked Queries with Sweeping Selection

摘要: Existing methods for top-k ranked query employ techniques including sorting, updating thresholds and materializing views. In this paper, we propose two novel index-based query: (1) indexing the layered skyline, (2) microclusters of objects into a grid structure. We also develop efficient algorithms by locating answer points during sweeping line/hyperplane score function over indexed objects. Both can be easily plugged typical multi-dimensional database indexes. The comprehensive experiments not only demonstrate that our outperform existing ones, but illustrate application data mining technique (microclustering) is useful effective solution processing.