메뉴 건너뛰기




Volumn , Issue , 2009, Pages 640-651

SPROUT: Lazy vs. eager query plans for tuple-independent probabilistic databases

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; EFFICIENCY IMPROVEMENT; EXACT COMPUTATIONS; EXPERIMENTAL EVALUATION; FUNCTIONAL DEPENDENCY; POSTGRESQL; PROBABILISTIC DATABASE; PROOF OF CONCEPT; QUERY ENGINES; QUERY RESULTS; QUERY STRUCTURES; RELATIONAL QUERIES; STATE OF THE ART; STATIC INFORMATION;

EID: 67649643447     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.123     Document Type: Conference Paper
Times cited : (83)

References (17)
  • 1
    • 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
  • 2
    • 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
  • 4
    • 67649635142 scopus 로고    scopus 로고
    • S. Chaudhuri and K. Shim. An Overview of Cost-based Optimization of Queries with Aggregates. IEEE Data Engineering Bulletin, 1995.
    • S. Chaudhuri and K. Shim. "An Overview of Cost-based Optimization of Queries with Aggregates". IEEE Data Engineering Bulletin, 1995.
  • 5
    • 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
  • 6
    • 53849111343 scopus 로고    scopus 로고
    • Management of Probabilistic Data: Foundations and Challenges
    • N. Dalvi and D. Suciu. "Management of Probabilistic Data: Foundations and Challenges". In Proc. PODS, 2007.
    • (2007) Proc. PODS
    • Dalvi, N.1    Suciu, D.2
  • 7
    • 57349085600 scopus 로고    scopus 로고
    • The Dichotomy of Conjunctive Queries on Probabilistic Structures
    • N. Dalvi and D. Suciu. "The Dichotomy of Conjunctive Queries on Probabilistic Structures". In Proc. PODS, 2007.
    • (2007) Proc. PODS
    • Dalvi, N.1    Suciu, D.2
  • 8
    • 0021513522 scopus 로고
    • Incomplete information in relational databases
    • T. Imielinski and W. Lipski. "Incomplete information in relational databases". Journal of ACM, 31(4):761-791, 1984.
    • (1984) Journal of ACM , vol.31 , Issue.4 , pp. 761-791
    • Imielinski, T.1    Lipski, W.2
  • 10
    • 70349841406 scopus 로고    scopus 로고
    • Conditioning Probabilistic Databases
    • C. Koch and D. Olteanu. "Conditioning Probabilistic Databases". PVLDB, 1(1), 2008.
    • (2008) PVLDB , vol.1 , Issue.1
    • Koch, C.1    Olteanu, D.2
  • 11
    • 79952342776 scopus 로고    scopus 로고
    • Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
    • D. Olteanu and J. Huang. "Using OBDDs for Efficient Query Evaluation on Probabilistic Databases". In Proc. SUM, 2008.
    • (2008) Proc. SUM
    • Olteanu, D.1    Huang, J.2
  • 12
    • 48449092575 scopus 로고    scopus 로고
    • World-set Decompositions: Expressiveness and Efficient Algorithms
    • D. Olteanu, C. Koch, and L. Antova. "World-set Decompositions: Expressiveness and Efficient Algorithms". TCS, 403(2-3), 2008.
    • (2008) TCS , vol.403 , Issue.2-3
    • Olteanu, D.1    Koch, C.2    Antova, L.3
  • 13
    • 52649122656 scopus 로고    scopus 로고
    • Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
    • A. D. Sarma, M. Theobald, and J. Widom. "Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases". InProc. ICDE, 2008.
    • (2008) Proc. ICDE
    • Sarma, A.D.1    Theobald, M.2    Widom, J.3
  • 14
    • 34548772330 scopus 로고    scopus 로고
    • Representing and Querying Correlated Tuples in Probabilistic Databases
    • P. Sen and A. Deshpande. "Representing and Querying Correlated Tuples in Probabilistic Databases". In Proc. ICDE, 2007.
    • (2007) Proc. ICDE
    • Sen, P.1    Deshpande, A.2
  • 16
    • 51149112283 scopus 로고    scopus 로고
    • Probabilistic Top-k and Ranking- Aggregate Queries
    • M. Soliman, I. Ilyas, and K. Chang. "Probabilistic Top-k and Ranking- Aggregate Queries". In ACM TODS, volume 33:3, 2008.
    • (2008) ACM TODS , vol.33 , pp. 3
    • Soliman, M.1    Ilyas, I.2    Chang, K.3
  • 17
    • 0003142704 scopus 로고
    • Eager Aggregation and Lazy Aggregation
    • Y. Yan and P. Larson. "Eager Aggregation and Lazy Aggregation". In Proc. VLDB, 1995.
    • (1995) Proc. VLDB
    • Yan, Y.1    Larson, P.2


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