메뉴 건너뛰기




Volumn , Issue , 2003, Pages 476-487

Star-cubing: Computing iceberg cubes by top-down and bottom-up integration

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; DATA WAREHOUSES; FORESTRY; GEOMETRY; SEA ICE; STARS;

EID: 85012157812     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (108)

References (25)
  • 2
    • 0001882616 scopus 로고    scopus 로고
    • Fast algorithm for mining association rules
    • R. Agrawal and R. Srikant. Fast algorithm for mining association rules. VLDB'94.
    • VLDB'94
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 85012147171 scopus 로고    scopus 로고
    • Materialized view selection in a multidimensional database
    • E. Baralis, S. Paraboschi, and E. Teniente. Materialized view selection in a multidimensional database. VLDB'97, 98-12.
    • VLDB'97 , pp. 98-112
    • Baralis, E.1    Paraboschi, S.2    Teniente, E.3
  • 4
    • 0001853449 scopus 로고    scopus 로고
    • Quasi-cubes: Exploiting approximation in multidimensional database
    • D. Barbara and M. Sullivan. Quasi-cubes: Exploiting approximation in multidimensional database. SIG-MOD Record, 26:12-17, 1997.
    • (1997) SIG-MOD Record , vol.26 , pp. 12-17
    • Barbara, D.1    Sullivan, M.2
  • 5
    • 5444255998 scopus 로고    scopus 로고
    • Using loglinear models to compress datacube
    • D. Barbara and X. Wu. Using loglinear models to compress datacube. WAIM'00, 311-322.
    • WAIM'00 , pp. 311-322
    • Barbara, D.1    Wu, X.2
  • 6
    • 0008707038 scopus 로고    scopus 로고
    • Bottom-up computation of sparse and iceberg cubes
    • K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. SIGMOD'99, 359-370.
    • SIGMOD'99 , pp. 359-370
    • Beyer, K.1    Ramakrishnan, R.2
  • 7
    • 84870689573 scopus 로고    scopus 로고
    • Multi-dimensional regression analysis of time-series data streams
    • Y. Chen, G. Dong, J. Han, B. W. Wah, and J. Wang, Multi-Dimensional Regression Analysis of Time-Series Data Streams. VLDB'02.
    • VLDB'02
    • Chen, Y.1    Dong, G.2    Han, J.3    Wah, B.W.4    Wang, J.5
  • 9
    • 84948964173 scopus 로고    scopus 로고
    • Selection of views to materialize in a data warehouse
    • H. Gupta. Selection of views to materialize in a data warehouse. ICDT'97, 98-112.
    • ICDT'97 , pp. 98-112
    • Gupta, H.1
  • 11
    • 0039562917 scopus 로고    scopus 로고
    • Efficient computation of iceberg cubes with complex measures
    • J. Han, J. Pei, G. Dong, and K. Wang. Efficient computation of iceberg cubes with complex measures. SIG-MOD'01, 1-12.
    • SIG-MOD'01 , pp. 1-12
    • Han, J.1    Pei, J.2    Dong, G.3    Wang, K.4
  • 12
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation. SIGMOD'00, 1-12.
    • SIGMOD'00 , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 15
    • 2442673631 scopus 로고    scopus 로고
    • Quotient cubes: How to summarize the semantics of a data cube
    • L. V. S. Lakeshmanan, J. Pei and J. Han. Quotient Cubes: How to Summarize the Semantics of a Data Cube. VLDB'02.
    • VLDB'02
    • Lakeshmanan, L.V.S.1    Pei, J.2    Han, J.3
  • 16
    • 1142291601 scopus 로고    scopus 로고
    • QC-trees: An efficient summary structure for semantic OLAP
    • L. V. S. Lakeshmanan, J. Pei and Y. Zhao. QC-Trees: An Efficient Summary Structure for Semantic OLAP, SIGMOD'03.
    • SIGMOD'03
    • Lakeshmanan, L.V.S.1    Pei, J.2    Zhao, Y.3
  • 17
    • 0032092760 scopus 로고    scopus 로고
    • Exploratory mining and pruning optimizations of constrained associations rules
    • R. Ng, L. V. S. Lakeshmanan, J. Han and A. Pang. Exploratory Mining and Pruning Optimizations of Constrained Associations Rules, SIGMOD'98.
    • SIGMOD'98
    • Ng, R.1    Lakeshmanan, L.V.S.2    Han, J.3    Pang, A.4
  • 18
    • 0001580396 scopus 로고    scopus 로고
    • Fast computation of sparse datacubes
    • K. Ross and D. Srivastava. Fast Computation of sparse datacubes. VLDB'97.
    • VLDB'97
    • Ross, K.1    Srivastava, D.2
  • 20
    • 0002678075 scopus 로고    scopus 로고
    • Compressed data cubes for OLAP aggregate query approximation on continuous dimension
    • J. Shanmugasundaram, U. M. Fayyad, and P. S. Bradley. Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimension. KDD'99.
    • KDD'99
    • Shanmugasundaram, J.1    Fayyad, U.M.2    Bradley, P.S.3
  • 21
    • 0008696982 scopus 로고    scopus 로고
    • Materialized view selection for multidimensional datasets
    • A. Shukla, P. M. Deshpande, and J. F. Naughton. Materialized view selection for multidimensional datasets. VLDB'99.
    • VLDB'99
    • Shukla, A.1    Deshpande, P.M.2    Naughton, J.F.3
  • 23
    • 0002683757 scopus 로고    scopus 로고
    • Data Cube approximation and histograms via wavelets
    • J. S. Vitter, M. Wang, and B. R. Iyer. Data Cube approximation and histograms via wavelets. CIKM'98.
    • CIKM'98
    • Vitter, J.S.1    Wang, M.2    Iyer, B.R.3
  • 24
    • 0036203284 scopus 로고    scopus 로고
    • Condensed cube: An effective approach to reducing data cube size
    • W. Wang, J. Feng, H. Lu and J. X. Yu. Condensed Cube: An Effective Approach to Reducing Data Cube Size. ICDE'02.
    • ICDE'02
    • Wang, W.1    Feng, J.2    Lu, H.3    Yu, J.X.4
  • 25
    • 0031162046 scopus 로고    scopus 로고
    • An array-based algorithm for simultaneous multidimensional aggregates
    • Y. Zhao, P. Deshpande, J. F. Naughton: An Array-Based Algorithm for Simultaneous Multidimensional Aggregates. SIGMOD'97.
    • SIGMOD'97
    • Zhao, Y.1    Deshpande, P.2    Naughton, J.F.3


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