This Article 
 Bibliographic References 
 Add to: 
A Note on "Incomplete Relational Database Models Based on Intervals"
February 1996 (vol. 8 no. 1)
pp. 189-191

Abstract—In [5], a family of relational database models (M-1 to M-5) were proposed to represent unknown values by intervals. Relational operators were extended for evaluating queries on these models. In this note, we stultify the theorems claiming that query evaluation in models M-2, M-3, and M-5 is sound.

[1] T. Imielinski and W. Lipski Jr.,“Incomplete information in relational databases,” J. ACM, vol. 31, no. 4, pp. 761-791, 1984.
[2] D. Maier,The Theory of Relational Databases.Rockville, Md.: Computer Science Press, 1983.
[3] J. Minker,“On indefinite databases and the closed world assumption,” Proc. Automated Deduction Conf., pp. 292-308, 1982.
[4] A. Ola,“Relational databases with exclusive disjunctions,” Proc. IEEE Data Eng. Conf., pp. 328-336, 1992.
[5] A. Ola and G. Ozsoyoglu,“Incomplete relational database models based on intervals,” IEEE Trans. Knowledge and Data Engineering, vol. 5, no. 2, pp. 293-308, 1993.
[6] R. Reiter,"Towards a logical reconstruction of relational database theory," On Conceptual Modeling.New York: Springer-Verlag, pp. 191-233, 1984.

Index Terms:
Incomplete information, disjunctive information, null values, extended relational model, extended relational algebra.
Jui-Shang Chiu, Arbee L. P. Chen, "A Note on "Incomplete Relational Database Models Based on Intervals"," IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 1, pp. 189-191, Feb. 1996, doi:10.1109/69.485648
Usage of this product signifies your acceptance of the Terms of Use.