File: A file structure for hierarchically clustered OLAP cubes

Karayannidis, N; Sellis, T; Kouvaras, Y

dc.contributor.author	Karayannidis, N	en
dc.contributor.author	Sellis, T	en
dc.contributor.author	Kouvaras, Y	en
dc.date.accessioned	2014-03-01T01:53:57Z
dc.date.available	2014-03-01T01:53:57Z
dc.date.issued	2004	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/27150
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	File: A file structure for hierarchically clustered OLAP cubes	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoe OLAP query evaluation. In this paper, we propose a novel multidimensional file structure for organizing the most detailed data of a cube, the CUBE File. The CUBE File achieves hierarchical clustering of the data, enabling fast access via hierarchical restrictions. Moreover, it imposes a low storage cost and adapts perfectly to the extensive sparseness of the data space achieving a high compression rate. Our results show that the CUBE File outperforms the most effective method proposed up to now for hierarchically clustering the cube, resulting in 7-9 times less I/Os on average for all workloads tested. Thus, it achieves a higher degree of hierarchical clustering. Moreover, the CUBE File imposes a 2-3 times lower storage cost.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	ADVANCES IN DATABASE TECHNOLOGY - EDBT 2004, PROCEEDINGS	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.isi	ISI:000189447000036	en
dc.identifier.volume	2992	en
dc.identifier.spage	621	en
dc.identifier.epage	638	en