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
Efficient Reverse Top- k Boolean Spatial Keyword Queries on Road Networks
TL;DR: A new type of queries, namely, reverse top-k Boolean spatial keyword (RkBSK) retrieval, which assumes objects are on the road network and considers both spatial and textual information and a new data structure called count tree has been developed to further improve query performance.
Proceedings ArticleDOI
Frankenplace: Interactive Thematic Mapping for Ad Hoc Exploratory Search
TL;DR: The architecture of an interactive thematic map search engine, Frankenplace, designed to facilitate document exploration at the intersection of theme and place is described and it is demonstrated that Frankenplace can support four distinct types of exploratory search tasks while being adaptive to scale and location of interest.
Journal ArticleDOI
Geo-Social Influence Spanning Maximization
TL;DR: This paper proposes and investigates the problem of influence maximization in location-aware social networks, and proposes the OIR*-Tree index, which is a hybrid index combining ordered influential node lists with an R*-tree.
Book
Spatial Data Management
TL;DR: This book presents indexing approaches for spatial data, with a focus on the R-tree, and introduces spatial data models and queries and discusses the main issues of extending a database system to support spatial data.
Journal ArticleDOI
Group-Wise Itinerary Planning in Temporary Mobile Social Network
TL;DR: This paper proposes a group-wise itinerary planning framework to improve the mobile users’ experiences and shows the effectiveness of the proposed framework over real data sets.
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.