<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">mais-1070</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Оригинальные статьи</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Articles</subject></subj-group></article-categories><title-group><article-title>Оптимизация конъюнктов условий в составе запросов</article-title><trans-title-group xml:lang="en"><trans-title>Optimization of Queries Containing Conjunctions of Conditions</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Кузнецов</surname><given-names>Сергей Дмитриевич</given-names></name><name name-style="western" xml:lang="en"><surname>Kuznetsov</surname><given-names>S. D.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Мендкович</surname><given-names>Никита Андреевич</given-names></name><name name-style="western" xml:lang="en"><surname>Mendkovich</surname><given-names>N. A.</given-names></name></name-alternatives><email xlink:type="simple">mend@f-group.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Институт Системного Программирования РАН</institution><country>Russian Federation</country></aff><aff xml:lang="ru" id="aff-2"><institution>ООО «Объединение сетей ФРИнет»</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2011</year></pub-date><pub-date pub-type="epub"><day>20</day><month>09</month><year>2011</year></pub-date><volume>18</volume><issue>3</issue><fpage>144</fpage><lpage>154</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Кузнецов С.Д., Мендкович Н.А., 2011</copyright-statement><copyright-year>2011</copyright-year><copyright-holder xml:lang="ru">Кузнецов С.Д., Мендкович Н.А.</copyright-holder><copyright-holder xml:lang="en">Kuznetsov S.D., Mendkovich N.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/1070">https://www.mais-journal.ru/jour/article/view/1070</self-uri><abstract><p>Предлагается новый алгоритм оптимизации запроса. Этот алгоритм сокращает ограничения запросов, содержащих многоатрибутные условия. Он также решает проблему выражений «Условие AND Конъюнкция условий».</p></abstract><trans-abstract xml:lang="en"><p>A new algorithm for query optimization is proposed. This algorithm simplifies queries
restriction containing multi-attribute conditions. It also solves the problem of "Condition
AND Conjunction of conditions" expressions.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>оптимизация запросов</kwd><kwd>лексическая оптимизация</kwd></kwd-group><kwd-group xml:lang="en"><kwd>query optimization</kwd><kwd>lexical optimization</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Chaudhuri S. Query Optimizers: Time to Rethink the Contract? // Proceedings of the ACM SIGMOD International Conference on Management of Data, Providence, Rhode Island, USA, June 29 - July 2, 2009.</mixed-citation><mixed-citation xml:lang="en">Chaudhuri S. Query Optimizers: Time to Rethink the Contract? // Proceedings of the ACM SIGMOD International Conference on Management of Data, Providence, Rhode Island, USA, June 29 - July 2, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Ionnidis Y. E. Query Optimization // The Computer Science and Engineering Handbook. Boca Raton, CRC Press, 1996.</mixed-citation><mixed-citation xml:lang="en">Ionnidis Y. E. Query Optimization // The Computer Science and Engineering Handbook. Boca Raton, CRC Press, 1996.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Chaudhari S. An Overview of Query Optimization in Relational Systems // Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington. ACM Press, 1998. Русский перевод: Чаудхари С. Методы оптимизации запросов в реляционных системах // СУБД. 1998. №3.</mixed-citation><mixed-citation xml:lang="en">Chaudhari S. An Overview of Query Optimization in Relational Systems // Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of Database Systems, June 1-3, 1998, Seattle, Washington. ACM Press, 1998. Русский перевод: Чаудхари С. Методы оптимизации запросов в реляционных системах // СУБД. 1998. №3.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Кузнецов С. Д. Методы оптимизации выполнения запросов в реляционных СУБД. &lt;http://www.citforum.ru/database/articles/art_26.shtml&gt;. Доступ 10 июня 2011 года.</mixed-citation><mixed-citation xml:lang="en">Кузнецов С. Д. Методы оптимизации выполнения запросов в реляционных СУБД. &lt;http://www.citforum.ru/database/articles/art_26.shtml&gt;. Доступ 10 июня 2011 года.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Muralikrishna M. Improved Unnesting Algorithms for Join Aggregate SQL Queries // Proceedings of the 18th International Conference on Very Large Data Bases, August 23-27, Vancouver, Canada, 1992.</mixed-citation><mixed-citation xml:lang="en">Muralikrishna M. Improved Unnesting Algorithms for Join Aggregate SQL Queries // Proceedings of the 18th International Conference on Very Large Data Bases, August 23-27, Vancouver, Canada, 1992.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Khaitan P., Satish K. M., Korra S. B., Jena S. K. Improved Query Plans for Unnesting Nested SQL Queries // Proceedings of 2nd International Conference on Computer Science and its Applications, December 10-12, South Korea, 2009.</mixed-citation><mixed-citation xml:lang="en">Khaitan P., Satish K. M., Korra S. B., Jena S. K. Improved Query Plans for Unnesting Nested SQL Queries // Proceedings of 2nd International Conference on Computer Science and its Applications, December 10-12, South Korea, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Дейт К. Дж. Введение в системы баз данных. Москва; Санкт-Петербург; Киев, 2001.</mixed-citation><mixed-citation xml:lang="en">Дейт К. Дж. Введение в системы баз данных. Москва; Санкт-Петербург; Киев, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">May N., Helmer S., Moerkotte G. Strategies for Query Unnesting in XML Databases // ACM Transactions on Database Systems. 2006. №331(3).</mixed-citation><mixed-citation xml:lang="en">May N., Helmer S., Moerkotte G. Strategies for Query Unnesting in XML Databases // ACM Transactions on Database Systems. 2006. №331(3).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Bellamkonda S., Ahmed R., Witkowski A., Amor A., Zait M., Lin C.-C. Enhanced Subquery Optimizations in Oracle // Proceedings of the 35th international conference on Very large data base, Lyon, France, August 28, 2009.</mixed-citation><mixed-citation xml:lang="en">Bellamkonda S., Ahmed R., Witkowski A., Amor A., Zait M., Lin C.-C. Enhanced Subquery Optimizations in Oracle // Proceedings of the 35th international conference on Very large data base, Lyon, France, August 28, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Mendkovich N., Kuznetcov S. New Algorithms for Lexical Query Optimization // Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces. June 22-25, 2009, Cavtat/Dubrovnik, Croatia. Edited by Vesna Luzar- Stiffler, Iva Jarec, Zoran Bekic. Technical Editor Boris Grinfeld.</mixed-citation><mixed-citation xml:lang="en">Mendkovich N., Kuznetcov S. New Algorithms for Lexical Query Optimization // Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces. June 22-25, 2009, Cavtat/Dubrovnik, Croatia. Edited by Vesna Luzar- Stiffler, Iva Jarec, Zoran Bekic. Technical Editor Boris Grinfeld.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Кузнецов С. Д., Мендкович Н. А. Новые алгоритмы лексической оптимизации запросов // Моделирование и анализ информационных систем. 2009. Т. 16, №4.</mixed-citation><mixed-citation xml:lang="en">Кузнецов С. Д., Мендкович Н. А. Новые алгоритмы лексической оптимизации запросов // Моделирование и анализ информационных систем. 2009. Т. 16, №4.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Quin W. V. O cores and prime implicants of truth functions // American Mathematics Monthly. 1959. V. 66. №9.</mixed-citation><mixed-citation xml:lang="en">Quin W. V. O cores and prime implicants of truth functions // American Mathematics Monthly. 1959. V. 66. №9.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">McCluskey E. J. Minimization of Boolean Functions // The Bell System Technical Journal. November 1956. V. 35, Issue 5.</mixed-citation><mixed-citation xml:lang="en">McCluskey E. J. Minimization of Boolean Functions // The Bell System Technical Journal. November 1956. V. 35, Issue 5.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
