메뉴 건너뛰기




Volumn , Issue , 2010, Pages 317-326

When data dependencies over SQL tables meet the logics of paradox and S-3

Author keywords

axiomatization; data dependency; implication; logic of paradox; null value; s 3 logic

Indexed keywords

AXIOMATIZATION; CLASSICAL THEORY; CONSEQUENCE RELATIONS; DATA DEPENDENCIES; EFFECTIVE MECHANISMS; IMPLICATION PROBLEM; INFORMATION INTERPRETATION; NULL VALUE; PARACONSISTENT LOGIC; POSSIBLE WORLD SEMANTICS;

EID: 77954705920     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807085.1807126     Document Type: Conference Paper
Times cited : (20)

References (43)
  • 1
    • 3042647135 scopus 로고    scopus 로고
    • A normal form for XML documents
    • M. Arenas and L. Libkin. A normal form for XML documents. ACM Trans. Database Syst., 29(1):195-232, 2004.
    • (2004) ACM Trans. Database Syst. , vol.29 , Issue.1 , pp. 195-232
    • Arenas, M.1    Libkin, L.2
  • 2
    • 0001454571 scopus 로고
    • Dependency structures of database relationships
    • W. W. Armstrong. Dependency structures of database relationships. Information Processing, 74:580-583, 1974.
    • (1974) Information Processing , vol.74 , pp. 580-583
    • Armstrong, W.W.1
  • 3
    • 0022745134 scopus 로고
    • Functional dependencies and constraints on null values in database relations
    • P. Atzeni and N. Morfuni. Functional dependencies and constraints on null values in database relations. Information and Control, 70(1):1-31, 1986.
    • (1986) Information and Control , vol.70 , Issue.1 , pp. 1-31
    • Atzeni, P.1    Morfuni, N.2
  • 4
    • 0019058623 scopus 로고
    • On the membership problem for functional and multivalued dependencies in relational databases
    • C. Beeri. On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. Database Syst., 5(3):241-259, 1980.
    • (1980) ACM Trans. Database Syst. , vol.5 , Issue.3 , pp. 241-259
    • Beeri, C.1
  • 5
    • 0018442877 scopus 로고
    • Computational problems related to the design of normal form relational schemas
    • C. Beeri and P. Bernstein. Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst., 4(1):30-59, 1979.
    • (1979) ACM Trans. Database Syst. , vol.4 , Issue.1 , pp. 30-59
    • Beeri, C.1    Bernstein, P.2
  • 6
    • 85029497299 scopus 로고
    • A complete axiomatization for functional and multivalued dependencies in database relations
    • ACM
    • C. Beeri, R. Fagin, and J. H. Howard. A complete axiomatization for functional and multivalued dependencies in database relations. In SIGMOD, pages 47-61. ACM, 1977.
    • (1977) SIGMOD , pp. 47-61
    • Beeri, C.1    Fagin, R.2    Howard, J.H.3
  • 7
    • 12944289417 scopus 로고
    • Inferences of multivalued dependencies in fixed and undetermined universes
    • J. Biskup. Inferences of multivalued dependencies in fixed and undetermined universes. Theor. Comput. Sci., 10(1):93-106, 1980.
    • (1980) Theor. Comput. Sci. , vol.10 , Issue.1 , pp. 93-106
    • Biskup, J.1
  • 8
    • 49949114751 scopus 로고    scopus 로고
    • Appropriate reasoning about data dependencies in fixed and undetermined universes
    • J. Biskup and S. Link. Appropriate reasoning about data dependencies in fixed and undetermined universes. In FoIKS, pages 58-77, 2006.
    • (2006) FoIKS , pp. 58-77
    • Biskup, J.1    Link, S.2
  • 10
    • 21444446907 scopus 로고    scopus 로고
    • On the complexity of entailment in propositional multivalued logics
    • M. Cadoli and M. Schaerf. On the complexity of entailment in propositional multivalued logics. Ann. Math. Artif. Intell., 18(1):29-50, 1996.
    • (1996) Ann. Math. Artif. Intell. , vol.18 , Issue.1 , pp. 29-50
    • Cadoli, M.1    Schaerf, M.2
  • 11
    • 0014797273 scopus 로고
    • A relational model of data for large shared data banks
    • E. F. Codd. A relational model of data for large shared data banks. Commun. ACM, 13(6):377-387, 1970.
    • (1970) Commun. ACM , vol.13 , Issue.6 , pp. 377-387
    • Codd, E.F.1
  • 12
    • 0018705521 scopus 로고
    • Extending the database relational model to capture more meaning
    • E. F. Codd. Extending the database relational model to capture more meaning. ACM Trans. Database Syst., 4(4):397-434, 1979.
    • (1979) ACM Trans. Database Syst. , vol.4 , Issue.4 , pp. 397-434
    • Codd, E.F.1
  • 13
    • 0018015497 scopus 로고
    • Normalization and hierarchical dependencies in the relational data model
    • C. Delobel. Normalization and hierarchical dependencies in the relational data model. ACM Trans. Database Syst., 3(3):201-222, 1978.
    • (1978) ACM Trans. Database Syst. , vol.3 , Issue.3 , pp. 201-222
    • Delobel, C.1
  • 15
    • 0000720354 scopus 로고
    • Functional dependencies in a relational data base and propositional logic
    • R. Fagin. Functional dependencies in a relational data base and propositional logic. IBM Journal of Research and Development, 21(6):543-544, 1977.
    • (1977) IBM Journal of Research and Development , vol.21 , Issue.6 , pp. 543-544
    • Fagin, R.1
  • 16
    • 0017532380 scopus 로고
    • Multivalued dependencies and a new normal form for relational databases
    • R. Fagin. Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst., 2(3):262-278, 1977.
    • (1977) ACM Trans. Database Syst. , vol.2 , Issue.3 , pp. 262-278
    • Fagin, R.1
  • 17
    • 18144386595 scopus 로고    scopus 로고
    • Data exchange: Semantics and query answering
    • R. Fagin, P. Kolaitis, R. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005.
    • (2005) Theor. Comput. Sci. , vol.336 , Issue.1 , pp. 89-124
    • Fagin, R.1    Kolaitis, P.2    Miller, R.3    Popa, L.4
  • 18
    • 84974661393 scopus 로고
    • An almost linear-time algorithm for computing a dependency basis in a relational database
    • Z. Galil. An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM, 29(1):96-102, 1982.
    • (1982) J. ACM , vol.29 , Issue.1 , pp. 96-102
    • Galil, Z.1
  • 19
    • 3142722962 scopus 로고
    • Decision problems for multivalued dependencies in relational databases
    • K. Hagihara, M. Ito, K. Taniguchi, and T. Kasami. Decision problems for multivalued dependencies in relational databases. SIAM J. Comput., 8(2):247-264, 1979.
    • (1979) SIAM J. Comput. , vol.8 , Issue.2 , pp. 247-264
    • Hagihara, K.1    Ito, M.2    Taniguchi, K.3    Kasami, T.4
  • 20
    • 39549085359 scopus 로고    scopus 로고
    • Characterising nested database dependencies by fragments of propositional logic
    • S. Hartmann and S. Link. Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic, 152(1-3):84-106, 2008.
    • (2008) Ann. Pure Appl. Logic , vol.152 , Issue.1-3 , pp. 84-106
    • Hartmann, S.1    Link, S.2
  • 21
    • 67651242794 scopus 로고    scopus 로고
    • Efficient reasoning about a robust XML key fragment
    • S. Hartmann and S. Link. Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst., 34(2), 2009.
    • (2009) ACM Trans. Database Syst. , vol.34 , Issue.2
    • Hartmann, S.1    Link, S.2
  • 22
    • 77249108247 scopus 로고    scopus 로고
    • Numerical constraints on XML data
    • S. Hartmann and S. Link. Numerical constraints on XML data. Inf. Comput., 208(5):521-544, 2010.
    • (2010) Inf. Comput. , vol.208 , Issue.5 , pp. 521-544
    • Hartmann, S.1    Link, S.2
  • 23
    • 0021513522 scopus 로고
    • Incomplete information in relational databases
    • T. Imielinski and W. Lipski Jr. Incomplete information in relational databases. J. ACM, 31(4):761-791, 1984.
    • (1984) J. ACM , vol.31 , Issue.4 , pp. 761-791
    • Imielinski, T.1    Lipski Jr., W.2
  • 24
    • 33947331055 scopus 로고    scopus 로고
    • Dependency-preserving normalization of relational and XML data
    • S. Kolahi. Dependency-preserving normalization of relational and XML data. J. Comput. Syst. Sci., 73(4):636-647, 2007.
    • (2007) J. Comput. Syst. Sci. , vol.73 , Issue.4 , pp. 636-647
    • Kolahi, S.1
  • 25
    • 0001550514 scopus 로고    scopus 로고
    • Axiomatisation of functional dependencies in incomplete relations
    • M. Levene and G. Loizou. Axiomatisation of functional dependencies in incomplete relations. Theor. Comput. Sci., 206(1-2):283-300, 1998.
    • (1998) Theor. Comput. Sci. , vol.206 , Issue.1-2 , pp. 283-300
    • Levene, M.1    Loizou, G.2
  • 26
    • 0003369368 scopus 로고    scopus 로고
    • Database design for incomplete relations
    • M. Levene and G. Loizou. Database design for incomplete relations. ACM Trans. Database Syst., 24(1):80-125, 1999.
    • (1999) ACM Trans. Database Syst. , vol.24 , Issue.1 , pp. 80-125
    • Levene, M.1    Loizou, G.2
  • 27
    • 0011852765 scopus 로고
    • A knowledge-level account of abduction
    • H. Levesque. A knowledge-level account of abduction. In IJCAI, pages 1061-1067, 1989.
    • (1989) IJCAI , pp. 1061-1067
    • Levesque, H.1
  • 28
    • 84976830370 scopus 로고
    • On the equivalence of database models
    • E. Lien. On the equivalence of database models. J. ACM, 29(2):333-362, 1982.
    • (1982) J. ACM , vol.29 , Issue.2 , pp. 333-362
    • Lien, E.1
  • 29
    • 73049083712 scopus 로고    scopus 로고
    • Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies
    • W.-D. Langeveldt and S. Link. Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies. Inf. Syst., 35(5):352-374, 2010.
    • (2010) Inf. Syst. , vol.35 , Issue.5 , pp. 352-374
    • Langeveldt, W.-D.1    Link, S.2
  • 30
    • 44849120928 scopus 로고    scopus 로고
    • On the implication of multivalued dependencies in partial database relations
    • S. Link. On the implication of multivalued dependencies in partial database relations. Int. J. Found. Comput. Sci., 19(3):691-715, 2008.
    • (2008) Int. J. Found. Comput. Sci. , vol.19 , Issue.3 , pp. 691-715
    • Link, S.1
  • 31
    • 0347756653 scopus 로고    scopus 로고
    • Resource-bounded paraconsistent inference
    • P. Marquis and N. Porquet. Resource-bounded paraconsistent inference. Ann. Math. Artif. Intell., 39:349-384, 2003.
    • (2003) Ann. Math. Artif. Intell. , vol.39 , pp. 349-384
    • Marquis, P.1    Porquet, N.2
  • 34
    • 84976667388 scopus 로고
    • An algorithm for inferring multivalued dependencies with an application to propositional logic
    • Y. Sagiv. An algorithm for inferring multivalued dependencies with an application to propositional logic. J. ACM, 27(2):250-262, 1980.
    • (1980) J. ACM , vol.27 , Issue.2 , pp. 250-262
    • Sagiv, Y.1
  • 35
    • 0019590420 scopus 로고
    • An equivalence between relational database dependencies and a fragment of propositional logic
    • Y. Sagiv, C. Delobel, D. S. Parker Jr., and R. Fagin. An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM, 28(3):435-453, 1981.
    • (1981) J. ACM , vol.28 , Issue.3 , pp. 435-453
    • Sagiv, Y.1    Delobel, C.2    Parker Jr., D.S.3    Fagin, R.4
  • 36
    • 0029290445 scopus 로고
    • Tractable reasoning via approximation
    • M. Schaerf and M. Cadoli. Tractable reasoning via approximation. Artif. Intell., 74:249-310, 1995.
    • (1995) Artif. Intell. , vol.74 , pp. 249-310
    • Schaerf, M.1    Cadoli, M.2
  • 37
    • 73049089025 scopus 로고    scopus 로고
    • On keys and functional dependencies as first-class citizens in description logics
    • D. Toman and G. Weddell. On keys and functional dependencies as first-class citizens in description logics. J. Autom. Reasoning, 40(2-3):117-132, 2008.
    • (2008) J. Autom. Reasoning , vol.40 , Issue.2-3 , pp. 117-132
    • Toman, D.1    Weddell, G.2
  • 38
    • 85028752389 scopus 로고
    • The complexity of relational query languages
    • M. Vardi. The complexity of relational query languages. In STOC, pages 137-146, 1982.
    • (1982) STOC , pp. 137-146
    • Vardi, M.1
  • 39
    • 7544221362 scopus 로고    scopus 로고
    • Strong functional dependencies and their application to normal forms in XML
    • M. Vincent, J. Liu, and C. Liu. Strong functional dependencies and their application to normal forms in XML. ACM Trans. Database Syst., 29(3):445-462, 2004.
    • (2004) ACM Trans. Database Syst. , vol.29 , Issue.3 , pp. 445-462
    • Vincent, M.1    Liu, J.2    Liu, C.3
  • 40
    • 0026822489 scopus 로고
    • Reasoning about functional dependencies generalized for semantic data models
    • G. Weddell. Reasoning about functional dependencies generalized for semantic data models. ACM Trans. Database Syst., 17(1):32-64, 1992.
    • (1992) ACM Trans. Database Syst. , vol.17 , Issue.1 , pp. 32-64
    • Weddell, G.1
  • 41
    • 0004730750 scopus 로고    scopus 로고
    • Temporal FDs on Complex Objects
    • J. Wijsen. Temporal FDs on Complex Objects. ACM Trans. Database Syst., 24(1):127-176, 1999.
    • (1999) ACM Trans. Database Syst. , vol.24 , Issue.1 , pp. 127-176
    • Wijsen, J.1
  • 42
    • 0026822672 scopus 로고
    • The practical need for fourth normal form
    • M. Wu. The practical need for fourth normal form. In ACM SIGCSE, pages 19-23, 1992.
    • (1992) ACM SIGCSE , pp. 19-23
    • Wu, M.1
  • 43
    • 0021371332 scopus 로고
    • Database relations with null values
    • C. Zaniolo. Database relations with null values. J. Comput. Syst. Sci., 28(1):142-166, 1984.
    • (1984) J. Comput. Syst. Sci. , vol.28 , Issue.1 , pp. 142-166
    • Zaniolo, C.1


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