메뉴 건너뛰기




Volumn 17, Issue 11, 2005, Pages 1465-1477

Using datacube aggregates for approximate querying and deviation detection

Author keywords

Approximate query answering; Data warehouse; Datacube; Deviation detection

Indexed keywords

AGGREGATED INFORMATION; APPROXIMATE QUERY ANSWERING; DATACUBE; DEVIATION DETECTION;

EID: 28244449227     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2005.187     Document Type: Article
Times cited : (35)

References (38)
  • 4
    • 0003804614 scopus 로고
    • Approximate query processing with summary tables in statistical databases
    • Mar.
    • S. Abad-Mota, "Approximate Query Processing with Summary Tables in Statistical Databases," Proc. Int'l Conf. Extending Database Technology, pp. 499-515, Mar. 1992.
    • (1992) Proc. Int'l Conf. Extending Database Technology , pp. 499-515
    • Abad-Mota, S.1
  • 5
    • 0036367942 scopus 로고    scopus 로고
    • Exploiting statistics on query expressions for optimization
    • June
    • N. Bruno and S. Chaudhuri, "Exploiting Statistics on Query Expressions for Optimization," Proc. ACM SIGMOD Int'l Conf., pp. 263-274, June 2002.
    • (2002) Proc. ACM SIGMOD Int'l Conf. , pp. 263-274
    • Bruno, N.1    Chaudhuri, S.2
  • 9
    • 0002652285 scopus 로고    scopus 로고
    • A maximum entropy approach to natural language modelling
    • May
    • A. Berger, S. Pietra, and V. Pietra, "A Maximum Entropy Approach to Natural Language Modelling," Computational Linguistics, vol. 22, no. 1, May 1996.
    • (1996) Computational Linguistics , vol.22 , Issue.1
    • Berger, A.1    Pietra, S.2    Pietra, V.3
  • 10
    • 0001853449 scopus 로고    scopus 로고
    • Quasi-cubes: Exploiting approximations in multidimensional databases
    • D. Barbará and M. Sullivan, "Quasi-Cubes: Exploiting Approximations in Multidimensional Databases," ACM SIGMOD Record, vol. 26, no. 3, pp. 12-17, 1997.
    • (1997) ACM SIGMOD Record , vol.26 , Issue.3 , pp. 12-17
    • Barbará, D.1    Sullivan, M.2
  • 11
    • 5444255998 scopus 로고    scopus 로고
    • Using loglinear models to compress datacubes
    • June
    • D. Barbara and X. Wu, "Using Loglinear Models to Compress Datacubes," Web-Age Information Management, pp. 311-322, June 2000.
    • (2000) Web-age Information Management , pp. 311-322
    • Barbara, D.1    Wu, X.2
  • 13
    • 0004014502 scopus 로고    scopus 로고
    • A gaussian prior for smoothing maximum entropy models
    • Carnegie Mellon Univ., Feb.
    • S.F. Chen and R. Rosenfeld, "A Gaussian Prior for Smoothing Maximum Entropy Models," Technical Report CMU-CS-99-108, Carnegie Mellon Univ., Feb. 1999.
    • (1999) Technical Report , vol.CMU-CS-99-108
    • Chen, S.F.1    Rosenfeld, R.2
  • 15
    • 0000695960 scopus 로고
    • On a least square adjustment of a sampled frequency table when the expected marginal totals are known
    • W.E. Deming and F.F. Stephan, "On a Least Square Adjustment of a Sampled Frequency Table When the Expected Marginal Totals Are Known," Annals of Math. Statistics, vol. 11, pp. 427-444, 1940.
    • (1940) Annals of Math. Statistics , vol.11 , pp. 427-444
    • Deming, W.E.1    Stephan, F.F.2
  • 17
    • 0029752925 scopus 로고    scopus 로고
    • Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals
    • Mar.
    • J. Gray, A. Bosworth, A. Layman, and H. Pirahesh, "Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals." Proc. Int'l Conf. Data Eng., pp. 152-159, Mar. 1996.
    • (1996) Proc. Int'l Conf. Data Eng. , pp. 152-159
    • Gray, J.1    Bosworth, A.2    Layman, A.3    Pirahesh, H.4
  • 18
    • 84976743126 scopus 로고
    • Balancing histogram optimality and practicality for query result size estimation
    • June
    • Y. Ioannidis and V. Poosala, "Balancing Histogram Optimality and Practicality for Query Result Size Estimation," Proc. ACM SIGMOD, pp. 233-244, June 1995.
    • (1995) Proc. ACM SIGMOD , pp. 233-244
    • Ioannidis, Y.1    Poosala, V.2
  • 20
    • 0347087676 scopus 로고    scopus 로고
    • Snakes and sandwiches: Optimal clustering strategies for a data ware-house
    • June
    • H.V. Jagadish, L.V.S. Lakshmanan, and D. Srivastava, "Snakes and Sandwiches: Optimal Clustering Strategies for a Data Ware-house," Proc. ACM SIGMOD, pp. 37-48, June 1999.
    • (1999) Proc. ACM SIGMOD , pp. 37-48
    • Jagadish, H.V.1    Lakshmanan, L.V.S.2    Srivastava, D.3
  • 23
    • 0002948319 scopus 로고    scopus 로고
    • Algorithms for mining distance-based outliers in large datasets
    • Aug.
    • E.M. Knorr and R.T. Ng, "Algorithms for Mining Distance-Based Outliers in Large Datasets," Proc. Int'l Conf. Very Large Data Bases, pp. 392-403, Aug. 1998.
    • (1998) Proc. Int'l Conf. Very Large Data Bases , pp. 392-403
    • Knorr, E.M.1    Ng, R.T.2
  • 24
    • 0012905555 scopus 로고    scopus 로고
    • Finding intensional knowledge of distance-based outliers
    • Sept.
    • E.M. Knorr and R.T. Ng, "Finding Intensional Knowledge of Distance-Based Outliers," Proc. Int'l Conf. Very Large Data Bases, pp. 211-222, Sept. 1999.
    • (1999) Proc. Int'l Conf. Very Large Data Bases , pp. 211-222
    • Knorr, E.M.1    Ng, R.T.2
  • 27
    • 0027874192 scopus 로고
    • A universal scheme approach to statistical databases containing homogeneous summary tables
    • Dec.
    • F. Malvesruto, "A Universal Scheme Approach to Statistical Databases Containing Homogeneous Summary Tables," ACM Trans. Database Systems, vol. 18, no. 4, pp. 678-708, Dec. 1993.
    • (1993) ACM Trans. Database Systems , vol.18 , Issue.4 , pp. 678-708
    • Malvesruto, F.1
  • 29
    • 0242698558 scopus 로고    scopus 로고
    • Random sampling techniques for space efficient online computation of order statistics of large datasets
    • June
    • G.S. Manku, S. Rajagopalan, and B.G. Lindsay, "Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Datasets," Proc. ACM SIGMOD, pp. 251-262, June 1999.
    • (1999) Proc. ACM SIGMOD , pp. 251-262
    • Manku, G.S.1    Rajagopalan, S.2    Lindsay, B.G.3
  • 30
    • 0030157406 scopus 로고    scopus 로고
    • Improved histograms for selectivity estimation of range predicates
    • June
    • V. Poosala, Y. Ioannidis, P. Haas, and E. Shekita, "Improved Histograms for Selectivity Estimation of Range Predicates," Proc. ACM SIGMOD, pp. 294-305, June 1996.
    • (1996) Proc. ACM SIGMOD , pp. 294-305
    • Poosala, V.1    Ioannidis, Y.2    Haas, P.3    Shekita, E.4
  • 32
    • 0039845384 scopus 로고    scopus 로고
    • Efficient algorithms for mining ouliers from large data sets
    • May
    • S. Ramaswamy, R. Rastogi, and K. Shim, "Efficient Algorithms for Mining Ouliers from Large Data Sets" Proc. ACM SIGMOD, pp. 427-438, May 2000.
    • (2000) Proc. ACM SIGMOD , pp. 427-438
    • Ramaswamy, S.1    Rastogi, R.2    Shim, K.3
  • 34
    • 34250647666 scopus 로고    scopus 로고
    • User-adaptive exploration of multidimensional data
    • Sept.
    • S. Sarawagi, "User-Adaptive Exploration of Multidimensional Data," Proc. Int'l Conf. Very Large Data Bases, pp. 307-316, Sept. 2000.
    • (2000) Proc. Int'l Conf. Very Large Data Bases , pp. 307-316
    • Sarawagi, S.1


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