{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:42:15Z","timestamp":1781106135505,"version":"3.54.1"},"reference-count":15,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4,1]]},"abstract":"<p>The pre-computation of data cubes is critical for improving the response time of OLAP (On-Line Analytical Processing) systems. To meet the need for improved performance created by growing data sizes, parallel solutions for data cube construction are becoming increasingly important. This paper presents a new parallel data cube construction scheme based on an extendible multidimensional array, which is dynamically extendible along any dimension without relocating any existing data. The authors have implemented and evaluated their parallel data cube construction methods on shared-memory multiprocessors. Given the performance limit, the methods achieve close to linear speedup with load balance. The authors\u2019 experiments also indicate that their parallel methods can be more scalable on higher dimensional data cube construction.<\/p>","DOI":"10.4018\/jghpc.2012040103","type":"journal-article","created":{"date-parts":[[2012,4,12]],"date-time":"2012-04-12T16:48:41Z","timestamp":1334249321000},"page":"32-45","source":"Crossref","is-referenced-by-count":0,"title":["A New Parallel Data Cube Construction Scheme"],"prefix":"10.4018","volume":"4","author":[{"given":"Dong","family":"Jin","sequence":"first","affiliation":[{"name":"Qingdao University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tatsuo","family":"Tsuji","sequence":"additional","affiliation":[{"name":"University of Fukui, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jghpc.2012040103-0","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAPD.0000018572.20283.e0"},{"issue":"2","key":"jghpc.2012040103-1","first-page":"181","article-title":"Parallelizing the data cube.","volume":"11","author":"F.Dehne","year":"2002","journal-title":"Distributed and Parallel Databases"},{"key":"jghpc.2012040103-2","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-006-6575-6"},{"key":"jghpc.2012040103-3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009777418785"},{"key":"jghpc.2012040103-4","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1691"},{"key":"jghpc.2012040103-5","doi-asserted-by":"crossref","unstructured":"Gray, J., Bosworth, A., Layman, A., & Pirahesh, H. (1996). Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In Proceedings of the International Conference on Data Engineering (pp. 152-159).","DOI":"10.1109\/ICDE.1996.492099"},{"key":"jghpc.2012040103-6","doi-asserted-by":"crossref","unstructured":"Harinarayan, V., Rajaraman, A., & Ullman, J. D. (1996). Implementing data cubes efficiently. In Proceedings of the ACM SIGMOD Conference on Management of Data (pp. 205-216).","DOI":"10.1145\/235968.233333"},{"key":"jghpc.2012040103-7","doi-asserted-by":"crossref","unstructured":"Hasan, K. M. A., Kuroda, M., Azuma, N., & Tsuji, T. (2005). An extendible array based implementation of relational tables for multidimensional databases. In A. M. Tjoa & J. Trujillo (Eds.), Proceedings of the 7th International Conference on Data Warehousing and Knowledge Discovery (LNCS 3589, pp. 233-242).","DOI":"10.1007\/11546849_23"},{"key":"jghpc.2012040103-8","doi-asserted-by":"crossref","unstructured":"Jin, D., Tsuji, T., Tsuchida, T., & Higuchi, K. (2008). An incremental maintenance scheme of data cubes. In Proceedings of the 13th International Conference on Database Systems for Advanced Applications (pp. 172-187).","DOI":"10.1007\/978-3-540-78568-2_15"},{"key":"jghpc.2012040103-9","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.144"},{"key":"jghpc.2012040103-10","unstructured":"Lu, H., Huang, X., & Li, Z. (1997). Computing data cubes using massively parallel processors. In Proceedings of the 7th Parallel Computing Workshop, Canberra, Australia."},{"key":"jghpc.2012040103-11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021567425133"},{"key":"jghpc.2012040103-12","doi-asserted-by":"crossref","unstructured":"Muto, S., & Kitsuregawa, M. (1999). A dynamic load balancing strategy for parallel datacube computation. In Proceedings of the ACM Second International Workshop on Data Warehousing and OLAP (pp. 67-72).","DOI":"10.1145\/319757.319793"},{"key":"jghpc.2012040103-13","doi-asserted-by":"crossref","unstructured":"Ng, R., Wagner, A., & Yin, Y. (2001). Iceberg-cube computation with pc clusters. In Proceedings of the ACM SIGMOD Conference on Management of Data (pp. 25-36).","DOI":"10.1145\/376284.375666"},{"key":"jghpc.2012040103-14","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(03)00035-9"}],"container-title":["International Journal of Grid and High Performance Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=66355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:00:24Z","timestamp":1654092024000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jghpc.2012040103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,4,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jghpc.2012040103","relation":{},"ISSN":["1938-0259","1938-0267"],"issn-type":[{"value":"1938-0259","type":"print"},{"value":"1938-0267","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,1]]}}}