<?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-1081</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>A strategy for the execution of copy and delete operations
in the tree of objects</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>Mayorov</surname><given-names>A. V.</given-names></name></name-alternatives><email xlink:type="simple">xor@byte-force.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><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>03</month><year>2011</year></pub-date><volume>18</volume><issue>1</issue><fpage>116</fpage><lpage>129</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">Mayorov A.V.</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/1081">https://www.mais-journal.ru/jour/article/view/1081</self-uri><abstract><p>Описываются общие правила организации объектов в иерархические 
структуры. Приводятся различные типы связей, объясняется их роль в организации
объектов. Рассматриваются принципы выполнения операций копирования и
удаления объектов, не нарушающих логику связей между объектами.</p></abstract><trans-abstract xml:lang="en"><p>The paper discusses some general rules for organizing database objects into hierarchical
structures. It describes different kinds of relations between objects, and the role that
relations play in the organization of such structures. It also defines principles of executing
object copy and delete operations that do not break the logic of relations between
objects.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>дерево объектов</kwd><kwd>граф объектов</kwd><kwd>копирование</kwd><kwd>удаление</kwd><kwd>реляционная база данных</kwd></kwd-group><kwd-group xml:lang="en"><kwd>objects tree</kwd><kwd>objects graph</kwd><kwd>copy operation</kwd><kwd>delete operation</kwd><kwd>relation database</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">Wells April J. Grid database design. s.l. : Auerbach Pulications, Taylor &amp; Francis Group, 2005.</mixed-citation><mixed-citation xml:lang="en">Wells April J. Grid database design. s.l. : Auerbach Pulications, Taylor &amp; Francis Group, 2005.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Bancilhon F., Delobel C., Kanellakis P. Building an Object-Oriented Database. s.l.: Morgan Kaufmann, 1992.</mixed-citation><mixed-citation xml:lang="en">Bancilhon F., Delobel C., Kanellakis P. Building an Object-Oriented Database. s.l.: Morgan Kaufmann, 1992.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Майоров А. Построение индекса по иерархии записей в реляционной базе данных // Материалы конференции SEF-2009. Минск, 2009.</mixed-citation><mixed-citation xml:lang="en">Майоров А. Построение индекса по иерархии записей в реляционной базе данных // Материалы конференции SEF-2009. Минск, 2009.</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>
