QDR-Tree: An Efcient Index Scheme for Complex Spatial Keyword Query

@article{Zang2018QDRTreeAE,
  title={QDR-Tree: An Efcient Index Scheme for Complex Spatial Keyword Query},
  author={Xinshi Zang and Peiwen Hao and Xiaofeng Gao and Bin Yao and Guihai Chen},
  journal={ArXiv},
  year={2018},
  volume={abs/1804.10726}
}
With the popularity of mobile devices and the development of geo-positioning technology, location-based services (LBS) attract much attention and top-k spatial keyword queries become increasingly complex.It is common to see that clients issue a query to find a restaurant serving pizza and steak, low in price and noise level particularly.However, most of prior works focused only on the spatial keyword while ignoring these independent numerical attributes. 
View via Publisher
6 Citations
Background Citations
1
Methods Citations
2

6 Citations

Efficient index-independent approaches for the collective spatial keyword queries
A Personalized and Approximated Spatial Keyword Query Approach
TLDR
This paper proposes a spatial keyword query method that can support semantic approximate query processing and achieves higher execution efficiency and better user satisfaction compared with the state-of-the-art methods.
Influence constraint based Top-k spatial keyword preference query
TLDR
A Threshold Inverted File Algorithm (TAIFA) is proposed to improve the query, which based on influence constraints filters out irrelevant feature objects of query keywords and uses inverted files to store feature objects.
Spatial-Keyword Skyline Publish/Subscribe Query Processing over Distributed Sliding Window Streaming Data
TLDR
A distributed skyline query processing framework is proposed, which can efficiently support large-scale skyline queries, and MF-Rt-tree, which is an update-efficient and space-saving indexing structure and a fast approach for processing a continuous spatial-keyword skyline query called eager∗, is introduced.
Top-K Collective Spatial Keyword Queries
TLDR
It is proved that the Top-Top-CoSKQ problem is NP-hard, and two index-independent algorithms based on the spatial-textual similarity constraint are proposed, containing an exact algorithm and a heuristic algorithm.
A survey on multisource heterogeneous urban sensor access and data management technologies

References

SHOWING 1-10 OF 19 REFERENCES
Dynamically ranked top-k spatial keyword search
TLDR
This work proposes the idea of "dynamic ranking" of spatio-textual objects, and introduces a novel index, called STARI, which uses this ranking method to retrieve the most recent top-k relevant objects.
Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search
TLDR
A novel index structure is proposed, 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 and a partition based method is proposed to deal with BTOPK-SK.
Semantic-aware top-k spatial keyword queries
TLDR
Novel indexing structures are proposed, which integrate spatial, textual and semantic information in a hierarchical manner, so as to prune the search space effectively in query processing.
LINQ: A Framework for Location-Aware Indexing and Query Processing
TLDR
This work proposes a novel framework called LINQ, capable of processing the generic location-aware rank query (GLRQ) efficiently and holistically, and integrates the synopses tree with the spatio-textual index such as IR-tree.
On Efficient Spatial Keyword Querying with Semantics
TLDR
A novel indexing structure called NIQ-tree is proposed, which integrates spatial, textual and semantic information in a hierarchical manner, so as to prune the search space effectively in query processing.
Fast Nearest Neighbor Search with Keywords
TLDR
A new access method called the spatial inverted index is developed that extends the conventional inverted index to cope with multidimensional data, and comes with algorithms that can answer nearest neighbor queries with keywords in real time.
SKY R-tree: An Index Structure for Distance-Based Top-k Query
TLDR
A new index structure and query processing algorithms for distance-based top-k queries, called SKY R-tree, which drives on the strengths of R- tree and Skyline algorithm to efficiently prune the search space by exploring both the spatial proximity and non-spatial attributes.
Keyword Search on Spatial Databases
TLDR
This work presents an efficient method to answer top-k spatial keyword queries using an indexing structure called IR2-Tree (Information Retrieval R-Tree) which combines an R- Tree with superimposed text signatures.
Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects
TLDR
A new indexing framework for location-aware top-k text retrieval that encompasses algorithms that utilize the proposed indexes for computing the top- k query, thus taking into account both text relevancy and location proximity to prune the search space.
Retrieving top-k prestige-based relevant spatial web objects
TLDR
Empirical studies with real-world spatial data demonstrate that LkPT queries are more effective in retrieving web objects than a previous approach that does not consider the effects of nearby objects; and they show that the proposed algorithms are scalable and outperform a baseline approach significantly.
...
...