Abstract
The design theory of database schemas deals with the possibilities of representing parts of the real world within a data model such that information on the real world can simply and efficiently be obtained just by looking at its representation, i.e., just by querying the database. In this paper, we try to direct the reader's attention to the schema design problem for deductive (or logic oriented) databases. In order to provide a formal framework for a thorough investigation of this problem we present a simple logic oriented data model and carefully develop a general design methodology for it, based on schema properties, corresponding schema transformations and a notion of query faithfulness. Schema properties are meant to be formalizations of desirable aspects of "good" schemas, while schema transformations are used in order to achieve these properties by restructuring and improving an initial design. Of course the final schema should somehow support the initial design. This requirement is formalized by our notion of query faithfulness.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M.E. Adiba, B.G. Lindsay, ‘Database snapshots', Proc. International Conference on Very Large Databases VLDB, 1980, 86–91.
A.V. Aho, J.D. Ullman, ‘Universality of data retrieval languages', Proc. ACM Symposium on Principles of Programming Languages, 1979, 110–120.
K.R. Apt, M.H. van Emden, ‘Contributions to the theory of logic programming', Journal of the ACM, Vol. 29, No. 3, 1982, 841–862.
J. Biskup, B. Convent, ‘A formal view integration method', Proc. ACM-SIGMOD International Conference on Management of Data, 1986, 398–407.
J. Biskup, ‘Entwurf von Datenbankschemas durch schrittweises Umwandeln verbotener Teilstrukturen', Tagungsband GI-EMISA-Fachgespräch Entwurf von Informationssystemen — Methoden und Modelle, 1985, 130–148.
B. Convent, ‘On the design of logic oriented database schemes', Proc. Workshop on Relational Databases and their Extensions, Lessach (Austria), Technical Report 87/3, TU Clausthal, 1987, 185–203.
B. Convent, ‘Deciding finiteness, groundness and domain independence of pure datalog queries', Hildesheimer Informatikberichte 2/1988, 1988, to appear in: Journal of Information Processing and Cybernetics EIK.
S.S. Cosmadakis, C.H. Papadimitriou, ‘Updates of relational views', Proc. ACM-SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983, 317–331.
R. Fagin, ‘Multivalued dependencies and a new normal form for relational databases, ACM Transactions on Database Systems, Vol. 2, No. 3, 262–278, 1977.
A.L. Furtado, M.A. Casanova, ‘Updating relational views', Technical Report 020, IBM do Brasil, 1984.
H. Gallaire, J. Minker, J.-M. Nicolas, ‘Logic and databases: a deductive approach', ACM Computing Surveys, Vol. 16, No. 2, 1984, 153–185.
P. Helman, R. Veroff, A. Cable, ‘Deductive database design in the presence of updates', Technical Report CS87-9, University of New Mexico, Albuquerque, 1987.
P. Helman, R. Veroff, ‘Designing deductive databases', Journal of Automated Reasoning, Vol. 4, No. 1, 1988, 29–68.
A.M. Keller, ‘Updating relational databases through views', Dissertation, Stanford University, 1985.
Y.E. Lien, ‘On the equivalence of database models', Journal of the ACM, Vol. 29, No. 2, 333–362, 1982.
J.W. Lloyd, ‘Foundations of logic programming', 2nd ed., Springer, 1987.
J. Minker, ‘Perspectives in deductive databases', Journal of Logic Programming, Vol. 5, No. 1, 1988, 33–60.
J.-M. Nicolas, H. Gallaire, ‘Data base: theory vs. interpretation', in: H. Gallaire, J. Minker (eds.), ‘Logic and databases', Plenum Publishing Corporation, 1978, 33–54.
R. Reiter, ‘Towards a logical reconstruction of relational database theory', in: ‘On conceptual modelling', M.L. Brodie, J. Mylopoulos, J.W. Schmidt (eds.), Springer, 1984, 191–233.
J.C. Shepherdson, ‘Negation in logic programming', in: ‘Foundations of deductive databases and logic programming', J. Minker (ed.), Morgan Kaufmann, 1988, 19–88.
H. Stiefeling, ‘Änderungen auf Sichten relationaler Datenbanken', Diplomarbeit, Universität Dortmund, 1984.
T.J. Teorey, J.P. Fry, ‘Design of database structures', Prentice-Hall, 1982.
J.D. Ullman, ‘Principles of database and knowledge-base systems', Computer Science Press, 1988.
M.Y. Vardi, ‘Fundamentals of dependency theory', IBM Research Report RJ 4858, IBM Research Laboratory, San Jose, 1985.
M.H. van Emden, R.A. Kowalski, ‘The semantics of predicate logic as a programming language', Journal of the ACM, Vol. 23, No. 4, 1976, 733–742.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biskup, J., Convent, B. (1989). Towards a schema design methodology for deductive databases. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-51251-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51251-6
Online ISBN: 978-3-540-46182-1
eBook Packages: Springer Book Archive