scispace - formally typeset
Journal ArticleDOI

Efficient retrieval of the top-k most relevant spatial web objects

Gao Cong, +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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A Personalized and Approximated Spatial Keyword Query Approach

Xiangfu Meng, +2 more
- 01 Jan 2020 - 
TL;DR: 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.
Book ChapterDOI

SKY R-tree: An Index Structure for Distance-Based Top-k Query

TL;DR: 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.
Proceedings ArticleDOI

Efficient Processing of Spatio-Temporal-Textual Queries

TL;DR: This paper specifies the spatio-temporal-textual query that returns the relevant data objects considering these three criteria simultaneously, presenting new indexes and algorithms to process such query efficiently.
Journal ArticleDOI

Searching Activity Trajectories with Semantics

TL;DR: A novel trajectory query is proposed that not only considers the spatio-temporal closeness of the users’ trajectories but also leverages a proven technique in text mining field, probabilistic topic modelling, to capture the semantic relatedness of the activities between the data and query.
Patent

System and method for fusing vector data with imagery

TL;DR: In this article, vector-imagery conflation is used to align vector data and imagery over large geographical regions, which is applicable for GIS applications requiring alignment of vector data, raster maps, and imagery.
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.
Related Papers (5)