Skyline queries on keyword-matched data
- Authors
- Choi, Hyunsik; Jung, HaRim; Lee, Ki Yong; Chung, Yon Dohn
- Issue Date
- 20-5월-2013
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- Information technology and system; Database management; Query processing; Spatial database; Textual database
- Citation
- INFORMATION SCIENCES, v.232, pp.449 - 463
- Indexed
- SCIE
SCOPUS
- Journal Title
- INFORMATION SCIENCES
- Volume
- 232
- Start Page
- 449
- End Page
- 463
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/103214
- DOI
- 10.1016/j.ins.2012.01.045
- ISSN
- 0020-0255
- 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. (C) 2012 Elsevier Inc. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.