메뉴 건너뛰기




Volumn , Issue , 2010, Pages 675-686

Lineage processing over correlated probabilistic databases

Author keywords

conjunctive queries; indexing; junction trees; lineage; probabilistic databases

Indexed keywords

ATTRIBUTE UNCERTAINTY; COMPLEX CORRELATION; CONJUNCTIVE QUERIES; EXACT COMPUTATIONS; EXPERIMENTAL STUDIES; MARKOV SEQUENCE; MESSAGE PASSING ALGORITHM; MONTE CARLO ALGORITHMS; OPTIMIZATION TECHNIQUES; P-COMPLETE; PROBABILISTIC DATABASE; TREE-WIDTH;

EID: 77954712915     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807241     Document Type: Conference Paper
Times cited : (29)

References (30)
  • 1
    • 52649102939 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 ICDE, 2008.
    • (2008) ICDE
    • Antova, L.1    Jansen, T.2    Koch, C.3    Olteanu, D.4
  • 2
    • 85056103572 scopus 로고    scopus 로고
    • Efficient principled learning of thin junction trees
    • A. Chechetka and C. Guestrin. Efficient principled learning of thin junction trees. In NIPS, 2007.
    • (2007) NIPS
    • Chechetka, A.1    Guestrin, C.2
  • 3
    • 1142291577 scopus 로고    scopus 로고
    • Evaluating probabilistic queries over imprecise data
    • R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.
    • (2003) SIGMOD
    • Cheng, R.1    Kalashnikov, D.V.2    Prabhakar, S.3
  • 4
    • 77954696033 scopus 로고    scopus 로고
    • An edge deletion semantics for belief propagation and its practical impact on approximation quality
    • A. Choi and A. Darwiche. An edge deletion semantics for belief propagation and its practical impact on approximation quality. In AAAI, 2006.
    • (2006) AAAI
    • Choi, A.1    Darwiche, A.2
  • 7
    • 77954579212 scopus 로고    scopus 로고
    • A web of concepts
    • N. Dalvi et al. A web of concepts. In PODS, 2009.
    • (2009) PODS
    • Dalvi, N.1
  • 8
    • 84938961099 scopus 로고    scopus 로고
    • Efficient query evaluation on probabilistic databases
    • N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004.
    • (2004) VLDB
    • Dalvi, N.N.1    Suciu, D.2
  • 9
    • 85011051649 scopus 로고    scopus 로고
    • Data integration with uncertainty
    • X. L. Dong, A. Y. Halevy, and C. Yu. Data integration with uncertainty. In VLDB, 2007.
    • (2007) VLDB
    • Dong, X.L.1    Halevy, A.Y.2    Yu, C.3
  • 10
    • 0002012853 scopus 로고
    • Optimal junction trees
    • J. Finn and J. Frank. Optimal junction trees. In UAI, 1994.
    • (1994) UAI
    • Finn, J.1    Frank, J.2
  • 11
    • 0013496420 scopus 로고
    • Stochastic relaxation, gibbs distributions, and the bayesian restoration of images
    • S. Geman and D. Geman. Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. IEEE PAMI, 1984.
    • (1984) IEEE PAMI
    • Geman, S.1    Geman, D.2
  • 12
    • 0034855429 scopus 로고    scopus 로고
    • Factoring and recognition of read-once functions using cographs and normality
    • M. C. Golumbic, A. Mintz, and U. Rotics. Factoring and recognition of read-once functions using cographs and normality. In DAC, 2001.
    • (2001) DAC
    • Golumbic, M.C.1    Mintz, A.2    Rotics, U.3
  • 13
    • 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
  • 16
    • 52649107508 scopus 로고    scopus 로고
    • Online filtering, smoothing and probabilistic modeling of streaming data
    • B. Kanagal and A. Deshpande. Online filtering, smoothing and probabilistic modeling of streaming data. In ICDE, 2008.
    • (2008) ICDE
    • Kanagal, B.1    Deshpande, A.2
  • 17
    • 67649657660 scopus 로고    scopus 로고
    • Efficient query evaluation over temporally correlated probabilistic streams
    • B. Kanagal and A. Deshpande. Efficient query evaluation over temporally correlated probabilistic streams. In ICDE, 2009.
    • (2009) ICDE
    • Kanagal, B.1    Deshpande, A.2
  • 18
    • 70849101223 scopus 로고    scopus 로고
    • Indexing correlated probabilistic databases
    • B. Kanagal and A. Deshpande. Indexing correlated probabilistic databases. In SIGMOD, 2009.
    • (2009) SIGMOD
    • Kanagal, B.1    Deshpande, A.2
  • 19
    • 5844407787 scopus 로고
    • Combining exact inference and gibbs sampling in junction trees
    • U. Kjærulff. Hugs: Combining exact inference and gibbs sampling in junction trees. In UAI, 1995.
    • (1995) UAI
    • Kjærulff Hugs, U.1
  • 22
    • 84880794510 scopus 로고    scopus 로고
    • Thin junction tree filters for simultaneous localization and mapping
    • M. A. Paskin. Thin junction tree filters for simultaneous localization and mapping. In IJCAI, 2003.
    • (2003) IJCAI
    • Paskin, M.A.1
  • 24
  • 25
    • 79952758877 scopus 로고    scopus 로고
    • Approximate lineage for probabilistic databases
    • C. Ré and D. Suciu. Approximate lineage for probabilistic databases. PVLDB, 2008.
    • (2008) PVLDB
    • Ré, C.1    Suciu, D.2
  • 27
    • 52649122656 scopus 로고    scopus 로고
    • Exploiting lineage for confidence computation in uncertain and probabilistic databases
    • A. D. Sarma, M. Theobald, and J. Widom. Exploiting lineage for confidence computation in uncertain and probabilistic databases. In ICDE, 2008.
    • (2008) ICDE
    • Sarma, A.D.1    Theobald, M.2    Widom, J.3
  • 28
    • 34548772330 scopus 로고    scopus 로고
    • Representing and querying correlated tuples in probabilistic databases
    • P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. In ICDE, 2007.
    • (2007) ICDE
    • Sen, P.1    Deshpande, A.2
  • 29
    • 70349814693 scopus 로고    scopus 로고
    • Exploiting shared correlations in probabilistic databases
    • P. Sen, A. Deshpande, and L. Getoor. Exploiting shared correlations in probabilistic databases. In VLDB, 2008.
    • (2008) VLDB
    • Sen, P.1    Deshpande, A.2    Getoor, L.3
  • 30
    • 77954717404 scopus 로고    scopus 로고
    • The RFID Ecosystem, University of Washington. http://rfid.cs.washington. edu/.
    • The RFID Ecosystem


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