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

Fast Searching of Nearest Neighbor using Key Values in Data Mining

TL;DR: In this article, the authors developed a new method Spatial inverted index that cope with 3D data to answer the nearest neighbor query using keyword along with key values in real time.

Nearest Neighbor Search with Keywords in Spatial Databases

TL;DR: A system which can implement search for a location or place only in the used data subspace with the help of R-tree and Nearest neighbor algorithm using inverted Index spatial R-Tree is proposed.
Journal ArticleDOI

Genetic-Based Keyword Matching DBSCAN in IoT for Discovering Adjacent Clusters

TL;DR: Zhang et al. as discussed by the authors proposed a genetic algorithm-based keyword matching algorithm for Density-Based Spatial Clustering of Applications with Noise (DBSCAN).
Posted Content

Learning to Match for Multi-criteria Document Relevance

TL;DR: This paper proposes to tackle the relevance estimation of the users' generated content through the design of a novel fuzzy-based document ranking model, and proposes an automated methodology to capture the importance of relevance dimensions, as well as information about their interaction.

Best Keyword Cover Search Using Distance and Rating

TL;DR: This work proposes generic version called keyword nearest neighbor expansion which reduces the resulted candidate keyword covers of the existing algorithm.
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)