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
Improving local search ranking through external logs
TL;DR: This paper describes the relevant signal contained in a number of external data sources in detail and proposes novel backoff methods to alleviate the impact of skew, noise or incomplete data in these logs in a systematic manner.
Journal ArticleDOI
Location- and keyword-based querying of geo-textual data: a survey
TL;DR: A survey of both the research problems studied and the solutions proposed in these two settings is offered, which aims to offer the reader a first understanding of key concepts and techniques underlying proposed solutions to the querying of geo-textual data.
Proceedings ArticleDOI
Efficient Access to Temporally Overlaying Spatial and Textual Trajectories
Hamza Issa,Maria Luisa Damiani +1 more
TL;DR: In this paper, a novel index framework, called IRWI, is presented for the efficient processing of queries on aligned spatio-textual trajectories formulated as sequences of ordered spatio/textual range queries q = q1, .., qn (sequenced queries).
Journal ArticleDOI
Range Queries on Multi-Attribute Trajectories
TL;DR: This paper integrates standard trajectories and attributes into one unified framework and proposes an index structure as well as the query algorithm for answering range queries that return trajectories containing particular attribute values and passing a certain area during the query time.
Journal ArticleDOI
Hierarchical information quadtree: efficient spatial temporal image search for multimedia stream
TL;DR: In this paper, a novel index structure, namely Hierarchical Information Quadtree (HI-Quadtree), is proposed to efficiently insert/delete spatial temporal images with high arrive rates.
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.