메뉴 건너뛰기




Volumn , Issue , 2008, Pages 779-790

Sampling cube: A framework for statistical OLAP over sampling data

Author keywords

Algorithms; Design; Experimentation

Indexed keywords

CLUSTERING ALGORITHMS; DATA STORAGE EQUIPMENT; SAMPLING;

EID: 57149135463     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376695     Document Type: Conference Paper
Times cited : (34)

References (22)
  • 1
    • 85088335618 scopus 로고    scopus 로고
    • Outlier detection for high dimensional data
    • C. C. Aggarwal and P. S. Yu. Outlier detection for high dimensional data. In SIGMOD'01.
    • SIGMOD'01
    • Aggarwal, C.C.1    Yu, P.S.2
  • 3
    • 0008707038 scopus 로고    scopus 로고
    • Bottom-up computation of sparse and iceberg cubes
    • K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. In SIGMOD'99.
    • SIGMOD'99
    • Beyer, K.1    Ramakrishnan, R.2
  • 6
    • 85084686275 scopus 로고    scopus 로고
    • Robust and efficient fuzzy match for online data cleaning
    • Surajit Chaudhuri, Kris Ganjam, Venkatesh Ganti, and Rajeev Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD '03.
    • SIGMOD '03
    • Chaudhuri, S.1    Ganjam, K.2    Ganti, V.3    Motwani, R.4
  • 10
    • 0029752925 scopus 로고    scopus 로고
    • Data cube: A relational operator generalizing group-by, cross-tab and sub-totals
    • J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational operator generalizing group-by, cross-tab and sub-totals. In ICDE'96.
    • ICDE'96
    • Gray, J.1    Bosworth, A.2    Layman, A.3    Pirahesh, H.4
  • 13
    • 0003818389 scopus 로고
    • CBS College Publishing, New York, NY
    • W. L. Hays. Statistics. CBS College Publishing, New York, NY, 1981.
    • (1981) Statistics
    • Hays, W.L.1
  • 14
    • 2442673631 scopus 로고    scopus 로고
    • Quotient cube: How to summarize the semantics of a data cube
    • L. V. S. Lakshmanan, J. Pei, and J. Han. Quotient cube: How to summarize the semantics of a data cube. In VLDB'02.
    • VLDB'02
    • Lakshmanan, L.V.S.1    Pei, J.2    Han, J.3
  • 15
    • 1142291601 scopus 로고    scopus 로고
    • QC-Trees: An efficient summary structure for semantic OLAP
    • L. V. S. Lakshmanan, J. Pei, and Y. Zhao. QC-Trees: An efficient summary structure for semantic OLAP. In SIGMOD'O3.
    • SIGMOD'O3
    • Lakshmanan, L.V.S.1    Pei, J.2    Zhao, Y.3
  • 16
    • 51649101824 scopus 로고    scopus 로고
    • High-dimensional OLAP: A minimal cubing approach
    • X. Li, J. Han, and H. Gonzalez. High-dimensional OLAP: A minimal cubing approach. In VLDB'04
    • VLDB'04
    • Li, X.1    Han, J.2    Gonzalez, H.3
  • 18
    • 17044376078 scopus 로고    scopus 로고
    • Subspace clustering for high dimensional data: A review
    • L. Parsons, E. Haque, and H. Liu. Subspace clustering for high dimensional data: A review. SIGKDD Explorations, 2004.
    • (2004) SIGKDD Explorations
    • Parsons, L.1    Haque, E.2    Liu, H.3
  • 19
    • 84944315993 scopus 로고    scopus 로고
    • Potter's wheel: An interactive data cleaning system
    • V. Raman and J. M. Hellerstein. Potter's wheel: An interactive data cleaning system. In VLDB'01.
    • VLDB'01
    • Raman, V.1    Hellerstein, J.M.2
  • 20
    • 57149136142 scopus 로고    scopus 로고
    • The complexity of fully materialized coalesced cubes
    • Y. Sismanis and N. Roussopoulos. The complexity of fully materialized coalesced cubes. In VLDB'04
    • VLDB'04
    • Sismanis, Y.1    Roussopoulos, N.2
  • 22
    • 85012157812 scopus 로고    scopus 로고
    • Star-cubing: Computing iceberg cubes by top-down and bottom-up integration
    • D. Xin, J. Han, X. Li, and B. W. Wall. Star-cubing: Computing iceberg cubes by top-down and bottom-up integration. In VLDB'03.
    • VLDB'03
    • Xin, D.1    Han, J.2    Li, X.3    Wall, B.W.4


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