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

A Hierarchical Framework for Top-k Location-Aware Error-Tolerant Keyword Search

TL;DR: A novel framework to solve the problem of top-k location-aware similarity search with fuzzy token matching is proposed and a hierarchical index HGR-Tree is proposed to capture signatures of both spatial and textual relevance.
Journal ArticleDOI

Microblogs data management: a survey

TL;DR: This paper reviews core components that enable large-scale querying and indexing for microblogs data, and discusses system-level issues and on-going effort on supporting microblogs through the rising wave of big data systems.
Journal ArticleDOI

Towards Why-Not Spatial Keyword Top-$k$ Queries: A Direction-Aware Approach

TL;DR: It is proved that the best refined query directions lie in a finite solution space for a special case and the search for the optimal refinement to a linear programming problem for the general case is reduced.
Proceedings ArticleDOI

Evaluating spatial-keyword queries on streaming data

TL;DR: This paper extends existing snapshot spatial-keyword queries with the temporal dimension to effectively serve streaming data applications and evaluates the major index structures equipped with efficient query processing techniques and evaluated to process the extended queries.
Journal ArticleDOI

Top-k Spatio-Textual Similarity Join

TL;DR: This paper proposes a signature-based top-k-ST join framework, which identifies the most similar pairs from two spatio-textual data sets, and proposes a best-first accessing method that preferentially accesses signatures with large upper bounds while those pairs with small upper bounds can be pruned.
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)