메뉴 건너뛰기




Volumn 1677, Issue , 1999, Pages 761-770

Drolap — a dense-region based approach to on-line analytical processing

Author keywords

[No Author keywords available]

Indexed keywords

DATA WAREHOUSES; EXPERT SYSTEMS; QUERY PROCESSING;

EID: 22844453972     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48309-8_71     Document Type: Conference Paper
Times cited : (4)

References (16)
  • 3
    • 84947960463 scopus 로고    scopus 로고
    • David W. Cheung, Bo Zhou, Ben Kao, Kan Hu and Sau Dan Lee. DROLAP—A Dense-Region Based Approach to On-line Analytical Processing. Technical Report (TR-99-02), Dept. of Computer Science & I.S., the University of Hong Kong, 1999. http://www.csis.hku.hk/publications/techreps/document/TR-99-02.ps
    • Cheung, D.W.1    Bo, Z.2    Kao, B.3    Kan, H.4    Lee, S.D.5
  • 4
    • 0002568682 scopus 로고    scopus 로고
    • OLAP, relational, and multidimensional database systems
    • G. Colliat. OLAP, relational, and multidimensional database systems. SIGMOD Record, pages 64-69, Vol.25, No.3, September 1996.
    • (1996) SIGMOD Record , vol.25 , Issue.3 , pp. 64-69
    • Colliat, G.1
  • 5
    • 85170282443 scopus 로고    scopus 로고
    • A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise
    • Portland, Oregon
    • M. Ester, H. Kriegel, J. Sander, and X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proceedings of KDD, pages 226-231, Portland, Oregon, August 1996.
    • (1996) Proceedings of KDD , pp. 226-231
    • Ester, M.1    Kriegel, H.2    Sander, J.3    Xu, X.4
  • 6
    • 0029752925 scopus 로고    scopus 로고
    • Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total
    • New Orleans, February
    • J. Gray, A. Bosworth, A. Layman, and H. Piramish. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In Proceeding of ICDE, pages 152-159, New Orleans, February 1996.
    • (1996) Proceeding of ICDE , pp. 152-159
    • Gray, J.1    Bosworth, A.2    Layman, A.3    Piramish, H.4
  • 11
    • 0003136237 scopus 로고
    • Efficient and Effective Clustering Methods for Spatial Data Mining
    • Santiago, Chile
    • R.T. Ng, and J. Han. Efficient and Effective Clustering Methods for Spatial Data Mining. In Proc. of VLDB, pages 144-155, Santiago, Chile, 1994.
    • (1994) Proc. Of VLDB , pp. 144-155
    • Ng, R.T.1    Han, J.2
  • 13
    • 84993661534 scopus 로고    scopus 로고
    • Fast computation of sparse datacube
    • Athens, Greece
    • K.A. Ross and D. Srivastava. Fast computation of sparse datacube. In Proc. of VLDB, pages 116-125, Athens, Greece, August 1997.
    • (1997) Proc. Of VLDB , pp. 116-125
    • Ross, K.A.1    Srivastava, D.2
  • 14
    • 0030157145 scopus 로고    scopus 로고
    • T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases In Proceedings ofthe ACM SIGMOD Conference on Management of Data, pages 103-114, Montreal, Quebec, June 1996.
    • Zhang, T.1    Ramakrishnan, R.2    Livny, M.3
  • 16
    • 84947960465 scopus 로고    scopus 로고
    • of Wisconsin-Madison, CS Department, May
    • Y.H. Zhao, K. Tufte, and J.F. Naughton. On the Performance of an Array-Based ADT for OLAP Workloads. Technical Report CS-TR-96-1313, University of Wisconsin-Madison, CS Department, May 1996.
    • (1996)
    • Zhao, Y.H.1    Tufte, K.2    Naughton, J.F.3


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