Article

Aggregation Algorithms for Very Large Compressed Data Warehouses

Authors:

Jaideep SrivastavaAuthors Info & Claims

VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases

Pages 651 - 662

Published: 07 September 1999 Publication History

Abstract

No abstract available.

References

[1]

{1} Jim Gray, Surajit Chaudhuri, Adam Bosworth, Andrew Layman, Don Reichart, Murali Venkatrao, Frank Pellow, Hamid Pirahesh: Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab, and Sub Totals. Data Min. Knowl. Discov. 1(1): 29-53(1997).

Digital Library

[2]

{2} Yazdani, S. and Wong, S., "Data Warehousing with Oracle", Prentice-Hall, Upper Saddle River, N.J., 1997.

[3]

{3} Gupta, V. R., "Data Warehousing with MS SQL Server Unleashed", Sams, Englewood Cliffs, N. J., 1977.

[4]

{4} Damianos Chatziantoniou, Kenneth A. Ross: Querying Multiple Features of Groups in Relational Databases. VLDB 1996: 295-306.

Digital Library

[5]

{5} Arbor Sofware, "The Role of Multidimensional Database in a Data Warehousing Solution", White Paper, Arbor Software, http://www.arborsoft.com/papers/ware TOC.html

[6]

{6} Inmon, W.H., "Multidimensional Databases and Data Warehousing", Data Management Riview, Feb. 1995.

[7]

{7} George Colliat: OLAP, Relational, and Multidimensional Database Systems. SIGMOD Record 25(3): 64-69(1996).

Digital Library

[8]

{8} Mostafa A. Bassiouni: Data Compression in Scientific and Statistical Databases. IEEE Trans. Software Eng. 11(10): 1047-1058(1985).

Digital Library

[9]

{9} Mark A. Roth, Scott J. Van Horn: Database Compression. SIGMOD Record 22(3): 31-39(1993).

Digital Library

[10]

{10} Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton: An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. SIGMOD Conference 1997: 159-170.

Digital Library

[11]

{11} Goetz Graefe: Query Evaluation Techniques for Large Databases. ACM Comput. Surv. 25(2): 73-170(1993).

Digital Library

[12]

{12} Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman: Implementing Data Cubes Efficiently. SIGMOD Conference 1996: 205-216.

Digital Library

[13]

{13} Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman: Index Selection for OLAP. ICDE 1997: 208-219.

Digital Library

[14]

{14} Yannis Kotidis, Nick Roussopoulos: An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees. SIGMOD Conference 1998: 249-258.

Digital Library

[15]

{15} Nick Roussopoulos, Yannis Kotidis, Mema Roussopoulos: Cubetree: Organization of and Bulk Updates on the Data Cube. SIGMOD Conference 1997: 89-99.

Digital Library

[16]

{16} Sameet Agarwal, Rakesh Agrawal, Prasad Deshpande, Ashish Gupta, Jeffrey F. Naughton, Raghu Ramakrishnan, Sunita Sarawagi: On the Computation of Multidimensional Aggregates. VLDB 1996: 506-521.

Digital Library

[17]

{17} Arie Shoshani: Statistical Databases: Characteristics, Problems, and some Solutions. VLDB 1982: 208-222.

Digital Library

[18]

{18} Meng Chang Chen, Lawrence McNamee: On the Data Model and Access Method of Summary Data Management. IEEE Trans. Knowl. Data Eng. 1(4): 519-529(1989).

Digital Library

[19]

{19} Jaideep Srivastava, Jack S. Eddy Tan, Vincent Y. Lum: TBSAM: An Access Method for Efficient Processing of Statistical Queries. IEEE Trans. Knowl. Data Eng. 1(4): 414-423(1989).

Digital Library

[20]

{20} Zbigniew Michalewicz: Statistical and Scientific Databases. Ellis Horwood 1992.

Digital Library

[21]

{21} Susan J. Eggers, Arie Shoshani: Efficient Access of Compressed Data. VLDB 1980: 205-211.

[22]

{22} Li, Jianzhong, Wang, H.K., Rotem, D. "Batched International Searching on Databases", Information Sciences (An International Journal). 1989. Vol. 48.

Digital Library

[23]

{23} Li, Jianzhong, Rotem, Doron, and Srivastava, Jaideep, "Aggregation Algorithms for Very Large Compressed Data Warehouses", Technique Report, http://www.lbl.gov/~rotem/paper/aggr.ps.

Cited By

Amur HRichter WAndersen DKaminsky MSchwan KBalachandran AZawadzki ELohman G(2013)Memory-efficient groupby-aggregate using compressed buffer treesProceedings of the 4th annual Symposium on Cloud Computing10.1145/2523616.2523625(1-16)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1145/2523616.2523625
Müller SPlattner HNica ASuchanek F(2011)Aggregation strategies for columnar in-memory databases in a mixed workloadProceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management10.1145/2065003.2065015(51-58)Online publication date: 28-Oct-2011
https://dl.acm.org/doi/10.1145/2065003.2065015
Wu WGao HLi J(2006)New Algorithm for Computing Cube on Very Large Compressed Data SetsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2006.19518:12(1667-1680)Online publication date: 1-Dec-2006
https://dl.acm.org/doi/10.1109/TKDE.2006.195
Show More Cited By

Aggregation Algorithms for Very Large Compressed Data Warehouses
1. Human-centered computing
  1. Human computer interaction (HCI)
    1. Interaction devices

Recommendations

Efficient Aggregation Algorithms for Compressed Data Warehouses

Aggregation and cube are important operations for online analytical processing (OLAP). Many efficient algorithms to compute aggregation and cube for relational OLAP have been developed. Some work has been done on efficiently computing cube for ...
Efficient aggregation algorithms on very large compressed data warehouses
Abstract
Multidimensional aggregation is a dominant operation on data warehouses for on-line analytical processing (OLAP). Many efficient algorithms to compute multidimensional aggregation on relational database based data warehouses have been developed. ...
Efficient Algorithms for On-line Analysis Processing On Compressed Data Warehouses
NPC '07: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops

Data compression is an effective technique to improve the performance of data warehouses. Aggregation and cube are important operations for on-line analytical processing (OLAP). It is a major challenge to develop efficient algorithms for aggregation and ...

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases

September 1999

761 pages

ISBN:1558606157

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 07 September 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Amur HRichter WAndersen DKaminsky MSchwan KBalachandran AZawadzki ELohman G(2013)Memory-efficient groupby-aggregate using compressed buffer treesProceedings of the 4th annual Symposium on Cloud Computing10.1145/2523616.2523625(1-16)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1145/2523616.2523625
Müller SPlattner HNica ASuchanek F(2011)Aggregation strategies for columnar in-memory databases in a mixed workloadProceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management10.1145/2065003.2065015(51-58)Online publication date: 28-Oct-2011
https://dl.acm.org/doi/10.1145/2065003.2065015
Wu WGao HLi J(2006)New Algorithm for Computing Cube on Very Large Compressed Data SetsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2006.19518:12(1667-1680)Online publication date: 1-Dec-2006
https://dl.acm.org/doi/10.1109/TKDE.2006.195
Kotidis Y(2002)Aggregate view management in data warehousesHandbook of massive data sets10.5555/779232.779253(711-741)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.5555/779232.779253
Lee YWhang KMoon YSong I(2002)A one-pass aggregation algorithm with the optimal buffer size in multidimensional OLAPProceedings of the 28th international conference on Very Large Data Bases10.5555/1287369.1287437(790-801)Online publication date: 20-Aug-2002
https://dl.acm.org/doi/10.5555/1287369.1287437
Li JSrivastava J(2002)Efficient Aggregation Algorithms for Compressed Data WarehousesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2002.100034014:3(515-529)Online publication date: 1-May-2002
https://dl.acm.org/doi/10.1109/TKDE.2002.1000340
Chen ZGehrke JKorn F(2001)Query optimization in compressed database systemsACM SIGMOD Record10.1145/376284.37569230:2(271-282)Online publication date: 1-May-2001
https://dl.acm.org/doi/10.1145/376284.375692
Chen ZGehrke JKorn F(2001)Query optimization in compressed database systemsProceedings of the 2001 ACM SIGMOD international conference on Management of data10.1145/375663.375692(271-282)Online publication date: 1-May-2001
https://dl.acm.org/doi/10.1145/375663.375692

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents