메뉴 건너뛰기




Volumn , Issue , 2008, Pages 119-128

Query evaluation with soft-key constraints

Author keywords

Probabilistic databases; Query processing

Indexed keywords

#P-HARD; CONJUNCTIVE QUERIES; DATA SETS; KEY CONSTRAINTS; MARKOV NETWORKS; PROBABILISTIC DATABASES; QUERY EVALUATIONS;

EID: 57349108073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376916.1376934     Document Type: Conference Paper
Times cited : (18)

References (28)
  • 1
    • 33749588820 scopus 로고    scopus 로고
    • P. Andritsos, A. Fuxman, and R. J. Miller. Clean answers over dirty databases: A probabilistic approach. In ICDE '06, page 30, Washington, DC, USA, 2006. IEEE Computer Society.
    • P. Andritsos, A. Fuxman, and R. J. Miller. Clean answers over dirty databases: A probabilistic approach. In ICDE '06, page 30, Washington, DC, USA, 2006. IEEE Computer Society.
  • 2
    • 34548727323 scopus 로고    scopus 로고
    • MayBMS: Managing incomplete information with probabilistic world-set decompositions
    • L. Antova, C Koch, and D. Olteanu. MayBMS: Managing incomplete information with probabilistic world-set decompositions. In ICDE, 2007.
    • (2007) ICDE
    • Antova, L.1    Koch, C.2    Olteanu, D.3
  • 4
    • 84925001453 scopus 로고    scopus 로고
    • ULDBs: Databases with uncertainty and lineage
    • O. Benjelloun, A. D. Sarma, A. Y. Halevy, and J. Widom. ULDBs: Databases with uncertainty and lineage. In VLDB, pages 953-964, 2006.
    • (2006) VLDB , pp. 953-964
    • Benjelloun, O.1    Sarma, A.D.2    Halevy, A.Y.3    Widom, J.4
  • 6
    • 0001902823 scopus 로고
    • The theory of probabilistic databases
    • R. Cavallo and M. Pittarelli. The theory of probabilistic databases. In Proceedings of VLDB, pages 71-81, 1987.
    • (1987) Proceedings of VLDB , pp. 71-81
    • Cavallo, R.1    Pittarelli, M.2
  • 7
    • 0003687180 scopus 로고    scopus 로고
    • R. Cowell, P. Dawid, S. Lauritzen, and D. Spiegelhalter, editors, Springer
    • R. Cowell, P. Dawid, S. Lauritzen, and D. Spiegelhalter, editors. Probabilistic Networks and Expert Systems. Springer, 1999.
    • (1999) Probabilistic Networks and Expert Systems
  • 8
    • 35448953431 scopus 로고    scopus 로고
    • The dichotomy of conjunctive queries on probabilistic structures
    • N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, pages 293-302, 2007.
    • (2007) PODS , pp. 293-302
    • Dalvi, N.1    Suciu, D.2
  • 9
    • 35448996115 scopus 로고    scopus 로고
    • Management of probabilistic data: Foundations and challenges
    • New York, NY, USA, ACM Press
    • N. Dalvi and D. Suciu. Management of probabilistic data: foundations and challenges. In PODS '07, pages 1-12, New York, NY, USA, 2007. ACM Press.
    • (2007) PODS '07 , pp. 1-12
    • Dalvi, N.1    Suciu, D.2
  • 10
    • 84938961099 scopus 로고    scopus 로고
    • Efficient query evaluation on probabilistic databases
    • N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB, 2004.
    • (2004) VLDB
    • Dalvi, N.N.1    Suciu, D.2
  • 11
    • 35448996115 scopus 로고    scopus 로고
    • Management of probabilistic data: Foundations and challenges
    • N. N. Dalvi and D. Suciu. Management of probabilistic data: foundations and challenges. In PODS, 2007.
    • (2007) PODS
    • Dalvi, N.N.1    Suciu, D.2
  • 12
    • 0030836948 scopus 로고    scopus 로고
    • A probabilistic relational algebra for the integration of information retrieval and database systems
    • N. Fuhr and T. Roelleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inf. Syst., 15(l):32-66, 1997.
    • (1997) ACM Trans. Inf. Syst , vol.15 , Issue.L , pp. 32-66
    • Fuhr, N.1    Roelleke, T.2
  • 13
    • 0027709748 scopus 로고
    • A probabilistic relational model for the integration of IR and databases
    • Fuhr, Norbert. A probabilistic relational model for the integration of IR and databases. In SIGIR, 1993.
    • (1993) SIGIR
    • Fuhr, N.1
  • 14
    • 36849083106 scopus 로고    scopus 로고
    • An introduction to probabilistic graphical models for relational data
    • march
    • L. Getoor. An introduction to probabilistic graphical models for relational data. Data Engineering Bulletin, 29(1), march 2006.
    • (2006) Data Engineering Bulletin , vol.29 , Issue.1
    • Getoor, L.1
  • 15
    • 57349155750 scopus 로고    scopus 로고
    • Efficient inference with cardinality-based clique potentials
    • ACM
    • R. Gupta, A. Diwan, and S. Sarawagi. Efficient inference with cardinality-based clique potentials. In ICML. ACM, 2007.
    • (2007) ICML
    • Gupta, R.1    Diwan, A.2    Sarawagi, S.3
  • 16
    • 3142708793 scopus 로고    scopus 로고
    • Cords: Automatic discovery of correlations and soft functional dependencies
    • I. Ilyas, V. Markl, P. Haas, P. Brown, and A. Aboulnaga. Cords: Automatic discovery of correlations and soft functional dependencies. In SIGMOD, pages 647-658, 2004.
    • (2004) SIGMOD , pp. 647-658
    • Ilyas, I.1    Markl, V.2    Haas, P.3    Brown, P.4    Aboulnaga, A.5
  • 18
    • 36348979272 scopus 로고    scopus 로고
    • Joint inference in information extraction
    • H. Poon and P. Domingos. Joint inference in information extraction. In AAAI, pages 913-918, 2007.
    • (2007) AAAI , pp. 913-918
    • Poon, H.1    Domingos, P.2
  • 19
    • 34548714632 scopus 로고    scopus 로고
    • Efficient Top-k query evaluation on probabilistic data
    • C. Re, N. Dalvi, and D. Suciu. Efficient Top-k query evaluation on probabilistic data. In ICDE, 2007.
    • (2007) ICDE
    • Re, C.1    Dalvi, N.2    Suciu, D.3
  • 21
    • 57349142496 scopus 로고    scopus 로고
    • Efficient evaluation of having queries on a probabilistic database
    • C. Re and D.Suciu. Efficient evaluation of having queries on a probabilistic database. In Proceedings of DBPL, 2007.
    • (2007) Proceedings of DBPL
    • Re, C.1    Suciu, D.2
  • 22
    • 32044466073 scopus 로고    scopus 로고
    • Markov logic networks.
    • M. Richardson and P. Domingos. Markov logic networks. Mach Learn., 62(1 -2): 107-136, 2006.
    • (2006) Mach Learn , vol.62 , Issue.1 -2 , pp. 107-136
    • Richardson, M.1    Domingos, P.2
  • 24
    • 34548772330 scopus 로고    scopus 로고
    • Representing and querying correlated tuples in probabilistic databases
    • IEEE
    • P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. In ICDE. IEEE, 2007.
    • (2007) ICDE
    • Sen, P.1    Deshpande, A.2
  • 25
    • 29344435802 scopus 로고    scopus 로고
    • Constraint-based entity matching
    • W. Shen, X. Li, and A. Doan. Constraint-based entity matching. In AAAI, pages 862-867, 2005.
    • (2005) AAAI , pp. 862-867
    • Shen, W.1    Li, X.2    Doan, A.3
  • 26
    • 84878044770 scopus 로고    scopus 로고
    • Entity resolution with markov logic
    • P. Singla and P. Domingos. Entity resolution with markov logic. In ICDM, pages 572-582, 2006.
    • (2006) ICDM , pp. 572-582
    • Singla, P.1    Domingos, P.2
  • 27
    • 33845267758 scopus 로고    scopus 로고
    • Preference-driven querying of inconsistent relational databases
    • S. Staworko, J. Chomicki, and J. Marcinkowski. Preference-driven querying of inconsistent relational databases. In EDBT Workshops, pages 318-335, 2006.
    • (2006) EDBT Workshops , pp. 318-335
    • Staworko, S.1    Chomicki, J.2    Marcinkowski, J.3
  • 28
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
    • (1979) SIAM Journal on Computing , vol.8 , Issue.3 , pp. 410-421
    • Valiant, L.G.1


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