메뉴 건너뛰기




Volumn 37, Issue 4, 2008, Pages 78-85

On query algebras for probabilistic databases

Author keywords

[No Author keywords available]

Indexed keywords

EXPRESSIVE POWER; FORMAL DEFINITIONS; PROBABILISTIC DATABASE; QUERY ALGEBRAS;

EID: 63749084566     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/1519103.1519116     Document Type: Article
Times cited : (12)

References (21)
  • 2
    • 44949276851 scopus 로고
    • On the Representation and Querying of Sets of Possible Worlds
    • S. Abiteboul, P. Kanellakis, and G. Grahne. "On the Representation and Querying of Sets of Possible Worlds". Theor. Comput. Sci., 78(1): 158-187, 1991.
    • (1991) Theor. Comput. Sci , vol.78 , Issue.1 , pp. 158-187
    • Abiteboul, S.1    Kanellakis, P.2    Grahne, G.3
  • 3
    • 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 Proc. ICDE, 2008.
    • (2008) Proc. ICDE
    • Antova, L.1    Jansen, T.2    Koch, C.3    Olteanu, D.4
  • 5
    • 35448929116 scopus 로고    scopus 로고
    • From Complete to Incomplete Information and Back
    • L. Antova, C. Koch, and D. Olteanu. "From Complete to Incomplete Information and Back". In Proc. SIGMOD, 2007.
    • (2007) Proc. SIGMOD
    • Antova, L.1    Koch, C.2    Olteanu, D.3
  • 8
    • 0034538249 scopus 로고    scopus 로고
    • An Optimal Algorithm for Monte Carlo Estimation
    • P. Dagum, R. M. Karp, M. Luby, and S. M. Ross. "An Optimal Algorithm for Monte Carlo Estimation". SlAM J. Comput., 29(5): 1484-1496, 2000.
    • (2000) SlAM J. Comput , vol.29 , Issue.5 , pp. 1484-1496
    • Dagum, P.1    Karp, R.M.2    Luby, M.3    Ross, S.M.4
  • 9
    • 36148994784 scopus 로고    scopus 로고
    • Efficient query evaluation on probabilistic databases
    • N. Dalvi and D. Suciu. "Efficient query evaluation on probabilistic databases". VLDB Journal, 16(4):523-544, 2007.
    • (2007) VLDB Journal , vol.16 , Issue.4 , pp. 523-544
    • Dalvi, N.1    Suciu, D.2
  • 10
    • 84864254203 scopus 로고    scopus 로고
    • A Compositional Framework for Complex Queries over Uncertain Data
    • to appear
    • M. Goetz and C. Koch. "A Compositional Framework for Complex Queries over Uncertain Data". In Proc. ICDT, 2009. to appear.
    • (2009) Proc. ICDT
    • Goetz, M.1    Koch, C.2
  • 11
    • 0003592506 scopus 로고    scopus 로고
    • The Complexity of Query Reliability
    • E. Gradei, Y. Gurevich, and C. Hirsch. "The Complexity of Query Reliability". In Proc. PODS, pages 227-234, 1998.
    • (1998) Proc. PODS , pp. 227-234
    • Gradei, E.1    Gurevich, Y.2    Hirsch, C.3
  • 13
    • 0001202403 scopus 로고
    • Monte-Carlo Approximation Algorithms for Enumeration Problems
    • R. M. Karp, M. Luby, and N. Madras. "Monte-Carlo Approximation Algorithms for Enumeration Problems". J. Algorithms, 10(3):429-448, 1989.
    • (1989) J. Algorithms , vol.10 , Issue.3 , pp. 429-448
    • Karp, R.M.1    Luby, M.2    Madras, N.3
  • 14
    • 63749085644 scopus 로고    scopus 로고
    • Approximating Predicates and Expressive Queries on Probabilistic Databases
    • C. Koch. "Approximating Predicates and Expressive Queries on Probabilistic Databases". In Proc. PODS, 2008.
    • (2008) Proc. PODS
    • Koch, C.1
  • 15
    • 63749105970 scopus 로고    scopus 로고
    • MayBMS: A system for managing large uncertain and probabilistic databases
    • C. Aggarwal, editor, chapter 6. Springer-Verlag, To appear
    • C. Koch. "MayBMS: A system for managing large uncertain and probabilistic databases". In C. Aggarwal, editor, Managing and Mining Uncertain Data, chapter 6. Springer-Verlag, 2008. To appear.
    • (2008) Managing and Mining Uncertain Data
    • Koch, C.1
  • 16
    • 63749101156 scopus 로고    scopus 로고
    • A Compositional Query Algebra for Second-Order Logic and Uncertain Databases
    • to appear
    • C. Koch. "A Compositional Query Algebra for Second-Order Logic and Uncertain Databases". In Proc. ICDT, 2009. to appear.
    • (2009) Proc. ICDT
    • Koch, C.1
  • 17
    • 70349841406 scopus 로고    scopus 로고
    • Conditioning Probabilistic Databases
    • C. Koch and D. Olteanu. "Conditioning Probabilistic Databases". In Proc. VLDB, 2008.
    • (2008) Proc. VLDB
    • Koch, C.1    Olteanu, D.2
  • 18
    • 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 Proc. ICDE, pages 886-895, 2007.
    • (2007) Proc. ICDE , pp. 886-895
    • Re, C.1    Dalvi, N.2    Suciu, D.3
  • 19
    • 38449104917 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 Proc. DBPL, pages 186-200, 2007.
    • (2007) Proc. DBPL , pp. 186-200
    • Re, C.1    Suciu, D.2
  • 21
    • 77952774652 scopus 로고    scopus 로고
    • Trio: A system for data, uncertainty, and lineage
    • C. Aggarwal, editor, Springer-Verlag, To appear
    • J. Widom. "Trio: a system for data, uncertainty, and lineage". In C. Aggarwal, editor, Managing and Mining Uncertain Data. Springer-Verlag, 2008. To appear.
    • (2008) Managing and Mining Uncertain Data
    • Widom, J.1


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