Location-aware type ahead search on spatial databases: Semantics and efficiency

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 361-372

  Basu Roy, Senjuti ^a   Chakrabarti, Kaushik ^b  

^a UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

type ahead search

Indexed keywords

LOCATION; QUERY LANGUAGES; QUERY PROCESSING; SEARCH ENGINES; SEMANTIC WEB;

'CURRENT; DATABASE SEMANTICS; DATATYPES; KEYWORD SEARCH; LOCATION-AWARE; SEARCH FUNCTIONALITY; SPATIAL DATA; SPATIAL DATABASE; TYPE-AHEAD SEARCHES; YELLOW PAGES;

SEMANTICS;

EID: 79959982938     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989362     Document Type: Conference Paper

References (19)

1. http://www.marketwire.com/press-release/Study-Shows- Double-Digit-Growth- Local-Mobile-Usage-Unlocking-Access-Younger-Wealthier-1297436.htm.
2. Spatial databases with application to GIS. Morgan Kaufmann Publishers Inc., 2002.
3. H. Bast and I. Weber. Type less, find more: fast autocompletion search with a succinct index. In SIGIR, pages 364-371, 2006.
4. J. L. Bentley. Multidimensional binary search trees in database applications. IEEE Trans. Software Eng., 5(4):333-340, 1979.
5. S. Chaudhuri and R. Kaushik. Extending autocompletion to tolerate errors. In SIGMOD Conference, pages 707-718, 2009.
6. G. Cong, C. S. Jensen, and D. Wu. Efficient retrieval of the top-k most relevant spatial web objects. PVLDB, 2(1):337-348, 2009.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company, 2001.
8. J. J. Darragh and I. H. Witten. Adaptive predictive text generation and the reactive keyboard. Interacting with Computers, 3(1):27-50, 1991.
9. R. Fagin and et. al. Optimal Aggregation Algorithms for Middleware. In PODS, 2001.
10. I. D. Felipe, V. Hristidis, and N. Rishe. Keyword search on spatial databases. In ICDE, pages 656-665, 2008.
11. R. A. Finkel and J. L. Bentley. Quad trees: A data structure for retrieval on composite keys. Acta Inf., 4:1-9, 1974.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
13. M. N. Garofalakis and A. Kumar. Deterministic wavelet thresholding for maximum-error metrics. In PODS, pages 166-176, 2004.
14. G. Li, S. Ji, C. Li, and J. Feng. Efficient type-ahead search on relational data: a tastier approach. In SIGMOD Conference, pages 695-706, 2009.
15. S. Muthukrishnan, V. Poosala, and T. Suel. On rectangular partitionings in two dimensions: Algorithms, complexity, and applications. In ICDT, pages 236-256, 1999.
16. A. Nandi and H. V. Jagadish. Assisted querying using instant-response interfaces. In SIGMOD Conference, pages 1156-1158, 2007.
17. J. Nievergelt, H. Hinterberger, and K. C. Sevcik. The grid file: An adaptable, symmetric multikey file structure. ACM Transactions on Database Systems, 1984.
18. M. Prez, X. Benavent, and R. Olanda. Efficient coding of quadtree nodes. In Computational Science ICCS 2006. 2006.
19. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD Conference, 1995.