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 Article

Challenges and Opportunities in Self-Managing Scientific Databases

TL;DR: Challenges and opportunities for research in automating scientific data management related to self-management are described and the problems faced in particular scientific domains are discussed using concrete examples of large-scale applications from neuroscience and high-energy physics.
Journal ArticleDOI

A moving-object index for efficient query processing with peer-wise location privacy

TL;DR: The PEB-tree as discussed by the authors is a privacy-policy-enabled index that integrates location proximity and policy compatibility to enable peer-wise location privacy in location-aware range and kNN queries.
Journal ArticleDOI

Reverse Spatial Visual Top- $k$ Query

TL;DR: Comprehensive experiments are conducted on four geo-image datasets, and the results illustrate that the approach can address the RSVQ k problem effectively and efficiently.
Proceedings ArticleDOI

Efficient algorithms for answering reverse spatial-keyword nearest neighbor queries

TL;DR: To design efficient algorithms, for the first time, an ideal case is theoretically analyzed, which minimizes the object/index node accesses, for processing reverse spatial-keyword nearest neighbor queries and novel search algorithms are designed for efficiently answering the queries.
Proceedings ArticleDOI

STILT: Unifying Spatial, Temporal and Textual Search using a Generalized Multi-dimensional Index

TL;DR: This work introduces a generalized, multi-dimensional index called Spatio-temporal Textual InterLeaved Trie (STILT), which unifies spatial, textual, and temporal components within a single structure and is significantly faster than state-of-the-art approaches in terms of index construction time and search latency.
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)