See-to-retrieve: efficient processing of spatio-visual keyword queries

The wide proliferation of powerful smart phones equipped with multiple sensors, 3D graphical engine, and 3G connection has nurtured the creation of a new spectrum of visual mobile applications. These applications require novel data retrieval techniques which we call What-You-Retrieve-Is-What-You-See (WYRIWYS). However, state-of-the-art spatial retrieval methods are mostly distance-based and thus inapplicable for supporting WYRIWYS. Motivated by this problem, we propose a novel query called spatio-visual keyword (SVK) query, to support retrieving spatial Web objects that are both visually conspicuous and semantically relevant to the user. To capture the visual features of spatial Web objects with extents, we introduce a novel visibility metric which computes object visibility in a cumulative manner. We propose an incremental method called Complete Occlusion-map based Retrieval (COR) to answer SVK queries. This method exploits effective heuristics to prune the search space and construct a data structure called Occlusion-Map. Then the method adopts the best-first strategy to return relevant objects incrementally. Extensive experiments on real and synthetic data sets suggest that our method is effective and efficient when processing SVK queries.

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

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

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

[4]  A. Guttmma,et al.  R-trees: a dynamic index structure for spatial searching , 1984 .

[5]  Yunjun Gao,et al.  Continuous visible nearest neighbor queries , 2009, EDBT '09.

[6]  Rui Zhang,et al.  Incremental Evaluation of Visible Nearest Neighbor Queries , 2010, IEEE Transactions on Knowledge and Data Engineering.

[7]  Torsten Suel,et al.  Efficient query processing in geographic web search engines , 2006, SIGMOD Conference.

[8]  Yunjun Gao,et al.  Visible Reverse k-Nearest Neighbor Queries , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[9]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

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

[11]  Frédo Durand,et al.  A Survey of Visibility for Walkthrough Applications , 2003, IEEE Trans. Vis. Comput. Graph..

[12]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS.

[13]  Feifei Li,et al.  Approximate string search in spatial databases , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[14]  Michael Gervautz,et al.  R-trees for organizing and visualizing 3D GIS databases , 2000 .

[15]  Lidan Shou,et al.  HDoV-tree: the structure, the storage, the speed , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[16]  Gang Chen,et al.  What-you-retrieve-is-what-you-see: a preliminary cyber-physical search engine , 2011, SIGIR '11.

[17]  Chen Li,et al.  Processing Spatial-Keyword (SK) Queries in Geographic Information Retrieval (GIR) Systems , 2007, 19th International Conference on Scientific and Statistical Database Management (SSDBM 2007).

[18]  Ken C. K. Lee,et al.  Nearest Surrounder Queries , 2006, IEEE Transactions on Knowledge and Data Engineering.

[19]  Mark de Berg,et al.  Computational Geometry: Algorithms and Applications, Second Edition , 2000 .

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

[21]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.