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
Proceedings ArticleDOI
Distributed top-k query processing on multi-dimensional data with keywords
TL;DR: A new query is defined which enriches the conventional top-k queries, and some algorithms are proposed to solve the novel problem of how to efficiently retrieve k data objects with the best score and all query from distributed databases.
Journal ArticleDOI
Efficiently Processing Spatial and Keyword Queries in Indoor Venues
TL;DR: A novel data structure called Keyword Partitioning Tree (KP-Tree) that indexes objects in an indoor partition and an efficient algorithm based on VIP-Tree and KP-Trees to efficiently answer spatial keyword queries are proposed.
Journal ArticleDOI
Keyword Search on Large Graphs: A Survey
Jianye Yang,Wu Yao,Wenjie Zhang +2 more
TL;DR: This survey aims to provide the researchers a comprehensive understanding of existing graph keyword search solutions by classifying the existing works into different categories according to the specific problem definition.
Proceedings ArticleDOI
A Cost-based Method for Location-Aware Publish/Subscribe Services
TL;DR: This paper proposes two novel indexing structures, mbrtrie and PKQ, and devise two filtering algorithms to support fast message filtering, and develops a cost-based model to judiciously select the best filtering algorithm for different scenarios.
Proceedings ArticleDOI
Top-k point of interest retrieval using standard indexes
TL;DR: A novel technique is proposed that encodes the spatio-textual part of a PoI as a compact bit string in compressed form and a novel top-k query algorithm that merges partial results while providing an exact result is proposed.
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.