{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:25:17Z","timestamp":1759134317454},"reference-count":21,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780120884698"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1016\/b978-012088469-8.50049-8","type":"book-chapter","created":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T04:12:29Z","timestamp":1257480749000},"page":"540-551","source":"Crossref","is-referenced-by-count":23,"title":["The Polynomial Complexity of Fully Materialized Coalesced Cubes"],"prefix":"10.1016","author":[{"given":"Yannis","family":"Sismanis","sequence":"first","affiliation":[]},{"given":"Nick","family":"Roussopoulos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-012088469-8.50049-8_bib1","series-title":"SIGMOD","first-page":"487","article-title":"Congressional Samples for Approximate Answering of Group-By Queries","author":"Acharya","year":"2000"},{"key":"10.1016\/B978-012088469-8.50049-8_bib2","unstructured":"S. Agarwal, R. Agrawal, P. M. Deshpande, A. Gupta, J. F. Naughton, R. Ramakrishnan, and S. Sarawagi. On the computation of multidimensional aggregates. In VLDB, pages 506\u2013521, 1996."},{"key":"10.1016\/B978-012088469-8.50049-8_bib3","series-title":"SIGMOD","first-page":"359","article-title":"Bottom-Up Computation of Sparse and Iceberg CUBEs","author":"Beyer","year":"1999"},{"article-title":"Computation of multidimensional aggregates","year":"1996","author":"Deshpande","key":"10.1016\/B978-012088469-8.50049-8_bib4"},{"key":"10.1016\/B978-012088469-8.50049-8_bib5","unstructured":"Lixin Fu and Joachim Hammer. CUBIST: A New Algorithm for Improving the Performance of Ad-hoc OLAP Queries. In DOLAP, 2000."},{"key":"10.1016\/B978-012088469-8.50049-8_bib6","series-title":"ICDE","first-page":"152","article-title":"Data Cube: A Relational Aggregation Operator Generalizing Gro up-By, Cross-Tab, and Sub-Totals","author":"Gray","year":"1996"},{"key":"10.1016\/B978-012088469-8.50049-8_bib7","series-title":"ICDE","first-page":"208","article-title":"Index Selection for OLAP","author":"Gupta","year":"1997"},{"key":"10.1016\/B978-012088469-8.50049-8_bib8","series-title":"SIGMOD","first-page":"205","article-title":"Implementing Data Cubes Efficiently","author":"Harinarayan","year":"1996"},{"issue":"1","key":"10.1016\/B978-012088469-8.50049-8_bib9","first-page":"27","article-title":"Some Approaches to Index Design for Cube Forests","volume":"20","author":"Johnson","year":"1997","journal-title":"Data Engineering Bulletin"},{"key":"10.1016\/B978-012088469-8.50049-8_bib10","series-title":"PODS","first-page":"167","article-title":"On the Complexity of the View-Selection Problem","author":"Karloff","year":"1999"},{"key":"10.1016\/B978-012088469-8.50049-8_bib11","series-title":"SIGMOD","first-page":"64","article-title":"QC-Trees: An Efficient Summary Structure for Semantic OLAP","author":"Lakshmanan","year":"2003"},{"key":"10.1016\/B978-012088469-8.50049-8_bib12","unstructured":"K. A. Ross and D. Srivastana. Fast Computation of Sparse Datacubes. In VLDB, pages 116\u2013125, Athens, Greece, 1997."},{"key":"10.1016\/B978-012088469-8.50049-8_bib13","series-title":"SIGMOD","first-page":"89","article-title":"Cubetree: Organization of and Bulk Incremental Updates on the Data Cube","author":"Roussopoulos","year":"1997"},{"article-title":"On computing the data cube","year":"1996","author":"Sarawagi","key":"10.1016\/B978-012088469-8.50049-8_bib14"},{"key":"10.1016\/B978-012088469-8.50049-8_bib15","unstructured":"A. Shukla, P. Deshpande, J. Naughton, and K. Ramasamy. Storage estimation for multidimensional aggregates in the presense of hierarchies. In VLDB, pages 522\u2013531, Bombay, India, August 1996."},{"key":"10.1016\/B978-012088469-8.50049-8_bib16","doi-asserted-by":"crossref","unstructured":"Y. Sismanis, A. Deligiannakis, Y. Kotidis, and N. Roussopoulos. Hierarchical dwarfs for the rollup cube. In DOLAP, 2003.","DOI":"10.1145\/956060.956064"},{"key":"10.1016\/B978-012088469-8.50049-8_bib17","series-title":"SIGMOD","first-page":"464","article-title":"Dwarf: Shrinking the PetaCube","author":"Sismanis","year":"2002"},{"key":"10.1016\/B978-012088469-8.50049-8_bib18","unstructured":"D. Theodoratos and T. Sellis. Data Warehouse Configuration. In VLDB, pages 126\u2013135, Athens, Greece, August 1997."},{"key":"10.1016\/B978-012088469-8.50049-8_bib19","doi-asserted-by":"crossref","unstructured":"J.S. Vitter, M. Wang, and B. Iyer. Data Cube Approximation and Histograms via Wavelets. In CIKM, 1998.","DOI":"10.1145\/288627.288645"},{"key":"10.1016\/B978-012088469-8.50049-8_bib20","series-title":"ICDE","article-title":"Condensed Cube: An Effective Approach to Reducing Data Cube Size","author":"Wang","year":"2002"},{"key":"10.1016\/B978-012088469-8.50049-8_bib21","series-title":"SIGMOD","first-page":"159","article-title":"An array-based algorithm for simultaneous multidimensional aggregates","author":"Zhao","year":"1997"}],"container-title":["Proceedings 2004 VLDB Conference"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T13:42:50Z","timestamp":1558618970000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780120884698500498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9780120884698"],"references-count":21,"URL":"https:\/\/doi.org\/10.1016\/b978-012088469-8.50049-8","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}