ok
Direktori : /opt/alt/postgresql11/usr/share/doc/alt-postgresql11-9.2.24/html/ |
Current File : //opt/alt/postgresql11/usr/share/doc/alt-postgresql11-9.2.24/html/geqo-intro.html |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> <HTML ><HEAD ><TITLE >Query Handling as a Complex Optimization Problem</TITLE ><META NAME="GENERATOR" CONTENT="Modular DocBook HTML Stylesheet Version 1.79"><LINK REV="MADE" HREF="mailto:pgsql-docs@postgresql.org"><LINK REL="HOME" TITLE="PostgreSQL 9.2.24 Documentation" HREF="index.html"><LINK REL="UP" TITLE="Genetic Query Optimizer" HREF="geqo.html"><LINK REL="PREVIOUS" TITLE="Genetic Query Optimizer" HREF="geqo.html"><LINK REL="NEXT" TITLE="Genetic Algorithms" HREF="geqo-intro2.html"><LINK REL="STYLESHEET" TYPE="text/css" HREF="stylesheet.css"><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=ISO-8859-1"><META NAME="creation" CONTENT="2017-11-06T22:43:11"></HEAD ><BODY CLASS="SECT1" ><DIV CLASS="NAVHEADER" ><TABLE SUMMARY="Header navigation table" WIDTH="100%" BORDER="0" CELLPADDING="0" CELLSPACING="0" ><TR ><TH COLSPAN="5" ALIGN="center" VALIGN="bottom" ><A HREF="index.html" >PostgreSQL 9.2.24 Documentation</A ></TH ></TR ><TR ><TD WIDTH="10%" ALIGN="left" VALIGN="top" ><A TITLE="Genetic Query Optimizer" HREF="geqo.html" ACCESSKEY="P" >Prev</A ></TD ><TD WIDTH="10%" ALIGN="left" VALIGN="top" ><A HREF="geqo.html" ACCESSKEY="U" >Up</A ></TD ><TD WIDTH="60%" ALIGN="center" VALIGN="bottom" >Chapter 51. Genetic Query Optimizer</TD ><TD WIDTH="20%" ALIGN="right" VALIGN="top" ><A TITLE="Genetic Algorithms" HREF="geqo-intro2.html" ACCESSKEY="N" >Next</A ></TD ></TR ></TABLE ><HR ALIGN="LEFT" WIDTH="100%"></DIV ><DIV CLASS="SECT1" ><H1 CLASS="SECT1" ><A NAME="GEQO-INTRO" >51.1. Query Handling as a Complex Optimization Problem</A ></H1 ><P > Among all relational operators the most difficult one to process and optimize is the <I CLASS="FIRSTTERM" >join</I >. The number of possible query plans grows exponentially with the number of joins in the query. Further optimization effort is caused by the support of a variety of <I CLASS="FIRSTTERM" >join methods</I > (e.g., nested loop, hash join, merge join in <SPAN CLASS="PRODUCTNAME" >PostgreSQL</SPAN >) to process individual joins and a diversity of <I CLASS="FIRSTTERM" >indexes</I > (e.g., B-tree, hash, GiST and GIN in <SPAN CLASS="PRODUCTNAME" >PostgreSQL</SPAN >) as access paths for relations. </P ><P > The normal <SPAN CLASS="PRODUCTNAME" >PostgreSQL</SPAN > query optimizer performs a <I CLASS="FIRSTTERM" >near-exhaustive search</I > over the space of alternative strategies. This algorithm, first introduced in IBM's System R database, produces a near-optimal join order, but can take an enormous amount of time and memory space when the number of joins in the query grows large. This makes the ordinary <SPAN CLASS="PRODUCTNAME" >PostgreSQL</SPAN > query optimizer inappropriate for queries that join a large number of tables. </P ><P > The Institute of Automatic Control at the University of Mining and Technology, in Freiberg, Germany, encountered some problems when it wanted to use <SPAN CLASS="PRODUCTNAME" >PostgreSQL</SPAN > as the backend for a decision support knowledge based system for the maintenance of an electrical power grid. The DBMS needed to handle large join queries for the inference machine of the knowledge based system. The number of joins in these queries made using the normal query optimizer infeasible. </P ><P > In the following we describe the implementation of a <I CLASS="FIRSTTERM" >genetic algorithm</I > to solve the join ordering problem in a manner that is efficient for queries involving large numbers of joins. </P ></DIV ><DIV CLASS="NAVFOOTER" ><HR ALIGN="LEFT" WIDTH="100%"><TABLE SUMMARY="Footer navigation table" WIDTH="100%" BORDER="0" CELLPADDING="0" CELLSPACING="0" ><TR ><TD WIDTH="33%" ALIGN="left" VALIGN="top" ><A HREF="geqo.html" ACCESSKEY="P" >Prev</A ></TD ><TD WIDTH="34%" ALIGN="center" VALIGN="top" ><A HREF="index.html" ACCESSKEY="H" >Home</A ></TD ><TD WIDTH="33%" ALIGN="right" VALIGN="top" ><A HREF="geqo-intro2.html" ACCESSKEY="N" >Next</A ></TD ></TR ><TR ><TD WIDTH="33%" ALIGN="left" VALIGN="top" >Genetic Query Optimizer</TD ><TD WIDTH="34%" ALIGN="center" VALIGN="top" ><A HREF="geqo.html" ACCESSKEY="U" >Up</A ></TD ><TD WIDTH="33%" ALIGN="right" VALIGN="top" >Genetic Algorithms</TD ></TR ></TABLE ></DIV ></BODY ></HTML >