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
Posted Content
Efficient Authentication of Outsourced String Similarity Search
Boxiang Dong,Hui Wang +1 more
TL;DR: This paper designs AutoS3, an authentication mechanism of outsourced string similarity search that returns a verification object VO to prove the result correctness and designs two lightweight authentication methods named VS2 and EVS2 that can catch the service provider various cheating behaviors with cheap verification cost.
Book ChapterDOI
Hybrid-LSH for Spatio-Textual Similarity Queries
TL;DR: This paper presents hybrid-LSH, a new LSH method for indexing data objects according to both their spatial location and their keyword similarity, and presents an adaptive query-processing model to address the fixed range problem of traditional LSH and to handle queries with varying ranges effectively.
Book ChapterDOI
Reduce the Shopping Distance: Map Region Search Based on High Order Voronoi Diagram
TL;DR: A framework of map search service using Region-of-Interest (ROI) as the query result, which can greatly reduce users shopping distance among multiple stores is proposed and Experimental results show that the method is both efficient and effective.
Journal Article
Analysis and Detection of Path Nearby Clusters in Spatial Networks
Asra Tabassum,K. Deepika +1 more
TL;DR: A novel query known as the path neighborhood cluster (PNC) question that finds areas of capabilities interest with recognize to a user-particular journey route with primary advantages to customers in trendy purposes just like journey planning and subject suggestion is presented.
Journal ArticleDOI
Efficient Spatial Keyword Search Methods for Reflecting Multiple Keyword Domains.
TL;DR: These methods prune the nodes that cannot satisfy environmental conditions in the earlier stage of searching, they reduce the number of refining range queries for MKDR and MKDkNN.
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.