NDLI: RASIM: a rank-aware separate index method for answering top-k spatial keyword queries

Please wait, while we are loading the content...

RASIM: a rank-aware separate index method for answering top-k spatial keyword queries

Content Provider	Springer Nature Link
Author	Kwon, Hyuk Yoon Whang, Kyu Young Song, Il Yeol Wang, Haixun
Copyright Year	2012
Abstract	A top-k spatial keyword query returns k objects having the highest (or lowest) scores with regard to spatial proximity as well as text relevancy. Approaches for answering top-k spatial keyword queries can be classified into two categories: the separate index approach and the hybrid index approach. The separate index approach maintains the spatial index and the text index independently and can accommodate new data types. However, it is difficult to support top-k pruning and merging efficiently at the same time since it requires two different orders for clustering the objects: the first based on scores for top-k pruning and the second based on object IDs for efficient merging. In this paper, we propose a new separate index method called Rank-Aware Separate Index Method (RASIM) for top-k spatial keyword queries. RASIM supports both top-k pruning and efficient merging at the same time by clustering each separate index in two different orders through the partitioning technique. Specifically, RASIM partitions the set of objects in each index into rank-aware (RA) groups that contain the objects with similar scores and applies the first order to these groups according to their scores and the second order to the objects within each group according to their object IDs. Based on the RA groups, we propose two query processing algorithms: (i) External Threshold Algorithm (External TA) that supports top-k pruning in the unit of RA groups and (ii) Generalized External TA that enhances the performance of External TA by exploiting special properties of the RA groups. RASIM is the first research work that supports top-k pruning based on the separate index approach. Naturally, it keeps the advantages of the separate index approach. In addition, in terms of storage and query processing time, RASIM is more efficient than the IR-tree method, which is the prevailing method to support top-k pruning to date and is based on the hybrid index approach. Experimental results show that, compared with the IR-tree method, the index size of RASIM is reduced by up to 1.85 times, and the query performance is improved by up to 3.22 times.
Starting Page	111
Ending Page	139
Page Count	29
File Format	PDF
ISSN	1386145X
Journal	World Wide Web
Volume Number	16
Issue Number	2
e-ISSN	15731413
Language	English
Publisher	Springer US
Publisher Date	2012-05-19
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	top-k spatial keyword query separate index top-k pruning Information Systems Applications (incl. Internet) Database Management Operating Systems
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

G-Index Model: A generic model of index schemes for top-k spatial-keyword queries

Scalable and efficient processing of top-k multiple-type integrated queries

Top-k answers for XML keyword queries

Evaluating continuous top-k queries over document streams

Efficient processing of top-k twig queries over probabilistic XML data

Top-k temporal keyword search over social media data

Efficient processing of top-k dominating queries in distributed environments

Efficient moving k nearest neighbor queries over line segment objects

Top- $symbol{k}$ query processing over uncertain data in distributed environments

RASIM: a rank-aware separate index method for answering top-k spatial keyword queries

Similar Documents

G-Index Model: A generic model of index schemes for top-k spatial-keyword queries

Scalable and efficient processing of top-k multiple-type integrated queries

Top-k answers for XML keyword queries

Evaluating continuous top-k queries over document streams

Efficient processing of top-k twig queries over probabilistic XML data

Top-k temporal keyword search over social media data

Efficient processing of top-k dominating queries in distributed environments

Efficient moving k nearest neighbor queries over line segment objects

Top- $symbol{k}$ query processing over uncertain data in distributed environments

RASIM: a rank-aware separate index method for answering top-k spatial keyword queries