메뉴 건너뛰기




Volumn 77, Issue 3, 2011, Pages 473-490

Queries and materialized views on probabilistic databases

Author keywords

Probabilistic databses; Query evaluation; Views

Indexed keywords

DATABASE SYSTEMS;

EID: 79952359806     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.04.006     Document Type: Article
Times cited : (39)

References (31)
  • 5
    • 34548734138 scopus 로고    scopus 로고
    • 10̂(10̂6) worlds and beyond: Efficient representation and processing of incomplete information
    • L. Antova, C. Koch, D. Olteanu, 10 ̂ (10 ̂ 6 ) worlds and beyond: Efficient representation and processing of incomplete information, in: ICDE, 2007.
    • (2007) ICDE
    • Antova, L.1    Koch, C.2    Olteanu, D.3
  • 6
    • 84878745829 scopus 로고    scopus 로고
    • World-set decompositions: Expressiveness and efficient algorithms
    • L. Antova, C. Koch, D. Olteanu, World-set decompositions: Expressiveness and efficient algorithms, in: ICDT, 2007, pp. 194-208.
    • (2007) ICDT , pp. 194-208
    • Antova, L.1    Koch, C.2    Olteanu, D.3
  • 7
    • 84925001453 scopus 로고    scopus 로고
    • ULDBs: Databases with uncertainty and lineage
    • O. Benjelloun, A. Das Sarma, A. Halevy, J. Widom, ULDBs: Databases with uncertainty and lineage, in: VLDB, 2006, pp. 953-964.
    • (2006) VLDB , pp. 953-964
    • Benjelloun, O.1    Das Sarma, A.2    Halevy, A.3    Widom, J.4
  • 8
    • 33750915630 scopus 로고    scopus 로고
    • Query evaluation on probabilistic databases
    • N. Dalvi, Chris Re, and D. Suciu Query evaluation on probabilistic databases IEEE Data Eng. Bull. 29 1 2006 25 31
    • (2006) IEEE Data Eng. Bull. , vol.29 , Issue.1 , pp. 25-31
    • Dalvi, N.1    Re, C.2    Suciu, D.3
  • 9
    • 84938961099 scopus 로고    scopus 로고
    • Efficient query evaluation on probabilistic databases
    • Toronto, Canada
    • N. Dalvi, D. Suciu, Efficient query evaluation on probabilistic databases, in: VLDB, Toronto, Canada, 2004.
    • (2004) VLDB
    • Dalvi, N.1    Suciu, D.2
  • 13
    • 0029194731 scopus 로고
    • Michel de Rougemont, the reliability of queries
    • Michel de Rougemont, The reliability of queries, in: PODS, 1995, pp. 286-291.
    • (1995) PODS , pp. 286-291
  • 15
    • 0031644039 scopus 로고    scopus 로고
    • The complexity of query reliability
    • E. Grädel, Y. Gurevich, C. Hirsch, The complexity of query reliability, in: PODS, 1998, pp. 227-234.
    • (1998) PODS , pp. 227-234
    • Grädel, E.1    Gurevich, Y.2    Hirsch, C.3
  • 16
    • 34548770803 scopus 로고    scopus 로고
    • Models for incomplete and probabilistic information
    • T. Green, and V. Tannen Models for incomplete and probabilistic information IEEE Data Eng. Bull. 29 1 March 2006 17 24
    • (2006) IEEE Data Eng. Bull. , vol.29 , Issue.1 , pp. 17-24
    • Green, T.1    Tannen, V.2
  • 18
    • 0035658039 scopus 로고    scopus 로고
    • Answering queries using views: A survey
    • DOI 10.1007/s007780100054
    • Alon Halevy Answering queries using views: A survey VLDB J. 10 4 2001 270 294 (Pubitemid 33570969)
    • (2001) VLDB Journal , vol.10 , Issue.4 , pp. 270-294
    • Halevy, A.Y.1
  • 19
    • 0344496674 scopus 로고    scopus 로고
    • PXML: A probabilistic semistructured data model and algebra
    • E. Hung, L. Getoor, V.S. Subrahmanian, PXML: A probabilistic semistructured data model and algebra, in: ICDE, 2003.
    • (2003) ICDE
    • Hung, E.1    Getoor, L.2    Subrahmanian, V.S.3
  • 20
    • 0021513522 scopus 로고
    • Incomplete information in relational databases
    • T. Imielinski, and W. Lipski Incomplete information in relational databases J. ACM 31 October 1984 761 791
    • (1984) J. ACM , vol.31 , pp. 761-791
    • Imielinski, T.1    Lipski, W.2
  • 22
    • 33845891886 scopus 로고    scopus 로고
    • A formal analysis of information disclosure in data exchange
    • DOI 10.1016/j.jcss.2006.10.004, PII S0022000006001127, Database Theory 2004
    • G. Miklau, and D. Suciu A formal analysis of information disclosure in data exchange J. Comput. System Sci. 73 3 2007 507 534 (Pubitemid 46027076)
    • (2007) Journal of Computer and System Sciences , vol.73 , Issue.3 , pp. 507-534
    • Miklau, G.1    Suciu, D.2
  • 24
    • 0000166629 scopus 로고
    • The complexity of counting cuts and of computing the probability that a graph is connected
    • J.S. Provan, and M.O. Ball The complexity of counting cuts and of computing the probability that a graph is connected SIAM J. Comput. 12 4 1983 777 788
    • (1983) SIAM J. Comput. , vol.12 , Issue.4 , pp. 777-788
    • Provan, J.S.1    Ball, M.O.2
  • 25
    • 34548714632 scopus 로고    scopus 로고
    • Efficient Top-k query evaluation on probabilistic data
    • C. Re, N. Dalvi, D. Suciu, Efficient Top-k query evaluation on probabilistic data, in: ICDE, 2007.
    • (2007) ICDE
    • Re, C.1    Dalvi, N.2    Suciu, D.3
  • 26
    • 84864155404 scopus 로고    scopus 로고
    • Materialized views in probabilistic databases for information exchange and query optimization
    • C. Re, D. Suciu, Materialized views in probabilistic databases for information exchange and query optimization, in: Proceedings of VLDB, 2007.
    • (2007) Proceedings of VLDB
    • Re, C.1    Suciu, D.2
  • 27
    • 52649122656 scopus 로고    scopus 로고
    • Exploiting lineage for confidence computation in uncertain and probabilistic databases
    • A. Das Sarma, M. Theobald, J. Widom, Exploiting lineage for confidence computation in uncertain and probabilistic databases, in: ICDE, 2008, pp. 1023-1032.
    • (2008) ICDE , pp. 1023-1032
    • Das Sarma, A.1    Theobald, M.2    Widom, J.3
  • 29
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • L. Valiant The complexity of enumeration and reliability problems SIAM J. Comput. 8 1979 410 421
    • (1979) SIAM J. Comput. , vol.8 , pp. 410-421
    • Valiant, L.1


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