Skyline queries on keyword-matched data
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Hyunsik | - |
dc.contributor.author | Jung, HaRim | - |
dc.contributor.author | Lee, Ki Yong | - |
dc.contributor.author | Chung, Yon Dohn | - |
dc.date.accessioned | 2021-09-06T01:28:55Z | - |
dc.date.available | 2021-09-06T01:28:55Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2013-05-20 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/103214 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.subject | COMPUTATION | - |
dc.title | Skyline queries on keyword-matched data | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Chung, Yon Dohn | - |
dc.identifier.doi | 10.1016/j.ins.2012.01.045 | - |
dc.identifier.scopusid | 2-s2.0-84875410009 | - |
dc.identifier.wosid | 000316774700029 | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.232, pp.449 - 463 | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 232 | - |
dc.citation.startPage | 449 | - |
dc.citation.endPage | 463 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | COMPUTATION | - |
dc.subject.keywordAuthor | Information technology and system | - |
dc.subject.keywordAuthor | Database management | - |
dc.subject.keywordAuthor | Query processing | - |
dc.subject.keywordAuthor | Spatial database | - |
dc.subject.keywordAuthor | Textual database | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.