Geospatial mapping and navigation of the web
Proceedings of the 10th international conference on World Wide Web
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Computing Geographical Scopes of Web Resources
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Web-a-where: geotagging web content
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Efficient query processing in geographic web search engines
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Keyword Search on Spatial Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Keyword Search in Spatial Databases: Towards Searching by Document
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Exponential-time approximation of weighted set cover
Information Processing Letters
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Retrieving top-k prestige-based relevant spatial web objects
Proceedings of the VLDB Endowment
Multi-approximate-keyword routing in GIS data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
User oriented trajectory search for trip recommendation
Proceedings of the 15th International Conference on Extending Database Technology
Top-k spatial keyword queries on road networks
Proceedings of the 15th International Conference on Extending Database Technology
Co-spatial searcher: efficient tag-based collaborative spatial search on geo-social network
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Circle of friend query in geo-social networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Seal: spatio-textual similarity search
Proceedings of the VLDB Endowment
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
See-to-retrieve: efficient processing of spatio-visual keyword queries
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Keyword-aware optimal route search
Proceedings of the VLDB Endowment
SWORS: a system for the efficient retrieval of relevant spatial web objects
Proceedings of the VLDB Endowment
DISKs: a system for distributed spatial group keyword search on road networks
Proceedings of the VLDB Endowment
Location-sensitive resources recommendation in social tagging systems
Proceedings of the 21st ACM international conference on Information and knowledge management
Spatial-aware interest group queries in location-based social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
Aggregate keyword routing in spatial database
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Spatio-textual similarity joins
Proceedings of the VLDB Endowment
Moving spatial keyword queries: Formulation, methods, and analysis
ACM Transactions on Database Systems (TODS)
Spatial keyword query processing: an experimental evaluation
Proceedings of the VLDB Endowment
Scalable top-k spatial keyword search
Proceedings of the 16th International Conference on Extending Database Technology
Collective spatial keyword queries: a distance owner-driven approach
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
An efficient query indexing mechanism for filtering geo-textual data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Top-k diversity queries over bounded regions
ACM Transactions on Database Systems (TODS)
Location-aware publish/subscribe
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Map search via a factor graph model
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Context-aware top-K processing using views
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Spatial keyword querying of geo-tagged web content
Proceedings of the 7th International Workshop on Ranking in Databases
A ranking measure for top-k moving object trajectories search
Proceedings of the 7th Workshop on Geographic Information Retrieval
GroupFinder: a new approach to top-k point-of-interest group retrieval
Proceedings of the VLDB Endowment
Density-based spatial keyword querying
Future Generation Computer Systems
Hi-index | 0.00 |
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.