Farhana M. Choudhury
Timos Sellis
ABSTRACT
Top-k spatial-textual queries have received significant attention in the research community. Several techniques to efficiently process this class of queries are now widely used in a variety of applications. However, the problem of how best to process multiple queries efficiently is not well understood. Applications relying on processing continuous streams of queries, and offline pre-processing of other queries could benefit from solutions to this problem. In this work, we study practical solutions to efficiently process a set of top-k spatial-textual queries. We propose an efficient best-first algorithm for the batch processing of top-k spatial-textual queries that promotes shared processing and reduced I/O in each query batch. By grouping similar queries and processing them simultaneously, we are able to demonstrate significant performance gains using publicly available datasets.
- Google annual search statistics. http://www.statisticbrain.com/google-searches. {Online; accessed 20-03-2015}.Google Scholar
- L. Chen, G. Cong, C. S. Jensen, and D. Wu. Spatial keyword query processing: an experimental evaluation. In VLDB, pages 217--228, 2013. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47--57, 1984. Google ScholarDigital Library
- J. M. Ponte and W. B. Croft. A language modeling approach to information retrieval. In SIGIR, pages 275--281, 1998. Google ScholarDigital Library
- J. B. Rocha-Junior, O. Gkorgkas, S. Jonassen, and K. Nørvåg. Efficient processing of top-k spatial keyword queries. In SSTD, pages 205--222, 2011. Google ScholarDigital Library
- SearchEngineLand. Microsoft: 53 percent of mobile searches have local intent. http://searchengineland.com/microsoft-53-percent-of-mobile-searches-have-local-intent-55556. {Online; accessed 20-03-2015}.Google Scholar
- D. Wu, G. Cong, and C. S. Jensen. A framework for efficient spatial web object retrieval. PVLDB, 21(6):797--822, 2012. Google ScholarDigital Library
- D. Wu, M. L. Yiu, G. Cong, and C. S. Jensen. Joint top-k spatial keyword query processing. TKDE, 24(10):1889--1903, 2012. Google ScholarDigital Library
- L. Zhisheng, K. C. K. Lee, Z. Baihua, L. Wang-Chien, L. Dik Lun, and W. Xufa. IR-tree: An efficient index for geographic document search. TKDE, 23(4):585--599, 2011. Google ScholarDigital Library
- J. Zobel, A. Moffat, and K. Ramamohanarao. Inverted files versus signature files for text indexing. ACM Trans. Database Syst., 23(4): 453--490, 1998. Google ScholarDigital Library
Index Terms
- Batch processing of Top-k Spatial-textual Queries
Recommendations
Batch Processing of Top-k Spatial-Textual Queries
Since the mid-2000s, everal indexing techniques have been proposed to efficiently answer top-k spatial-textual queries. However, all of these approaches focus on answering one query at a time. In contrast, how to design efficient algorithms that can ...
Scalable and efficient processing of top-k multiple-type integrated queries
AbstractIn this paper, we define a new class of queries, the top-k multiple-type integrated query (simply, top-k MULTI query). It deals with multiple data types and finds the information in the order of relevance between the query and the object. Various ...
Efficient Group Processing for Multiple Reverse Top-k Geo-Social Keyword Queries
Database Systems for Advanced ApplicationsAbstractA Reverse Top-k Geo-Social Keyword Query (RkGSKQ) aims to find all the users who have a given geo-social object in their top-k geo-social keyword query results. This query is practical in detecting prospective customers for online business in ...
Comments