期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2013
卷号：4
期号：1
页码：87-90
出版社：TechScience Publications
摘要：In this paper we proposed to progressively explore the parameter space and build a parametric plan during several executions of a query. Novel algorithms which resemble parametric plans are populated, are able to frequently bypass the optimizer but still execute optimal or near-optimal plans. It is known that commercial applications usually rely on precompiled parameterized procedures to interact with a database. Unfortunately, executing a procedure with a set of parameters different from those used at compilation time may be arbitrarily suboptimal. Hence Parametric query optimization (PQO) attempts to solve this problem by exhaustively determining the optimal plans at each point of the parameter space at compile time.
