{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:13:57Z","timestamp":1765545237152,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2002,6,3]],"date-time":"2002-06-03T00:00:00Z","timestamp":1023062400000},"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":[],"published-print":{"date-parts":[[2002,6,3]]},"DOI":"10.1145\/564691.564745","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"page":"464-475","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":126,"title":["Dwarf"],"prefix":"10.1145","author":[{"given":"Yannis","family":"Sismanis","sequence":"first","affiliation":[{"name":"University of Maryland, College Park"}]},{"given":"Antonios","family":"Deligiannakis","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park"}]},{"given":"Nick","family":"Roussopoulos","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park"}]},{"given":"Yannis","family":"Kotidis","sequence":"additional","affiliation":[{"name":"AT&T Labs-Research"}]}],"member":"320","published-online":{"date-parts":[[2002,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"VLDB","author":"Agarwal S.","year":"1996","unstructured":"{AAD+} 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 1996 . {AAD+} 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 1996."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335450"},{"key":"e_1_3_2_1_3_1","unstructured":"{Bla} Jock A. Blackard. The Forest CoverType Dataset. ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases\/covtype.  {Bla} Jock A. Blackard. The Forest CoverType Dataset. ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases\/covtype."},{"key":"e_1_3_2_1_4_1","volume-title":"VLDB","author":"Baralis E.","year":"1997","unstructured":"{BPT} E. Baralis , S. Paraboschi , and E. Teniente . Materialized View Selection in a Multidimensional Database . In VLDB 1997 , Athens. {BPT} E. Baralis, S. Paraboschi, and E. Teniente. Materialized View Selection in a Multidimensional Database. In VLDB 1997, Athens."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304214"},{"key":"e_1_3_2_1_6_1","volume-title":"ISSE-TR-98-03","author":"Barbara D.","year":"1998","unstructured":"{BS98} D. Barbara and M. Sullivan . A Space-Efficient way to support Approximate Multidimensional Databases. Technical report , ISSE-TR-98-03 , George Mason University , 1998 . {BS98} D. Barbara and M. Sullivan. A Space-Efficient way to support Approximate Multidimensional Databases. Technical report, ISSE-TR-98-03, George Mason University, 1998."},{"key":"e_1_3_2_1_7_1","volume-title":"http:\/\/www.olapcouncil.org\/research\/bmarkco.htm","author":"{Cou98} Olap Council","year":"1998","unstructured":"{Cou98} Olap Council . APB-1 Benchmark. http:\/\/www.olapcouncil.org\/research\/bmarkco.htm , 1998 . {Cou98} Olap Council. APB-1 Benchmark. http:\/\/www.olapcouncil.org\/research\/bmarkco.htm, 1998."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/355068.355318"},{"key":"e_1_3_2_1_10_1","volume-title":"Computing Iceberg Queries Efficiently. In VLDB","author":"Fang M.","year":"1998","unstructured":"{FSGM+} M. Fang , N. Shivakumar , H. Garcia-Molina , R. Motwani , and J. D. Ullman . Computing Iceberg Queries Efficiently. In VLDB 1998 . {FSGM+} M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing Iceberg Queries Efficiently. In VLDB 1998."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645481.655593"},{"key":"e_1_3_2_1_12_1","volume-title":"Index Selection for OLAP. In ICDE","author":"Gupta H.","year":"1997","unstructured":"{GHRU} H. Gupta , V. Harinarayan , A. Rajaraman , and J. Ullman . Index Selection for OLAP. In ICDE 1997 , Burmingham. {GHRU} H. Gupta, V. Harinarayan, A. Rajaraman, and J. Ullman. Index Selection for OLAP. In ICDE 1997, Burmingham."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276334"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645502.656089"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233333"},{"key":"e_1_3_2_1_17_1","unstructured":"{HWL} C. Hahn S. Warren and J. London. Edited synoptic cloud reports from ships and land stations over the globe. http:\/\/cdiac.esd.ornl.gov\/cdiac\/ndps\/ndp026b.html.  {HWL} C. Hahn S. Warren and J. London. Edited synoptic cloud reports from ships and land stations over the globe. http:\/\/cdiac.esd.ornl.gov\/cdiac\/ndps\/ndp026b.html."},{"key":"e_1_3_2_1_18_1","volume-title":"March","author":"Johnson T.","year":"1997","unstructured":"{JS97} T. Johnson and D. Shasha . Some Approaches to Index Design for Cube Forests. Data Engineering Bulletin, 20(1) , March 1997 . {JS97} T. Johnson and D. Shasha. Some Approaches to Index Design for Cube Forests. Data Engineering Bulletin, 20(1), March 1997."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276327"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253276"},{"key":"e_1_3_2_1_21_1","first-page":"116","volume-title":"Fast Computation of Sparse Datacubes. In VLDB","author":"Ross K. A.","year":"1997","unstructured":"{RS} K. A. Ross and D. Srivastana . Fast Computation of Sparse Datacubes. In VLDB 1997 , pages 116 - 125 , Athens, Greece. {RS} K. A. Ross and D. Srivastana. Fast Computation of Sparse Datacubes. In VLDB 1997, pages 116-125, Athens, Greece."},{"key":"e_1_3_2_1_22_1","volume-title":"June","author":"Roussopoulos N.","year":"2001","unstructured":"{RSDK01} N. Roussopoulos , J. Sismanis , A. Deligiannakis , and Y. Kotidis . The Dwarf Structure for Creating, Storing, and Querying Highly Compressed Data Cubes. Application to U.S. patent office submitted , June 2001 . {RSDK01} N. Roussopoulos, J. Sismanis, A. Deligiannakis, and Y. Kotidis. The Dwarf Structure for Creating, Storing, and Querying Highly Compressed Data Cubes. Application to U.S. patent office submitted, June 2001."},{"key":"e_1_3_2_1_24_1","volume-title":"Materialized View Selection for Multidimensional Datasets. In VLDB","author":"Shukla A.","year":"1998","unstructured":"{SDN} A. Shukla , P. M. Deshpande , and J. F. Naughton . Materialized View Selection for Multidimensional Datasets. In VLDB 1998 , New York City. {SDN} A. Shukla, P. M. Deshpande, and J. F. Naughton. Materialized View Selection for Multidimensional Datasets. In VLDB 1998, New York City."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312231"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/288627.288645"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994705"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253288"}],"event":{"name":"SIGMOD\/PODS02: International Conference on Management of Data and Symposium on Principles Database and Systems","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Madison Wisconsin","acronym":"SIGMOD\/PODS02"},"container-title":["Proceedings of the 2002 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/564691.564745","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/564691.564745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:24:22Z","timestamp":1750267462000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/564691.564745"}},"subtitle":["shrinking the PetaCube"],"short-title":[],"issued":{"date-parts":[[2002,6,3]]},"references-count":26,"alternative-id":["10.1145\/564691.564745","10.1145\/564691"],"URL":"https:\/\/doi.org\/10.1145\/564691.564745","relation":{},"subject":[],"published":{"date-parts":[[2002,6,3]]},"assertion":[{"value":"2002-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}