Optimization of Top-k Spatial Preference Queries' Execution Process Based on Similarity of Preferences

Authors:
Marcin Gorawski;Kamil Dowlaszewicz
Affiliations:
Institute of Computer Science, Silesian University of Technology, Poland;Institute of Computer Science, Silesian University of Technology, Poland
Venue:
Proceedings of the 2008 conference on New Trends in Multimedia and Network Information Systems
Year:
2008

Citing 3
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

A detailed description of top-k spatial preference queries and the schema of their execution will be presented. Then, it discusses existing R-tree based top-k spatial preference queries' execution algorithms and the optimization methods they utilize. Moreover, the paper presents a new optimization technique and an algorithm capable of utilizing it together with other methods. Finally, an analysis of proposed method's efficiency is presented.