Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/94132
Title: | Sub-Prolog2SQL compiler |
Authors: | Axiak, Martha (2008) |
Keywords: | Prolog (Computer program language) SQL (Computer program language) First-order logic |
Issue Date: | 2008 |
Citation: | Axiaq, M. (2008). Sub-Prolog2SQL compiler (Bachelor's dissertation). |
Abstract: | If both Prolog and SQL originate from first-order logic, there is obviously some common ground between the two. By analyzing what is common and different in the two languages with regards to syntax, semantics and modes of evaluation, this project attempts to come up with a way of coupling the two languages in order to maximize logical-level and minimize physical-level coupling. By analyzing what is common and different in the two languages this project produces a compiler that has two main methods. The first compiles the Prolog program and the second takes a Prolog query and transforms it into an SQL query using the previously compiled program. Importance has been given to the design and evaluation of the mappings between the two languages by ensuring that the semantics of Prolog constructs are still valid after mappings to SQL have been made. The evaluation of this project discusses the design in terms of performance, coverage and quality. The evaluation confirms the claims that Prolog's performance deteriorates as the number of Prolog facts increase and that the Prolog compiler should have tight logical-level and loose physical-level coupling in order to maximize Prolog's expressive syntax and database's efficient storage and retrieval mechanisms. |
Description: | B.Sc. IT (Hons)(Melit.) |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/94132 |
Appears in Collections: | Dissertations - FacICT - 1999-2009 Dissertations - FacICTCS - 2008 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BSC(HONS)IT_Axiak_Martha_2008.pdf Restricted Access | 9.48 MB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.