著者・編者Siddique, Md. Anisuzzaman
Morimoto, Yasuhiko
タイトル（掲載誌）Advances in Knoeledge Didcovery and Data Mining, Proceedings
一般注記type:text
Skyline queries are useful in many applications such as multi-criteria decision making, data mining, and user preference queries. A skyline query returns a set of interesting data objects that are not dominated in all dimensions by any other objects. For a high-dimensional database, sometimes it returns too many data objects to analyze intensively. To reduce the number of returned objects and to find more important and meaningful objects, we consider a problem of k-dominant skyline queries. Given an n-dimensional database, an object p is said to k-dominates another object q if there are (k <= n) dimensions in which p is better than or equal to q. A k-dominant, skyline object is an object that is not k-dominated by any other objects. In contrast, conventional skyline objects are n-dominant objects. We propose an efficient method for computing k-dominant skyline queries. Intensive performance study using real and synthetic datasets demonstrated that our method is efficient and scalable.
一次資料へのリンクURLhttp://ir.lib.hiroshima-u.ac.jp/files/public/2/28867/20141016165538821247/PAKDD_2009_839.pdf
著作権情報Copyright (c) 2009 Springer
関連情報The original publication is available at www.springerlink.com
http://dx.doi.org/10.1007/978-3-642-01307-2_87
関連情報（DOI）10.1007/978-3-642-01307-2_87
連携機関・データベース国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）