OLAPスカイライン・キューブに対する範囲問合せ処理

カテゴリ: 論文誌(論文単位)

グループ名: 【C】電子・情報・システム部門

発行日: 2016/04/01

タイトル(英語): Range Query Processing in OLAP Skyline Cubes

著者名: 佐藤　秀樹（大同大学），宇佐美　孝侑（大同大学大学院／(株)ソフトバリー）

著者名(英語): Hideki Sato (Daido University), Takayuki Usami (Garduate School of Informatics, Daido University/System Development Department, Soft Valley Corporation)

キーワード: 集約関数，スカイライン演算，スカイライン・キューブ，範囲問合せ，R-木，GPGPU　　aggregate function，skyline operation，skyline cube，range query，R-tree，GPGPU

要約(英語): Skyline cube (SC) is an extension of data cube, where the skyline operation is used to aggregate each cell of tuples with the same values of dimension attributes. To make SC more effective decision making tool, range query regarding SC is potentially promising. This paper discusses the storage structure of SC and range query processing system. R-tree based storage structure is dedicated to multi-dimensional index which associates values of dimension attributes with the corresponding results of extended skyline operation. The sequential processing system and the parallel processing system are built upon R-tree based storage structure to answer range queries. Experimental results show that R-tree based storage structure is allowable, because its storage size is at most 3 times as that of materialized view. Also, both of the sequential processing system and the parallel processing system are superior to the materialized view system in processing range queries. Especially, the parallel processing system takes below 20% times as that of the materizalized view system, even in the case of range query including anti-correlation skyline attributes which entail heavy burdens.

本誌: 電気学会論文誌C（電子・情報・システム部門誌） Vol.136 No.4 （2016） 特集：最新の化合物半導体デバイスとその応用技術

本誌掲載ページ: 576-587 p

原稿種別: 論文／日本語

電子版へのリンク: https://www.jstage.jst.go.jp/article/ieejeiss/136/4/136_576/_article/-char/ja/