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
Proceedings ArticleDOI

Evaluation of Spatial Keyword Queries with Partial Result Support on Spatial Networks

TL;DR: This research formally introduces definitions of Spatial Keyword k Nearest Neighbor (SKkNN) and Sp spatial Keyword Range (SKR) queries and presents a framework of a spatial keyword query evaluation system which is comprised of Keyword Constraint Filter (KCF), Keyword and Spatial Refinement (KSR), and the spatial keyword ranker.
Journal ArticleDOI

Querying spatial data by dominators in neighborhood

TL;DR: This paper proposes three meaningful score functions to quantify the negative effects of dominators in a spatial object’s neighborhood and designs several algorithms that require different indexes on spatial data sets.
Book ChapterDOI

The Flexible Group Spatial Keyword Query

TL;DR: A new class of service for location based social networks, called the Flexible Group Spatial Keyword Query, which enables a group of users to collectively find a point of interest that optimizes an aggregate cost function combining both spatial distances and keyword similarities.
Proceedings ArticleDOI

Finding Influential Local Users with Similar Interest from Geo-Tagged Social Media Data

TL;DR: This paper designs three hybrid user profiling techniques, an indexing tree, and an upper bound query-user similarity that enables efficient pruning in query processing and proposes a baseline method and a more efficient improved method.
Proceedings ArticleDOI

An Indexing Approach for Efficient Supporting of Continuous Spatial Approximate Keyword Queries

TL;DR: This paper has explored the feasibility of parallelizing AP-tree+ by employing Graphic Processing Unit (GPU) and a min-wise parallel hashing algorithm is used to parallelize the approximate keyword matching of AP- tree+.
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)