{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:43:36Z","timestamp":1742395416619,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414568"},{"type":"electronic","value":"9783540445036"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44503-x_9","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:25:32Z","timestamp":1186892732000},"page":"129-143","source":"Crossref","is-referenced-by-count":10,"title":["Parallelizing the Data Cube"],"prefix":"10.1007","author":[{"given":"Frank","family":"Dehne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd","family":"Eavis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanne","family":"Hambrusch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Rau-Chaplin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"key":"9_CR1","unstructured":"S. Agarwal, R. Agarwal, P.M. Deshpande, A. Gupta, J.F. Naughton, R. Ramakrishnan, and S. Srawagi. On the computation of multi-dimensional aggregates. In Proc. 22nd VLDB Conf., pages 506\u2013521, 1996."},{"key":"9_CR2","unstructured":"Argonne National Laboratory, http:\/\/www-unix.mcs.anl.gov\/mpi\/index.html .The Message Passing Interface (MPI) standard."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"R.I. Becker, Y. Perl, and S.R. Schach. A shifting algorithm for min-max tree partitioning. J. ACM, (29):58\u201367, 1982.","DOI":"10.1145\/322290.322294"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. In Proc. of 1999 ACM SIGMOD Conference on Management of data, pages 359\u2013370, 1999.","DOI":"10.1145\/304182.304214"},{"key":"9_CR5","first-page":"268","volume":"2","author":"T. Cheatham","year":"1995","unstructured":"T. Cheatham, A. Fahmy, D. C. Stefanescu, and L. G. Valiant. Bulk synchronous parallel computing-A paradigm for transportable software. In Proc. of the 28th Hawaii International Conference on System Sciences. Vol. 2: Software Technology, pages 268\u2013275, 1995.","journal-title":"Bulk synchronous parallel computing-A paradigm for transportable software"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"F. Dehne, W. Dittrich, and D. Hutchinson. Efficient external memory algorithms by simulating coarse-grained parallel algorithms. In Proc. 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA\u201997), pages 106\u2013115, 1997.","DOI":"10.1145\/258492.258503"},{"key":"9_CR7","unstructured":"F. Dehne, W. Dittrich, D. Hutchinson, and A. Maheshwari. Parallel virtual memory. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 889\u2013890, 1999."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. In ACM Symp. Computational Geometry, pages 298\u2013307, 1993.","DOI":"10.1145\/160985.161154"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"F. Dehne, D. Hutchinson, and A. Maheshwari. Reducing i\/o complexity by simulating coarse grained parallel algorithms. In Proc. 13th International Parallel Processing Symposium (IPPS\u201999), pages 14\u201320, 1999.","DOI":"10.1109\/IPPS.1999.760428"},{"key":"9_CR10","unstructured":"P.M. Deshpande, S. Agarwal, J.F. Naughton, and R Ramakrishnan. Computation of multidimensional aggregates. Technical Report1314, University of Wisconsin, Madison, 1996."},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"P. Flajolet and G.N. Martin. Probablistic counting algorithms for database applications. Journal of Computer and System Sciences, 31(2):182\u2013209, 1985.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR12","unstructured":"G.N. Frederickson. Optimal algorithms for tree partitioning. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 168\u2013177, 1991."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"S. Goil and A. Choudhary. High performance OLAP and data mining on parallel computers. Journal of Data Mining and Knowledge Discovery, 1(4), 1997.","DOI":"10.1023\/A:1009777418785"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"S. Goil and A. Choudhary. A parallel scalable infrastructure for OLAP and data mining. In Proc. International Data Engineering and Applications Symposium (IDEAS\u201999), Montreal, August 1999.","DOI":"10.1109\/IDEAS.1999.787266"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"M. Goudreau, K. Lang, S. Rao, T. Suel, and T. Tsantilas. Towards efficiency and portability: Programming with the BSP model. In Proc. 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA\u2019 96), pages 1\u201312, 1996.","DOI":"10.1145\/237502.237503"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009726021843","volume":"1","author":"J. Gray","year":"1997","unstructured":"J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. J. Data Mining and Knowledge Discovery,1(1):29\u201353, April 1997.","journal-title":"J. Data Mining and Knowledge Discovery"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"V. Harinarayan, A. Rajaraman, and J.D. Ullman. Implementing data cubes efficiently. SIGMOD Record (ACM Special Interest Group on Management of Data), 25(2):205\u2013216, 1996.","DOI":"10.1145\/235968.233333"},{"issue":"14","key":"9_CR18","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0167-8191(98)00093-3","volume":"24","author":"J. Hill","year":"1998","unstructured":"J. Hill, B. McColl, D. Stefanescu, M. Goudreau, K. Lang, S. Rao, T. Suel, T. Tsantilas, and R. Bisseling. BSPlib: The BSP programming library. Parallel Computing, 24(14):1947\u20131980, December 1998.","journal-title":"Parallel Computing"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Y. Perl and U. Vishkin. Efficient implementation of a shifting algorithm. Disc. Appl. Math., (12):71\u201380, 1985.","DOI":"10.1016\/0166-218X(85)90041-1"},{"key":"9_CR20","unstructured":"K.A. Ross and D. Srivastava. Fast computation of sparse datacubes. In Proc. 23rd VLDB Conference, pages 116\u2013125, 1997."},{"key":"9_CR21","series-title":"Technical Report","volume-title":"On computing the data cube","author":"S. Sarawagi","year":"1996","unstructured":"S. Sarawagi, R. Agrawal, and A. Gupta. On computing the data cube. Technical Report RJ10026, IBM Almaden Research Center, San Jose, CA, 1996."},{"key":"9_CR22","unstructured":"A. Shukla, P. Deshpende, J.F. Naughton, and K. Ramasamy. Storage estimation for mutlidimensional aggregates in the presence of hierarchies. In Proc. 22nd VLDB Conference, pages 522\u2013531, 1996."},{"key":"9_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-62592-5_75","volume-title":"BSP-like external-memory computation","author":"J.F. Sibeyn","year":"1997","unstructured":"J.F. Sibeyn and M. Kaufmann. BSP-like external-memory computation. In Proc. of 3rd Italian Conf. on Algorithms and Complexity (CIAC-97), volume LNCS1203,pages 229\u2013240. Springer, 1997."},{"key":"9_CR24","unstructured":"D.E. Vengroff and J.S. Vitter. I\/o-efficient scientific computation using tpie. In Proc. Goddard Conference on Mass Storage Systems and Technologies, pages 553\u2013570, 1996."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"J.S. Vitter. External memory algorithms. In Proc. 17th ACM Symp. on Principles of Database Systems (PODS\u2019 98), pages 119\u2013128, 1998.","DOI":"10.1145\/275487.275501"},{"issue":"2\u20133","key":"9_CR26","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01185207","volume":"12","author":"J.S. Vitter","year":"1994","unstructured":"J.S. Vitter and E.A.M. Shriver. Algorithms for parallel memory. i: Two-level memories. Algorithmica, 12(2\u20133):110\u2013147, 1994.","journal-title":"Algorithmica"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Y. Zhao, P.M. Deshpande, and J.F. Naughton. An array-based algorithm for simultaneous multidimensional aggregates. In Proc. ACM SIGMOD Conf., pages 159\u2013170, 1997.","DOI":"10.1145\/253260.253288"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44503-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:37:33Z","timestamp":1737362253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44503-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540414568","9783540445036"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-44503-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}