메뉴 건너뛰기




Volumn 361, Issue , 2009, Pages 73-83

Query languages for data exchange: Beyond unions of conjunctive queries

Author keywords

[No Author keywords available]

Indexed keywords

CERTAIN ANSWERS; COMBINED COMPLEXITY; CONJUNCTIVE QUERIES; DATA COMPLEXITY; DATA EXCHANGE; DATALOG; DATALOG PROGRAMS; FUNDAMENTAL PROPERTIES; POLYNOMIAL-TIME;

EID: 70349138839     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514904     Document Type: Conference Paper
Times cited : (12)

References (19)
  • 1
    • 70349094613 scopus 로고    scopus 로고
    • S. Abiteboul, and O. Duschka. Answering queries using materialized views. Gemo report 383.
    • S. Abiteboul, and O. Duschka. Answering queries using materialized views. Gemo report 383.
  • 3
    • 43349096655 scopus 로고    scopus 로고
    • Data exchange in the presence of arithmetic comparisons
    • F. N. Afrati, C, Li, and V. Pavlaki. Data exchange in the presence of arithmetic comparisons. In EDBT, pages 487-498, 2008.
    • (2008) EDBT , pp. 487-498
    • Afrati, F.N.1    Li, C.2    Pavlaki, V.3
  • 4
    • 3142707202 scopus 로고    scopus 로고
    • Locally consistent transformations and query answering in data exchange
    • M. Arenas, P. Barceló, R. Fagin, and L. Libkin. Locally consistent transformations and query answering in data exchange. In PODS, pages 229-240, 2004.
    • (2004) PODS , pp. 229-240
    • Arenas, M.1    Barceló, P.2    Fagin, R.3    Libkin, L.4
  • 5
    • 0021508773 scopus 로고
    • A proof procedure for data dependencies
    • C. Beeri, and M. Y. Vardi. A proof procedure for data dependencies. Journal of the ACM, 31(4):718-741, 1984.
    • (1984) Journal of the ACM , vol.31 , Issue.4 , pp. 718-741
    • Beeri, C.1    Vardi, M.Y.2
  • 7
    • 3142721843 scopus 로고    scopus 로고
    • Composing schema mappings: Second-order dependencies to the rescue
    • R. Fagin, P. Kolaitis, L. Popa, W. C. Tan. Composing schema mappings: Second-order dependencies to the rescue. In PODS, pages 83-94, 2004.
    • (2004) PODS , pp. 83-94
    • Fagin, R.1    Kolaitis, P.2    Popa, L.3    Tan, W.C.4
  • 10
    • 0038147465 scopus 로고    scopus 로고
    • On the complexity of single-rule datalog queries
    • G. Gottlob, C. Papadimitriou. On the complexity of single-rule datalog queries. Information and Computation, 183(1): 104-122, 2003.
    • (2003) Information and Computation , vol.183 , Issue.1 , pp. 104-122
    • Gottlob, G.1    Papadimitriou, C.2
  • 11
    • 33244483085 scopus 로고    scopus 로고
    • Schema mappings, data exchange, and metadata management
    • P. Kolaitis. Schema mappings, data exchange, and metadata management. In PODS, pages 61-75, 2005.
    • (2005) In PODS , pp. 61-75
    • Kolaitis, P.1
  • 12
    • 33947312337 scopus 로고    scopus 로고
    • The complexity of data exchange
    • P. Kolaitis, J. Panttaja, and W.-C. Tan. The complexity of data exchange. In PODS, pages 30-39, 2006.
    • (2006) PODS , pp. 30-39
    • Kolaitis, P.1    Panttaja, J.2    Tan, W.-C.3
  • 13
    • 0021513522 scopus 로고
    • Incomplete information in relational databases
    • T. Imielinski, W. Lipski. Incomplete information in relational databases. Journal of the ACM 31, 761-791, 1984.
    • (1984) Journal of the ACM , vol.31 , pp. 761-791
    • Imielinski, T.1    Lipski, W.2
  • 14
    • 0036036947 scopus 로고    scopus 로고
    • Data integration: A theoretical perspective
    • M. Lenzerini. Data integration: A theoretical perspective. In PODS, pages 233-246, 2002.
    • (2002) PODS , pp. 233-246
    • Lenzerini, M.1
  • 16
    • 33947318644 scopus 로고    scopus 로고
    • Data exchange and incomplete information
    • L. Libkin. Data exchange and incomplete information. In PODS, pages 60-69, 2006.
    • (2006) PODS , pp. 60-69
    • Libkin, L.1
  • 17
    • 57349152183 scopus 로고    scopus 로고
    • Data exchange and schema mappings in open and closed worlds
    • L. Libkin, C. Sirangelo. Data exchange and schema mappings in open and closed worlds. In PODS, pages 139-148, 2008.
    • (2008) PODS , pp. 139-148
    • Libkin, L.1    Sirangelo, C.2
  • 18
    • 18244363327 scopus 로고    scopus 로고
    • Data exchange: On the complexity of answering queries with inequalities
    • A. Ma̧dry. Data exchange: On the complexity of answering queries with inequalities. Information Processing Letters, 94(6):253-257, 2005.
    • (2005) Information Processing Letters , vol.94 , Issue.6 , pp. 253-257
    • Ma̧dry, A.1
  • 19
    • 85028752389 scopus 로고
    • The complexity of relational query languages
    • M. Y. Vardi. The complexity of relational query languages. In STOC, pages 137-146, 1982.
    • (1982) STOC , pp. 137-146
    • Vardi, M.Y.1


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