Developing an Application Concept of Data Dependencies of Transactions to Relational Databases

Author Title Number of Pages Date Jouni Laakso Developing an Application Concept of Data Depencies of Transactions to Relational Databases 73 pages + 5 appendices 18. February 2016 Degree Master of Engineering Degree Programme Information Technology Instructor Pasi Ranne, Senior Lecturer Information systems usually use a relational database to store the application data. The relational database can be used outside of the scope of the application. The information systems has to verify the attributes to be the attributes of the transactions to the relational database. The integrity verification includes the verification of the atomicity of the attribute values and the form of their values matching the attributes type. Integrity verification includes the verification and the checking of the dependency constraints. The dependency constraints are usually other attributes the attributes are dependent on. Applications are reprogrammed for different purposes. It has been noted that a complete information system and a new application program is not always needed in the most simple information systems. Sometimes a database query language is enough to use a relational database. For example an administrator of an application can remove and add users with an SQL-editor. The thesis studies the automatic checking of the attributes of the transactions with consistency and integrity verification. The purpose was to develop a concept automatically checking the integrity and consistency of the applications attributes. With the help of the concept, the quality of the application should improve with the help of the reusable application components and with a generic application to be used in different purposes. The application concept could be used in the simplest applications where program logic is not needed. The concept can be used in some part to replace the integrity verification of the relational database management system if the application does not use a relational database. It is also intended to use response messages helping the user to insert missing and mistyped attribute values based on the integrity verification. Consistency and integrity in a relational database are based on relational theory. The relational theory has been developed to its current state mostly already in two decades starting from the year 1970. In the thesis, the algorithms providing the consistency has been researched and studied. The possibilities to develop an application concept based on the algorithms is evaluated with the relational theory.

[1]  Heikki Mannila,et al.  Design by Example: An Application of Armstrong Relations , 1986, J. Comput. Syst. Sci..

[2]  S. Esakkirajan,et al.  Fundamentals of relational database management systems , 2007 .

[3]  Luca Cardelli,et al.  Typeful Programming , 1989, Formal Description of Programming Concepts.

[4]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[5]  Victor M. Markowitz,et al.  Referential Integrity Revisited: An Object-Oriented Perspective , 1990, VLDB.

[6]  Claude Delobel,et al.  Decompositions and functional dependencies in relations , 1980, TODS.

[7]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[8]  D. E. Rutherford,et al.  Introduction to Lattice Theory , 1966 .

[9]  Robert Roth Stoll,et al.  Set theory and logic , 1963 .

[10]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[11]  Paris C. Kanellakis,et al.  Elements of Relational Database Theory , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[12]  Jennifer Widom,et al.  Database Systems: The Complete Book , 2001 .

[13]  Stéphane Bressan,et al.  Introduction to Database Systems , 2005 .

[14]  Philip A. Bernstein,et al.  Synthesizing third normal form relations from functional dependencies , 1976, TODS.

[15]  E. F. Codd,et al.  The Relational Model for Database Management, Version 2 , 1990 .

[16]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[17]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[18]  Ronald Fagin,et al.  Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[19]  B. N. Rossiter,et al.  The Functorial Data Model-An Extension to Functional Databases , 1994 .

[20]  Catriel Beeri,et al.  On the menbership problem for functional and multivalued dependencies in relational databases , 1980, TODS.

[21]  Zubair Ahmed Shaikh,et al.  An extended synthesis algorithm for relational database schema design , 2013, ISDOC.

[22]  H. Enderton.  Elements of Set Theory , 1977 .

[23]  Ronald Fagin,et al.  A normal form for relational databases that is based on domains and keys , 1981, TODS.

[24]  Catriel Beeri,et al.  Equivalence of Relational Database Schemes , 1981, SIAM J. Comput..

[25]  Yehoshua Sagiv.  An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic , 1980, JACM.

[26]  Philip A. Bernstein,et al.  Computational problems related to the design of normal form relational schemas , 1979, TODS.

[27]  B. Russell,et al.  Introduction to Mathematical Philosophy , 1920, The Mathematical Gazette.

[28]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in C , 1991 .

[29]  Peter W. Resnick,et al.  Internet Message Format , 2001, RFC.

[30]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[31]  Adam Barth,et al.  HTTP State Management Mechanism , 2011, RFC.

[32]  Yong Tang,et al.  Modeling MongoDB with Relational Model , 2013, 2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies.

[33]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .