Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Douglas, Paul; Barker, Steve
Languages: English
Types: Article
Subjects: UOW3

Classified by OpenAIRE into

In this paper, we describe an "intelligent" tool for helping to teach the principles of database design. The software that we present uses PROLOG to implement a teaching tool with which students can explore the concepts of dependency theory, and the normalization process. Students are able to construct their own learning environment and can develop their understanding of the material at a pace that is controlled by the individual student.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] J. Ullman, Principles of Database and Knowledge-base Systems, Computer Science Press, 1989.
    • [2] Yazdani, M., New Horizons in Educational Computing, Chichester: Ellis Horwood, 1983.
    • [3] Nichol, J., Briggs, J., and Dean, J., Prolog, Children and Students, London: Kogan-Page, 1988.
    • [4] B. Byrne, Top Down Approaches to Database Design Tend to Produce Fully Normalised Designs Anyway, Proceedings of TLAD, 2003.
    • [5] F. Marton and P. Ramsden, What does it take to improve learning?, Improving Learning: New Perspectives, Kogan Page, 1988.
    • [6] R. M. Gagne, The Conditions of Learning, Holt, Reinhart and Winston, 1970.
    • [7] C. Beeri and P. Honeyman, Preserving Functional Dependencies, SIAM Journal of Computing, 10(3), 1981.
    • [8] G. Loizou and P. Thanisch, Testing a Dependency-preserving Decomposition for Losslessness, Information Systems, 8(1), 1983.
    • [9] G. Gottlob, Computing Covers for Embedded Functional Dependencies, PODS, 1987.
    • [10] C. Lucchesi and S. Osborn, Candidate Keys for Relations, Journal of Computer and System Sciences, 17(2), 1978.
    • [11] D. Tsou and P. Fischer, Decomposition of a Relation Scheme into BoyceCodd Normal Form, SIGACT News 14(3), 1982.
    • [12] K Sagonas, T. Swift, D. Warren, J. Freire and P. Rao., The XSB System Version 2.0, Programmer's Manual, 1999.
    • [13] K Sagonas, T. Swift, and D. Warren., XSB as an Efficient Deductive Database Engine, ACM SIGMOD Proceedings, 1994.
    • [14] S. Decker, Yet Another db.stanford.edu/%7Estefan/rdf/yajxb/ [15] M. Tessmer, Planning and Conducting Formative Evaluations, Kogan-Page, 1993.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article