Keyword search on structured and semi-structured data
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
A hybrid index structure for geo-textual searches
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Computing minimum diameter color-spanning sets
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Retrieving top-k prestige-based relevant spatial web objects
Proceedings of the VLDB Endowment
Providing built-in keyword search capabilities in RDBMS
The VLDB Journal — The International Journal on Very Large Data Bases
NP-completeness of spreading colored points
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Reverse spatial and textual k nearest neighbor search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Collective spatial keyword querying
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
On some geometric problems of color-spanning sets
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Preference-based top-k spatial keyword queries
Proceedings of the 1st international workshop on Mobile location-based service
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Keyword query cleaning with query logs
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Computing minimum diameter color-spanning sets is hard
Information Processing Letters
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
Evaluating spatial keyword queries under the mapreduce framework
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Seal: spatio-textual similarity search
Proceedings of the VLDB Endowment
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
Efficient safe-region construction for moving top-K spatial keyword queries
Proceedings of the 21st ACM international conference on Information and knowledge management
Keyword-based k-nearest neighbor search in spatial databases
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
A framework for efficient spatial web object retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
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
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
On some geometric problems of color-spanning sets
Journal of Combinatorial Optimization
ST-HBase: a scalable data management system for massive geo-tagged objects
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Spatial keyword querying of geo-tagged web content
Proceedings of the 7th International Workshop on Ranking in Databases
A spatial keyword evaluation framework for network-based spatial queries
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A ranking measure for top-k moving object trajectories search
Proceedings of the 7th Workshop on Geographic Information Retrieval
Density-based spatial keyword querying
Future Generation Computer Systems
| Hi-index | 0.00 |
This work addresses a novel spatial keyword query called the m-closest keywords (mCK) query. Given a database of spatial objects, each tuple is associated with some descriptive information represented in the form of keywords. The mCK query aims to find the spatially closest tuples which match m user-specified keywords. Given a set of keywords from a document, mCK query can be very useful in geotagging the document by comparing the keywords to other geotagged documents in a database. To answer mCK queries efficiently, we introduce a new index called the bR*-tree, which is an extension of the R*-tree. Based on bR*-tree, we exploit a priori-based search strategies to effectively reduce the search space. We also propose two monotone constraints, namely the distance mutex and keyword mutex, as our a priori properties to facilitate effective pruning. Our performance study demonstrates that our search strategy is indeed efficient in reducing query response time and demonstrates remarkable scalability in terms of the number of query keywords which is essential for our main application of searching by document.