Skyline queries on keyword-matched data

  • Authors:

  • Hyunsik Choi;Harim Jung;Ki Yong Lee;Yon Dohn Chung

  • Affiliations:

  • Department of Computer Science and Engineering, College of Information and Communication, Korea University, Seoul 136-713, Republic of Korea;Department of Computer Science and Engineering, College of Information and Communication, Korea University, Seoul 136-713, Republic of Korea;Department of Computer Science, Sookmyung Women's University, Seoul, Republic of Korea;Department of Computer Science and Engineering, College of Information and Communication, Korea University, Seoul 136-713, Republic of Korea

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.07

Visualization

Abstract

Given a set of d-dimensional tuples with textual descriptions, a keyword-matched skyline query retrieves a skyline computed from tuples whose textual descriptions contain all query words. For example, suppose a customer prefers cars with low mileage and low price, and finds a car equipped with 'air bag' and 'sunroof' in an online shop. In such a case, a keyword-matched skyline query is highly recommended. Although there are many applications for this type of query, to date there have not been any studies on the keyword-matched skyline queries. In this paper, we define a keyword-matched skyline query and propose an efficient and progressive algorithm, named Keyword-Matched Skyline search (KMS). KMS utilizes the IR^2-tree as an index structure. To retrieve a keyword-matched skyline, it performs nearest neighbor search in a branch and bound manner. While traversing the IR^2-tree, KMS effectively prunes unqualified nodes by means of both spatial and textual information of nodes. To demonstrate the efficiency of KMS, we conducted extensive experiments in various settings. The experimental results show that KMS is very efficient in terms of computational cost and I/O cost.