<?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">ipolytech</journal-id><journal-title-group><journal-title xml:lang="ru">iPolytech Journal</journal-title><trans-title-group xml:lang="en"><trans-title>iPolytech Journal</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2782-4004</issn><issn pub-type="epub">2782-6341</issn><publisher><publisher-name>Irkutsk National Research Technical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.21285/1814-3520-2018-12-145-156</article-id><article-id custom-type="elpub" pub-id-type="custom">ipolytech-237</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>INFORMATION SCIENCE, COMPUTER ENGINEERING AND CONTROL</subject></subj-group></article-categories><title-group><article-title>ФОРМИРОВАНИЕ МЕТАДАННЫХ МНОГОМЕРНЫХ ИНФОРМАЦИОННЫХ СИСТЕМ НА БАЗЕ КЛАССИФИКАЦИОННЫХ СХЕМ</article-title><trans-title-group xml:lang="en"><trans-title>CLASSIFICATION SCHEME-BASED GENERATION OF MULTIDIMENSIONAL INFORMATION SYSTEM METADATA</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>Fomin</surname><given-names>M. B.</given-names></name></name-alternatives><email xlink:type="simple">fomin-mb@rudn.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>Kuznetsov</surname><given-names>E. A.</given-names></name></name-alternatives><email xlink:type="simple">kuznetsovea@lanit.ru</email><xref ref-type="aff" rid="aff-2"/></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>Shorokhov</surname><given-names>S. G.</given-names></name></name-alternatives><email xlink:type="simple">shorokhov-sg@rudn.ru</email><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>Peoples’ Friendship University of Russia (RUDN University)</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Лаборатория новых информационных технологий</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Laboratory of New Information Technologies (LANIT)</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2018</year></pub-date><pub-date pub-type="epub"><day>15</day><month>09</month><year>2020</year></pub-date><volume>22</volume><issue>12</issue><fpage>145</fpage><lpage>156</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Фомин М.Б., Кузнецов Е.А., Шорохов С.Г., 2020</copyright-statement><copyright-year>2020</copyright-year><copyright-holder xml:lang="ru">Фомин М.Б., Кузнецов Е.А., Шорохов С.Г.</copyright-holder><copyright-holder xml:lang="en">Fomin M.B., Kuznetsov E.A., Shorokhov S.G.</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://ipolytech.elpub.ru/jour/article/view/237">https://ipolytech.elpub.ru/jour/article/view/237</self-uri><abstract><p>Разработан способ формирования метаданных многомерной информационной системы путем сопряжения классификационных схем. Каждая классификационная схема представляет собой иерархию значений измерений, относящихся к отдельной структурной компоненте наблюдаемого явления. В основе метода лежит выявление групп значений измерений, которые связаны с группами значений других измерений. Группы значений разных измерений используются для построения кластеров сочетаний значений измерений. Сочетания кластера формируются декартовым произведением групп значений измерений. Метаданные информационной системы представлены в виде множества допустимых сочетаний значений измерений, которые формируются как набор кластеров. Для решения этой сложной задачи наблюдаемое явление рассматривается как набор структурных компонент. Из полного набора измерений информационной системы выделяются отдельные наборы измерений, семантически связанные со структурными компонентами наблюдаемого явления. Семантические связи, выявленные в процессе анализа структурной компоненты, позволяют построить иерархию групп значений измерений и представить их совокупность в виде графа - классификационной схемы, связанной со структурной компонентой. В информационных системах с многоаспектным описанием предметной области кубы данных характеризуются большой разреженностью, что затрудняет формирование метаданных. Классификационные схемы описывают отдельные аспекты метаданных, связанные с отдельными структурными компонентами наблюдаемого явления. Сопряжение классификационных схем дает возможность получить полное описание метаданных. Использование классификационных схем позволяет разбить задачу описания структуры аналитического пространства многомерной информационной системы на более простые задачи анализа его отдельных структурных компонент. Сопряжение классификационных схем, относящихся к разным структурным компонентам, дает возможность сформировать метаданные информационной системы. В метаданных центральное место занимает множество допустимых сочетаний значений измерений.</p></abstract><trans-abstract xml:lang="en"><p>The purpose of the paper is development of a method for generating metadata of a multidimensional information system by classification scheme conjugation. Each classification scheme is a hierarchy of dimension values (members) related to a separate structural component of the observed phenomenon. The method is based on the identification of groups of dimension values that are associated with the groups of values of other dimensions. The groups of members for different dimensions are used to generate clusters of member combinations. Cluster combinations are generated by the Cartesian product of groups of members. The metadata of the information system are presented as a set of possible member combinations, which is formed as a set of clusters. To solve this complex problem the observed phenomenon is considered as a set of structural components. Separate sets of dimensions, which are semantically related to the structural components of the observed phenomenon, are distinguished from the complete set of dimensions of the information system. The semantic relationships identified in the analysis of the structural component allow to generate a hierarchy of groups of dimension values and represent all of them in the form of a graph - a classification scheme associated with the structural component. In information systems with a multidimensional representation of a subject domain, data cubes are characterized by high sparseness, which complicates metadata generation. The classification schemes describe specific aspects of the metadata associated with the individual structural components of the observed phenomenon. Conjugation of the classification schemes allows to obtain a complete description of the metadata. The use of classification schemes provides the opportunity to divide the task of describing the structure of the multidimensional information system analytical space into simpler tasks of analysis of its individual structural components. The conjugation of classification schemes related to different structural components enables the generation of information system metadata. The central place in the metadata belongs to the set of possible member combinations.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>multidimensional information system</kwd><kwd>multidimensional data cube</kwd><kwd>sparse data cube</kwd><kwd>classification scheme</kwd><kwd>combination of measurement values</kwd><kwd>set of possible member combinations</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">Thomsen E. OLAP Solution: Building Multidimensional Information System. NY, Willey Computer Publishing. 2002. 688 p.</mixed-citation><mixed-citation xml:lang="en">Thomsen E. OLAP Solution: Building Multidimensional Information System. NY, Willey Computer Publishing. 2002. 688 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Висков А.В., Фомин М.Б. Методы описания допустимых сочетаний реквизитов-признаков при использовании многомерных моделей в инфокоммуникационных системах // T-Comm. Телекоммуникации и Транспорт. 2012. № 7. С. 45-47.</mixed-citation><mixed-citation xml:lang="en">Висков А.В., Фомин М.Б. Методы описания допустимых сочетаний реквизитов-признаков при использовании многомерных моделей в инфокоммуникационных системах // T-Comm. Телекоммуникации и Транспорт. 2012. № 7. С. 45-47.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Hirata, C.M., Lima, J.C. Multidimensional cyclic graph approach: representing a data cube without common sub-graphs. Information Sciences. 2011. Vol. 181. P. 2626-2655. DOI: 10.1016/j.ins.2010.05.012</mixed-citation><mixed-citation xml:lang="en">Hirata, C.M., Lima, J.C. Multidimensional cyclic graph approach: representing a data cube without common sub-graphs. Information Sciences. 2011. Vol. 181. P. 2626-2655. DOI: 10.1016/j.ins.2010.05.012</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Luo Z.W., Ling T.W., Ang C.H., Lee S.Y., Cui B. Range top/bottom k queries in OLAP sparse data cubes. In: Mayr H.C., Lazansky J., Quirchmayr G., Vogel P. Database and Expert Systems Applications - DEXA 2001. Vol. 2113. P. 678-687. Heidelberg, Springer, 2001. P. 678-687. DOI: 10.1007/3-540-44759-8_66</mixed-citation><mixed-citation xml:lang="en">Luo Z.W., Ling T.W., Ang C.H., Lee S.Y., Cui B. Range top/bottom k queries in OLAP sparse data cubes. In: Mayr H.C., Lazansky J., Quirchmayr G., Vogel P. Database and Expert Systems Applications - DEXA 2001. Vol. 2113. P. 678-687. Heidelberg, Springer, 2001. P. 678-687. DOI: 10.1007/3-540-44759-8_66</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Vitter J.S., Wang M. Approximate computation of multidimensional aggregates of sparse data using wavelets. In: Proceedings of the 1999 International Conference on Management of Data - SIGMOD 1999. New York, ACM. 1999. P. 193-204. DOI:10.1145/304182.304199</mixed-citation><mixed-citation xml:lang="en">Vitter J.S., Wang M. Approximate computation of multidimensional aggregates of sparse data using wavelets. In: Proceedings of the 1999 International Conference on Management of Data - SIGMOD 1999. New York, ACM. 1999. P. 193-204. DOI:10.1145/304182.304199</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Messaoud R.B., Boussaid O., Rabaseda S.L. A multiple correspondence analysis to organize data cube. In: Databases and Information Systems IV - DB&amp;IS 2006. Vilnius, IOS Press. 2007. P. 133-146.</mixed-citation><mixed-citation xml:lang="en">Messaoud R.B., Boussaid O., Rabaseda S.L. A multiple correspondence analysis to organize data cube. In: Databases and Information Systems IV - DB&amp;IS 2006. Vilnius, IOS Press. 2007. P. 133-146.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Karayannidis N., Sellis T., Kouvara Y. CUBE file: a file structure for hierarchically clustered OLAP cube. In: Bertino E., Christodoulakis S., Plexousakis D., Christophides V., Koubarakis M., BЕohm K., Ferrari E. Advances in Database Technology - EDBT 2004, vol. 2992. Heidelberg, Springer. 2004. P. 621-638. DOI: 10.1007/978-3-540-24741-8_36</mixed-citation><mixed-citation xml:lang="en">Karayannidis N., Sellis T., Kouvara Y. CUBE file: a file structure for hierarchically clustered OLAP cube. In: Bertino E., Christodoulakis S., Plexousakis D., Christophides V., Koubarakis M., BЕohm K., Ferrari E. Advances in Database Technology - EDBT 2004, vol. 2992. Heidelberg, Springer. 2004. P. 621-638. DOI: 10.1007/978-3-540-24741-8_36</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Chen C., Feng J., Xing L. Computation of sparse data cubes with constraints. In: Kambayashi Y., Mohania M., Wob W. Data Warehousing and Knowledge Discovery - DaWaK 2003. Vol. 2737. Heidelberg, Springer. 2003. P. 14-23. DOI: 10.1007/978-3-540-45228-7_3</mixed-citation><mixed-citation xml:lang="en">Chen C., Feng J., Xing L. Computation of sparse data cubes with constraints. In: Kambayashi Y., Mohania M., Wob W. Data Warehousing and Knowledge Discovery - DaWaK 2003. Vol. 2737. Heidelberg, Springer. 2003. P. 14-23. DOI: 10.1007/978-3-540-45228-7_3</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Wang W., Lu H., Feng J., Yu J.X. Condensed cube: an effective approach to reducing data cube size. In: Proceedings of the 18th International Conference on Data Engineering - ICDE 2002. IEEE Computer Society, Washington. 2002. P. 155-165.</mixed-citation><mixed-citation xml:lang="en">Wang W., Lu H., Feng J., Yu J.X. Condensed cube: an effective approach to reducing data cube size. In: Proceedings of the 18th International Conference on Data Engineering - ICDE 2002. IEEE Computer Society, Washington. 2002. P. 155-165.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Gomez L.I., Gomez S.A., Vaisman A.A. generic data model and query language for spatiotemporal OLAP cube analysis. In: Rundensteiner, E., Markl, V., Manolescu, I., Amer-Yahia S., Naumann F., Ari I. Proceedings of the 15-th International Conference on Extending Database Technology - EDBT 2012. New York, ACM. 2012. P. 300-311.</mixed-citation><mixed-citation xml:lang="en">Gomez L.I., Gomez S.A., Vaisman A.A. generic data model and query language for spatiotemporal OLAP cube analysis. In: Rundensteiner, E., Markl, V., Manolescu, I., Amer-Yahia S., Naumann F., Ari I. Proceedings of the 15-th International Conference on Extending Database Technology - EDBT 2012. New York, ACM. 2012. P. 300-311.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Фомин М.Б. Описание метаданных многомерных информационных систем с использованием кластерного метода // Вестник Иркутского государственного технического университета. 2017. Т 21. № 7. С. 78-86. https: doi.org/10.21285/1814-3520-2017-7-78-86.</mixed-citation><mixed-citation xml:lang="en">Фомин М.Б. Описание метаданных многомерных информационных систем с использованием кластерного метода // Вестник Иркутского государственного технического университета. 2017. Т 21. № 7. С. 78-86. https: doi.org/10.21285/1814-3520-2017-7-78-86.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Salmam F.Z., Fakir M., Errattahi R. Prediction in OLAP data cubes. Journal of Information &amp; Knowledge Management. 2016. Vol. 15. No. 2. P. 449-458. DOI: 10.1142/S0219649216500222</mixed-citation><mixed-citation xml:lang="en">Salmam F.Z., Fakir M., Errattahi R. Prediction in OLAP data cubes. Journal of Information &amp; Knowledge Management. 2016. Vol. 15. No. 2. P. 449-458. DOI: 10.1142/S0219649216500222</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Fu L.: Efficient evaluation of sparse data cubes. In: Li Q., Wang G., Feng L. Advances in Web-Age Information Management, vol. 3129 - WAIM 2004. Heidelberg, Springer, 2004. P. 336-345. DOI: 10.1007/978-3-540-27772-9_34</mixed-citation><mixed-citation xml:lang="en">Fu L.: Efficient evaluation of sparse data cubes. In: Li Q., Wang G., Feng L. Advances in Web-Age Information Management, vol. 3129 - WAIM 2004. Heidelberg, Springer, 2004. P. 336-345. DOI: 10.1007/978-3-540-27772-9_34</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Romero O., Pedersen T.B., Berlanga R., Nebot V., Aramburu M.J., Simitsis A.: Using semantic web technologies for exploratory OLAP: A survey. IEEE Transactions on Knowledge and Data Engineering. 2015. Vol. 27. No. 2. P. 571-588. DOI: 10.1109/TKDE.2014.2330822</mixed-citation><mixed-citation xml:lang="en">Romero O., Pedersen T.B., Berlanga R., Nebot V., Aramburu M.J., Simitsis A.: Using semantic web technologies for exploratory OLAP: A survey. IEEE Transactions on Knowledge and Data Engineering. 2015. Vol. 27. No. 2. P. 571-588. DOI: 10.1109/TKDE.2014.2330822</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Salmam F.Z., Fakir M., Errattahi R. Explanation in OLAP data cubes. Journal of Information Technology Research. 2014. Vol. 7. No. 4. P. 36-78. DOI: 10.4018/jitr.2014100105</mixed-citation><mixed-citation xml:lang="en">Salmam F.Z., Fakir M., Errattahi R. Explanation in OLAP data cubes. Journal of Information Technology Research. 2014. Vol. 7. No. 4. P. 36-78. DOI: 10.4018/jitr.2014100105</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Orlov Y., Gaidamaka Y., Zaripova E. Approach to estimation of performance measures for SIP server model with batch arrivals. In: Vishnevsky V., Kozyrev D. Distributed Computer and Communication Networks. DCCN 2015, vol 601. Cham, Springer, pp. 141-150. DOI: 10.1007/978-3-319-30843-2_15</mixed-citation><mixed-citation xml:lang="en">Orlov Y., Gaidamaka Y., Zaripova E. Approach to estimation of performance measures for SIP server model with batch arrivals. In: Vishnevsky V., Kozyrev D. Distributed Computer and Communication Networks. DCCN 2015, vol 601. Cham, Springer, pp. 141-150. DOI: 10.1007/978-3-319-30843-2_15</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Висков А.В., Фомин М.Б. Моделирование аналитических измерений в многомерных базах данных // Вестник Иркутского государственного технического университета. 2012. Т. 63. № 4. С. 15-19.</mixed-citation><mixed-citation xml:lang="en">Висков А.В., Фомин М.Б. Моделирование аналитических измерений в многомерных базах данных // Вестник Иркутского государственного технического университета. 2012. Т. 63. № 4. С. 15-19.</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>
