Attribute value reordering for efficient hybrid OLAP

Information Sciences

Volumn 176, Issue 16, 2006, Pages 2304-2336

  Kaser, Owen ^a   Lemire, Daniel ^b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Chunking; Data cubes; MOLAP; Multidimensional binary arrays; Normalization

Indexed keywords

ALGORITHMS; HEURISTIC PROGRAMMING; OPTIMIZATION; STATISTICAL MECHANICS;

CHUNKING; DATA CUBES; MULTIDIMENSIONAL BINARY ARRAYS; NORMALIZATION;

DATABASE SYSTEMS;

EID: 33646914216     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.09.005     Document Type: Article

References (24)

1. O. Kaser, D. Lemire, Attribute-value reordering for efficient hybrid OLAP, in: DOLAP, 2003, pp. 1-8.
2. S. Goil, High performance on-line analytical processing and data mining on parallel computers, Ph.D. thesis, Dept. ECE, Northwestern University, 1999.
3. F. Dehne, T. Eavis, A. Rau-Chaplin, Coarse grained parallel on-line analytical processing (OLAP) for data mining, in: ICCS, 2001, pp. 589-598.
4. Ng W., and Ravishankar C.V. Block-oriented compression techniques for large statistical databases. IEEE Knowledge and Data Engineering 9 2 (1997) 314-328
5. Y. Sismanis, A. Deligiannakis, N. Roussopoulus, Y. Kotidis, Dwarf: shrinking the petacube, in: SIGMOD, 2002, pp. 464-475.
6. Zhao Y., Deshpande P.M., and Naughton J.F. An array-based algorithm for simultaneous multidimensional aggregates. SIGMOD (1997), ACM Press 159-170
7. D.W.-L. Cheung, B. Zhou, B. Kao, K. Hu, S.D. Lee, DROLAP-a dense-region based approach to on-line analytical processing, in: DEXA, 1999, pp. 761-770.
8. Cheung D.W.-L., Zhou B., Kao B., Kan H., and Lee S.D. Towards the building of a dense-region-based OLAP system. Data and Knowledge Engineering 36 1 (2001) 1-27
9. O. Kaser, Compressing MOLAP arrays by attribute-value reordering: an experimental analysis, Tech. Rep. TR-02-001, Dept. of CS and Appl. Stats, University of New Brunswick, Saint John, Canada, August 2002.
10. D. Barbará, X. Wu, Using loglinear models to compress datacube, in: Web-Age Information Management, 2000, pp. 311-322.
11. J.S. Vitter, M. Wang, Approximate computation of multidimensional aggregates of sparse data using wavelets, in: SIGMOD, 1999, pp. 193-204.
12. M. Riedewald, D. Agrawal, A. El Abbadi, pCube: update-efficient online aggregation with progressive feedback and error bounds, in: SSDBM, 2000, pp. 95-108.
13. S. Sarawagi, M. Stonebraker, Efficient organization of large multidimensional arrays, in: ICDE, 1994, pp. 328-336.
14. Li J., and Srivastava J. Efficient aggregation algorithms for compressed data warehouses. IEEE Knowledge and Data Engineering 14 3 (2002) 515-529
15. D.S. Johnson, A catalog of complexity classes, in: van Leeuwen [24], pp. 67-161.
16. J. van Leeuwen, Graph algorithms, in: Handbook of Theoretical Computer Science [24], pp. 525-631.
17. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, New York
18. H.B. Hunt, III, D.J. Rosenkrantz, Complexity of grammatical similarity relations: Preliminary report, in: Conference on Theoretical Computer Science, Department of Computer Science, University of Waterloo, 1977, pp. 139-148, cited in Garey and Johnson.
19. Gabow H. An efficient implementation of Edmond's algorithm for maximum matching on graphs. Journal of ACM 23 (1976) 221-234
20. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms, and Applications (1993), Prentice-Hall
21. Kaser O. Compressing arrays by ordering attribute values. Information Processing Letters 92 (2004) 253-256
22. S. Hettich, S.D. Bay, The UCI KDD archive. Available from: , last checked on 26/8/2005, 2000.
23. C. Hahn, S. Warren, J. London, Edited synoptic cloud reports from ships and land stations over the globe (1982-1991). Available from: , last checked on 26/8/2005, 2001.
24. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science vol. A (1990), Elsevier/MIT Press