메뉴 건너뛰기




Volumn 361, Issue , 2009, Pages 149-161

A compositional framework for complex queries over uncertain data

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX QUERIES; COMPUTATION ALGORITHM; CONFIDENCE INTERVAL; ERROR BOUND; INTERMEDIATE RESULTS; NEW MODEL; PROBABILISTIC DATABASE; QUERY EVALUATION; RANDOMIZED ALGORITHMS; RELATIONAL ALGEBRA; UNCERTAIN DATAS;

EID: 70349098781     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514913     Document Type: Conference Paper
Times cited : (3)

References (22)
  • 2
    • 33749588820 scopus 로고    scopus 로고
    • Clean answers over dirty databases: A probabilistic approach
    • Periklis Andritsos, Ariel Fuxman, and Renee J. Miller. Clean answers over dirty databases: A probabilistic approach. In Proc. ICDE, 2006.
    • (2006) Proc. ICDE
    • Andritsos, P.1    Fuxman, A.2    Miller, R.J.3
  • 3
    • 52649102939 scopus 로고    scopus 로고
    • Fast and Simple Relational Processing of Uncertain Data
    • Lyublena Antova, Thomas Jansen, Christoph Koch, and Dan Olteanu. "Fast and Simple Relational Processing of Uncertain Data". In Proc. ICDE, 2008.
    • (2008) Proc. ICDE
    • Antova, L.1    Jansen, T.2    Koch, C.3    Olteanu, D.4
  • 5
    • 70349089151 scopus 로고    scopus 로고
    • Incorporating Constraints In Probabilistic XML
    • Sara Cohen, Benny Kimelfeld, and Yehoshua Sagiv. "Incorporating Constraints In Probabilistic XML". In Proc. PODS, 2008.
    • (2008) Proc. PODS
    • Cohen, S.1    Kimelfeld, B.2    Sagiv, Y.3
  • 6
    • 84938961099 scopus 로고    scopus 로고
    • Efficient Query Evaluation on Probabilistic Databases
    • Nilesh Dalvi and Dan Suciu. "Efficient Query Evaluation on Probabilistic Databases". In Proc. VLDB, 2004.
    • (2004) Proc. VLDB
    • Dalvi, N.1    Suciu, D.2
  • 7
    • 0030836948 scopus 로고    scopus 로고
    • A Probabilistic Relational Algebra for the Integration of Information Retrieval and Database Systems
    • Norbert Fuhr and Thomas Rölleke. "A Probabilistic Relational Algebra for the Integration of Information Retrieval and Database Systems". ACM Trans. Inf. Syst., 15(1), 1997.
    • (1997) ACM Trans. Inf. Syst , vol.15 , Issue.1
    • Fuhr, N.1    Rölleke, T.2
  • 10
    • 0021513522 scopus 로고
    • Incomplete Information in Relational Databases
    • T. Imielinski and W. Lipski. "Incomplete Information in Relational Databases". J. ACM, 31(4), 1984.
    • (1984) J. ACM , vol.31 , Issue.4
    • Imielinski, T.1    Lipski, W.2
  • 11
    • 70349084295 scopus 로고    scopus 로고
    • Query Evaluation with Soft-Key Constraints
    • Abhay Jha, Vibhor Rastogi, and Dan Suciu. "Query Evaluation with Soft-Key Constraints". In Proc. PODS, 2008.
    • (2008) Proc. PODS
    • Jha, A.1    Rastogi, V.2    Suciu, D.3
  • 13
    • 0003094833 scopus 로고
    • Monte-Carlo Algorithms for Enumeration and Reliability Problems
    • Richard M. Karp and Michael Luby. "Monte-Carlo Algorithms for Enumeration and Reliability Problems". In Proc. FOCS, 1983.
    • (1983) Proc. FOCS
    • Karp, R.M.1    Luby, M.2
  • 14
    • 63749085644 scopus 로고    scopus 로고
    • Approximating Predicates and Expressive Queries on Probabilistic Data
    • Christoph Koch. "Approximating Predicates and Expressive Queries on Probabilistic Data". In Proc. PODS, 2008.
    • (2008) Proc. PODS
    • Koch, C.1
  • 15
    • 70349841406 scopus 로고    scopus 로고
    • Conditioning Probabilistic Databases
    • Christoph Koch and Dan Olteanu. "Conditioning Probabilistic Databases". In Proc. VLDB, 2008.
    • (2008) Proc. VLDB
    • Koch, C.1    Olteanu, D.2
  • 17
    • 57049160857 scopus 로고    scopus 로고
    • Event Queries on Correlated Probabilistic Streams
    • Christopher Ré, Julie Letchner, Magdalena Balazinska, and Dan Suciu. "Event Queries on Correlated Probabilistic Streams". In Proc. SIGMOD, 2008.
    • (2008) Proc. SIGMOD
    • Ré, C.1    Letchner, J.2    Balazinska, M.3    Suciu, D.4
  • 18
    • 34247491690 scopus 로고    scopus 로고
    • A note on approximate counting for k-dnf
    • Luca Trevisan. A note on approximate counting for k-dnf. In Proc. APPROX-RANDOM, 2004.
    • (2004) Proc. APPROX-RANDOM
    • Trevisan, L.1
  • 19
    • 0000142982 scopus 로고
    • The Complexity of Enumeration and Reliability Problems
    • Leslie G. Valiant. "The Complexity of Enumeration and Reliability Problems". SIAM J. Comput., 8(3), 1979.
    • (1979) SIAM J. Comput , vol.8 , Issue.3
    • Valiant, L.G.1
  • 20
    • 77952774652 scopus 로고    scopus 로고
    • TRIO: A System for Managing Data, Uncertainty, and Lineage. In Charu Agarwal, editor
    • To appear
    • Jennifer Widom. "TRIO: A System for Managing Data, Uncertainty, and Lineage". In Charu Agarwal, editor, Managing and Mining Uncertain Data, 2008. To appear.
    • (2008) Managing and Mining Uncertain Data
    • Widom, J.1
  • 21
    • 70349151069 scopus 로고    scopus 로고
    • Query algebra operations for interval probabilities
    • Wenzhong Zhao, Alex Dekhtyar, and Judy Goldsmith. Query algebra operations for interval probabilities. In Proc. DEXA, 2003.
    • (2003) Proc. DEXA
    • Zhao, W.1    Dekhtyar, A.2    Goldsmith, J.3
  • 22
    • 4444368691 scopus 로고    scopus 로고
    • Databases for interval probabilities
    • Wenzhong Zhao, Alex Dekhtyar, and Judy Goldsmith. Databases for interval probabilities. Int. J. Intell. Syst., 19(9):789-815, 2004.
    • (2004) Int. J. Intell. Syst , vol.19 , Issue.9 , pp. 789-815
    • Zhao, W.1    Dekhtyar, A.2    Goldsmith, J.3


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