Efficient processing of top-k spatial preference queries
Proceedings of the VLDB Endowment
Collective spatial keyword querying
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient processing of top-k spatial keyword queries
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
SWORS: a system for the efficient retrieval of relevant spatial web objects
Proceedings of the VLDB Endowment
Spatial keyword querying of geo-tagged web content
Proceedings of the 7th International Workshop on Ranking in Databases
| Hi-index | 0.00 |
The notion of point-of-interest (PoI) has existed since paper road maps began to include markings of useful places such as gas stations, hotels, and tourist attractions. With the introduction of geopositioned mobile devices such as smartphones and mapping services such as Google Maps, the retrieval of PoIs relevant to a user's intent has became a problem of automated spatio-textual information retrieval. Over the last several years, substantial research has gone into the invention of functionality and efficient implementations for retrieving nearby PoIs. However, with a couple of exceptions existing proposals retrieve results at single-PoI granularity. We assume that a mobile device user issues queries consisting of keywords and an automatically supplied geo-position, and we target the common case where the user wishes to find nearby groups of PoIs that are relevant to the keywords. Such groups are relevant to users who wish to conveniently explore several options before making a decision such as to purchase a specific product. Specifically, we demonstrate a practical proposal for finding top-k PoI groups in response to a query. We show how problem parameter settings can be mapped to options that are meaningful to users. Further, although this kind of functionality is prone to combinatorial explosion, we will demonstrate that the functionality can be supported efficiently in practical settings.