{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:34:41Z","timestamp":1778301281316,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540414568","type":"print"},{"value":"9783540445036","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44503-x_11","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:25:32Z","timestamp":1186878332000},"page":"159-173","source":"Crossref","is-referenced-by-count":19,"title":["Flexible Data Cubes for Online Aggregation"],"prefix":"10.1007","author":[{"given":"Mirek","family":"Riedewald","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divyakant","family":"Agrawal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amr","family":"El Abbadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"key":"11_CR1","unstructured":"E. Baralis, S. Paraboschi, and E. Teniente. Materialized view selection in a multidimensional database. In Proc. Int. Conf. on Very Large Databases (VLDB), pages 156\u2013165, 1997."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg CUBEs. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 359\u2013370, 1999.","DOI":"10.1145\/304182.304214"},{"key":"11_CR3","unstructured":"C.-Y. Chan and Y. E. Ioannidis. Hierarchical cubes for range-sum queries. In Proc. Int. Conf. on Very Large Databases (VLDB), pages 675\u2013686, 1999. Extended version published as Tech. Report, Univ. of Wisconsin, 1999."},{"key":"11_CR4","unstructured":"E. F. Codd. Providing OLAP (on-line analytical processing) to user-analysts: An IT mandate. Technical report, E. F. Codd and Associates, 1993."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"S. Geffner, D. Agrawal, and A. El Abbadi. The dynamic data cube. In Proc. Int. Conf. on Extending Database Technology (EDBT), pages 237\u2013253, 2000.","DOI":"10.1007\/3-540-46439-5_17"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"S. Geffner, D. Agrawal, A. El Abbadi, and T. Smith. Relative prefix sums: An efficient approach for querying dynamic OLAP data cubes. In Proc. Int. Conf. on Data Engineering (ICDE), pages 328\u2013335, 1999.","DOI":"10.1109\/ICDE.1999.754948"},{"key":"11_CR7","doi-asserted-by":"crossref","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. Data Mining and Knowledge Discovery, pages 29\u201353, 1997.","DOI":"10.1023\/A:1009726021843"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"H. Gupta. Selection of views to materialize in a data warehouse. In Proc. Int. Conf. on Database Theory (ICDT), pages 98\u2013112, 1997.","DOI":"10.1007\/3-540-62222-5_39"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"H. Gupta, V. Harinarayan, A. Rajaraman, and J. D. Ullman. Index selection for OLAP. In Proc. Int. Conf. on Data Engineering (ICDE), pages 208\u2013219, 1997.","DOI":"10.1109\/ICDE.1997.581755"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 205\u2013216, 1996.","DOI":"10.1145\/233269.233333"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"C. Ho, R. Agrawal, N. Megiddo, and R. Srikant. Range queries in OLAP data cubes. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 73\u201388, 1997.","DOI":"10.1145\/253260.253274"},{"issue":"1","key":"11_CR12","first-page":"27","volume":"20","author":"T. Johnson","year":"1997","unstructured":"T. Johnson and D. Shasha. Some approaches to index design for cube forests. IEEE Data Engineering Bulletin, 20(1):27\u201335, 1997.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Y. Kotidis and N. Roussopoulos. An alternative storage organization for ROLAP aggregate views based on cubetrees. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 249\u2013258, 1998.","DOI":"10.1145\/276304.276327"},{"key":"11_CR14","unstructured":"N. Pendse and R. Creeth. The OLAP report. http:\/\/www.olapreport.com\/Analyses.htm , 2000. Parts available online in the current edition."},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"M. Riedewald, D. Agrawal, and A. El Abbadi. Flexible data cubes for online aggregation. Technical report, UC Santa Barbara, 2000.","DOI":"10.1007\/3-540-44503-X_11"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"M. Riedewald, D. Agrawal, and A. El Abbadi. pCube: Update-efficient online aggregation with progressive feedback and error bounds. In Proc. Int. Conf. on Scientific and Statistical Database Management (SSDBM), pages 95\u2013108, 2000.","DOI":"10.1109\/SSDM.2000.869781"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"M. Riedewald, D. Agrawal, A. El Abbadi, and R. Pajarola. Space-efficient data cubes for dynamic environments. In Proc. Int. Conf. on Data Warehousing and Knowledge Discovery (DaWaK), pages 24\u201333, 2000.","DOI":"10.1007\/3-540-44466-1_3"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"J. R. Smith, V. Castelli, A. Jhingran, and C.-S. Li. Dynamic assembly of views in data cubes. In Proc. Symp. on Principles of Database Systems (PODS), pages 274\u2013283, 1998.","DOI":"10.1145\/275487.275518"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"J. S. Vitter and M. Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. In Proc. Int. Conf. on Management of Data (SIGMOD), pages 193\u2013204, 1999.","DOI":"10.1145\/304182.304199"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"J. S. Vitter, M. Wang, and B. Iyer. Data cube approximation and histograms via wavelets. In Proc. Intl. Conf. on Information and Knowledge Management (CIKM), pages 96\u2013104, 1998.","DOI":"10.1145\/288627.288645"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:39:46Z","timestamp":1556739586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44503-X_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540414568","9783540445036"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44503-x_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}