Abstract
A simple semantic or object-based data model is considered, which includes objects and object identifiers, classes and class hierarchies, attributes ranging over atomic values. Transactions are composed from five, basic operators manipulating objects. Preservation of functional and acyclic inclusion dependencies by transactions is studied in such a context of semantic databases and update transactions. It is shown to be decidable whether a given transaction preserves a given set of functional dependencies, or acyclic inclusion dependencies, or both functional and acyclic inclusion dependencies. Time complexity (with respect to the sizes of transactions and database schemas) for testing preservation is also discussed. It turns out that the problem is co-NP-complete in the simplest cases where there is only one nontrivial dependency and transactions consist of only creations and deletions of objects. It implies that the problem is at least co-NP-hard in general.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
[AH87] Abiteboul, S., Hull, R.: IFO: a formal semantic database model. ACM Trans. Database Syst.12(4), 525–565 (1987)
[AV88a] Abiteboul, S., Vianu, V.: The connection of static constraints with determinism and boundedness of dynamic specifications. In: Beeri, C., Schmidt, J.W., Dayal, U. (eds.) Proceeding of 3rd International Conference on Data and Knowledge Bases, pp. 324–334, Jerusalem, Israel, June 1988
[AV88b] Abiteboul, S., Vianu, V.: Equivalence and optimization of relational transactions. J. ACM35, (1), 70–120 (1988)
[AV89] Abiteboul, S., Vianu, V.: A transaction-based approach to relational database specification. J. ACM36(4), 758–789 (1989)
[Bee88] Beech, D.: A foundation for evalution from relational to object databases. In: Schmidt, J.W., Ceri, S., Missikoff, M. (eds.) Advances in database technology-EDBT '88 (Lect. Notes Comput. Sci., vol. 303, pp. 251–270) Berlin, Heidelberg, New York: Springer 1988
[CFP84] Casanova, M.A., Fagin, R., Papadimitriou, C.H.: Inclusion dependencies and their interaction with functional dependencies. J. Comput. Syst. Sci.28, 29–59 (1984)
[Cod70] Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM13(6), 377–387 (1970)
[GJ79] Garey, M.R., Johnson, D.S.: Computer and intractability: a guide to the theory of NP-completeness. New York: W.H. Freeman 1979
[HK87] Hull, R., King, R.: Semantic data modeling: survey, applications, and research issues. ACM Comput. Surv.19(3), 201–260 (1987)
[HM81] Hammer, M., McLeod, D.: Database description with SDM: a semantic database model. ACM Trans. Database Syst.6(3), 351–386 (1981)
[Klu80] Klug, A.: Calculating constraints on relational expressions. ACM Trans. Database Syst.5(3), 260–290 (1980)
[KP82] Klug, A., Price, R.: Determining view dependencies using tableaux. ACM Trans. Database Syst.7(3), 361–380 (1982)
[Mai83] Maier, D.: The theory of relational databases. Potomac, MD: Computer Science Press 1983
[Su91] Su, J.: Dynamic constraints and object migration. Technical Report, Dept. of Computer Science, UCSB 1992 (An extended abstract appears in Proc. Int. Conf. on Very Large Data Bases, 1991)
[Ull82] Ullman, J.D.: Principles of database systems, 2nd edn. Potomac, MD: Computer Science Press 1982
[Ull88] Ullman, J.D.: Database and knowledge-base systems, vol. 1. Potomac, MD: Computer Science Press 1988
Author information
Authors and Affiliations
Additional information
This work supported in part by NSF grants IRI-9109520 and IRI-9117094
Rights and permissions
About this article
Cite this article
Su, J. Dependency preservation in semantic databases. Acta Informatica 31, 27–54 (1994). https://doi.org/10.1007/BF01178921
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01178921