Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

An Optimal Query Execution plan for Database Systems

An Optimal Query Execution plan for Database Systems
View Free PDF
Author(s): Hassan Pournaghshband (Southern Polytechnic State University, USA), Vahab Pournaghshband (University of California-Berkeley, USA) and Shahriar Movafaghi (Southern New Hampshire University, USA)
Copyright: 2007
Pages: 2
Source title: Managing Worldwide Operations and Communications with Information Technology
Source Editor(s): Mehdi Khosrow-Pour, D.B.A. (Information Resources Management Association, USA)
DOI: 10.4018/978-1-59904-929-8.ch148
ISBN13: 9781599049298
EISBN13: 9781466665378


A major decision for the query processor of the database management system in centralized as well as distributed environments is how a query can produce the result as efficiently as possible. The typical query optimizer will not necessarily produce an optimal query plan. It simply tries to find the best possible plan within a minimum amount of time using mostly semi-accurate statistical information. In this paper, we discuss major issues regarding query optimization for relational database management systems, and expand the optimization issues for distributed database systems (DDBSs) to show how the query optimizer can choose an optimal plan for efficient execution of those queries that require multiple-site participations for producing the result. An algorithm that can be used toward more efficient query processing is presented. Our algorithm examines frequently used queries, and identifies two categories of groups of queries. First, a group of queries requiring the same procedures (including operations used), and second, a group of queries requiring data from the same site (or set of sites) for producing the result

Body Bottom