메뉴 건너뛰기




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

Attribute value reordering for efficient hybrid OLAP

Author keywords

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

Indexed keywords

ALGORITHMS; HEURISTIC PROGRAMMING; OPTIMIZATION; STATISTICAL MECHANICS;

EID: 33646914216     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.09.005     Document Type: Article
Times cited : (9)

References (24)
  • 1
    • 7544248929 scopus 로고    scopus 로고
    • O. Kaser, D. Lemire, Attribute-value reordering for efficient hybrid OLAP, in: DOLAP, 2003, pp. 1-8.
  • 2
    • 33646942673 scopus 로고    scopus 로고
    • S. Goil, High performance on-line analytical processing and data mining on parallel computers, Ph.D. thesis, Dept. ECE, Northwestern University, 1999.
  • 3
    • 84957885786 scopus 로고    scopus 로고
    • 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
    • 0031094449 scopus 로고    scopus 로고
    • Block-oriented compression techniques for large statistical databases
    • Ng W., and Ravishankar C.V. Block-oriented compression techniques for large statistical databases. IEEE Knowledge and Data Engineering 9 2 (1997) 314-328
    • (1997) IEEE Knowledge and Data Engineering , vol.9 , Issue.2 , pp. 314-328
    • Ng, W.1    Ravishankar, C.V.2
  • 5
    • 0036373392 scopus 로고    scopus 로고
    • Y. Sismanis, A. Deligiannakis, N. Roussopoulus, Y. Kotidis, Dwarf: shrinking the petacube, in: SIGMOD, 2002, pp. 464-475.
  • 6
    • 0031162046 scopus 로고    scopus 로고
    • An array-based algorithm for simultaneous multidimensional aggregates
    • ACM Press
    • Zhao Y., Deshpande P.M., and Naughton J.F. An array-based algorithm for simultaneous multidimensional aggregates. SIGMOD (1997), ACM Press 159-170
    • (1997) SIGMOD , pp. 159-170
    • Zhao, Y.1    Deshpande, P.M.2    Naughton, J.F.3
  • 7
    • 22844453972 scopus 로고    scopus 로고
    • 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.
  • 9
    • 33646950985 scopus 로고    scopus 로고
    • 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
    • 5444255998 scopus 로고    scopus 로고
    • D. Barbará, X. Wu, Using loglinear models to compress datacube, in: Web-Age Information Management, 2000, pp. 311-322.
  • 11
    • 0347087667 scopus 로고    scopus 로고
    • J.S. Vitter, M. Wang, Approximate computation of multidimensional aggregates of sparse data using wavelets, in: SIGMOD, 1999, pp. 193-204.
  • 12
    • 53949122891 scopus 로고    scopus 로고
    • 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
    • 0028288815 scopus 로고    scopus 로고
    • S. Sarawagi, M. Stonebraker, Efficient organization of large multidimensional arrays, in: ICDE, 1994, pp. 328-336.
  • 14
    • 0036565571 scopus 로고    scopus 로고
    • Efficient aggregation algorithms for compressed data warehouses
    • Li J., and Srivastava J. Efficient aggregation algorithms for compressed data warehouses. IEEE Knowledge and Data Engineering 14 3 (2002) 515-529
    • (2002) IEEE Knowledge and Data Engineering , vol.14 , Issue.3 , pp. 515-529
    • Li, J.1    Srivastava, J.2
  • 15
    • 33646904481 scopus 로고    scopus 로고
    • D.S. Johnson, A catalog of complexity classes, in: van Leeuwen [24], pp. 67-161.
  • 16
    • 33646897596 scopus 로고    scopus 로고
    • J. van Leeuwen, Graph algorithms, in: Handbook of Theoretical Computer Science [24], pp. 525-631.
  • 18
    • 33646913531 scopus 로고    scopus 로고
    • 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
    • 0016943409 scopus 로고
    • An efficient implementation of Edmond's algorithm for maximum matching on graphs
    • Gabow H. An efficient implementation of Edmond's algorithm for maximum matching on graphs. Journal of ACM 23 (1976) 221-234
    • (1976) Journal of ACM , vol.23 , pp. 221-234
    • Gabow, H.1
  • 21
    • 7544224841 scopus 로고    scopus 로고
    • Compressing arrays by ordering attribute values
    • Kaser O. Compressing arrays by ordering attribute values. Information Processing Letters 92 (2004) 253-256
    • (2004) Information Processing Letters , vol.92 , pp. 253-256
    • Kaser, O.1
  • 22
    • 33646898149 scopus 로고    scopus 로고
    • S. Hettich, S.D. Bay, The UCI KDD archive. Available from: , last checked on 26/8/2005, 2000.
  • 23
    • 33646910772 scopus 로고    scopus 로고
    • 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
    • 0003947113 scopus 로고
    • van Leeuwen J. (Ed), Elsevier/MIT Press
    • In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science vol. A (1990), Elsevier/MIT Press
    • (1990) Handbook of Theoretical Computer Science , vol.A


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.