Abstract
We specify a data model with object-oriented and logic-oriented features. The model is based on F-logic. For this model, we study a decomposition of a class, the counterpart to the well-known decomposition of a relation scheme under functional dependencies. For this decomposition of a class, the transformation pivoting is used. Pivoting transplants some attributes of the class to a newly generated class. This new class is a subclass of the result class of the so-called pivot attribute. The pivot attribute maintains the link between the original class and the new subclass. We identify the conditions under which input and output of pivoting are equivalent. Additionally, we show under which conditions a schema with functional dependencies can be recursively transformed into an equivalent one without non-key functional dependencies.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Abiteboul and P.C. Kanellakis, Building an Object-Oriented Database System: The Story of O2, 1st edn. (Morgan Kaufmann, San Mateo, CA, 1992) chapter 5.
J. Biskup, Database schema design theory: Achievements and challenges, in: Proc. 6th Int. Conf. Inf. Syst. and Management of Data, Bombay, 1995, ed. S. Bhalla, Lecture Notes in Computer Science, Vol. 1006 (Springer, 1995) pp. 14-44.
J. Biskup, R. Menzel and T. Polle, Transforming an entity-relationship schema into object-oriented database schemas, in: Adv. in Databases and Inf. Syst., Moscow 95, eds. J. Eder and L. A. Kalinichenko, Workshops in Computing (Springer, 1996) pp. 109-136.
J. Biskup, R. Menzel, T. Polle and Y. Sagiv, A case study on object-oriented database schema design, in: Int. Baltic Workshop on Databases and Inf. Syst., Tallinn, Estonia, eds. H.-M. Haav and B. Thalheim (1996).
J. Biskup, R. Menzel, T. Polle and Y. Sagiv, Decomposition of relationships through pivoting, in: Proc. 15th Int. Conf. on Conceptual Modeling, Cottbus, Germany, ed. B. Thalheim, Lecture Notes in Computer Science, Vol. 1157 (Springer, 1996) pp. 28-41.
J. Biskup and T. Polle, Constraints in object-oriented databases, Technical report, FB Informatik, LS 6, University of Dortmund (2000), http://ls6-www.cs.uni-dortmund.de/lssi/ archive/literature/2000/Biskup_Polle:2000b.ps.gz.
J. Biskup and T. Polle, Decomposition of database classes under path functional dependencies and onto constraints, in: Proc. Foundations of Inf. and Knowledge Base Syst., eds. B. Thalheim and K.-D. Schewe, Lecture Notes in Computer Science, Vol. 1762 (Springer, 2000) pp. 31-49.
J. Demetrovics, L.O. Libkin and I.B. Muchnik, Functional dependencies in relational databases: A lattice point of view, Discrete Applied Mathematics 40 (1992) 155-185.
C.S. dos Santos, S. Abiteboul and C. Delobel, Virtual schemas and bases, in: Adv. in Database Technology-EDBT '94, eds. M. Jarke, J. Bubenko and K. Jeffery, Lecture Notes in Computer Science, Vol. 779 (Springer, 1994) pp. 81-94.
M. Gyssens, On the complexity of join queries, ACM Transactions on Database Systems 11 (1986) 81-108.
J.L. Johnson and G. Fernandez, Re-engineering relational normal forms in an object-oriented framework, in: 1997 Int. Conf. on Object Oriented Inf. Syst., Brisbane, eds. M.E. Orlowska and R. Zicari, (Springer, Berlin, 1997) pp. 433-452.
M. Kifer and J. Wu, A logic for object-oriented logic programming (Maier's O-logic revisited), in: Proceedings of 8th ACM PODS (1989) pp. 389-393.
M. Kifer and G. Lausen, F-logic: A higher order language for reasoning about objects, inheritance, and schema, in: Proc. 1989 ACM SIGMOD Int. Conf. on Management of Data, eds. J. Clifford, B.G. Lindsay and D. Maier (1989) pp. 134-146.
M. Kifer, G. Lausen and J. Wu, Logical foundations of object-oriented and frame-based languages, Journal of ACM 42(4) (1995) 741-843.
D. Maier, A logic for objects, in: Workshop on Foundations of Deductive Databases and Logic Programming, Washington, DC (1986) pp. 6-26.
J.A. Makowsky and E.V. Ravve, Dependency preserving refinements and the fundamental problem of database design, Data and Knowledge Engineering 24(3) (1998) 277-312.
H. Mannila and K.-J. Räihä, Practical algorithms for finding prime attributes and testing normal forms, in: Proceedings of 8th ACM PODS (1989) pp. 128-133.
H. Mannila and K.-J. Räihä, The Design of Relational Databases (Addison-Wesley, Wokingham, UK, 1992).
W.Y. Mok, Y.-K. Ng and D.W. Embley, A normal form for precisely characterizing redundancy in nested relations, ACM Transactions on Database Systems 21(1) (1996) 77-106.
T. Polle, On representing relationships in object-oriented databases, Ph.D. thesis, FB Informatik/LS6, Universität Dortmund, Dortmund (2000).
R. Reiter, Equality and domain closure in first-order databases, Journal of ACM 27(2) (1980) 235-249.
B. Thalheim, Foundations of entity-relationship modeling, Annals of Mathematics and Artificial Intelligence 7 197-256.
M.W. Vincent, Semantic foundations of 4NF in relational database design, Acta Informatica 36(3) (1999) 173-213.
M.W. Vincent and B. Srinivasan, Redundancy and the justification for fourth normal form in relational databases, International Journal of Foundations of Computer Science 4 (1993) 355-365.
G.E. Weddell, A theory of functional dependencies for object-oriented data models, in: Proc. 1st Deductive and Object-Oriented Databases (DOOD '89), Kyoto, Japan, eds. W. Kim, J.-M. Nicolas and S. Nishio (Elsevier Science/North-Holland, Amsterdam, 1989) pp. 165-184.
G.E. Weddell, Reasoning about functional dependencies generalized for semantic data models, ACM Transactions on Database Systems 17(1) (1992) 32-64.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Biskup, J., Polle, T. Decomposition of object-oriented database schemas. Annals of Mathematics and Artificial Intelligence 33, 119–155 (2001). https://doi.org/10.1023/A:1013134906161
Issue Date:
DOI: https://doi.org/10.1023/A:1013134906161