메뉴 건너뛰기




Volumn , Issue , 2013, Pages 134-145

Cleaning uncertain data for top-k queries

Author keywords

[No Author keywords available]

Indexed keywords

CLEANING OPERATIONS; DATA UNCERTAINTY; EMERGING APPLICATIONS; GREEDY ALGORITHMS; OPTIMAL SOLUTIONS; POSSIBLE WORLD SEMANTICS; PROBABILISTIC DATABASE; TEMPERATURE VALUES;

EID: 84881328468     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2013.6544820     Document Type: Conference Paper
Times cited : (32)

References (34)
  • 3
    • 36148994784 scopus 로고    scopus 로고
    • Efficient query evaluation on probabilistic databases
    • N. Dalvi and D. Suciu, "Efficient query evaluation on probabilistic databases," The VLDB Journal, 2007.
    • (2007) The VLDB Journal
    • Dalvi, N.1    Suciu, D.2
  • 4
  • 5
    • 85027780074 scopus 로고    scopus 로고
    • Creating probabilistic databases from information extraction models
    • R. Gupta and S. Sarawagi, "Creating probabilistic databases from information extraction models," in VLDB, 2006.
    • (2006) VLDB
    • Gupta, R.1    Sarawagi, S.2
  • 9
    • 70849120983 scopus 로고    scopus 로고
    • Maybms: A probabilistic database management system
    • J. Huang, L. Antova, C. Koch, and D. Olteanu, "Maybms: a probabilistic database management system," in SIGMOD, 2009.
    • (2009) SIGMOD
    • Huang, J.1    Antova, L.2    Koch, C.3    Olteanu, D.4
  • 10
    • 34548724406 scopus 로고    scopus 로고
    • Top-k query processing in uncertain databases
    • M. A. Soliman, I. F. Ilyas, and K. C.-C. Chang, "Top-k query processing in uncertain databases," in ICDE, 2007.
    • (2007) ICDE
    • Soliman, M.A.1    Ilyas, I.F.2    Chang, K.C.-C.3
  • 11
    • 57149131668 scopus 로고    scopus 로고
    • Ranking queries on uncertain data: A probabilistic threshold approach
    • M. Hua, J. Pei, W. Zhang, and X. Lin, "Ranking queries on uncertain data: a probabilistic threshold approach," in SIGMOD, 2008.
    • (2008) SIGMOD
    • Hua, M.1    Pei, J.2    Zhang, W.3    Lin, X.4
  • 12
    • 53349136541 scopus 로고    scopus 로고
    • Efficient processing of top-k queries in uncertain databases with x-relations
    • K. Yi, F. Li, G. Kollios, and D. Srivastava, "Efficient processing of top-k queries in uncertain databases with x-relations," TKDE, 2008.
    • (2008) TKDE
    • Yi, K.1    Li, F.2    Kollios, G.3    Srivastava, D.4
  • 13
    • 50249105848 scopus 로고    scopus 로고
    • On the semantics and evaluation of top-k queries in probabilistic databases
    • X. Zhang and J. Chomicki, "On the semantics and evaluation of top-k queries in probabilistic databases," in ICDE Workshop, 2008.
    • ICDE Workshop, 2008
    • Zhang, X.1    Chomicki, J.2
  • 14
    • 67649643456 scopus 로고    scopus 로고
    • Semantics of ranking queries for probabilistic data and expected ranks
    • G. Cormode, F. Li, and K. Yi, "Semantics of ranking queries for probabilistic data and expected ranks," in ICDE, 2009.
    • (2009) ICDE
    • Cormode, G.1    Li, F.2    Yi, K.3
  • 15
  • 19
    • 43349083065 scopus 로고    scopus 로고
    • Probabilistic ranked queries in uncertain databases
    • X. Lian and L. Chen, "Probabilistic ranked queries in uncertain databases," in EDBT08.
    • EDBT08
    • Lian, X.1    Chen, L.2
  • 20
    • 70349804722 scopus 로고    scopus 로고
    • Qualitative effects of knowledge rules and user feedback in probabilistic data integration
    • M. van Keulen and A. de Keijzer, "Qualitative effects of knowledge rules and user feedback in probabilistic data integration," The VLDB Journal, 2009.
    • (2009) The VLDB Journal
    • Van Keulen, M.1    De Keijzer, A.2
  • 21
    • 79959979272 scopus 로고    scopus 로고
    • Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
    • B. Kanagal, J. Li, and A. Deshpande, "Sensitivity analysis and explanations for robust query evaluation in probabilistic databases," in SIGMOD, 2011.
    • (2011) SIGMOD
    • Kanagal, B.1    Li, J.2    Deshpande, A.3
  • 23
    • 84859203466 scopus 로고    scopus 로고
    • Quality-aware probing of uncertain data with resource constraints
    • J. Chen and R. Cheng, "Quality-aware probing of uncertain data with resource constraints," in SSDBM, 2008.
    • (2008) SSDBM
    • Chen, J.1    Cheng, R.2
  • 24
    • 33644501764 scopus 로고    scopus 로고
    • Cost-efficient processing of min/max queries over distributed sensors with uncertainty
    • Z. Liu, K. C. Sia, and J. Cho, "Cost-efficient processing of min/max queries over distributed sensors with uncertainty," in SAD, 2005.
    • (2005) SAD
    • Liu, Z.1    Sia, K.C.2    Cho, J.3
  • 25
    • 1142291592 scopus 로고    scopus 로고
    • Adaptive filters for continuous queries over distributed data streams
    • C. Olston, J. Jiang, and J. Widom, "Adaptive filters for continuous queries over distributed data streams," in SIGMOD, 2003.
    • (2003) SIGMOD
    • Olston, C.1    Jiang, J.2    Widom, J.3
  • 27
    • 33749588820 scopus 로고    scopus 로고
    • Clean answers over dirty databases: A probabilistic approach
    • P. Andritsos, A. Fuxman, and R. J. Miller, "Clean answers over dirty databases: A probabilistic approach," in ICDE, 2006.
    • (2006) ICDE
    • Andritsos, P.1    Fuxman, A.2    Miller, R.J.3
  • 29
    • 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 MobiDE, 2006.
    • (2006) MobiDE
    • Khoussainova, N.1    Balazinska, M.2    Suciu, D.3
  • 31
    • 84881348682 scopus 로고    scopus 로고
    • http://www.cs.hku.hk/research/techreps/document/TR-2012-11.pdf.
  • 34
    • 21244451599 scopus 로고    scopus 로고
    • The average behaviour of greedy algorithms for the knapsack problem: General distributions
    • G. Diubin and A. Korbut, "The average behaviour of greedy algorithms for the knapsack problem: general distributions," Mathematical Methods of Operations Research, 2003.
    • (2003) Mathematical Methods of Operations Research
    • Diubin, G.1    Korbut, A.2


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