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
Spatio-temporal Keywords Queries in HBase
TL;DR: Two algorithms for spatio-temporal keyword queries are developed, one is suitable for the queries with ordinary selectivity, the other is a parallel algorithm based on MapReduce aiming for the large range queries.
Proceedings ArticleDOI
SEQ: Example-based Query for Spatial Objects
TL;DR: This paper proposes the Spatial Exemplar Query (SEQ), which allows the user to input a result example over an interface inside the map service, and proposes an effective similarity measure to evaluate the proximity between a candidate answer and the given example.
Journal ArticleDOI
Unique indexing model in Geospatial database Paradigm
TL;DR: This paper presents a framework for capturing location aware unconventional data and present co-relation of perspective, agile problem, spatial signature and data model in term of spatial search.
Journal ArticleDOI
cBiK: A Space-Efficient Data Structure for Spatial Keyword Queries
TL;DR: This work proposes the first spatio-textual index that uses compact data structures to reduce the size of the structure, hence facilitating its usage in main memory and shows that this approach needs half the space and is more than one order of magnitude faster than a disk resident state-of-the-art index.
Journal ArticleDOI
Secure Boolean Spatial Keyword Query With Lightweight Access Control in Cloud Environments
TL;DR: Wang et al. as discussed by the authors proposed and formalized the problem of secure boolean spatial keyword query under lightweight access control while guaranteeing the widely accepted adaptive indistinguishability against chosen keyword attack.
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.