메뉴 건너뛰기




Volumn , Issue , 2007, Pages 465-474

MapGraph: Efficient methods for complex OLAP hierarchies

Author keywords

Attribute hierarchies; Data cube; OLAP

Indexed keywords

ATTRIBUTE HIERARCHIES; CONVENTIONAL TECHNIQUES; CORE DIMENSIONS; DATA CUBE; DIMENSION HIERARCHIES; DRILL DOWNS; EFFICIENT METHODS; LOGICAL STRUCTURES; MULTI-DIMENSIONAL DATUM; OLAP; OLAP QUERIES; ON-LINE ANALYTICAL PROCESSING; QUERY OPERATIONS;

EID: 63449122796     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321507     Document Type: Conference Paper
Times cited : (11)

References (19)
  • 2
    • 0008707038 scopus 로고    scopus 로고
    • Bottom-up computation of sparse and iceberg cubes
    • K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. ACM SIGMOD, pages 359-370, 1999.
    • (1999) ACM SIGMOD , pp. 359-370
    • Beyer, K.1    Ramakrishnan, R.2
  • 3
    • 33751369369 scopus 로고    scopus 로고
    • Parallel querying of ROLAP cubes in the presence of hierarchies
    • F. Dehne, T. Eavis, and A. Rau-Chaplin. Parallel querying of ROLAP cubes in the presence of hierarchies. DOLAP, 2005.
    • (2005) DOLAP
    • Dehne, F.1    Eavis, T.2    Rau-Chaplin, A.3
  • 5
    • 0029752925 scopus 로고    scopus 로고
    • Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals
    • J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. ICDE, pages 152-159, 1996.
    • (1996) ICDE , pp. 152-159
    • Gray, J.1    Bosworth, A.2    Layman, A.3    Pirahesh, H.4
  • 10
    • 0030675502 scopus 로고    scopus 로고
    • Summarizability in OLAP and statistical data bases
    • H. Lenz and A. Shoshani. Summarizability in OLAP and statistical data bases. SSDBM, pages 132-143, 1997.
    • (1997) SSDBM , pp. 132-143
    • Lenz, H.1    Shoshani, A.2
  • 13
    • 84893838524 scopus 로고    scopus 로고
    • CURE for cubes: Cubing using a ROLAP engine
    • K. Morfonios and Y. Ioannidis. CURE for cubes: cubing using a ROLAP engine. In VLDB, pages 379-390, 2006.
    • (2006) VLDB , pp. 379-390
    • Morfonios, K.1    Ioannidis, Y.2
  • 14
    • 33751373099 scopus 로고    scopus 로고
    • Logical multidimensional database design for ragged and unbalanced aggregation hierarchies
    • T. Niemi, J. Nummenmaa, and P. Thanisch. Logical multidimensional database design for ragged and unbalanced aggregation hierarchies. DMDW,pages 1-8, 2001.
    • (2001) DMDW , pp. 1-8
    • Niemi, T.1    Nummenmaa, J.2    Thanisch, P.3
  • 15
    • 0035385366 scopus 로고    scopus 로고
    • A foundation for capturing and querying complex multidimensonal data
    • T. Pederson, C. Jensen, and C. Dyreson. A foundation for capturing and querying complex multidimensonal data. Information Systems Journal, 26(5):383-423, 2001.
    • (2001) Information Systems Journal , vol.26 , Issue.5 , pp. 383-423
    • Pederson, T.1    Jensen, C.2    Dyreson, C.3
  • 16
    • 84993661534 scopus 로고    scopus 로고
    • Fast computation of sparse data cubes
    • K. Ross and D. Srivastava. Fast computation of sparse data cubes. VLDB, pages 116-125, 1997.
    • (1997) VLDB , pp. 116-125
    • Ross, K.1    Srivastava, D.2
  • 17
    • 33750280191 scopus 로고    scopus 로고
    • Storage estimation for multidimensional aggregates in the presence of hierarchies
    • A. Shukla, P. Deshpande, J. Naughton, and K. Ramasamy. Storage estimation for multidimensional aggregates in the presence of hierarchies. VLDB, pages 522-531, 1996.
    • (1996) VLDB , pp. 522-531
    • Shukla, A.1    Deshpande, P.2    Naughton, J.3    Ramasamy, K.4
  • 19
    • 0031162046 scopus 로고    scopus 로고
    • An array-based algorithm for simultaneous multi-dimensional aggregates
    • Y. Zhao, P. Deshpande, and J. Naughton. An array-based algorithm for simultaneous multi-dimensional aggregates. ACM SIGMOD, pages 159-170, 1997.
    • (1997) ACM SIGMOD , pp. 159-170
    • Zhao, Y.1    Deshpande, P.2    Naughton, J.3


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