An analysis and extensions of top k spatial preference queries optimization methods

Marcin Gorawski, Kamil Dowlaszewicz

Abstract


The paper presents a general description of top-k spatial preference queries and an overview of its existing, R-tree based, execution methods. It also introduces an optimization method based on a widened top-k spatial reference query description. All discussed techniques are then analyzed and their characteristics are presented together with the fields of their potential use.

Keywords


spatial queries; optimization

Full Text:

PDF (Polski)

References


Yiu M. L., Dai X., Mamoulis N., Vaitis M.: Top-k Spatial Preference Queries. ICDE 2007, s. 1076-1085.

Hjaltason G. R., Samet H.: Distance Browsing in Spatial Databases. ACM Trans. Database Syst. 24(2), s. 265-318 (1999).

Guttman A.: R-Trees: A Dynamie Index Structure for Spatial Searching. SIGMOD Conference 1984, s. 47-57.

Procopiuc O.: Data Structures for Spatial Database Systems. 1997.

Strona internetowa www.research.att.com/~marioli/spatialindex.




DOI: http://dx.doi.org/10.21936/si2008_v29.n2A.534