메뉴 건너뛰기




Volumn 4254 LNCS, Issue , 2006, Pages 358-374

On the first-order reducibility of unions of conjunctive queries over inconsistent databases

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; DATA REDUCTION; DATA STRUCTURES; DATABASE SYSTEMS;

EID: 33845277801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11896548_28     Document Type: Conference Paper
Times cited : (10)

References (13)
  • 6
    • 36849055542 scopus 로고    scopus 로고
    • On the computational complexity of minimal-change integrity maintenance in relational databases
    • Leopoldo Bertossi, Anthony Hunter, and Torsten Schaub, editors, Inconsistency Tolerance, Springer
    • Jan Chomicki and Jerzy Marcinkowski. On the computational complexity of minimal-change integrity maintenance in relational databases. In Leopoldo Bertossi, Anthony Hunter, and Torsten Schaub, editors, Inconsistency Tolerance, volume 3300 of Lecture Notes in Computer Science, pages 119-150. Springer, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3300 , pp. 119-150
    • Chomicki, J.1    Marcinkowski, J.2
  • 10
    • 29844451508 scopus 로고    scopus 로고
    • First-order query rewriting for inconsistent databases
    • Proceedings of the Tenth International Conference on Database Theory (ICDT 2005), Springer
    • Ariel Fuxman and Renée J. Miller. First-order query rewriting for inconsistent databases. In Proceedings of the Tenth International Conference on Database Theory (ICDT 2005), volume 3363 of LNCS, pages 337-351. Springer, 2005.
    • (2005) LNCS , vol.3363 , pp. 337-351
    • Fuxman, A.1    Miller, R.J.2
  • 11


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