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
Textually Relevant Spatial Skylines
TL;DR: In this article, a spatio-textual skyline (STS) query is proposed, in which the skyline points are selected not only based on their distances to a set of query locations, but also based on the relevance of query keywords.
Journal ArticleDOI
SkyGraph: retrieving regions of interest using skyline subgraph queries
TL;DR: This paper overcome the computational bottleneck by proposing a polynomial-time approximation algorithm called SkyGraph, and develops an index structure, Partner Index, that drastically prunes the search space and provides up to 3 orders of magnitude speed-up on real road networks over the baseline approach.
Proceedings ArticleDOI
Batch processing of Top-k Spatial-textual Queries
TL;DR: This work proposes 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.
Journal ArticleDOI
Open Issues in Intelligent Personal Health Record – An Updated Status Report for 2012
TL;DR: Several open issues in iPHR are discussed, including two enhancements to an existing function and two potential new functions, including one potential new function that is personalized search for individual healthcare providers and another which is personalized local search for health-related services.
Journal ArticleDOI
Enabling Scalable Geographic Service Sharing with Weighted Imprecise Voronoi Cells
TL;DR: The key challenge addressed is that of scalably providing up-to-date results to queries when the query locations change continuously, which is achieved by the proposal of a new so-called safe-zone model.
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.