Abstract
The problem of evaluating queries on a relational database which is allowed to contain null values has been extensively studied. In general, most of the approaches to query evaluation in the literature seem to fall into two categories. Those in the first guarantee that answers to queries can be efficiently computed (i.e. in time polynomial in the database size), while being “incomplete” in the sense that they do not compute all “valid” answers to certain queries. The second kind guarantee “completeness” but unfortunately suffer from intractability. In this paper, we reexamine the proof-theoretic approach proposed by Reiter [Re 86] (which as proposed is incomplete) and present a “natural” interpretation of null values based on various possible null assignments. We show that this approach leads to completeness of query evaluation. We bring out the drawback of such an extension by showing that evaluation of even “simple” queries using this approach is co-NP-complete. We then propose an approach based on intuitionistic logic for the problem. The advantages are that query evaluation is now guaranteed to be complete (w.r.t. the new approach) and computable in time polynomial in the database size.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, G. Grahne, and P. Kanellakis, “The Data Complexity of Null Values,” SIGMOD 86, 1986.
J. Biskup, “Null Values in Database Relations,” In Advances in Database Theory, vol.1, H. Gallaire, J. Minker, and J.M. Nicolas, Eds., Plenum Press, NY, 1981.
J. Biskup, “A Foundation of Codd's Relational Maybe Operations,” ACM TODS 8, 4 (Dec. 1983), 608–636.
E.F. Codd, “Further Normalization of the Database Relational Model,” In Database Systems, R. Rustin, Ed., Prentice Hall, NJ, 1972.
E.F. Codd, “Extending the Database Relational Model to Capture more Meaning,” ACM TODS, 4, 4(Dec. 1979), 397–434.
R. Fagin, J.D. Ullman, and M.Y. Vardi, “On the Semantics of Updates in Databases,” Proc. 2nd ACM Symp. PODS, 1983, pp. 352–365.
M. Fitting, Intuitionistic Logic — Model Theory and Forcing, North Holland, Amsterdam, 1969.
M.R. Garey and D.S. Johnson, Computers and Intractability, Freeman, San Fransisco, 1979.
H. Gallaire and J. Minker, Logic and Databases, Plenum Press, NY, 1978.
H. Gallaire, J. Minker, and J.M. Nicolas, “Logic and Databases: A Deductive Approach,” Computing Surveys, 16, 2(June 1984), 151–185.
T. Imielinski and W. Lipski, “Incomplete Information in Relational Databases,” JACM, 31, 4(Oct. 1984), 761–791.
V.S. Lakshmanan, “Query Evaluation with Null Values: Different Notions of Completeness and Their Complexity,” in preparation.
W. Lipski, “On Databases with Incomplete Information,” JACM, 28, 1(Jan. 1981), 41–70.
J.M. Nicolas and J. Minker, “Database Theory vs. Interpretation,” In Logic and Databases, Plenum Press, NY, 1978, pp. 33–54.
D. Maier, The Theory of Relational Databases, Computer Science Press, Maryland, 1983.
J. Minker, “On Indefinite Databases and the Closed World Assumption,” Proc. 6th Conf. Automated Deduction, LNCS, vol. 138, Springer Verlag, 1982, pp. 292–308.
R. Reiter, “Towards a Logical Reconstruction of Relational Database Theory,” In On Conceptual Modeling (M.L. Brodie et al Eds.), Springer, NY, 1984, pp. 191–233.
R. Reiter, “A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values,” JACM, 33, 2(Apr. 1986), 349–370.
H. Raisowa and R. Sikorski, The Mathematics of Metamathematics, Pnastwowe Wydawnictwo Naukowe, Warszawa, 1963.
R.T. Smullyan, “First Order Logic,” Springer, Berlin, 1968.
J.R. Shoenfield, Mathematical Logic, Addison-Wesley, Mass., 1969.
J.D. Ullman, Principles of Database Systems, Computer Science Press, Maryland, 1980.
M.Y. Vardi, “Querying Logical Databases,” Proc. 4th ACM Symp. PODS, 1985, pp. 57–65 (also see JCSS 33, 2 (Oct 1986), 142–160).
M.Y. Vardi, “On the Integrity of Databases with Incomplete Information,” Proc. 5th ACM Symp. PODS, 1986, pp. 252–266.
Y. Vasiliou, “Null Values in Database Management: A Denotational Semantics Approach,” Proc. ACM SIGMOD Conf. ICMOD, 1979, pp. 162–169.
L.C. Yuan and D.-A. Chiang, “A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values,” ACM SIGMOD, 1988.
C. Zaniolo, “Database Relations with Null Values,” Proc. 1st ACM Symp. PODS, 1982, pp. 27–33 (also see JCSS 28 (1984), 142–166).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lakshmanan, V.S. (1989). Query evaluation with null values: How complex is completeness?. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_45
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive