Journal ArticleDOI
Efficient retrieval of the top-k most relevant spatial web objects
Gao Cong,Christian S. Jensen,Dingming Wu +2 more
- Vol. 2, Iss: 1, pp 337-348
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.Abstract:
The conventional Internet is acquiring a geo-spatial dimension. Web documents are being geo-tagged, and geo-referenced objects such as points of interest are being associated with descriptive text documents. The resulting fusion of geo-location and documents enables a new kind of top-k query that takes into account both location proximity and text relevancy. To our knowledge, only naive techniques exist that are capable of computing a general web information retrieval query while also taking location into account.This paper proposes a new indexing framework for location-aware top-k text retrieval. The framework leverages the inverted file for text retrieval and the R-tree for spatial proximity querying. Several indexing approaches are explored within the framework. The framework 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. Results of empirical studies with an implementation of the framework demonstrate that the paper's proposal offers scalability and is capable of excellent performance.read more
Citations
More filters
Journal ArticleDOI
Spatio-textual similarity joins
TL;DR: This paper combines ideas from state-of-the-art spatial distance join and set similarity join methods and proposes efficient algorithms that take into account both spatial and textual constraints and proposes a batch processing technique which boosts the performance of the approaches.
Proceedings ArticleDOI
DESKS: Direction-Aware Spatial Keyword Search
Guoliang Li,Jianhua Feng,Jing Xu +2 more
TL;DR: This work develops effective pruning techniques and search algorithms to efficiently answer a direction-aware query and achieves high performance and outperforms existing methods significantly.
Proceedings ArticleDOI
Collective spatial keyword queries: a distance owner-driven approach
TL;DR: This paper studies the CoSKQ problem and proposes a distance owner-driven approach which involves two algorithms: one is an exact algorithm which runs faster than the best-known existing algorithm by several orders of magnitude and the other is an approximate algorithm which improves thebest-known constant approximation factor from 2 to 1.375.
Proceedings ArticleDOI
Location-aware publish/subscribe
TL;DR: An rtree based index structure by integrating textual descriptions into rtree nodes is proposed, which can filter 500 tweets in a second for 10 million registered subscriptions on a commodity computer and develop effective pruning techniques to improve filtering efficiency.
Proceedings ArticleDOI
An efficient query indexing mechanism for filtering geo-textual data
Lisi Chen,Gao Cong,Xin Cao +2 more
TL;DR: A hybrid index, called IQ-tree, and novel cost models for managing a stream of incoming Boolean Range Continuous queries and algorithms for matching the queries with incoming geo-textual objects based on the index are proposed.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Modern Information Retrieval
TL;DR: In this article, the authors present a rigorous and complete textbook for a first course on information retrieval from the computer science (as opposed to a user-centred) perspective, which provides an up-to-date student oriented treatment of the subject.
Proceedings ArticleDOI
R-trees: a dynamic index structure for spatial searching
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
Proceedings ArticleDOI
The R*-tree: an efficient and robust access method for points and rectangles
TL;DR: The R*-tree is designed which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory which clearly outperforms the existing R-tree variants.