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
Journal ArticleDOI
A New Hybrid Index Structure Based on R-Tree and Inverted File
TL;DR: A new hybrid index structure that combines R-tree and inverted file is proposed that is faster and more accurate to furnish searching results to mobile user, and the results are considered of text relation and the location proximity.
Journal ArticleDOI
Learning to Process Topic Aware Queries on Geo-Textual Streaming Data
TL;DR: Topic Aware Grid (TAG) as discussed by the authors integrates spatial and topic information using a variation of the Grid index where cells of the index are attached to local topic models to process topic-aware spatial keyword search on streaming data.
Proceedings ArticleDOI
Single and Multiple Point Spatial Queries Supporting Keywords for Searching Nearest Neighbors
Komal K. Chhajed,Shailaja Jadhav +1 more
TL;DR: A new method named the SI-index Spatial Inverted) is developed which extends the capabilities of conventional inverted index manages with multidimensional data, along with the solution of moving range queries answered by using SI- index results to algorithm which solves the problem in real time.
Journal Article
A Novel Approach to find out the Nearest Object Location
B.Sowmya,A.Venkanna Babu +1 more
TL;DR: This work proposes an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for large scale computer vision problems and states that the distance between two points in the embedded space is bounded by the distance in the original space.
A Query Based Algorithm For Optimal Location Search
TL;DR: The objective is to explore a general form, known as Best Keyword Cover (BKC) query, which along with interobject distance also considers ratings of keyword, which enhances the decision making process.
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.