Skip Navigation

The Computer Journal 1990 33(1):49-60; doi:10.1093/comjnl/33.1.49
© 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 (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Taylor, M. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Logical Optimisation of Distributed Knowledge Base Queries

M. C. Taylor *

Department of Computer Science, University of Houston, Texas, USA

Query optimisation is a crucial element in providing acceptable performance in a distributed knowledge base system. This paper considers optimisation in a heterogeneous environment where each node provides an interface to a common model. The common model is object-oriented, using unnormalised relations with an extended relational algebra as query language. Both the data structures and the language are formally defined using the Vienna Development Method (VDM). These formal definitions are then used as a basis for deriving conditions under which various optimising transformations can be applied.

Received November 1988. revised July 1989.

* Present address: Department of Computer Science, University of Houston, Texas, USA.

§ Department of Computer Science, University of Keele, Keele, Staffs.


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.