Adaptive predictive text generation and the reactive keyboard
Interacting with Computers
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Spatial databases with application to GIS
Spatial databases with application to GIS
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Deterministic wavelet thresholding for maximum-error metrics
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Assisted querying using instant-response interfaces
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Multidimensional Binary Search Trees in Database Applications
IEEE Transactions on Software Engineering
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
Efficient coding of quadtree nodes
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Seal: spatio-textual similarity search
Proceedings of the VLDB Endowment
Proceedings of the 21st ACM international conference on Information and knowledge management
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
Map search via a factor graph model
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Mobility and social networking: a data management perspective
Proceedings of the VLDB Endowment
Density-based spatial keyword querying
Future Generation Computer Systems
Hi-index | 0.00 |
Users often search spatial databases like yellow page data using keywords to find businesses near their current location. Typing the entire query is cumbersome and prone to errors, especially from mobile phones. We address this problem by introducing type-ahead search functionality on spatial databases. Like keyword search on spatial data, type-ahead search needs to be location-aware, i.e., with every letter being typed, it needs to return spatial objects whose names (or descriptions) are valid completions of the query string typed so far, and which rank highest in terms of proximity to the user's location and other static scores. Existing solutions for type-ahead search cannot be used directly as they are not location-aware. We show that a straight-forward combination of existing techniques for performing type-ahead search with those for performing proximity search perform poorly. We propose a formal model for query processing cost and develop novel techniques that optimize that cost. Our empirical evaluations on real and synthetic datasets demonstrate the effectiveness of our techniques. To the best of our knowledge, this is the first work on location-aware type-ahead search.