Skip Navigation

The Computer Journal 1990 33(6):547-555; doi:10.1093/comjnl/33.6.547
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Paton, N. W.
Right arrow Articles by Gray, P. M. D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Optimising and Executing DAPLEX Queries using Prolog

N. W. Paton1 * and P. M. D. Gray2

1 Department of Computer Science, Heriot-Watt University, 79 Grassmarket, Edinburgh EH1 2HJ, UK, 2 Department of Computing Science, University of Aberdeen, King's College, Aberdeen AB9 2UB, UK

In this paper a query optimiser for use with functional data model databases is described. The system is in use with a large database of protein structures from which examples are taken. The optimiser, which evaluates alternative paths through the object base, is written in Prolog and integrated with a parser for DAPLEX. The constructs of DAPLEX are easily expressed in Prolog, which has also proved suitable for implementing both the parser and rewrite rules. The implementation of the optimiser using rewrite rules is both concise and extensible.

Received September 1989. revised March 1990.

* To whom correspondance should be addressed at: Department of computer Science, Heriot-Watt University, 79 Grassmarket, Edinburgh EH1 2HJ.

§ Department of Computing Science, University of Aberdeen, King's College, Aberdeen AB9 2UB


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.