Please use this identifier to cite or link to this item:
|Title:||Collective spatial keyword querying|
|Keywords:||spatial group keyword query|
spatial keyword query
|Source:||Cao, X.,Cong, G.,Jensen, C.S.,Ooi, B.C. (2011). Collective spatial keyword querying. Proceedings of the ACM SIGMOD International Conference on Management of Data : 373-384. ScholarBank@NUS Repository. https://doi.org/10.1145/1989323.1989363|
|Abstract:||With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and spatial keyword queries that exploit both location and textual description are gaining in prominence. However, the queries studied so far generally focus on finding individual objects that each satisfy a query rather than finding groups of objects where the objects in a group collectively satisfy a query. We define the problem of retrieving a group of spatial web objects such that the group's keywords cover the query's keywords and such that objects are nearest to the query location and have the lowest inter-object distances. Specifically, we study two variants of this problem, both of which are NP-complete. We devise exact solutions as well as approximate solutions with provable approximation bounds to the problems. We present empirical studies that offer insight into the efficiency and accuracy of the solutions. © 2011 ACM.|
|Source Title:||Proceedings of the ACM SIGMOD International Conference on Management of Data|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.