메뉴 건너뛰기




Volumn 19, Issue 1, 2006, Pages 29-62

The cgmCUBE project: Optimizing parallel data cube generation for ROLAP

Author keywords

Data cube; Parallel processing; ROLAP

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA WAREHOUSES; ONLINE SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; SEQUENTIAL CIRCUITS;

EID: 32344440304     PISSN: 09268782     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10619-006-6575-6     Document Type: Article
Times cited : (39)

References (41)
  • 2
    • 0019897628 scopus 로고
    • A shifting algorithm for min-max tree partitioning
    • R. Becker, S. Schach, and Y. Perl, "A shifting algorithm for min-max tree partitioning," Journal of the ACM, vol. 29, pp. 58-67, 1982.
    • (1982) Journal of the ACM , vol.29 , pp. 58-67
    • Becker, R.1    Schach, S.2    Perl, Y.3
  • 4
    • 1942486356 scopus 로고    scopus 로고
    • Parallel ROLAP data cube construction on sharednothing multiprocessors
    • Y. Chen, F. Dehne, T. Eavis, and A. Rau-Chaplin, "Parallel ROLAP data cube construction on sharednothing multiprocessors," Distributed and Parallel Databases, vol. 15, pp. 219-236, 2004.
    • (2004) Distributed and Parallel Databases , vol.15 , pp. 219-236
    • Chen, Y.1    Dehne, F.2    Eavis, T.3    Rau-Chaplin, A.4
  • 11
    • 0020828424 scopus 로고
    • Probabilistic counting algorithms for database applications
    • P Flajolet and G. Martin, "Probabilistic counting algorithms for database applications," Journal of Computer and System Sciences, vol. 31 no. 2, pp. 182-209, 1985.
    • (1985) Journal of Computer and System Sciences , vol.31 , Issue.2 , pp. 182-209
    • Flajolet, P.1    Martin, G.2
  • 12
    • 32344432921 scopus 로고    scopus 로고
    • Flex and Bison, 2003. http://dinosaur.compilertools.net/.
    • (2003)
    • Flex1    Bison2
  • 23
    • 32344447848 scopus 로고    scopus 로고
    • Leda, 2003. http://www.mpi-sb.mpg.de/LEDA/.
    • (2003)
  • 24
    • 0037372473 scopus 로고    scopus 로고
    • Fully dynamic partitioning: Handling data skew in parallel data cube computation
    • H. Lu, J.X. Yu, L. Feng, and X. Li, "Fully dynamic partitioning: Handling data skew in parallel data cube computation," Distributed and Parallel Databases, vol. 13, pp. 181-202, 2003.
    • (2003) Distributed and Parallel Databases , vol.13 , pp. 181-202
    • Lu, H.1    Yu, J.X.2    Feng, L.3    Li, X.4
  • 32
    • 0004052015 scopus 로고    scopus 로고
    • On computing the data cube
    • IBM Almaden Research Center, San Jose, California
    • S. Sarawagi, R. Agrawal, and A.Gupta, "On computing the data cube," Technical Report RJ10026, IBM Almaden Research Center, San Jose, California, 1996.
    • (1996) Technical Report , vol.RJ10026
    • Sarawagi, S.1    Agrawal, R.2    Gupta, A.3
  • 37
    • 32344439290 scopus 로고    scopus 로고
    • The Winter Report, 2003. http://www.wintercorp.com/vldb/2003_TopTen_Survey.
    • (2003) The Winter Report


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