메뉴 건너뛰기




Volumn 53, Issue 2, 2005, Pages 163-223

Checking query containment with the CQC method

Author keywords

Constraint management; Deductive databases; Query containment

Indexed keywords

CONSTRAINT MANAGEMENT; DEDUCTIVE DATABASES; QUERY CONTAINMENT; VARIABLE INSTANTIATION PATTERNS (VIP);

EID: 11144253513     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2004.08.002     Document Type: Article
Times cited : (31)

References (56)
  • 5
    • 0030125127 scopus 로고    scopus 로고
    • On the relative expressiveness of description logics and predicate logics
    • A. Borgida On the relative expressiveness of description logics and predicate logics Artificial Intelligence 82 1-2 1996 353 367
    • (1996) Artificial Intelligence , vol.82 , Issue.12 , pp. 353-367
    • Borgida, A.1
  • 7
    • 84949976019 scopus 로고    scopus 로고
    • A deduction method complete for refutation and finite satisfiability
    • JELIA'98, LNCS 1489, Springer, Berlin
    • F. Bry, S. Torge, A deduction method complete for refutation and finite satisfiability, in: Proceedings of Logics in Artificial Intelligence, JELIA'98, LNCS 1489, Springer, Berlin, 1998, pp. 122-138
    • (1998) Proceedings of Logics in Artificial Intelligence , pp. 122-138
    • Bry, F.1    Torge, S.2
  • 8
    • 84860072852 scopus 로고    scopus 로고
    • Solving database satisfiability problems
    • Friedrich Schiller Universität Jena
    • F. Bry, S. Torge, Solving database satisfiability problems, in: Proceedings of the Workshop Grundlagen von Datenbanken, Friedrich Schiller Universität Jena, 1999, pp. 122-126
    • (1999) Proceedings of the Workshop Grundlagen Von Datenbanken , pp. 122-126
    • Bry, F.1    Torge, S.2
  • 11
    • 0024772001 scopus 로고
    • A completeness theorem for SLDNF resolution
    • L. Cavedon, and J.W. Lloyd A completeness theorem for SLDNF resolution Journal of Logic Programming 7 3 1989 177 191
    • (1989) Journal of Logic Programming , vol.7 , Issue.3 , pp. 177-191
    • Cavedon, L.1    Lloyd, J.W.2
  • 12
    • 0000826543 scopus 로고
    • Negation as failure
    • Plenum Press New York
    • K.L. Clark Negation as failure Logic and Data Bases 1977 Plenum Press New York 293 322
    • (1977) Logic and Data Bases , pp. 293-322
    • Clark, K.L.1
  • 16
    • 0031075172 scopus 로고    scopus 로고
    • On the equivalence of recursive and nonrecursive datalog programs
    • S. Chaudhuri, and M.Y. Vardi On the equivalence of recursive and nonrecursive datalog programs Journal of Computer and System Sciences 54 1 1997 61 78
    • (1997) Journal of Computer and System Sciences , vol.54 , Issue.1 , pp. 61-78
    • Chaudhuri, S.1    Vardi, M.Y.2
  • 19
    • 0344077147 scopus 로고    scopus 로고
    • Conjunctive query containment with respect to views and constraints
    • G. Dong, and J. Su Conjunctive query containment with respect to views and constraints Information Processing Letters 57 2 1996 95 102
    • (1996) Information Processing Letters , vol.57 , Issue.2 , pp. 95-102
    • Dong, G.1    Su, J.2
  • 26
    • 0035658039 scopus 로고    scopus 로고
    • Answering queries using views: A survey
    • A.Y. Halevy Answering queries using views: A survey VLDB Journal 10 4 2001 270 294
    • (2001) VLDB Journal , vol.10 , Issue.4 , pp. 270-294
    • Halevy, A.Y.1
  • 30
    • 0021375730 scopus 로고
    • Testing containment of conjunctive queries under functional and inclusion dependencies
    • D.S. Johnson, and A. Klug Testing containment of conjunctive queries under functional and inclusion dependencies Journal of Computer and System Sciences 28 1 1984 167 189
    • (1984) Journal of Computer and System Sciences , vol.28 , Issue.1 , pp. 167-189
    • Johnson, D.S.1    Klug, A.2
  • 31
    • 0023827554 scopus 로고
    • On conjunctive queries containing inequalities
    • A. Klug On conjunctive queries containing inequalities Journal of the ACM 35 1 1988 146 160
    • (1988) Journal of the ACM , vol.35 , Issue.1 , pp. 146-160
    • Klug, A.1
  • 35
    • 0032069368 scopus 로고    scopus 로고
    • Verification of knowledge bases based on containment checking
    • A. Levy, and M.-C. Rousset Verification of knowledge bases based on containment checking Artificial Intelligence 101 1-2 1998 227 250
    • (1998) Artificial Intelligence , vol.101 , Issue.12 , pp. 227-250
    • Levy, A.1    Rousset, M.-C.2
  • 42
    • 23044533778 scopus 로고    scopus 로고
    • A general procedure to check conjunctive query containment
    • M. Penabad, N. Brisaboa, H. Hernández, and J. Param A general procedure to check conjunctive query containment Acta Informatica 38 7 2002 489 529
    • (2002) Acta Informatica , vol.38 , Issue.7 , pp. 489-529
    • Penabad, M.1    Brisaboa, N.2    Hernández, H.3    Param, J.4
  • 43
    • 84918983692 scopus 로고
    • A machine-oriented logic based on the resolution principle
    • J.A. Robinson A machine-oriented logic based on the resolution principle Journal of ACM 12 1 1965 23 41
    • (1965) Journal of ACM , vol.12 , Issue.1 , pp. 23-41
    • Robinson, J.A.1
  • 48
    • 84976685263 scopus 로고
    • Equivalences among relational expressions with the union and difference operators
    • Y. Sagiv, and M. Yannakakis Equivalences among relational expressions with the union and difference operators Journal of the ACM 27 4 1980 633 655
    • (1980) Journal of the ACM , vol.27 , Issue.4 , pp. 633-655
    • Sagiv, Y.1    Yannakakis, M.2


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