References

1. Alfred V. Aho, Catriel Beeri & Jeffrey D. Ullman (1979): The Theory of Joins in Relational Databases. ACM Trans. Database Syst. 4(3), pp. 297–314. Available at http://doi.acm.org/10.1145/320083.320091.
2. Giorgio Ausiello, Alessandro D'Atri & Domenico Saccà (1983): Graph Algorithms for Functional Dependency Manipulation. J. ACM 30(4), pp. 752–766, doi:10.1145/2157.322404.
3. Franz Baader & Tobias Nipkow (1998): Term rewriting and all that. Cambridge University Press, doi:10.1017/CBO9781139172752.
4. Antonio Badia & Daniel Lemire (2011): A Call to Arms: Revisiting Database Design. SIGMOD Rec. 40(3), pp. 61–69, doi:10.1145/2070736.2070750.
5. Carlo Batini & Alessandro D'Atri (1978): Rewriting Systems as a Tool for Relational Data Base Design. In: Volker Claus, Hartmut Ehrig & Grzegorz Rozenberg: Graph-Grammars and Their Application to Computer Science and Biology, International Workshop, Bad Honnef, October 30 - November 3, 1978, Lecture Notes in Computer Science 73. Springer, pp. 139–154, doi:10.1007/BFb0025717.
6. Catriel Beeri, Ronald Fagin & John H. Howard (1977): A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations. In: Diane C. P. Smith: SIGMOD Conference. ACM, pp. 47–61. Available at http://doi.acm.org/10.1145/509404.509414.
7. Philip A. Bernstein (1976): Synthesizing Third Normal Form Relations from Functional Dependencies. ACM Trans. Database Syst. 1(4), pp. 277–298. Available at http://doi.acm.org/10.1145/320493.320489.
8. E. F. Codd (1970): A Relational Model of Data for Large Shared Data Banks. Communications of the ACM 13(6), pp. 377–387. Available at http://doi.acm.org/10.1145/362384.362685.
9. E. F. Codd (1971): Normalized Data Structure: A Brief Tutorial. In: E. F. Codd & A. L. Dean: SIGFIDET Workshop. ACM, pp. 1–17, doi:10.1145/1734714.1734716.
10. Bruno Courcelle (1990): Graph Rewriting: An Algebraic and Logic Approach. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). MIT Press, pp. 193–242. Available at https://www.elsevier.com/books/formal-models-and-semantics/unknown/978-0-444-88074-1.
11. David W. Embley & W. Y. Mok (2011): Mapping Conceptual Models to Database Schemas XIX. Springer, pp. 123–164. Available at http://www.springer.com/computer/swe/book/978-3-642-15864-3.
12. Maribel Fernández, Hélène Kirchner & Bruno Pinaud (2018): Strategic Port Graph Rewriting: an Interactive Modelling Framework. Mathematical Structures in Computer Science, pp. 1–48, doi:10.1017/S0960129518000270. Available at https://hal.inria.fr/hal-01251871.
13. J. H. Jahnke & A. Zündorf (1999): Applying Graph Transformations to Database re-engineering 2. World Scientific, pp. 267–286. Available at http://www.worldscientific.com/worldscibooks/10.1142/4180.
14. David Maier (1980): Minimum Covers in Relational Database Model. J. ACM 27(4), pp. 664–674, doi:10.1145/322217.322223.
15. David Maier, Alberto O. Mendelzon & Yehoshua Sagiv (1979): Testing Implications of Data Dependencies. ACM Trans. Database Syst. 4(4), pp. 455–469, doi:10.1145/320107.320115.
16. Hossein Saiedian & Thomas Spencer (1996): An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema. Comput. J. 39(2), pp. 124–132, doi:10.1093/comjnl/39.2.124.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org