The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Hybrid index structures for location-based web search
Proceedings of the 14th ACM international conference on Information and knowledge management
Efficient query processing in geographic web search engines
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Type less, find more: fast autocompletion search with a succinct index
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Processing Spatial-Keyword (SK) Queries in Geographic Information Retrieval (GIR) Systems
SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
Efficient interactive fuzzy keyword search
Proceedings of the 18th international conference on World wide web
Keyword Search on Spatial Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient type-ahead search on relational data: a TASTIER approach
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Extending autocompletion to tolerate errors
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Efficient retrieval of the top-k most relevant spatial web objects
Proceedings of the VLDB Endowment
Reverse spatial and textual k nearest neighbor search
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Location-aware type ahead search on spatial databases: semantics and efficiency
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient continuously moving top-k spatial keyword query processing
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Efficient fuzzy full-text type-ahead search
The VLDB Journal — The International Journal on Very Large Data Bases
DESKS: Direction-Aware Spatial Keyword Search
ICDE '12 Proceedings of the 2012 IEEE 28th International Conference on Data Engineering
Seal: spatio-textual similarity search
Proceedings of the VLDB Endowment
Supporting efficient top-k queries in type-ahead search
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
Supporting Search-As-You-Type Using SQL in Databases
IEEE Transactions on Knowledge and Data Engineering
Efficient safe-region construction for moving top-K spatial keyword queries
Proceedings of the 21st ACM international conference on Information and knowledge management
TsingNUS: a location-based service system towards live city
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Location-aware publish/subscribe
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Database research at the National University of Singapore
ACM SIGMOD Record
G-tree: an efficient index for KNN search on road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
Location-Based Services (LBS) have been widely accepted by mobile users recently. Existing LBS-based systems require users to type in complete keywords. However for mobile users it is rather difficult to type in complete keywords on mobile devices. To alleviate this problem, in this paper we study the location-aware instant search problem, which returns users location-aware answers as users type in queries letter by letter. The main challenge is to achieve high interactive speed. To address this challenge, in this paper we propose a novel index structure, prefix-region tree (called PR-Tree), to efficiently support location-aware instant search. PR-Tree is a tree-based index structure which seamlessly integrates the textual description and spatial information to index the spatial data. Using the PR-Tree, we develop efficient algorithms to support single prefix queries and multi-keyword queries. Experiments show that our method achieves high performance and significantly outperforms state-of-the-art methods.