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
Indexing multi-metric data
TL;DR: The main contribution is an index structure which combines all metrics into a single multi-dimensional access method that works for arbitrary weights preferences, and shows that the proposed index structure is more efficient than existing multi-metric access methods considering different cost criteria and tremendously outperforms traditional approaches when querying very large sets of multi-enriched objects.
Book ChapterDOI
Privacy-Preserving Top-k Spatial Keyword Queries over Outsourced Database
TL;DR: An encrypted tree index is built to facilitate privacy-preserving top-\(k\) spatial keyword queries, where spatial and textual data are encrypted in a unified way.
Patent
Systems and methods for linking content to individual image features
TL;DR: In this paper, a method, computer program, and system for linking content to individual image features are provided, and the content is linked to the plurality of features based on at least one rule.
Book ChapterDOI
Efficiently Evaluating Range-Constrained Spatial Keyword Query on Road Networks
TL;DR: Alternative approaches with different indexing strategies are proposed to solve a specific type of SK query, termed range constrained spatial keyword query (RC-SK query), which searches for all the POIs whose textual description is relevant to the query keywords within a specified area.
Journal ArticleDOI
Finding the optimal location and keywords in obstructed and unobstructed space
TL;DR: This work addresses two instances of the spatial relevance when ranking items: (1) the Euclidean distance and (2) the visibility and presents both approximate and exact solutions for the problem.
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.