Translation schemes and the fundamental problem of database design

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1157 LNCS, Issue , 1996, Pages 5-26

  Makowsky, J A ^a   Ravve, E V ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DATA PRESENTATION; DATABASE DESIGN; INCLUSION DEPENDENCIES; NORMAL FORM; STRUCTURE TRANSFORMATIONS; TRANSLATION SCHEMES;

DATABASE SYSTEMS;

EID: 21444436761     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0019911     Document Type: Conference Paper

References (27)

1. [AHV94] S. Abiteboul, R. Hull, and V. Vianu. Foundations of Database. Addison Wesley, 1994.
2. [BS81] F. Bancilhon and N. Spyratos. Update semantics of relational views. ACM Transactions on Database Systems, 6(4):557-575, 1981.
3. [BV84] C. Beeri and M. Vardi. Formal systems for tuple and equality generating dependencies. SIAM Journal on Computing, 13(1):76-98, 1984.
4. [CH90] K.J. Compton and C.W. Henson. A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic, 48:1-79, 1990.
5. [CLM81] A. Chandra, H. Lewis, and J.A. Makowsky. Embedded implicational dependencies and their implication problem. In ACM Symposium on the Theory of Computing 1981, pages 342-354. ACM, 1981.
6. [Cou94] B. Courcelle. Monadic second order graph transductions: A survey. Theoretical Computer Science, 126:53-75, 1994.
7. [Dah83] E. Dahlhaus. Reductions to NP-complete problems by interpretations. In E. Borger et. al., editor, Logic and Machines: Decision Problems and Complexity, volume 171, pages 357-365. Springer Verlag, 1983.
8. [Daw93] A. Dawar. Feasible Computation Through Model Theory. PhD thesis, Department of Computer Science, University of Maryland, 1993.
9. [EFT94] H.D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic, 2nd edition. Undergraduate Texts in Mathematics. Springer-Verlag, 1994.
10. [FV86] R. Fagin and M. Vardi. The theory of data dependencies. In M. Anshel and W. Gewirtz, editors, Proceedings of Symposia in Applied Mathematics, volume 34 of American Mathematical Society, pages 19-71. RI, 1986.
11. [HB70] D. Hilbert and P. Bernays. Grundlagen der Mathematik, I, volume 40 of Die Grundleheren der mathematischen Wissenschaften in Einzeldarstellungn. Springer Verlag, Heidelberg, 2nd edition, 1970.
12. [Her95] C. Herrmann. On the ubdecidability of implication between embedded multivalued database dependencies. Information and Computation, 122:221-235, 1995.
13. [Imm87] N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760-778, Aug 1987.
14. [Kol90] P.G. Kolaitis. Implicit definability on finite structures and unambiguous computations. In FOCS'90, pages 168-180. IEEE, 1990.
15. [KU84] A. Keller and J.D. Ullman. On complementary and independent mappings. Proc. ACM SIGMOD Symp. on the Management of Data, pages 145-148, 1984.
16. [Mak94] J.A. Makowsky. Capturing complexity classes with Lindstrom quantifiers. In MFCS'94, volume 841 of Lecture Notes in Computer Science, pages 6871. Springer Verlag, 1994.
17. [MPS90] J. Mycielski, P. Pudlak, and A.S. Stern. A Lattice of Chapters of Mathematics, volume 426 of Memoirs of the American Mathematical Society. American Mathematical Society, 1990.
18. [MR92] H. Mannila and K.J. Raiha. The Design of Relational Databases. Addison- Wesley, 1992.
19. [MR96] J.A. Makowsky and E. Ravve. Dependency preserving refinment of database schemes. Technical Report, April 1996, Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel, 1996.
20. [MV86] J.A. Makowsky and M. Vardi. On the expressive power of data dependencies. Acta Informatica, 23.3:231-244, 1986.
21. [PDGV89] J. Paredaens, P. De Bra, M. Gyssens, and D. Van Gucht, editors. The Structure of the Relational Database Model, volume 17 of EATCS Monographs on Theeoretical Computer Science. Springer Verlag, Heidelberg, 1989.
22. [Rab65] M.A. Rabin. A simple method for undecidability proofs and some applications. In Y. Bar Hillel, editor, Logic, Methodology and Philosophy of Science II, Studies in Logic, pages 58-68. North Holland, 1965.
23. [Tha91] B. Thalheim. Dependencies in Relational Databses, volume 126 of Teubner- Texte zur Mathematik. B.G. Teubner Verlagsgesellschaft, Leipzig, 1991.
24. [Tha93] B. Thalheim. Foundation of entity-relationship modeling. Annals of Mathematics and Artificial Intelligence, 7:197-256, 1993.
25. [Tha94] B. Thalheim. A survey on database constraints. Reine Informatik 1-8/1994, Fakultat fur Mathematik, Naturwissenschaften und Informatik, 1994.
26. [U1182] J.D. Ullman. Principles of Database Systems. Principles of Computer Science Series. Computer Science Press, 2nd edition, 1982.
27. [Var87] M. Vardi. Fundamentals of dependency theory. In Trends in Theoretical Computer Science, pages 171-224. Computer Science Press, 1987.