Density Based Collective Spatial Keyword Query

Geographic objects with descriptive text are gaining in prevalence in many web services such as Google map. Spatial keyword query which combines both the location information and textual description stands out in recent years. Existing works mainly focus on finding top-k Nearest Neighbours where each node has to match the whole querying keywords. A collective query has been proposed to retrieve a group of objects nearest to the query object such that the group's keywords cover query's keywords and has the shortest inner-object distances. But the previous method does not consider the density of data objects in the spatial space. In practice, a group of dense data objects around a query point will be more interesting than those sparse data objects. Inner distance of data objects of a group cannot reflect the density of the group. To overcome this shortage, we proposed an approximate algorithm to process the collective spatial keyword query based on density and inner distance. The empirical study shows that our algorithm can effectively retrieve the data objects in dense areas.

[1]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

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

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

[4]  Jiaheng Lu,et al.  Reverse spatial and textual k nearest neighbor search , 2011, SIGMOD '11.

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

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

[7]  Hai Zhuge,et al.  Probabilistic Resource Space Model for Managing Resources in Cyber-Physical Society , 2012, IEEE Transactions on Services Computing.

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

[9]  JUSTIN ZOBEL,et al.  Inverted files for text search engines , 2006, CSUR.

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

[11]  Luis Gravano,et al.  Computing Geographical Scopes of Web Resources , 2000, VLDB.

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

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

[14]  Christian S. Jensen,et al.  Efficient continuously moving top-k spatial keyword query processing , 2011, 2011 IEEE 27th International Conference on Data Engineering.