메뉴 건너뛰기




Volumn , Issue , 2011, Pages 153-164

Provenance for aggregate queries

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATE QUERIES; AGGREGATION OPERATOR; ANNOTATED DATABASE; QUERY EVALUATION; RELATIONAL ALGEBRA; SEMI-RING;

EID: 79960168520     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989284.1989302     Document Type: Conference Paper
Times cited : (161)

References (40)
  • 2
    • 84926257145 scopus 로고    scopus 로고
    • Managing lineage and uncertainty under a data exchange setting
    • F. N. Afrati and A. Vasilakopoulos. Managing lineage and uncertainty under a data exchange setting. In SUM, 2010.
    • (2010) SUM
    • Afrati, F.N.1    Vasilakopoulos, A.2
  • 3
    • 70349792478 scopus 로고    scopus 로고
    • 106 worlds and beyond: Efficient representation and processing of incomplete information
    • 106 worlds and beyond: efficient representation and processing of incomplete information. VLDB J., 18(5), 2009.
    • (2009) VLDB J. , vol.18 , Issue.5
    • Antova, L.1    Koch, C.2    Olteanu, D.3
  • 5
    • 57349181768 scopus 로고    scopus 로고
    • On the expressiveness of implicit provenance in query and update languages
    • P. Buneman, J. Cheney, and S. Vansummeren. On the expressiveness of implicit provenance in query and update languages. In ICDT, 2007.
    • (2007) ICDT
    • Buneman, P.1    Cheney, J.2    Vansummeren, S.3
  • 6
    • 57849161060 scopus 로고    scopus 로고
    • On the expressiveness of implicit provenance in query and update languages
    • P. Buneman, J. Cheney, and S. Vansummeren. On the expressiveness of implicit provenance in query and update languages. ACM Trans. Database Syst., 33(4), 2008.
    • (2008) ACM Trans. Database Syst. , vol.33 , Issue.4
    • Buneman, P.1    Cheney, J.2    Vansummeren, S.3
  • 7
    • 0002439387 scopus 로고    scopus 로고
    • Why and where: A characterization of data provenance
    • P. Buneman, S. Khanna, and W.C. Tan. Why and where: A characterization of data provenance. In ICDT, 2001.
    • (2001) ICDT
    • Buneman, P.1    Khanna, S.2    Tan, W.C.3
  • 8
    • 0029376142 scopus 로고
    • Principles of programming with complex objects and collection types
    • P. Buneman, S. Naqvi, V. Tannen, and L. Wong. Principles of programming with complex objects and collection types. TCS, 149(1), 1995.
    • (1995) TCS , vol.149 , Issue.1
    • Buneman, P.1    Naqvi, S.2    Tannen, V.3    Wong, L.4
  • 11
    • 19944387967 scopus 로고    scopus 로고
    • Containment of aggregate queries
    • S. Cohen. Containment of aggregate queries. SIGMOD Record, 34(1), 2005.
    • (2005) SIGMOD Record , vol.34 , Issue.1
    • Cohen, S.1
  • 12
    • 33745247381 scopus 로고    scopus 로고
    • Rewriting queries with arbitrary aggregation functions using views
    • S. Cohen, W. Nutt, and Y. Sagiv. Rewriting queries with arbitrary aggregation functions using views. ACM Trans. Database Syst., 31(2), 2006.
    • (2006) ACM Trans. Database Syst. , vol.31 , Issue.2
    • Cohen, S.1    Nutt, W.2    Sagiv, Y.3
  • 14
    • 67650088338 scopus 로고    scopus 로고
    • Probabilistic databases: Diamonds in the dirt
    • N. N. Dalvi, C. Ré, and D. Suciu. Probabilistic databases: diamonds in the dirt. Commun. ACM, 52(7), 2009.
    • (2009) Commun. ACM , vol.52 , Issue.7
    • Dalvi, N.N.1    Ré, C.2    Suciu, D.3
  • 15
    • 57349100882 scopus 로고    scopus 로고
    • Annotated XML: Queries and provenance
    • J.N. Foster, T.J. Green, and V. Tannen. Annotated XML: queries and provenance. In PODS, 2008.
    • (2008) PODS
    • Foster, J.N.1    Green, T.J.2    Tannen, V.3
  • 16
    • 0030836948 scopus 로고    scopus 로고
    • A probabilistic relational algebra for the integration of information retrieval and database systems
    • N. Fuhr and T. 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
  • 17
    • 77549084069 scopus 로고    scopus 로고
    • On database query languages for k-relations
    • F. Geerts and A. Poggi. On database query languages for k-relations. J. Applied Logic, 8(2), 2010.
    • (2010) J. Applied Logic , vol.8 , Issue.2
    • Geerts, F.1    Poggi, A.2
  • 19
    • 70349084688 scopus 로고    scopus 로고
    • Containment of conjunctive queries on annotated relations
    • T.J. Green. Containment of conjunctive queries on annotated relations. In ICDT, 2009.
    • (2009) ICDT
    • Green, T.J.1
  • 25
    • 63749110502 scopus 로고    scopus 로고
    • On the provenance of non-answers to queries over extracted data
    • J. Huang, T. Chen, A. Doan, and J. F. Naughton. On the provenance of non-answers to queries over extracted data. Proc. VLDB, 1, 2008.
    • (2008) Proc. VLDB , vol.1
    • Huang, J.1    Chen, T.2    Doan, A.3    Naughton, J.F.4
  • 26
    • 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
  • 29
    • 77954696370 scopus 로고    scopus 로고
    • Incremental query evaluation in a ring of databases
    • C. Koch. Incremental query evaluation in a ring of databases. In PODS, 2010.
    • (2010) PODS
    • Koch, C.1
  • 30
    • 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
  • 31
    • 84961797416 scopus 로고    scopus 로고
    • Mapping the nrc dataflow model to the open provenance model
    • N. Kwasnikowska and J. Van den Bussche. Mapping the nrc dataflow model to the open provenance model. In IPAW, pages 3-16, 2008.
    • (2008) IPAW , pp. 3-16
    • Kwasnikowska, N.1    Van Den Bussche, J.2
  • 34
    • 77952252122 scopus 로고    scopus 로고
    • A unified approach to ranking in probabilistic databases
    • J. Li, B. Saha, and A. Deshpande. A unified approach to ranking in probabilistic databases. Proc. VLDB, 2, 2009.
    • (2009) Proc. VLDB , vol.2
    • Li, J.1    Saha, B.2    Deshpande, A.3
  • 36
    • 84859199712 scopus 로고    scopus 로고
    • The complexity of causality and responsibility for query answers and non-answers
    • A. Meliou, W. Gatterbauer, K. F. Moore, and D. Suciu. The complexity of causality and responsibility for query answers and non-answers. PVLDB, 4(1), 2010.
    • (2010) PVLDB , vol.4 , Issue.1
    • Meliou, A.1    Gatterbauer, W.2    Moore, K.F.3    Suciu, D.4
  • 37
    • 57149141218 scopus 로고    scopus 로고
    • Efficient evaluation of having queries on a probabilistic database
    • C. Ré and D. Suciu. Efficient evaluation of having queries on a probabilistic database. In DBPL, 2007.
    • (2007) DBPL
    • Ré, C.1    Suciu, D.2
  • 38
    • 54249130328 scopus 로고    scopus 로고
    • Recording provenance for sql queries and updates
    • S. Vansummeren and J. Cheney. Recording provenance for sql queries and updates. IEEE Data Eng. Bull., 30(4), 2007.
    • (2007) IEEE Data Eng. Bull. , vol.30 , Issue.4
    • Vansummeren, S.1    Cheney, J.2
  • 39
    • 77954746819 scopus 로고    scopus 로고
    • Efficient querying and maintenance of network provenance at internet-scale
    • W. Zhou, M. Sherr, T. Tao, X. Li, B. T. Loo, and Y. Mao. Efficient querying and maintenance of network provenance at internet-scale. In SIGMOD, 2010.
    • (2010) SIGMOD
    • Zhou, W.1    Sherr, M.2    Tao, T.3    Li, X.4    Loo, B.T.5    Mao, Y.6
  • 40
    • 0030736377 scopus 로고    scopus 로고
    • Query evaluation in probabilistic relational databases
    • E. Zimányi. Query evaluation in probabilistic relational databases. Theor. Comput. Sci., 171(1-2), 1997.
    • (1997) Theor. Comput. Sci. , vol.171 , Issue.1-2
    • Zimányi, E.1


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