DEDUCTIVE DATABASES - WHERE TO NOW?
dc.contributor.author | Cleary, John | eng |
dc.contributor.author | Liu, Mengchi | eng |
dc.date.accessioned | 2008-02-27T16:57:30Z | |
dc.date.available | 2008-02-27T16:57:30Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1990-01-01 | eng |
dc.description.abstract | Deductive databases result from the integration of relational database and logic programming techniques. It combines the benefits of these two approaches, such as representational and operational uniformity, deductive power, efficient secondary storage access, etc. However, significant problems remain inherent in this synthesis. There are three broad areas where problems are apparent. The first problem area is how to naturally represent objects, complex objects and inheritance information. The second problem area is how to naturally deal with higher-order features in deductive databases. The last is the area of updates. The paper discusses these problems, surveys some of the attempts that have been made towards solving these problems and prepares an integrated framework for solving them. | eng |
dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
dc.identifier.department | 1990-377-1 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30540 | |
dc.identifier.uri | http://hdl.handle.net/1880/45833 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | DEDUCTIVE DATABASES - WHERE TO NOW? | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |