Article

Fast Computation of Sparse Datacubes

Authors:

Kenneth A. Ross,

Divesh SrivastavaAuthors Info & Claims

VLDB '97: Proceedings of the 23rd International Conference on Very Large Data Bases

Pages 116 - 125

Published: 25 August 1997 Publication History

Abstract

No abstract available.

References

[1]

{AAD+96} 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

Google Scholar

[2]

{DANR96} P. M. Deshpande, S. Agarwal, J. F. Naughton, and R. Ramakrishnan. Computation of multidimensional aggregates. Technical Report 1314, University of Wisconsin, Madison, 1996.

Google Scholar

[3]

{GBLP96} Jim Gray, Adam Bosworth, Andrew Layman, Hamid Pirahesh: Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total. ICDE 1996: 152-159.

Digital Library

Google Scholar

[4]

{Hoa62} C. A. R. Hoare: Quicksort. Comput. J. 5(1): 10-15(1962).

Crossref

Google Scholar

[5]

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

Digital Library

Google Scholar

[6]

{HWL94} C. J. Hahn, S. G. Warren, and J. London. Edited synoptic cloud reports from ships and land stations over the globe, 1982-1991. Available from http://cdiac.esd.ornl.gov/cdiac/ndps/ndp026b.html, 1994.

Google Scholar

[7]

{SAG96} S. Sarawagi, R. Agrawal, and A. Gupta. On computing the data cube. Technical Report RJ10026, IBM Almaden Research Center, San Jose, CA, 1996.

Google Scholar

[8]

{Tra95} Transaction Processing Performance Council (TPC), 777 N. First Street, Suite 600, San Jose, CA 95112, USA. TPC Benchmark D (Decision Support), May 1995.

Google Scholar

[9]

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

Digital Library

Google Scholar

Cited By

View all

Yang PThiagarajan SLin JDas GJermaine CBernstein P(2018)Robust, Scalable, Real-Time Event Time Series Aggregation at TwitterProceedings of the 2018 International Conference on Management of Data10.1145/3183713.3190663(595-599)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3183713.3190663
He ZWong PKao BLo ECheng RFeng Z(2017)Efficient Pattern-Based Aggregation on Sequence DataIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2016.261885629:2(286-299)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1109/TKDE.2016.2618856
Milo TAltshuler EÖzcan FKoutrika GMadden S(2016)An Efficient MapReduce Cube Algorithm for Varied DataDistributionsProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2882922(1151-1165)Online publication date: 26-Jun-2016
https://dl.acm.org/doi/10.1145/2882903.2882922
Show More Cited By

Fast Computation of Sparse Datacubes

Recommendations

A fast algorithm for nonconvex approaches to sparse recovery problems

This paper addresses the problem of sparse signal recovery from a lower number of measurements than those requested by the classical compressed sensing theory. This problem is formalized as a constrained minimization problem, where the objective ...
A new greedy sparse recovery algorithm for fast solving sparse representation
Abstract
Kernel sparse representation-based classification (KSRC) in compressive sensing represents one of the most interesting research areas in pattern recognition and image processing. Nevertheless, KSRC is subjected to some shortcomings. KSRC is greedy ... $_{}$ $_{}$
Fast Kernel Sparse Representation
DICTA '11: Proceedings of the 2011 International Conference on Digital Image Computing: Techniques and Applications

Two efficient algorithms are proposed to seek the sparse representation on high-dimensional Hilbert space. By proving that all the calculations in Orthogonal Match Pursuit (OMP) are essentially inner-product combinations, we modify the OMP algorithm to ...

Comments

Information & Contributors

Information

Published In

VLDB '97: Proceedings of the 23rd International Conference on Very Large Data Bases

August 1997

593 pages

ISBN:1558604707

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 25 August 1997

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

75
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yang PThiagarajan SLin JDas GJermaine CBernstein P(2018)Robust, Scalable, Real-Time Event Time Series Aggregation at TwitterProceedings of the 2018 International Conference on Management of Data10.1145/3183713.3190663(595-599)Online publication date: 27-May-2018
He ZWong PKao BLo ECheng RFeng Z(2017)Efficient Pattern-Based Aggregation on Sequence DataIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2016.261885629:2(286-299)Online publication date: 1-Feb-2017
Milo TAltshuler EÖzcan FKoutrika GMadden S(2016)An Efficient MapReduce Cube Algorithm for Varied DataDistributionsProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2882922(1151-1165)Online publication date: 26-Jun-2016
Dehne FZaboli HNg JCouturier CLitoiu MStroulia E(2011)Parallel data cubes on multi-core processors with multiple disksProceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research10.5555/2093889.2093901(99-106)Online publication date: 7-Nov-2011
Lima JHirata C(2011)Multidimensional cyclic graph approachInformation Sciences: an International Journal10.1016/j.ins.2010.05.012181:13(2626-2655)Online publication date: 1-Jul-2011
Han JKamber MPei J(2011)Data MiningundefinedOnline publication date: 29-Jul-2011
Lee KChung YKim M(2010)An efficient method for maintaining data cubes incrementallyInformation Sciences: an International Journal10.1016/j.ins.2009.11.037180:6(928-948)Online publication date: 1-Mar-2010
Morfonios KIoannidis Y(2010)Revisiting the cube lifecycle in the presence of hierarchiesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-009-0160-319:2(257-282)Online publication date: 1-Apr-2010
Dittrich JBlunschi LSalles M(2008)Dwarfs in the rearview mirrorProceedings of the VLDB Endowment10.14778/1454159.14542301:2(1586-1597)Online publication date: 1-Aug-2008
Chui CChan CLi Q(2008)The design and implementation of an OLAP system for sequence data analysisProceedings of the 2nd SIGMOD PhD workshop on Innovative database research10.1145/1410308.1410310(1-6)Online publication date: 13-Jun-2008
Show More Cited By

Abstract

References

Cited By

Recommendations

A fast algorithm for nonconvex approaches to sparse recovery problems

A new greedy sparse recovery algorithm for fast solving sparse representation

Fast Kernel Sparse Representation

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations