메뉴 건너뛰기




Volumn , Issue , 2007, Pages 596-605

Representing and querying correlated tuples in probabilistic databases

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS; OPTIMIZATION; PROBABILISTIC LOGICS; QUERY PROCESSING; SEMANTICS;

EID: 34548772330     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367905     Document Type: Conference Paper
Times cited : (184)

References (38)
  • 2
    • 0026941826 scopus 로고    scopus 로고
    • D. Barbara, H. Garcia-Molina, and D. Porter. The management of probabilistic data. In KDE, 1992.
    • D. Barbara, H. Garcia-Molina, and D. Porter. The management of probabilistic data. In KDE, 1992.
  • 4
    • 14744272624 scopus 로고    scopus 로고
    • About projection-selection-join queries addressed to possibilistic relational, databases
    • P. Bosc and O. Pivert. About projection-selection-join queries addressed to possibilistic relational, databases. In IEEE Tran. on Fuzzy Systems, 2005.
    • (2005) IEEE Tran. on Fuzzy Systems
    • Bosc, P.1    Pivert, O.2
  • 6
    • 0001902823 scopus 로고
    • The theory of probabilistic databases
    • R. Cavallo and M. Pittarelli. The theory of probabilistic databases. In VLDB, 1987.
    • (1987) VLDB
    • Cavallo, R.1    Pittarelli, M.2
  • 7
    • 1142291577 scopus 로고    scopus 로고
    • Evaluating probabilistic queries over imprecise data
    • R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.
    • (2003) SIGMOD
    • Cheng, R.1    Kalashnikov, D.2    Prabhakar, S.3
  • 8
    • 34548782732 scopus 로고    scopus 로고
    • Handling uncertainty and ignorance in databases: A rule to combine dependent data
    • S. Choenni, H. E. Blok, and E. Leertouwer. Handling uncertainty and ignorance in databases: A rule to combine dependent data. In Database Systems for Adv. Apps., 2006.
    • (2006) Database Systems for Adv. Apps
    • Choenni, S.1    Blok, H.E.2    Leertouwer, E.3
  • 9
    • 0025401005 scopus 로고
    • The computational complexity of probabilistic inference using Bayesian belief networks
    • G. F. Cooper. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 1990.
    • (1990) Artificial Intelligence
    • Cooper, G.F.1
  • 11
    • 0027560587 scopus 로고
    • Approximate probabilistic reasoning in Bayesian belief networks is NP-hard
    • P. Dagum and M. Luby. Approximate probabilistic reasoning in Bayesian belief networks is NP-hard. Artificial Intelligence, 1993.
    • (1993) Artificial Intelligence
    • Dagum, P.1    Luby, M.2
  • 12
    • 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
  • 13
    • 34548725036 scopus 로고    scopus 로고
    • Query answering using statistics and probabilistic views
    • N. Dalvi and D. Suciu. Query answering using statistics and probabilistic views. In VLDB, 2005.
    • (2005) VLDB
    • Dalvi, N.1    Suciu, D.2
  • 14
    • 33749596546 scopus 로고    scopus 로고
    • A. Das S arma, O. Benjelloun, A. Halevy, and J. Widom. Working models for uncertain data. In ICDE, 2006.
    • A. Das S arma, O. Benjelloun, A. Halevy, and J. Widom. Working models for uncertain data. In ICDE, 2006.
  • 15
    • 34548791788 scopus 로고    scopus 로고
    • R. Dechter. Bucket elimination: A unifying framework for probabilistic inference. In UAI, 1996.
    • R. Dechter. Bucket elimination: A unifying framework for probabilistic inference. In UAI, 1996.
  • 19
    • 0030836948 scopus 로고    scopus 로고
    • A probabilistic relational algebra for the integration of information retrieval and database systems
    • N. Fuhr and T. Rolleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. on Information Systems, 1997.
    • (1997) ACM Trans. on Information Systems
    • Fuhr, N.1    Rolleke, T.2
  • 21
    • 0034824924 scopus 로고    scopus 로고
    • Selectivity estimation using probabilistic models
    • L. Getoor, B. Taskar, and D. Koller. Selectivity estimation using probabilistic models. In SIGMOD, 2001.
    • (2001) SIGMOD
    • Getoor, L.1    Taskar, B.2    Koller, D.3
  • 24
    • 33749619596 scopus 로고
    • Horn tables - an efficient tool for handling incomplete information in databases
    • G. Grahne. Horn tables - an efficient tool for handling incomplete information in databases. In PODS, 1989.
    • (1989) PODS
    • Grahne, G.1
  • 25
    • 34548730794 scopus 로고
    • An analysis of first-order logics for reasoning about probability
    • J. Halpern. An analysis of first-order logics for reasoning about probability. Artificial Intelligence, 1990.
    • (1990) Artificial Intelligence
    • Halpern, J.1
  • 26
    • 34548762517 scopus 로고    scopus 로고
    • http://db.apache.org/derby. The Apache Derby Project.
    • http://db.apache.org/derby. The Apache Derby Project.
  • 30
    • 0041740288 scopus 로고
    • An extended relational database model for uncertain and imprecise information
    • S. K. Lee. An extended relational database model for uncertain and imprecise information. In VLDB, 1992.
    • (1992) VLDB
    • Lee, S.K.1
  • 32
    • 0021522494 scopus 로고
    • Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries
    • H. Prade and C. Testemale. Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries. Information Sciences, 1984.
    • (1984) Information Sciences
    • Prade, H.1    Testemale, C.2
  • 34
    • 34548783855 scopus 로고    scopus 로고
    • Representing and querying correlated tuples in probabilistic databases
    • Technical Report CS-TR-4820, University of Maryland, College Park
    • P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. Technical Report CS-TR-4820, University of Maryland, College Park, 2006.
    • (2006)
    • Sen, P.1    Deshpande, A.2
  • 35
    • 0027113212 scopus 로고
    • Approximate string matching with q-grams and maximal matches
    • E. Ukkonen. Approximate string matching with q-grams and maximal matches. In Theoretical Computer Science, 1992.
    • (1992) Theoretical Computer Science
    • Ukkonen, E.1
  • 36
    • 0001321490 scopus 로고    scopus 로고
    • External memory algorithms and data structures: Dealing with massive data
    • J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 2001.
    • (2001) ACM Computing Surveys
    • Vitter, J.S.1


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