Abstract
Fork algebras arose in computer science as a relational framework for program specification and development. They also shown to have applications in algebraic logic, the latter because of their expressiveness and finite axiomatizability. In this paper we present a new application of fork algebras, namely, as a framework suitable for derivation by calculation of new strategies for optimization of queries in deductive object-oriented database.
This is a preview of subscription content, log in via an institution to check access.
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
G. A. Baum, M. F. Frias, A. M. Haeberer, and P. E. Martínez López. From Specifications to Programs: A Fork-algebraic Approach to Bridge the Gap. Document 731 HKO-4 of the IFIP W.G. 2.1, Hong Kong, January 1995.
L. H. Chin, A. Tarski. Distributive and Modular Laws in the Arithmetic of Relation Algebras. In University of California Publications in Mathematics. University of California, pages 341–384, 1951.
S. Cluet, C. Delobel. A general Framework for the Optimization of Object Oriented Queries. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, San Diego, California, 1992.
R. Cole, G. Graefe. Optimization of Dynamic Query Evaluations Plans. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, Minneapolis, Minnesota, 1994.
M. F. Frias, N. G. Aguayo. Natural Specifications vs. Abstract Specifications. A Relational Approach. In Proceedings of SOFSEM ‘94, Milovy, Czech Republic, November, pages 17–22, 1994.
M. F. Frias, N. G. Aguayo, and B. Novak. Development of Graph Algorithms with Fork Algebras. In Proceedings of the XIX Latinamerican Conference on Informatics, pages 529–554, 1993.
M. F. Frias, A. M. Haeberer, and P. A. S. Veloso. On the Metalogical Properties of Fork Algebras. In Proceedings of the Winter Meeting of the ASL, San Francisco, California, January 1995. The Journal of Symbolic Logic.
M. F. Frias, A. M. Haeberer, P. A. S. Veloso, and G. A Baum. Repre-sentability of Fork Algebras. In Proceedings of the Logic Colloquium ‘94, July, pages 51, 1994, To appear also in: The Journal of Symbolic Logic.
M. F. Frias, A. M. Haeberer, P. A. S. Veloso, and G. A Baum. Widening Representable Fork Algebras. In Proc. of the Tenth International Congress of Logic, Philosophy and Methodology of Science, Florence, Italy, August 1995.
M. F. Frias, G. A. Baum, A. M. Haeberer, and P. A. S. Veloso. Fork Algebras are Representable. In Bull. Section of Logic, Polish Academy of Sciences.
A. M. Haeberer, G. A. Baum, and G. Schmidt. On the Smooth Calculation of Relational Recursive Expressions out of First-Order Non-Constructive Specifications Involving Quantifiers. In Proceedings of the International Conference on Formal Methods in Programming and Their Applications, Springer-Verlag, LNCS 735, pages 281–298, 1993.
A. M. Haeberer, P. A. S. Veloso. Partial Relations for Program Derivation: Adequacy, Inevitability and Expressiveness. In Proceedings of the IFIP TC2 Working Conference on Constructing Programs from Specifications, North Holland., IFIP WG. 2.1, Bernhard Möller, 319–371, 1991.
C. J. Hogger. Derivation of Logic Programs. JACM, 28(2):372–392, 1981.
L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras, part I. Studies in Logic and the Foundations of Mathematics, North Holland, 64, 1971.
L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras, part IL Studies in Logic and the Foundations of Mathematics, North Holland, 115, 1985.
T. Imielinski, W. Lipski. The Relational Model of Data and Cylindric Algebras. Journal of Computer and System Sciences, 28:80–102, 1984.
M. Lee, J. Freytag, and G. Lohman Implementing an Interpreter for Functional Rules in a Query Optimizer. In Proceedings of the Fourteenth International Conference on Very Large Data Bases, Los Angeles, USA, 1988.
A. Pettorossi, M. Proietti. Rules and Strategies for Program Transformation, in Formal Program Development, IFIP TC2/WG2.1 State-of-the-Art Report, Springer-Verlag, LNCS, 755, 263–304.
A. Sampaio, A. M. Haeberer, C. Terra, C. Ururahy, M. F. Frias, and N. Albuquerque. PLATO: A Tool to Assist Programming as Term Rewriting and Theorem Proving. In Proceedings of TAPSOFT’95, Springer-Verlag, LNCS 915, pages 797–798.
S. Shekhar, J. Srivastava, and S. Dutta. A Formal Model of Trade-off between Optimization and Execution Costs in Semantic Query Optimization. In Proceedings of the Fourteenth International Conference on Very Large Data Bases, Los Angeles, USA, 1988.
A. Tarski. On the Calculus of Relations. Journal of Symbolic Logic, 6:73–89, 1941.
A. Tarski, S. Givant. A Formalization of Set Theory without Variables. A.M.S., Coll., Pub., 41, 1987.
P. A. S. Veloso, A. M. Haeberer. A Finitary Relational Algebra for Classical First-Order Logic. In Bull., Section of Logic, Polish Academy of Sciences, 20(2):52–62, 1991.
P. A. S. Veloso, A. M. Haeberer, and M. F. Frias. Fork Algebras as Algebras of Logic. In Proceedings of the Logic Colloquium ’94, July, pages 127, 1994. To appear also in: The Journal of Symbolic Logic.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 British Computer Society
About this paper
Cite this paper
Frias, M.F., Gordillo, S.E. (1996). Semantic Optimization of Queries in Deductive Object-Oriented Database. In: Eder, J., Kalinichenko, L.A. (eds) Advances in Databases and Information Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-1486-4_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-1486-4_5
Publisher Name: Springer, London
Print ISBN: 978-3-540-76014-6
Online ISBN: 978-1-4471-1486-4
eBook Packages: Springer Book Archive