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
Book ChapterDOI
Location-based instant search
Shengyue Ji,Chen Li +1 more
TL;DR: This paper develops a new indexing technique, called filtering-effective hybrid index (FEH), that judiciously uses two types of keyword filters based on their selectiveness to do powerful pruning and develops indexing and search techniques that store prefix information on the FEH index and efficiently answer partial queries.
Book ChapterDOI
Slicing the Dimensionality: Top-k Query Processing for High-Dimensional Spaces
TL;DR: The experimental evaluation shows that the use of BSI for top-k query processing is more efficient than Sequential Scan for high-dimensional data and when compared to Sequential Top-k Algorithm (STA), BSI is one order of magnitude faster.
Proceedings ArticleDOI
Reverse Keyword-Based Location Search
TL;DR: This work defines, study, and provides means of computing the reverse top-k keyword-based location query, and develops novel pruning techniques on top of an index, and offers a series of optimization techniques that aim to further accelerate query processing.
Book ChapterDOI
Efficient Top-k Subscription Matching for Location-Aware Publish/Subscribe
TL;DR: The main idea is to develop a location-aware version of the Pub/Sub model, which was designed for message dissemination, that can effectively and efficiently return the top-k subscriptions with respect to an event.
Proceedings ArticleDOI
Indexing Geolocated Time Series Data
Georgios Chatzigeorgakidis,Dimitrios Skoutas,Kostas Patroumpas,Spiros Athanasiou,Spiros Skiadopoulos +4 more
TL;DR: This work proposes a hybrid index, called TSR-tree, which extends the R-tree by introducing appropriate bounds for the time series indexed at each node, and describes how these indices can be used to efficiently evaluate different variants of hybrid queries combining spatial and time series filtering or ranking.
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.