Range Query Processing in OLAP Skyline Cubes

DOI Web Site Web Site 13 References
  • Sato Hideki
    Daido University
  • Usami Takayuki
    Garduate School of Informatics, Daido University System Development Department, Soft Valley Corporation

Bibliographic Information

Other Title
  • OLAPスカイライン・キューブに対する範囲問合せ処理
  • OLAP スカイライン ・ キューブ ニ タイスル ハンイ トイアワセ ショリ

Search this article

Abstract

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.

Journal

References(13)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top