Skip Navigation

The Computer Journal 1984 27(4):301-309; doi:10.1093/comjnl/27.4.301
© 1984 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 Talbot, S.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Investigation into Logical Optimization of Relational Query Languages

S. Talbot *

Software Sciences Limited, London & Manchester House, Park Street, Macclesfield, UK

The motivation for this paper comes from an extensive study on relational database optimization techniques applied to query languages. Its aim is to give an introduction to query language optimization and to outline some of the techniques that can be used to improve the performance of a relational database. This investigation also discusses the complexity of maximal optimization and gives certain heuristic measures which lead to better performance in answering queries put to a database.


Received June 1983.

* Software Sciences Limited, London & Manchester House, Park Street, Macclesfield, Cheshire SK11 6SR, UK; Database consultant, 8 Lyndhurst Grove, Sittingbourne, Kent, UK


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.