메뉴 건너뛰기




Volumn , Issue , 2009, Pages 293-304

Histograms and wavelets on probabilistic data

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE QUERY PROCESSING; CORE PROBLEMS; DATA DISTRIBUTION; DATABASE MANAGEMENT; DETERMINISTIC DOMAINS; EFFICIENT ALGORITHM; ERROR METRIC; ERROR METRICS; HAAR WAVELETS; HUMAN UNDERSTANDING; INTERACTIVE DATA EXPLORATION; OPTIMAL SIZE; PROBABILISTIC DATA; PROBABILISTIC DATABASE; PROBABILISTIC RELATIONS; REDUCTION TECHNIQUES; UNCERTAIN DATA; UNCERTAIN INFORMATIONS; WAVELET COEFFICIENTS;

EID: 67649661847     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.74     Document Type: Conference Paper
Times cited : (21)

References (28)
  • 1
    • 84938961099 scopus 로고    scopus 로고
    • Efficient query evaluation on probabilistic databases
    • N. Dalvi and D. Suciu, "Efficient query evaluation on probabilistic databases," in VLDB, 2004.
    • (2004) VLDB
    • Dalvi, N.1    Suciu, D.2
  • 2
    • 33750901630 scopus 로고    scopus 로고
    • Towards correcting input data errors probabilistically using integrity constraints
    • N. Khoussainova, M. Balazinska, and D. Suciu, "Towards correcting input data errors probabilistically using integrity constraints," in ACM MobiDE Workshop, 2006.
    • (2006) ACM MobiDE Workshop
    • Khoussainova, N.1    Balazinska, M.2    Suciu, D.3
  • 3
    • 67649639242 scopus 로고    scopus 로고
    • Fast and simple relational processing of uncertain data
    • L. Antova, T. Jansen, C. Koch, and D. Olteanu, "Fast and simple relational processing of uncertain data," in IEEE ICDE, 2008.
    • (2008) IEEE ICDE
    • Antova, L.1    Jansen, T.2    Koch, C.3    Olteanu, D.4
  • 6
    • 84944315044 scopus 로고    scopus 로고
    • Approximate query processing: Taming the terabytes
    • M. Garofalakis and P. B. Gibbons, "Approximate query processing: Taming the terabytes," in VLDB, 2001.
    • (2001) VLDB
    • Garofalakis, M.1    Gibbons, P.B.2
  • 7
    • 85012195470 scopus 로고    scopus 로고
    • The history of histograms (abridged)
    • Y. E. Ioannidis, "The history of histograms (abridged)," in VLDB, 2003.
    • (2003) VLDB
    • Ioannidis, Y.E.1
  • 9
    • 84976743126 scopus 로고
    • Balancing histogram optimality and practicality for query result size estimation
    • Y. E. Ioannidis and V. Poosala, "Balancing histogram optimality and practicality for query result size estimation," in ACM SIGMOD, 1995, pp. 233-244.
    • (1995) ACM SIGMOD , pp. 233-244
    • Ioannidis, Y.E.1    Poosala, V.2
  • 10
    • 29844439289 scopus 로고    scopus 로고
    • Foundations of probabilistic answers to queries
    • D. Suciu and N. N. Dalvi, "Foundations of probabilistic answers to queries," in ACM SIGMOD, 2005.
    • (2005) ACM SIGMOD
    • Suciu, D.1    Dalvi, N.N.2
  • 11
    • 67649641391 scopus 로고    scopus 로고
    • Management of probabilistic data: Foundations and challenges
    • N. N. Dalvi and D. Suciu, "Management of probabilistic data: foundations and challenges," in ACM PODS, 2007.
    • (2007) ACM PODS
    • Dalvi, N.N.1    Suciu, D.2
  • 13
    • 35448935668 scopus 로고    scopus 로고
    • Sketching probabilistic data streams
    • G. Cormode and M. Garofalakis, "Sketching probabilistic data streams," in ACM SIGMOD, 2007.
    • (2007) ACM SIGMOD
    • Cormode, G.1    Garofalakis, M.2
  • 14
    • 84969256729 scopus 로고    scopus 로고
    • Efficient aggregation algorithms for probabilistic data
    • T. S. Jayram, S. Kale, and E. Vee, "Efficient aggregation algorithms for probabilistic data," in ACM-SIAM SODA, 2007.
    • (2007) ACM-SIAM SODA
    • Jayram, T.S.1    Kale, S.2    Vee, E.3
  • 15
    • 67649655706 scopus 로고    scopus 로고
    • Estimating statistical aggregates on probabilistic data streams
    • T. S. Jayram, A. McGregor, S. Muthukrishnan, and E. Vee, "Estimating statistical aggregates on probabilistic data streams," in ACM PODS, 2007.
    • (2007) ACM PODS
    • Jayram, T.S.1    McGregor, A.2    Muthukrishnan, S.3    Vee, E.4
  • 16
    • 67649655707 scopus 로고    scopus 로고
    • Approximation algorithms for clustering uncertain data
    • G. Cormode and A. McGregor, "Approximation algorithms for clustering uncertain data," in ACM PODS, 2008.
    • (2008) ACM PODS
    • Cormode, G.1    McGregor, A.2
  • 17
    • 57149143965 scopus 로고    scopus 로고
    • Finding frequent items in probabilistic data
    • Q. Zhang, F. Li, and K. Yi, "Finding frequent items in probabilistic data," in ACM SIGMOD, 2008.
    • (2008) ACM SIGMOD
    • Zhang, Q.1    Li, F.2    Yi, K.3
  • 18
    • 67649659791 scopus 로고    scopus 로고
    • Topics in massive data summarization,
    • Ph.D. dissertation, University of Michigan, Aug
    • X. Zheng, "Topics in massive data summarization," Ph.D. dissertation, University of Michigan, Aug. 2008.
    • (2008)
    • Zheng, X.1
  • 21
    • 34548704911 scopus 로고    scopus 로고
    • REHIST: Relative error histogram construction algorithms
    • S. Guha, K. Shim, and J. Woo, "REHIST: Relative error histogram construction algorithms," in VLDB, 2004.
    • (2004) VLDB
    • Guha, S.1    Shim, K.2    Woo, J.3
  • 23
    • 32344432100 scopus 로고    scopus 로고
    • Wavelet synopsis for data streams: Minimizing non-euclidean error
    • S. Guha and B. Harb, "Wavelet synopsis for data streams: minimizing non-euclidean error," in ACM SIGKDD, 2005.
    • (2005) ACM SIGKDD
    • Guha, S.1    Harb, B.2
  • 24
    • 0347087667 scopus 로고    scopus 로고
    • Approximate computation of multidimensional aggregates of sparse data using wavelets
    • J. S. Vitter and M. Wang, "Approximate computation of multidimensional aggregates of sparse data using wavelets," in ACM SIGMOD, 1999.
    • (1999) ACM SIGMOD
    • Vitter, J.S.1    Wang, M.2
  • 27
    • 33745187544 scopus 로고    scopus 로고
    • Approximation and streaming algorithms for histogram construction problems
    • -, "Approximation and streaming algorithms for histogram construction problems," ACM Transactions on Database Systems, vol. 31, no. 1, pp. 396-438, 2006.
    • (2006) ACM Transactions on Database Systems , vol.31 , Issue.1 , pp. 396-438
    • Guha, S.1    Koudas, N.2    Shim, K.3
  • 28
    • 34249794597 scopus 로고    scopus 로고
    • A note on linear time algorithms for maximum error histograms
    • S. Guha and K. Shim, "A note on linear time algorithms for maximum error histograms," IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 7, pp. 993-997, 2007.
    • (2007) IEEE Transactions on Knowledge and Data Engineering , vol.19 , Issue.7 , pp. 993-997
    • Guha, S.1    Shim, K.2


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