4 Hits in 6.2 sec

SISYPHUS: The implementation of a chunk-based storage manager for OLAP data cubes

Nikos Karayannidis, Timos Sellis
2003 Data & Knowledge Engineering  
In this article, we present the design and implementation of SISYPHUS, a storage manager for data cubes that provides an efficient physical base for performing OLAP operations.  ...  The SISYPHUS storage manager is based on a chunk-based data model that enables the hierarchical clustering of data with a very low storage cost.  ...  Acknowledgements This work has been partially funded by the European Union's Information Society Technologies Programme (IST) under project EDITH (IST-1999-20722). References  ... 
doi:10.1016/s0169-023x(02)00178-7 fatcat:ap4s3dwuprgedc5ph4nzgqvlvu

CUBE File: A File Structure for Hierarchically Clustered OLAP Cubes [chapter]

Nikos Karayannidis, Timos Sellis, Yannis Kouvaras
2004 Lecture Notes in Computer Science  
In this paper, we propose a novel multidimensional file structure for organizing the most detailed data of a cube, the CUBE File.  ...  Moreover, it imposes a low storage cost and adapts perfectly to the extensive sparseness of the data space achieving a high compression rate.  ...  Acknowledgements We wish to thank Transaction Software GmbH for providing us Transbase Hypercube to run the UB-tree/MHC experiments.  ... 
doi:10.1007/978-3-540-24741-8_36 fatcat:ujpbpl5vorfajfp3ei757nujci

Optimal chunking of large multidimensional arrays for data warehousing

E. J. Otoo, Doron Rotem, Sridhar Seshadri
2007 Proceedings of the ACM tenth international workshop on Data warehousing and OLAP - DOLAP '07  
The storage organization of such arrays on disks is done by partitioning the large global array into fixed size sub-arrays called chunks or tiles that form the units of data transfer between disk and memory  ...  The question that immediately arises is "what shapes of array chunks give the minimum expected number of chunks over a query workload?"  ...  in the SISYPHUS storage manager [9] .  ... 
doi:10.1145/1317331.1317337 dblp:conf/dolap/OtooRS07 fatcat:hhkf36zi75gizifmdgnspryaa4

On propositionalization for knowledge discovery in relational databases [article]

Mark-André Krogel, Universitäts- Und Landesbibliothek Sachsen-Anhalt, Martin-Luther Universität
Systems for propositionalization thus support the analyst during the usually costly phase of data preparation for data mining.  ...  Some of the learning problems are benchmarks from machine learning that have been in use for more than 20 years, others are based on more recent real-life data, which were made available for competitions  ...  That program in turn was based on other work by our students, which was the first implementation using Java for the application program and MySQL for the management of the databases [112, 113] .  ... 
doi:10.25673/4624 fatcat:hht32ech7vgbbb7asist4meuty