TY - GEN
T1 - Location-aware type ahead search on spatial databases
T2 - 2011 ACM SIGMOD and 30th PODS 2011 Conference
AU - Basu Roy, Senjuti
AU - Chakrabarti, Kaushik
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - type ahead search
UR - http://www.scopus.com/inward/record.url?scp=79959982938&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79959982938&partnerID=8YFLogxK
U2 - 10.1145/1989323.1989362
DO - 10.1145/1989323.1989362
M3 - Conference contribution
AN - SCOPUS:79959982938
SN - 9781450306614
T3 - Proceedings of the ACM SIGMOD International Conference on Management of Data
SP - 361
EP - 372
BT - Proceedings of SIGMOD 2011 and PODS 2011
PB - Association for Computing Machinery
Y2 - 12 June 2011 through 16 June 2011
ER -