Analytical evaluation of the optimal query processing
- 1 д.т.н., профессор, зав. кафедрой 304, МАИ
Keywords:
query optimization methodsequence of elementary queriesminimum processing timedominant sequenceefficiency of the optimal processing order
Abstract
In this paper is proposed a plan for optimizing the query execution time while accessing the database based on ordering the conjunctions of elementary queries, forming the entire or part of the request. An expression is given for the minimum request execution time for an ordered set of elementary requests in accordance with the required system of inequalities.
How to cite
Брехов О.М. Аналитическая оценка оптимальной обработки запросов // Успехи современной радиоэлектроники. 2012. № 7. С. 37–45.
References
- Selinger P.G., Astrahan M.M., Chamberlin D.D., Lorie R.A., Price T.G. Access Path Selection in a Relational Database Management System // Proc. ACM SIGMOD Int. Conf. Manag. Data. Boston, Mass. May 30 -June 1, 1979. New York. 1979. Р. 23-34.
- Кузнецов С.Д. Базы данных: языки и модели. М.: Бином. 2008.