SET-THEORETIC PROBLEMS OF NULL COMPLETION IN RELATIONAL DATABASES.

被引：0
|
作者：
Keller, Arthur M. [1 ]
机构：
[1] Stanford Univ, Stanford, CA, USA, Stanford Univ, Stanford, CA, USA
来源：
| 1600年 / 22期
关键词：
NULL COMPLETION;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] SET-THEORETIC PROBLEMS OF NULL COMPLETION IN RELATIONAL DATABASES
    KELLER, AM
    INFORMATION PROCESSING LETTERS, 1986, 22 (05) : 261 - 265
  • [2] SOME DECISION PROBLEMS ON VIEWS IN RELATIONAL DATABASES.
    Ito, Minoru
    Iwawaki, Motoaki
    Taniguchi, Kenichi
    Kasami, Tadao
    Systems, computers, controls, 1982, 13 (03): : 79 - 86
  • [3] Some problems and techniques in set-theoretic topology
    Tall, Franklin D.
    SET THEORY AND ITS APPLICATIONS, 2011, 533 : 183 - 209
  • [4] ON INTELLIGENT ACCESS TO RELATIONAL DATABASES.
    Furukawa, Koichi
    Japan Annual Reviews in Electronics, Computers & Telecommunications: Computer Science & Technologi, 1982, : 250 - 264
  • [5] Relational databases. The real story
    Anon
    1600, (15):
  • [6] Problems of set-theoretic non-standard analysis
    Kanovei, V. G.
    Lyubetskii, V. A.
    RUSSIAN MATHEMATICAL SURVEYS, 2007, 62 (01) : 45 - 111
  • [7] SET-THEORETIC MEREOLOGY
    Hamkins, Joel David
    Kikuchi, Makoto
    LOGIC AND LOGICAL PHILOSOPHY, 2016, 25 (03) : 285 - 308
  • [8] ON SET-THEORETIC INTERSECTIONS
    LYUBEZNIK, G
    JOURNAL OF ALGEBRA, 1984, 87 (01) : 105 - 112
  • [9] Set-theoretic blockchains
    Habic, Miha E.
    Hamkins, Joel David
    Klausner, Lukas Daniel
    Verner, Jonathan
    Williams, Kameryn J.
    ARCHIVE FOR MATHEMATICAL LOGIC, 2019, 58 (7-8) : 965 - 997
  • [10] POLYMORPHISM IS NOT SET-THEORETIC
    REYNOLDS, JC
    LECTURE NOTES IN COMPUTER SCIENCE, 1984, 173 : 145 - 156
12345