Skyline queries on keyword-matched data

Hyunsik Choi, Harim Jung, Ki Yong Lee, Yon Dohn Chung

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 IR2-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 IR2-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.

Original languageEnglish
Pages (from-to)449-463
Number of pages15
JournalInformation Sciences
Volume232
DOIs
Publication statusPublished - 2013 Jan 1

Fingerprint

Skyline
Railroad cars
Query
Costs
Experiments
Key words
Nearest Neighbor Search
Branch-and-bound
Vertex of a graph
Computational Cost
Nearest neighbor search
Customers

Keywords

  • Database management
  • Information technology and system
  • Query processing
  • Spatial database
  • Textual database

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management

Cite this

Skyline queries on keyword-matched data. / Choi, Hyunsik; Jung, Harim; Lee, Ki Yong; Chung, Yon Dohn.

In: Information Sciences, Vol. 232, 01.01.2013, p. 449-463.

Research output: Contribution to journalArticle

Choi, Hyunsik ; Jung, Harim ; Lee, Ki Yong ; Chung, Yon Dohn. / Skyline queries on keyword-matched data. In: Information Sciences. 2013 ; Vol. 232. pp. 449-463.
@article{66f82086ac524020b80a99e5bfd6f6b8,
title = "Skyline queries on keyword-matched data",
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 IR2-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 IR2-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.",
keywords = "Database management, Information technology and system, Query processing, Spatial database, Textual database",
author = "Hyunsik Choi and Harim Jung and Lee, {Ki Yong} and Chung, {Yon Dohn}",
year = "2013",
month = "1",
day = "1",
doi = "10.1016/j.ins.2012.01.045",
language = "English",
volume = "232",
pages = "449--463",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Skyline queries on keyword-matched data

AU - Choi, Hyunsik

AU - Jung, Harim

AU - Lee, Ki Yong

AU - Chung, Yon Dohn

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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 IR2-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 IR2-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.

AB - 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 IR2-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 IR2-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.

KW - Database management

KW - Information technology and system

KW - Query processing

KW - Spatial database

KW - Textual database

UR - http://www.scopus.com/inward/record.url?scp=84875410009&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875410009&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2012.01.045

DO - 10.1016/j.ins.2012.01.045

M3 - Article

AN - SCOPUS:84875410009

VL - 232

SP - 449

EP - 463

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -