Journal ArticleDOI
Efficient retrieval of the top-k most relevant spatial web objects
Gao Cong,Christian S. Jensen,Dingming Wu +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
Citations
More filters
Book ChapterDOI
Efficient Spatial Database Keyword Query Search
L. Venkateswara Reddy,K. Prema +1 more
TL;DR: The results proved that the proposed three-dimensional keyword search process can provide better efficiency in terms of accuracy and optimum results.
Journal ArticleDOI
Review on NLP based Technique to Improve the Performance of knn
TL;DR: This work develops a newly access method based on natural language processing that improves the performance of k nearest neighbor search.
Journal Article
Best Keyword Query Search Using Minimum Spatial Cover
G. DurgaRao,V. Dilip Kumar +1 more
TL;DR: The goal is to investigate a general structure, known as Best Keyword Cover (BKC) questions, which alongside bury objects separate additionally considers appraisals of catchphrase, which improves the basic leadership process.
Book ChapterDOI
Improved Spatial Keyword Search Based on IDF Approximation
TL;DR: This paper proposes a novel approximate IDF-based search algorithm that performs nearly twice better than existing method, which are shown through an extensive set of experiments.
Indonesian Journal of Electrical Engineering and Computer Science
Kalpana V. Metre,M. U. Kharat +1 more
TL;DR: The edit distancebased approach with the adaptive partitioning tree index for the queries is used for fuzzy string matching and it outperforms than the existing approaches in storage cost and query performance cost.
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.