메뉴 건너뛰기




Volumn , Issue , 2011, Pages 90-101

Relaxed notions of schema mapping equivalence revisited

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONAL DEPENDENCY; INCLUSION DEPENDENCIES; LOGICAL EQUIVALENCE; MAPPING EQUIVALENCES; OPTIMIZATION TASK; PROPERTY; QUERY EQUIVALENCE; SCHEMA MAPPINGS;

EID: 79952348087     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1938551.1938566     Document Type: Conference Paper
Times cited : (6)

References (23)
  • 1
    • 77954530759 scopus 로고    scopus 로고
    • Composition with target constraints
    • ACM
    • M. Arenas, R. Fagin, and A. Nash. Composition with target constraints. In Proc. ICDT'10, pages 129-142. ACM, 2010.
    • (2010) Proc. ICDT'10 , pp. 129-142
    • Arenas, M.1    Fagin, R.2    Nash, A.3
  • 2
    • 79960772623 scopus 로고    scopus 로고
    • Inverting schema mappings: Bridging the gap between theory and practice
    • M. Arenas, J. Pérez, J. L. Reutter, and C. Riveros. Inverting schema mappings: Bridging the gap between theory and practice. PVLDB, 2(1):1018-1029, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 1018-1029
    • Arenas, M.1    Pérez, J.2    Reutter, J.L.3    Riveros, C.4
  • 3
    • 76149121534 scopus 로고    scopus 로고
    • The recovery of a schema mapping: Bringing exchanged data back
    • M. Arenas, J. Pérez, and C. Riveros. The recovery of a schema mapping: Bringing exchanged data back. ACM Trans. Database Syst., 34(4), 2009.
    • (2009) ACM Trans. Database Syst. , vol.34 , Issue.4
    • Arenas, M.1    Pérez, J.2    Riveros, C.3
  • 4
    • 0021508773 scopus 로고
    • A proof procedure for data dependencies
    • C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718-741, 1984.
    • (1984) J. ACM , vol.31 , Issue.4 , pp. 718-741
    • Beeri, C.1    Vardi, M.Y.2
  • 5
    • 0038570636 scopus 로고    scopus 로고
    • Applying model management to classical meta data problems
    • P. A. Bernstein. Applying model management to classical meta data problems. In Proc. CIDR'03, 2003.
    • (2003) Proc. CIDR'03
    • Bernstein, P.A.1
  • 8
    • 84976676650 scopus 로고
    • Horn clauses and database dependencies
    • R. Fagin. Horn clauses and database dependencies. J. ACM, 29(4):952-985, 1982.
    • (1982) J. ACM , vol.29 , Issue.4 , pp. 952-985
    • Fagin, R.1
  • 9
    • 18144386595 scopus 로고    scopus 로고
    • Data exchange: Semantics and query answering
    • DOI 10.1016/j.tcs.2004.10.033, PII S030439750400725X
    • R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005. (Pubitemid 40612385)
    • (2005) Theoretical Computer Science , vol.336 , Issue.1 , pp. 89-124
    • Fagin, R.1    Kolaitis, P.G.2    Miller, R.J.3    Popa, L.4
  • 12
    • 33745201812 scopus 로고    scopus 로고
    • Composing schema mappings: Second-order dependencies to the rescue
    • R. Fagin, P. G. Kolaitis, L. Popa, and W. C. Tan. Composing schema mappings: Second-order dependencies to the rescue. ACM Trans. Database Syst., 30(4):994-1055, 2005.
    • (2005) ACM Trans. Database Syst. , vol.30 , Issue.4 , pp. 994-1055
    • Fagin, R.1    Kolaitis, P.G.2    Popa, L.3    Tan, W.C.4
  • 13
    • 70350686720 scopus 로고    scopus 로고
    • Reverse data exchange: Coping with nulls
    • ACM
    • R. Fagin, P. G. Kolaitis, L. Popa, and W. C. Tan. Reverse data exchange: coping with nulls. PODS'09, pages 23-32, ACM.
    • PODS'09 , pp. 23-32
    • Fagin, R.1    Kolaitis, P.G.2    Popa, L.3    Tan, W.C.4
  • 14
    • 0038147465 scopus 로고    scopus 로고
    • On the complexity of single-rule datalog queries
    • G. Gottlob and C. H. Papadimitriou. On the complexity of single-rule datalog queries. Inf. Comput., 183(1), 2003.
    • (2003) Inf. Comput. , vol.183 , Issue.1
    • Gottlob, G.1    Papadimitriou, C.H.2
  • 15
    • 79952336260 scopus 로고    scopus 로고
    • Normalization and optimization of schema mappings
    • G. Gottlob, R. Pichler, and V. Savenkov. Normalization and optimization of schema mappings. PVLDB, 2(1), 2009.
    • (2009) PVLDB , vol.2 , Issue.1
    • Gottlob, G.1    Pichler, R.2    Savenkov, V.3
  • 17
    • 0021375730 scopus 로고
    • TESTING CONTAINMENT OF CONJUNCTIVE QUERIES UNDER FUNCTIONAL AND INCLUSION DEPENDENCIES.
    • DOI 10.1016/0022-0000(84)90081-3
    • D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167-189, 1984. (Pubitemid 14569352)
    • (1984) Journal of Computer and System Sciences , vol.28 , Issue.1 , pp. 167-189
    • Johnson, D.S.1    Klug, A.2
  • 18
    • 85012235903 scopus 로고    scopus 로고
    • Composing mappings among data sources
    • J. Madhavan and A. Y. Halevy. Composing mappings among data sources. In Proc. VLDB'03, pages 572-583, 2003.
    • (2003) Proc. VLDB'03 , pp. 572-583
    • Madhavan, J.1    Halevy, A.Y.2
  • 19
    • 70350657109 scopus 로고    scopus 로고
    • Generalized schema-mappings: From termination to tractability
    • B. Marnette. Generalized schema-mappings: from termination to tractability. In PODS, pages 13-22, 2009.
    • (2009) PODS , pp. 13-22
    • Marnette, B.1
  • 20
    • 77954498300 scopus 로고    scopus 로고
    • On chase termination beyond stratification
    • M. Meier, M. Schmidt, and G. Lausen. On chase termination beyond stratification. PVLDB, 2(1):970-981, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 970-981
    • Meier, M.1    Schmidt, M.2    Lausen, G.3
  • 22
    • 33947667913 scopus 로고    scopus 로고
    • Composition of mappings given by embedded dependencies
    • A. Nash, P. A. Bernstein, and S. Melnik. Composition of mappings given by embedded dependencies. ACM TODS, 32(1):4, 2007.
    • (2007) ACM TODS , vol.32 , Issue.1 , pp. 4
    • Nash, A.1    Bernstein, P.A.2    Melnik, S.3
  • 23
    • 0002732106 scopus 로고
    • Equivalence of datalog queries is undecidable
    • O. Shmueli. Equivalence of datalog queries is undecidable. J. Log. Prog., 15(3):231-241, 1993.
    • (1993) J. Log. Prog. , vol.15 , Issue.3 , pp. 231-241
    • Shmueli, O.1


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