Abstract
An incomplete database T combines two types of information about the real world modeled by the database : (a) the relational database with null values ("value not known") represented by axioms of a First Order Theory T0 and (b) the data dependencies that are known to be satisfied in the real world. For a given set of dependencies (functional and inclusion dependencies), a chase process transforms in two steps ("forward" and "backward" chase) type (b) information into an equivalent type (a) form. This yields a new first order theory T1 ; for a class Γ of queries (subclass of monotone queries) the evaluation on T and on T1 are equivalent. A technique involving both algebraic and theorem-proving methods provides for a sound and complete evaluation of the query.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. H. Graham, A new proof that the chase is a Church-Rosser replacement system, June 1980.
G. Grahne, Dependency satisfaction in databases with incomplete information. Proc. 10th Symp. on Very Large Data Bases, Singapore, Aug. 1984, 37–47.
P. Honeyman, Testing Satisfaction of Functional Dependencies. J. Assoc. Comput. Mach. 29, 3(July 1982), 668–677.
T. Imielinski, W. Lipski, Incomplete information in Relational Databases. J. Assoc. Comput. Mach. 31, 4(Oct. 1984), 761–791.
T. Imielinski, W. Lipski, Dependencies in relational databases with incomplete information. To appear.
T. Imielinski, On algebraic query processing in logical databases. In Advances in Data Base Theory, vol 2 (H. Gallaire, J. Minker, J.-M. Nicolas, eds), Plenum Press, New York, 1984, 285–318.
T. Imielinski, Abstraction in Query Processing. 1985.
J. Janas, On the feasibility of informative answers. In Advances in Database Theory, vol. 1 (H. Gallaire, J. Minker and J. M. Nicolas, eds), Plenum Press, New York, 1981, pp. 397–414.
D. S. Johnson and A. Klug, Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. J. Computer Syst. Sci. 28, 167–189 (1984).
N. Lerat, W. Lipski, Non-applicable nulls. To appear in Theoretical Computer Science.
J.-M. Nicolas, First order logic formalization for functional, multivalued, and mutual dependencies. Proc. ACM SIGMOD Symp. on Management of Data, 1978, 40–46.
R. Reiter, Towards a logical reconstruction of relational database theory. In Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages (M. L. Brodie, J. Mylopoulos and J. Schmidt, eds), Springer-Verlag, to appear.
R. Reiter, A sound and sometimes complete query evaluation algorithm for relational databases with null values. Techn. Rep., Dept. of Computer Science, Univ. of British Columbia, Vancouver, BC, June 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lerat, N. (1986). Query processing in incomplete logical databases. In: Ausiello, G., Atzeni, P. (eds) ICDT '86. ICDT 1986. Lecture Notes in Computer Science, vol 243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17187-8_41
Download citation
DOI: https://doi.org/10.1007/3-540-17187-8_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17187-4
Online ISBN: 978-3-540-47346-6
eBook Packages: Springer Book Archive