Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search
- 15 February 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 28 (7), 1706-1721
- https://doi.org/10.1109/tkde.2016.2530060
Abstract
With advances in geo-positioning technologies and geo-location services, there are a rapidly growing amount of spatio-textual objects collected in many applications such as location based services and social networks, in which an object is described by its spatial location and a set of keywords (terms). Consequently, the study of spatial keyword search which explores both location and textual description of the objects has attracted great attention from the commercial organizations and research communities. In the paper, we study two fundamental problems in the spatial keyword queries: top $k$ spatial keyword search (TOPK-SK), and batch top $k$ spatial keyword search (BTOPK-SK). Given a set of spatio-textual objects, a query location and a set of query keywords, the TOPK-SK retrieves the closest $k$ objects each of which contains all keywords in the query. BTOPK-SK is the batch processing of sets of TOPK-SK queries. Based on the inverted index and the linear quadtree, we propose a novel index structure, called inverted linear quadtree (IL-Quadtree), which is carefully designed to exploit both spatial and keyword based pruning techniques to effectively reduce the search space. An efficient algorithm is then developed to tackle top $k$ spatial keyword search. To further enhance the filtering capability of the signature of linear quadtree, we propose a partition based method. In addition, to deal with BTOPK-SK, we design a new computing paradigm which partition the queries into groups based on both spatial proximity and the textual relevance between queries. We show that the IL-Quadtree technique can also efficiently support BTOPK-SK. Comprehensive experiments on real and synthetic data clearly demonstrate the efficiency of our methods.
Keywords
Funding Information
- ARC (DE140100679, DP130103245)
- ARC (DP150103071, DP150102728)
- NSFC (61232006)
- ARC (DP150102728, DP140103578)
This publication has 19 references indexed in Scilit:
- Scalable top-k spatial keyword searchPublished by Association for Computing Machinery (ACM) ,2013
- DESKS: Direction-Aware Spatial Keyword SearchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Top-k spatial keyword queries on road networksPublished by Association for Computing Machinery (ACM) ,2012
- A framework for efficient spatial web object retrievalThe VLDB Journal, 2012
- Text vs. spacePublished by Association for Computing Machinery (ACM) ,2011
- Joint Top-K Spatial Keyword Query ProcessingIEEE Transactions on Knowledge and Data Engineering, 2011
- Batch query processing for web search enginesPublished by Association for Computing Machinery (ACM) ,2011
- IR-Tree: An Efficient Index for Geographic Document SearchIEEE Transactions on Knowledge and Data Engineering, 2010
- Efficient and Scalable Method for Processing Top-k Spatial Boolean QueriesLecture Notes in Computer Science, 2010
- An effective way to represent quadtreesCommunications of the ACM, 1982