On Processing Top-k Spatio-Textual Preference Queries

In this paper we propose a novel query type, termedtop-k spatio-textual preference query, that retrieves a set of spatiotextual objects ranked by the goodness of the facilities in their neighborhood. Consider for example, a tourist that looks for “hotels that have nearby a highly rated Italian restaurant that serves pizza”. The proposed query type takes into account not only the spatial location and textual description of spatio-textual objects (such as hotels and restaurants), but also additional information such as ratings that describe their quality. Moreover, spatio-textual objects (i.e., hotels) are ranked based on the features of facilities (i.e., restaurants) in their neighborhood. Computing the score of each data object based on the facilities in its neighborhood is costly. To address this limitation, we propose an appropriate indexing technique and develop an efficient algorithm for processing our novel query. Moreover, we extend our algorithm for processing spatio-textual preference queries based on alternative score definitions under a unified framework. Last but not least, we conduct extensive experiments for evaluating the performance of our methods.

[1]  Christian S. Jensen,et al.  Retrieving Regions of Interest for User Exploration , 2014, Proc. VLDB Endow..

[2]  Christos Faloutsos,et al.  Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.

[3]  Anthony K. H. Tung,et al.  Keyword Search in Spatial Databases: Towards Searching by Document , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[4]  Man Lung Yiu,et al.  Top-k Spatial Preference Queries , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[5]  S. Muthukrishnan,et al.  Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD '00.

[6]  Nikos Mamoulis,et al.  Spatio-textual similarity joins , 2012, Proc. VLDB Endow..

[7]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[8]  Yang Du,et al.  The Optimal-Location Query , 2005, SSTD.

[9]  Christian S. Jensen,et al.  Spatial Keyword Query Processing: An Experimental Evaluation , 2013, Proc. VLDB Endow..

[10]  João B. Rocha-Junior,et al.  Efficient Processing of Top-k Spatial Keyword Queries , 2011, SSTD.

[11]  Beng Chin Ooi,et al.  Collective spatial keyword querying , 2011, SIGMOD '11.

[12]  Naphtali Rishe,et al.  Keyword Search on Spatial Databases , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[13]  Christian S. Jensen,et al.  Retrieving top-k prestige-based relevant spatial web objects , 2010, Proc. VLDB Endow..

[14]  Hua Lu,et al.  Ranking Spatial Data by Quality Preferences , 2011, IEEE Transactions on Knowledge and Data Engineering.

[15]  Ken C. K. Lee,et al.  IR-Tree: An Efficient Index for Geographic Document Search , 2011, IEEE Trans. Knowl. Data Eng..

[16]  K.Ankamma chowdary Efficient Processing of Top-k Spatial Preference Queries , 2012 .

[17]  Christian S. Jensen,et al.  Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects , 2009, Proc. VLDB Endow..

[18]  Yang Du,et al.  On Computing Top-t Most Influential Spatial Sites , 2005, VLDB.