<?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="en"><front><journal-meta><journal-id journal-id-type="publisher-id">donstu</journal-id><journal-title-group><journal-title xml:lang="en">Advanced Engineering Research (Rostov-on-Don)</journal-title><trans-title-group xml:lang="ru"><trans-title>Advanced Engineering Research (Rostov-on-Don)</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2687-1653</issn><publisher><publisher-name>Don State Technical University</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">donstu-1253</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="en"><subject>MANAGEMENT, COMPUTER FACILITIES AND INFORMATICS</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>УПРАВЛЕНИЕ, ВЫЧИСЛИТЕЛЬНАЯ ТЕХНИКА И ИНФОРМАТИКА</subject></subj-group></article-categories><title-group><article-title>VERTICAL PARTITIONING RELATIONS METHOD IN RELATIONAL DATABASE</article-title><trans-title-group xml:lang="ru"><trans-title>МЕТОД ВЕРТИКАЛЬНОЙ КЛАСТЕРИЗАЦИИ ОТНОШЕНИЙ РЕЛЯЦИОННЫХ БАЗ ДАННЫХ</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>HUNG</surname><given-names>NGO THANH</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Донской государственный технический университет.</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Don State Technical University.</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2008</year></pub-date><pub-date pub-type="epub"><day>30</day><month>12</month><year>2008</year></pub-date><volume>8</volume><issue>4</issue><fpage>126</fpage><lpage>136</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; HUNG N., 2008</copyright-statement><copyright-year>2008</copyright-year><copyright-holder xml:lang="ru">ХУНГ Н.</copyright-holder><copyright-holder xml:lang="en">HUNG N.</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.vestnik-donstu.ru/jour/article/view/1253">https://www.vestnik-donstu.ru/jour/article/view/1253</self-uri><abstract/><trans-abstract xml:lang="ru"/><kwd-group xml:lang="ru"><kwd>ВЕРТИКАЛЬНАЯ КЛАСТЕРИЗАЦИЯ ОТНОШЕНИЙ</kwd><kwd>VERTICAL PARTITIONING</kwd><kwd>ЦЕЛЕВАЯ ФУНКЦИЯ</kwd><kwd>OBJECTIVE FUNCTION</kwd><kwd>ОЦЕНОЧНЫЙ КРИТЕРИЙ</kwd><kwd>EVALUATION CRITERION</kwd><kwd>ВЕРОЯТНОСТЬ КЭШ-ПОПАДАНИЯ</kwd><kwd>CACHE HIT PROBABILITY</kwd><kwd>ЭВРИСТИЧЕСКИЙ АЛГОРИТМ</kwd><kwd>HEURISTIC ALGORITHM</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">Sharma Chakravarthy, Jaykumar Muthuraj, Ravi Varadarajan, Shamkant B. Navathe. An Objective Function for Vertically Partitioning Relations in Distributed Databases and its Analysis. In Distributed and Parallel Databases 2(2): 183-207(1994).</mixed-citation><mixed-citation xml:lang="en">Sharma Chakravarthy, Jaykumar Muthuraj, Ravi Varadarajan, Shamkant B. Navathe. An Objective Function for Vertically Partitioning Relations in Distributed Databases and its Analysis. In Distributed and Parallel Databases 2(2): 183-207(1994).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Sanjay Agrawal, Vivek Narasayya, Beverly Yang. Integrating Vertical and Horizontal Partitioning into Automated Physical Database Design. In SIGMOD 2004, June, 2004.</mixed-citation><mixed-citation xml:lang="en">Sanjay Agrawal, Vivek Narasayya, Beverly Yang. Integrating Vertical and Horizontal Partitioning into Automated Physical Database Design. In SIGMOD 2004, June, 2004.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">К. Дж. Дейт. Введение в системы баз данных. 7-е издание/К.Дж.Дейт. -М., СПб, Киев: Вильямс, 2001.</mixed-citation><mixed-citation xml:lang="en">К. Дж. Дейт. Введение в системы баз данных. 7-е издание/К.Дж.Дейт. -М., СПб, Киев: Вильямс, 2001.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Вильям Пэйдж, Дэвид Остин, Виллард Берд II, Николас Чейз и др. Специальное издание: Использование Oracle8/8I. Вильямс, 2000.</mixed-citation><mixed-citation xml:lang="en">Вильям Пэйдж, Дэвид Остин, Виллард Берд II, Николас Чейз и др. Специальное издание: Использование Oracle8/8I. Вильямс, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Ковалев М.М. Дискретная оптимизация -Целочисленное программирование/М.М.Ковалев.-М.: УРСС, 2003.</mixed-citation><mixed-citation xml:lang="en">Ковалев М.М. Дискретная оптимизация -Целочисленное программирование/М.М.Ковалев.-М.: УРСС, 2003.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Таненбаум Э. Современные операционные системы/Э.Таненбаум. -СПб: Питер, 2004.</mixed-citation><mixed-citation xml:lang="en">Таненбаум Э. Современные операционные системы/Э.Таненбаум. -СПб: Питер, 2004.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Natallia Kokash. An introduction to heuristic algorithms. 2005//&lt;http://dit.unitn.it/~kokash/documents/Heuristic_algorithms.pdf&gt;</mixed-citation><mixed-citation xml:lang="en">Natallia Kokash. An introduction to heuristic algorithms. 2005//&lt;http://dit.unitn.it/~kokash/documents/Heuristic_algorithms.pdf&gt;</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>
