{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T11:54:26Z","timestamp":1776426866062,"version":"3.51.2"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T00:00:00Z","timestamp":1193961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2007,11,2]]},"abstract":"<jats:p>Implementation of the data cube is an important and scientifically interesting issue in On-Line Analytical Processing (OLAP) and has been the subject of a plethora of related publications. Naive implementation methods that compute each node separately and store the result are impractical, since they have exponential time and space complexity with respect to the cube dimensionality. To overcome this drawback, a wide range of methods that provide efficient cube implementation (with respect to both computation and storage) have been proposed, which make use of relational, multidimensional, or graph-based data structures. Furthermore, there are several other methods that compute and store approximate descriptions of data cubes, sacrificing accuracy for condensation. In this article, we focus on Relational-OLAP (ROLAP), following the majority of the efforts so far. We review existing ROLAP methods that implement the data cube and identify six orthogonal parameters\/dimensions that characterize them. We place the existing techniques at the appropriate points within the problem space defined by these parameters and identify several clusters that the techniques form with various interesting properties. A careful study of these properties leads to the identification of particularly effective values for the space parameters and indicates the potential for devising new algorithms with better overall performance.<\/jats:p>","DOI":"10.1145\/1287620.1287623","type":"journal-article","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T14:26:02Z","timestamp":1195136762000},"page":"12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["ROLAP implementations of the data cube"],"prefix":"10.1145","volume":"39","author":[{"given":"Konstantinos","family":"Morfonios","sequence":"first","affiliation":[{"name":"University of Athens"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stratis","family":"Konakas","sequence":"additional","affiliation":[{"name":"University of Athens"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Ioannidis","sequence":"additional","affiliation":[{"name":"University of Athens"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Kotsis","sequence":"additional","affiliation":[{"name":"Capgemini UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,11,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335450"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 506--521","author":"Agarwal S."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of International Conference on Knowledge Discovery and Data Mining (KDD). 244--249","author":"Agrawal R."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 156--165","author":"Baralis E."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/262762.262764"},{"key":"e_1_2_1_6_1","unstructured":"Barbar\u00e1 D. and Sullivan M. 1998. A space-efficient way to support approximate multidimensional databases. In Tech. Rep. ISSE-TR-98-03 George Mason University.  Barbar\u00e1 D. and Sullivan M. 1998. A space-efficient way to support approximate multidimensional databases. In Tech. Rep. ISSE-TR-98-03 George Mason University."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304214"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/248603.248616"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 658--670","author":"Feng Y."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/355068.355318"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276334"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 152--159","author":"Gray J."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335448"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/645502.656089"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 208--219","author":"Gupta H."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of International Conference on Database Theory (ICDT). 453--470","author":"Gupta H."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 311--322","author":"Haas P. J."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375664"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233333"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98740"},{"key":"e_1_2_1_22_1","first-page":"27","article-title":"Some approaches to index design for cube forest","volume":"20","author":"Johnson T.","year":"1997","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-023X(02)00045-9"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of International Conference on Extending Database Technology (EDBT). 621--638","author":"Karayannidis N."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276327"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304215"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/646109.679283"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 778--789","author":"Lakshmanan L. V. S."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872768"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144120"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of Design and Management of Data Warehouses (DMDW). 3.","author":"Lee M."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-023X(01)00007-6"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 379--390","author":"Morfonios K."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0036-8"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/583890.583895"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.1999.787618"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 116--125","author":"Ross K. A."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253276"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312231"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSDBM.2004.53"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 488--499","author":"Shukla A."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 522--531","author":"Shukla A."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564745"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 540--551","author":"Sismanis Y."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 20th International Conference on Conceptual Modeling (ER'01)","author":"Theodoratos D."},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 126--135","author":"Theodoratos D."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/319757.319786"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304199"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/288627.288645"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of International Conference on Data Engineering (ICDE). 155--165","author":"Wang W."},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of Very Large Data Bases (VLDB). 476--487","author":"Xin D."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2003.818494"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253288"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1287620.1287623","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1287620.1287623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:50Z","timestamp":1750258670000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1287620.1287623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,2]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,2]]}},"alternative-id":["10.1145\/1287620.1287623"],"URL":"https:\/\/doi.org\/10.1145\/1287620.1287623","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,2]]},"assertion":[{"value":"2007-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}