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
Spatial Concept Query Based on Lattice-Tree
TL;DR: A novel spatial keyword query is proposed, named Top-k spatial concept query (TkSCQ), to answer STC and retrieve similar spatial objects with multiple textual features and Experimental results demonstrate that the Lattice-tree has the better retrieval efficiency in most cases, especially in the case of large amounts of data queries.
Proceedings ArticleDOI
Context-aware Location Search on Maps
Yufan Sheng,Yu Hao +1 more
TL;DR: This paper proposes an index structure and searching algorithm for context-aware location search problem based on maps that considers max distance among the locations corresponding to the primary keyword and all surrounding contexts keywords.
Journal ArticleDOI
Skyline-Based Sorting Approach for Rail Transit Stations Visualization
TL;DR: In this paper , a filtering and sorting method is used to dynamically query and visualize the relatively more important transportation stations within the users' visible range, so as to solve the above problems and provide people with better transportation services.
Journal Article
An Adaptive Nearest Keyword Search Using Multi-Scale Hashing and Projection Technique in Spatial Databases
D. Jyothirmai,Somasekhar T +1 more
TL;DR: An exact ProMi SH that always retrieves the optimal top-k results, and an approximate ProMiSH that is more efficient in terms of time and space, and is able to obtain near-optimal results in practice are developed.
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.