Abstract
DEDUCE is a deductive query language proposed for relational data bases. This language allows one to state queries, axioms, integrity constraints, preferences, and heuristics. In this paper, we shall give a new syntax of DEDUCE for uniformly handling queries having existential, universal or numerical quantifiers. Axioms are used to define virtual relations. A user can make a query against virtual relations and original base relations. The query is evaluated in two steps: First, use axioms to transform the query into a query containing only base relations. Second, check if the transformed query can be answered from the front-end intensional information, such as integrity constraints, within a prespecified time limit. If it can, output the answer. Otherwise, evaluate the transformed query by using a data base system such as System R. In this paper, we shall use the rewriting rule approach to transform the query. In addition, an optimization problem about access methods for efficient deductions in a relational data base will be discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Astrahan, M. M., Blasgen, M. W., Chamberlin, D. C., Eswaran, K. P., Gray, J. N., Griffiths, P. P., King, W. F., Lorie, R. A., McJones, P. R., Mehl, J. W., Putzolu, G. R., Traiger, I. L., Wade, B. W., and Watson, V. [1976] System R: Relational Approach to Database Management, ACM Transactions on Database Systems1, 2 (June 1976), 97–137.
Bernstein, P. A. [1976] Synthesizing Third Normal Form Relations from Functional Dependencies, ACM Transactions on Database Systems1, 4 (Dec. 1976), 277–298.
Boyce, R. F., Chamberlin, D. D., King, W. F., Ill, and Hammer, M. M. [1975] Specifying Queries.as Relational Expressions: SQUARE, CACM IS, 11 (November 1975), 621–628.
Chamberlin, D. D., and Boyce, R. F. [1974] SEQUEL: A Structured English Query Language, Proceedings of the 1974 ACM-SIGFIDET Workshop on Data Description, Access and Control, ACM, New York, 1974.
Chang, C. L. [1976] DEDUCE — A Deductive Query Language for Relational Data Bases, In Pattern Recognition and Artificial Intelligence (C. H. Chen, Ed.), Academic Press, Inc., New York, 1976, 108–134.
Chang, C. L. [1978] An Opitmization Problem in Relational Data Bases, IBM Research Report RJ2287, San Jose, Calif., 1978.
Chang, C. L. and Lee, R. C. T. [1973] Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, N. Y., 1973.
Chang, C. L. and Slagle, J. R. [1977] Using Rewriting Rules for Connection Graphs to Prove Theorems, IBM Research Report RJ 2117, San Jose, Calif., 1977.
Clark, K. L. [1978] Negation as Failure, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 293–322.
Codd, E. F. [1970] A Relational Model for Large Shared Data Banks, CACM13, 6 (June 1970), 377–387.
Codd, E. F. [1971a] Further Normalization of the Data Base Relational Model, In Data Base Systems, Courant Computer Science Symposia Series, Vol. 6 (R. Rustin, Ed.), Prentice-Hall, 1971, 33–64.
Codd, E. F. [1971b] A Data Base Sublanguage founded on the Relational Calculus, Proceedings of 1971 ACM-SIGFIDET Workshop on Data Description, Access, and Control, ACM, New York, 1971.
Codd, E. F. [1974] Seven Steps to RENDEZVOUS with the Casual User, Proceedings IF IP Working Conference on Data Base Management, North-Holland Publishing Co., Amsterdam, 1974, 179–200.
Codd, E. F., Arnold, R. S., Cadiou, J-M., Chang, C. L. and Roussopoulos, N. [1978] RENDEZVOUS Version 1: An Experimental English Language Query Formulation System for Relational Data Bases, IBM Research Report RJ2144, San Jose, Calif., 1978.
Delobel, C., and Casey, R. G. [1972] Decomposition of a Data Base and the Theory of Boolean Switching Functions, IBM J. of Research and Development17, 5 (Sept. 1972), 370–386.
Fagin, R. [1976a] Relational Data Base Decomposition and Propositional Logic, IBM Research Report RJ1776, San Jose, Calif., 1976.
Fagin, R. [1976b] Multivalued Dependencies and a New Normal Form for Relational Databases, IBM Research Report RJ1812, San Jose, Calif., 1976.
Gotlieb, L. R. [1975] Computing Joins of Relations, Proc. of the ACM International Conference on Management of Data, San Jose, Calif., 1975, 55–63.
Kellogg, C., Klahr, P. and Travis, L. [1978] Deductive Planning and Pathfinding for Relational Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 179–200.
Klahr, P. [1977] Planning Techniques for Rule Selection in Deductive Question-Answering, In Pattern-Directed Inference Systems (D. Waterman and F. Hayes-Roth, Eds.), Academic Press, New York, 1977.
Kowalski, R. [1975] A Proof Procedure Using Connection Graphs, JACM22, 4 (October 1975), 572–595.
Lacroix, M., and Pirotte, A. [1977] Domain-Oriented Relational Languages, Proceedings of Third International Conference on Very Large Data Bases, Tokyo, Japan, Oct. 6–8, 1977, 370–378.
Lee, R. C. T. [1972] Fuzzy Logic and the Resolution Principle, JACM19, (1972), 109–119.
McSkimin, J. R. and Minker, J. [1978] A Predicate Calculus Based Semantic Network for Question-Answering Systems, In Associative Networks — The Representation and Use of Knowledge (N. Findler, Ed.), Academic Press, New York, 1978.
Minker, J. [1975a] Performing Inferences over Relational Data Bases, Proa, of 1975 ACM-SIGMOD International Conference on Management of Data,1975, 79–91.
Minker, J. [1975b] Set Operations and Inferences Over Relational Data Bases, Invited Paper, Proc. 4th Texas Conf. on Computing Systems, Nov. 1975. Also Univ. of Md. Technical Report TR-427, December 1975.
Minker, J. [1978] An Experimental Relational Data Base System Based on Logic, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 107–147.
Nicolas, J. M., and Demolombe, R. [1977] A Short Note on the Use of First Order Logic in the Formalization of Functional and Multivalued Dependencies, ONERA-CERT, Toulouse, France, 1977.
Nicolas, J. M. and Gallaire, H. [1978] Data Bases: Theory vs. Interpretation, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 33–54.
Nicolas, J. M. and Yazdanian, K. [1978] Integrity Checking in Deductive Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 325–344.
Pirotte, A. [1978] High Level Data Base Query Languages, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 409–436.
Reiter, R. [1978a] On Closed World Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 55–76.
Reiter, R. [1978b] Deductive Question-Answering on Relational Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, 1978, 149–177.
Rissanen, J. [1977] Independent Components of Relations, IBM Research Report RJ1899, IBM, San Jose, Calif. 1977.
Sickel, S. [1977] Formal Grammars as Models of Logic Derivations, Proceedings of IJCAI-77, 1911, 544–551.
Slagle, J. R., Chang, C. L., and Lee, R.C.T. [1970] A New Algorithm for Generating Prime Implicants, IEEE Trans. Computers C-19, 4 (April 1970), 304–310.
Zadeh, L. A. [1965] Fuzzy Sets, Information and Control 8. 1965, 338–353.
Zadeh, L. A. [1974] Fuzzy Logic and Approximate Reasoning, Memo No. ERL-M479, Electronics Research Laboratory, Univ. of Calif., Berkeley, November 1974.
Zadeh, L. A. [1977] PRUF — A Meaning Representation Language for Natural Language, Electronics Research Laboratory, Univ. of Calif., Berkeley, 1977.
Zloof, M. M. [1975] Query by Example, Proceedings of the National Computer Conference, Vol. 45, Anaheim, Calif., May, 1975, 431–438.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Plenum Press, New York
About this chapter
Cite this chapter
Chang, C.L. (1978). DEDUCE 2: Further Investigations of Deduction in Relational Data Bases. In: Gallaire, H., Minker, J. (eds) Logic and Data Bases. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-3384-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-4684-3384-5_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-3386-9
Online ISBN: 978-1-4684-3384-5
eBook Packages: Springer Book Archive