The complexity of embedded axiomatization for a class of closed database views

Annals of Mathematics and Artificial Intelligence

Volumn 46, Issue 1-2, 2006, Pages 38-97

  Hegner, Stephen J ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

Complexity; Database; View

Indexed keywords

EID: 33645699253     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-005-9013-y     Document Type: Conference Paper

References (28)

1. S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, 1995).
2. J. Adámek, H. Herrlich and G. Strecker, Abstract and Concrete Categories (Wiley-Interscience, 1990).
3. F. Bancilhon and N. Spyratos, Update semantics of relational views, ACM Transactions on Database Systems 6 (1981) 557-575.
4. C. Beeri and M.Y. Vardi, Formal systems for tuple and equality generating dependencies, SIAM Journal on Computing 13(1) (1984) 76-98.
5. C. Beeri and M.Y. Vardi, A proof procedure for data dependencies, Journal of the Association for Computing Machinery 31(4) (1984) 718-741.
6. A.K. Chandra and M.Y. Vardi, The implication problem for functional and inclusion dependencies is undedidable, SIAM Journal on Computing 14 (1985) 671-677.
7. S. Cosmadakis, P.C. Kannelakis and M.Y. Vardi, Polynomial-time implication problems for unary inclusion dependencies, Journal of the Association for Computing Machinery 37(1) (1990) 15-46.
8. S. Cosmadakis and C. Papadimitriou, Updates of relational views, Journal of the Association for Computing Machinery 31 (1984) 742-760.
9. B.A. Davey and H.A. Priestly, Introduction to Lattices and Order, 2nd edition (Cambridge University Press, 2002).
10. R. Elmasri and S.B. Navathe, Fundamentals of Database Systems, 4th edition (Pearson Education, 2004).
11. R. Fagin, Horn clauses and database dependencies, Journal of the Association for Computing Machinery 29(4) (1982) 952-985.
12. R. Fagin and M.Y. Vardi, Armstrong databases for functional and inclusion dependencies, Information Processing Letters 16 (1983) 13-19.
13. J.N., Foster, M.B. Greenwald, J.T. Moore, B.C. Pierce and A. Schmitt, Combinators for Bi-Directional Tree Transformations; A Linguistic Approach to the View Update Problem, Technical Report MS-CIS-04-15, Department of Computer Science, University of Pennsylvania, 2004. to appear in POPL 2005.
14. J. Grant and B.E. Jacobs, On the family of generalized dependency constraints, JACM 29(4) (1982) 986-997.
15. S.J. Hegner, 1990, Foundations of canonical update support for closed database views, in: ICDT' 90, Third International Conference on Database Theory, eds. S. Abiteboul and P.C. Kanellakis (Paris, France), pp. 422-436, December.
16. S.J. Hegner, Some open problems on view axiomatization, Bulletin of the EATCS 40 (1990) 496-498.
17. S.J. Hegner, Characterization of desirable properties of general database decompositions, Annals of Mathematics and Artificial Intelligence 7 (1993) 129-195.
18. S.J. Hegner, Unique complements and decompositions of database schemata, Journal of Computer and System Sciences 48(1) (1994) 9-57.
19. S.J. Hegner, 2002, Uniqueness of update strategies for database views, in: Foundations of Information and Knowledge Systems: Second International Symposium, FoIKS 2002, Salzau Castle, Germany, February 2002, Proceedings, pp. 230-249.
20. S.J. Hegner, An order-based theory of updates for database views, Annals of Mathematics and Artificial Intelligence 40 (2004) 63-125.
21. S.J. Hegner, The relative complexity of updates for a class of database views, in: Foundations of Information and Knowledge Systems: Third International Symposium, FoIKS 2004, Wilehminenberg Castle, Austria, February 17-20, 2004, Proceedings, Vol. 2942 of Lecture Notes in Computer Science, eds. D. Seipel and J.M. Turull-Torres, (2004) pp. 155-175.
22. E. Horowitz, S. Sahni and S. Rajasekaran, Computer Algorithms (Computer Science, 1998).
23. R. Hull, Finitely specifiable implicational dependency families, Journal of the Association for Computing Machinery 31(2) (1984) 210-226.
24. B.E. Jacobs, A.R. Aronson and A.C. Klug, On interpretations of relational languages and solutions to the implied constraint problem, ACM Transactions on Database Systems 7(2) (1982) 291-315.
25. J. Lechtenbörger and G. Vossen, On the computation of relational view components, ACM Transactions on Database Systems 28 (2003) 175-208.
26. J. Paredaens, P. De Bra, M. Gyssens and D. Van Gucht, The Structure of the Relational Database Model (Springer, 1989).
27. B. Thalheim, Dependencies in Relational Databases, Vol. 126 of Teubner-Texte zur Mathematik (Teubner, 1991).
28. K. Wang and M.H. Graham, Constant-time maintainability: A generalization of independence, ACM Transactions on Database Systems 17(2) (1992) 201-246.