<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Objects of Interest Detection by Earth Remote Sensing Data Analysis</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anastasia V. Demidova</string-name>
          <email>demidova-av@rudn.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maxim B. Fomin</string-name>
          <email>fomin_mb@rudn.university</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sergey G. Shorokhov</string-name>
          <email>shorokhov_sg@rudn.university</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Applied Probability and Informatics, Peoples' Friendship University of Russia (RUDN University)</institution>
          ,
          <addr-line>6 Miklukho-Maklaya str., Moscow, 117198, Russian Federation</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Information Technologies Peoples' Friendship University of Russia (RUDN University) 6 Miklukho-Maklaya str.</institution>
          ,
          <addr-line>Moscow, 117198, Russian Federation</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>65</fpage>
      <lpage>71</lpage>
      <abstract>
        <p>In information systems based on a multidimensional approach, a data model is a multidimensional data cube. If one uses a large set of aspects for the analysis of data domain the data cubes are characterized by substantial sparseness. This makes it dificult to describe the metadata of the information system and complicates the organization of data storage. To describe the structure of a sparse data cube, a cluster method can be used. This method is based on the construction of groups of members which are semantically connected with other groups of members. Connected groups related to diferent dimensions describe the cluster of cells. Classification schemes that correspond to the structural components of the observed phenomenon can be used to describe it's semantics. Every classification scheme is a graph describing the hierarchy of members that are associated with a separate structural component of the observed phenomenon. The coupling between several classification schemes related to diferent structural components helps to describe the metadata of the multidimensional information system. Classification schemes are a source of classification of information objects of a multidimensional cube related to the structural components of the observed phenomenon.</p>
      </abstract>
      <kwd-group>
        <kwd>and phrases</kwd>
        <kwd>OLAP</kwd>
        <kwd>data warehouse</kwd>
        <kwd>multidimensional data model</kwd>
        <kwd>sparse data cube</kwd>
        <kwd>set of possible member combinations</kwd>
        <kwd>cluster of member combinations</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Copyright © 2018 for the individual papers by the papers’ authors. Copying permitted for private
and academic purposes. This volume is published and copyrighted by its editors.
In: K. E. Samouylov, L. A. Sevastianov, D. S. Kulyabov (eds.): Selected Papers of the 1st Workshop
(Summer Session) in the framework of the Conference “Information and Telecommunication
Technologies and Mathematical Modeling of High-Tech Systems”, Tampere, Finland, 20–23 August,
2018, published at http://ceur-ws.org
solved:
data.</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>Multidimensional information systems based on the principles of OLAP are used
for the operational analysis of large datasets.</p>
      <p>
        Analytical space in a system
of this
type is a multidimensional data cube. The role of the cube dimensionalities is played
by the dimensions corresponding to various aspects of the observed phenomenon for
which description the system is developed. If we use a large amount of semantically
heterogeneous data for the description of the observed phenomenon the multidimensional
cube is characterized by high sparseness and irregular filling [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5 ref6 ref7 ref8">1 – 8</xref>
        ]. As a result, there is a
problem of developing an adequate way to describe the structure of an analytical space
which use would make it possible to efectively organize the data analysis process [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref14 ref15 ref16 ref17 ref9">9 –
17</xref>
        ]. Such a correct way should provide the accounting of semantics of the observed
phenomenon.
      </p>
      <p>The cluster method can be used for the efective description of the multidimensional
cube structure. This method is based on the semantic analysis of diferent dimensions’
members’ compatibility in possible cube cells. It allows describing the metadata of the
information system</p>
      <p>as a set of possible member combinations. Possible combinations
comply
with
possible cells of the
multidimensional cube.</p>
      <sec id="sec-2-1">
        <title>Every possible cube cell</title>
        <p>complies with some fact.</p>
        <p>Dificulties in describing the structure of the analytical space may arise in case if,
in the process of forming the metadata of the information system, the analysis of the
semantic aspects of the observed phenomenon is subject to technological aspects. The
observed phenomenon is a set of interrelated processes related to the subject domain.
Data describing the observed phenomenon can form one or more multidimensional data
cubes. In describing the structure of an analytic space, the following problems must be
–</p>
        <p>the problem of classification of data describing the observed phenomenon;
– the problem of accounting for the semantics of the observed phenomenon in these
2.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Multidimensional data model</title>
      <p>( ) = {︀</p>
      <p>1,  2, ..,   }︀ , there   is  -dimension, and</p>
      <p>The structure of multidimensional data model should reflect the aspects of subject
domain
which
are used in the data analysis process.</p>
      <sec id="sec-3-1">
        <title>Each aspect corresponds to one dimension of a multidimensional cube  .</title>
        <p>
          A full set of dimensions forms a set
= dim( ) – dimensionality
of multidimensional cube [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. Each dimension is characterized by a set of members
        </p>
        <p>, there  is a number of dimension,   – the quantity of members.
a combination of members  =  1 ,  22 , ..,   ︁)
︁(</p>
        <p>1  
to an aspect of the observed phenomenon associated with   .</p>
        <p>Members of   are drawn from a set of positions of the basic classifier which corresponds
The multidimensional data cube is a structured set of cells. Each cell  is defined by
. The combination includes one member
each other and generates sparseness in the cube.
for each of the dimensions. If the analysis of the observed phenomenon is performed
using a large set of diverse aspects, not all members combinations define the possible
cells of multidimensional cube, i.e. the cells corresponding to a certain fact. This efect
occurs due to semantic inconsistencies of some members from diferent dimensions to</p>
        <p>The complex structure of the compatibility of members may lead to a situation
where a certain dimension becomes semantically uncertain if combined with a set of
members from other dimensions. In this situation, while describing the possible cell of
multidimensional cube the special value “Not in use” can be used to set the member of
semantically unspecified dimension. The structure of the multidimensional data cube in
the information system can be described as the set of possible members combinations.
Diferent values from the classifiers, which comply with the dimensions, and the special
value “Not in use” can be applied in the combinations of this set. To refer to the set of
possible members combinations we will use the abbreviation “SPMC”.</p>
        <p>The subject domain is characterized by the measure values defined in possible cells
of the multidimensional cube.</p>
      </sec>
      <sec id="sec-3-2">
        <title>The full set of measures composes the set  (</title>
        <p>) =
{ 1,  2, ..,   }</p>
        <p>, where   is  -measure,  – the quantity of measures in the hypercube.
Not all the measures from the  ( ) can be defined in the possible cell. This situation
can appear in case of semantic inconsistency between the members defining the cell
and some measures.</p>
        <p>While describing multidimensional data cube structure for every
possible sell it is necessary to define its own set  ( ) = {
 1, , ..,    }
the description of c measures, which are not included in the set  ( ).
certain measures for this cell, 1 ≤  
≤  . We can use the special value “Not in use” for
, which consists of</p>
        <p>
          The description of the SPMC can be obtained with the help of the cluster method
based on the analysis of links between members [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ].
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>The cluster method allows</title>
        <p>identifying the groups of members. The group   =
 -dimension includes   members (1 ≤  
≤   ), where  is a group number and
contains members, which equally coincide in the SPMC with the members from some
groups of members of other dimensions.</p>
        <p>It is possible to define connected groups of member in diferent dimensions with
the help of the semantic analysis. The cluster of members combinations 
is the set
of member combinations, which can be obtained with the help of Cartesian product
where operands are groups of members or special value “Not in use”; one operand stands
for every dimension used in the cluster SPMC(
members combinations can be used for the description of the SPMC.
) =  1 ×  2 × .. ×   . Clusters of
︁{
 1,  2, ..,   
︁}
of members in</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>The use of classification schemes for describing the semantics of the observed phenomenon</title>
      <p>
        From the position of semantic the description of the observed pattern characteristics
within the multidimensional data model consists of the classification attributes detecting
(dimensions of the multidimensional cube) and establishing the links between them. It
can be rather dificult if there are a great number of dimensions. Classification schemes
(SC) can be used to solve the problem of classification of data describing the observed
phenomenon. For CS it is possible to formulate a number of requirements [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>It is necessary to take into account the component structure of the observed pattern
while defining CS. If the observed pattern can be semantically divided into separate
structural components for which is possible to choose their own sets of aspects for
analysis every component should be compared with CS. The procedure of CS formation
is based on defining and analysis of the attributes relevant to the chosen aspects of the
analysis. The dimensions of the multidimensional cube should be compared with the
characteristics.</p>
      <p>CS of the attributes for the observed patterns should be formed on the hierarchical
principle. Ranking should be established among the attributes related to CS. This ranking
allocates the dimensions which to some extent convey the essence of the structural
component for the observed
pattern.</p>
      <sec id="sec-4-1">
        <title>This component is compared</title>
        <p>with</p>
        <p>CS. It is
necessary to define the major dimension which is more likely to reflect the semantic of
the structural component relevant to CS. The hierarchy of attributes should be formed
from other dimensions included into CS which are semantically subordinate to the major
dimension and express some particular properties of the structural component for the
observed pattern.</p>
        <p>The following principle should be observed: the members of the
major dimension convey the most important attributes of the observed pattern, the
members of other dimensions which come hierarchically below the major one convey
some subordinate attributes specifying the essence of the major dimension.</p>
        <p>While forming the hierarchy of the attributes for the observed pattern in CS it should
be possible to describe the members of the major dimension separately or in groups of
members as diferent members can be connected with diferent semantic aspects of the
structural component for the observed pattern. Diferent hierarchies of attributes should
be formed for the members of the major dimension which are semantically diferent.</p>
        <p>In the hierarchy of the attributes in CS there must be the information about the set
of measures describing the observed pattern in case of choosing some particular members
from the hierarchy.</p>
        <p>The classification scheme of the attributes for the observed pattern is an object of
the multidimensional information system which describes the structural component of
the observed pattern and contains the following information:
– the set of dimensions included into the classification scheme;
– the set of members of these dimensions included into the classification scheme;
– the major dimension chosen in the set of dimensions CS;
– the set of measures included into the classification scheme;
– the tree of member combinations CS which form the hierarchy of the attributes
included into CS.</p>
        <p>The hierarchy principal of CS forming is realized in the structure of a tree which
presents the member combinations in CS. The tree of combinations can be formed as
a result of the semantic analysis of the structural component for the observed pattern.
The tree can be defined while describing the process of its formation. One should start
the formation of the tree from its roots where the groups of members of the major
dimension are placed. Then it is necessary to go down passing the hierarchical levels
and adding a group of members to each of them. Thus every group reveals the essence
of every previous member on the previous level. What is more it is necessary to add
the group related to the dimension which is mostly connected with the members of
the previous level. As a result diferent sequences of CS measures can appear in tree
brunches on the way from the roots to leaves.</p>
        <p>
          Relationships between the members of diferent dimensions can be established
using approaches of non-parametric methods of statistical analysis [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] and queueing
theory [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ].
        </p>
        <p>For the tree structure of classification scheme, the following rules must be followed:
1. The root of the tree is the unit “Major dimension”.
2. The tree itself is a hierarchical structure where the levels are set through alternating
such units as “Group of members” and units “Dimension”. At the same time groups
of members should be formed in the dimensions relevant to the units hierarchically
placed one level higher.
3. Leaves of the tree are units “Group of members”.
4. The unit “Group of members” (except the unit which is a tree leaf) should be
relevant to the unit “Dimension” hierarchically placed on a lower level. Only one
unit or several units “Group of members” placed on a lower level can be relevant to
the unit “Dimension”.
5. Moving from the root to a leaf you can see every dimension only once.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Semantic aspects of information system metadata construction</title>
      <p>The analysis of the observed phenomenon reveals the qualification characteristics
that are included in the metadata of the information system. In the structure of a
multidimensional data cube, these characteristics are divided into subject of analysis
(measures) and aspect of analysis (dimensions). Semantic analysis allows to establish
connections between these characteristics. As a result, the structure of a multidimensional
cube can be revealed, that is, significant cells of a multidimensional cube corresponding
to the facts are described.</p>
      <p>Dificulties in the application of the described technique are due to the fact that
the complex observed phenomenon is characterized by a large number of aspects. A
complete set of these aspects allows us to construct many multidimensional data cubes
corresponding to diferent structural components of the observed phenomenon. The
pairwise analysis of the characteristics does not make it possible to separate them
in accordance with the structural components, since they are mixed in the observed
phenomenon and there are no hierarchical relationships between them.</p>
      <p>Construction of classification schemes related to the observed phenomenon as a result
of semantic analysis allows to achieve the following result:
– semantic separation of the characteristics of the observed phenomenon, their binding
to the structural components of the observed phenomenon;
– ranking of characteristics, building a hierarchy of characteristics in accordance with
their significance in the description of the properties of the structural component
of the observed phenomenon.</p>
      <p>The described properties of classification schemes allow us to consider them as the
main objects that describe and systematize information about the structural components
of the observed phenomena. The interaction of information objects included in the
multidimensional data cube and the classification scheme can be represented by a
diagram (see figure 1).
The links in the diagram represent semantic and technological dependencies. The
use of classification schemes alters the relationship between the observed phenomenon
and the multidimensional data cube. Classification schemes are a source of classification
of information objects of a multidimensional cube related to the structural components
of the observed phenomenon.</p>
      <p>Members belonging to diferent dimensions and measures form a classification scheme.
The process of such formation is influenced by the semantic relationship between
the observed phenomenon on the one hand and the dimensions and measures on the
other hand. Due to the fact that the classification scheme expresses the properties of
the structural component of the observed phenomenon, there is an implicit semantic
relationship between the classification scheme and the observed phenomenon, which
forms the composition of dimensions, members and measures of the classification scheme.
The same relationship allows us to determine which classification schemes can underlie
multidimensional data cubes related to the observed phenomenon. The insertion of
classification schemes changes the nature of the relationship between the observed
phenomenon and the multidimensional data cube. The observed phenomenon loses its
role as a source of classification, while the multidimensional cube plays the role of a
technological component.
5.</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>The paper considers the method of designing information systems using a
multidimensional approach. This approach allows us to develop a system based on a metamodel,
which is semantically related to the subject domain of the system. The method is
based on the construction of groups of members which are semantically connected with
other groups of members. Connected groups related to diferent dimensions describe the
cluster of cells.</p>
      <p>Classification schemes that correspond to the structural components of the observed
phenomenon can be used to describe it’s semantics. Every classification scheme is a
graph describing the hierarchy of members that are associated with a separate structural
component of the observed phenomenon. Classification schemes can be used to solve
the problem of classification of data describing the observed phenomenon. The coupling
between several classification schemes related to diferent structural components helps to
describe the metadata of the multidimensional information system. It is formed on the
hierarchical principle and establishes a ranking between the characteristics of structural
component of observed phenomenon. The classification scheme is a technological
component in relation to multidimensional data cube, while the multidimensional cube
plays the technological role in relation to the observed phenomenon.</p>
      <p>The publication has been prepared with the support of the “RUDN University
Program 5–100”.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. E. Thomsen, OLAP Solution:
          <article-title>Building Multidimensional Information System</article-title>
          , Willey Publishing,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>C. M. Hirata</surname>
            ,
            <given-names>J. C.</given-names>
          </string-name>
          <string-name>
            <surname>Lima</surname>
          </string-name>
          ,
          <article-title>Multidimensional cyclic graph approach: representing a data cube without common sub-graphs</article-title>
          .
          <source>Inf. Sci. 181</source>
          , pp.
          <fpage>2626</fpage>
          -
          <lpage>2655</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>N.</given-names>
            <surname>Karayannidis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Sellis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kouvara</surname>
          </string-name>
          , CUBE File:
          <article-title>A File Structure for Hierarchically Clustered OLAP Cube</article-title>
          , in: Advances in Database Technology, pp.
          <fpage>621</fpage>
          -
          <lpage>638</lpage>
          ,
          <issue>SpringerVerlag</issue>
          (
          <year>2004</year>
          ) ISBN 978-3-
          <fpage>540</fpage>
          -21200-3.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>S.</given-names>
            <surname>Chun</surname>
          </string-name>
          ,
          <article-title>Partial Prefix Sum Method for Large Data Warehouses</article-title>
          ,
          <source>in: Foundations of Intelligent Systems - ISMIS</source>
          <year>2003</year>
          , pp.
          <fpage>473</fpage>
          -
          <lpage>477</lpage>
          . Springer-Verlag (
          <year>2004</year>
          ) ISBN 978-3-
          <fpage>540</fpage>
          -39592-8.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>R. B. Messaoud</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Boussaid</surname>
            ,
            <given-names>S. L.</given-names>
          </string-name>
          <string-name>
            <surname>Rabaseda</surname>
            ,
            <given-names>A Multiple</given-names>
          </string-name>
          <string-name>
            <surname>Correspondence</surname>
          </string-name>
          <article-title>Analysis to Organize Data Cube</article-title>
          ,
          <source>in: Databases and Information Systems IV - DB&amp;IS</source>
          <year>2006</year>
          , pp.
          <fpage>133</fpage>
          -
          <lpage>146</lpage>
          . IOS Press (
          <year>2007</year>
          ) ISBN 978-1-
          <fpage>58603</fpage>
          -715-4.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>R.</given-names>
            <surname>Jin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. K.</given-names>
            <surname>Vaidyanathan</surname>
          </string-name>
          ,
          <string-name>
            <surname>G</surname>
          </string-name>
          . Yang,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Agrawal, Communication and memory optimal parallel data cube construction</article-title>
          ,
          <source>IEEE Transactions on Parallel and Distributed Systems</source>
          .
          <volume>16</volume>
          , pp.
          <fpage>1105</fpage>
          -
          <lpage>1119</lpage>
          (
          <year>2005</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>Z. W.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. W.</given-names>
            <surname>Ling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. H.</given-names>
            <surname>Ang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. Y.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Cui</surname>
          </string-name>
          , Range Top/Bottom
          <article-title>Queries in OLAP Sparse Data Cubes</article-title>
          ,
          <source>in: Database and Expert Systems Applications - DEXA'01</source>
          , pp.
          <fpage>678</fpage>
          -
          <lpage>687</lpage>
          . Springer-Verlag (
          <year>2001</year>
          ) ISBN 978-3-
          <fpage>540</fpage>
          -42527-4.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>L.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <article-title>Eficient Evaluation of Sparse Data Cubes</article-title>
          ,
          <source>in: Advances in Web-Age Information Management - WAIM'04</source>
          , pp.
          <fpage>336</fpage>
          -
          <lpage>345</lpage>
          . Springer-Verlag (
          <year>2004</year>
          ) ISBN 978-3-
          <fpage>540</fpage>
          - 27772-9.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>F. Z.</given-names>
            <surname>Salmam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fakir</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Errattahi</surname>
          </string-name>
          ,
          <article-title>Prediction in OLAP Data Cubes</article-title>
          .
          <source>Journal of Information &amp; Knowledge Management</source>
          ,
          <volume>15</volume>
          , pp.
          <fpage>449</fpage>
          -
          <lpage>458</lpage>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>O.</given-names>
            <surname>Romero</surname>
          </string-name>
          , T. B.
          <string-name>
            <surname>Pedersen</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Berlanga</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Nebot</surname>
            ,
            <given-names>M. J.</given-names>
          </string-name>
          <string-name>
            <surname>Aramburu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Simitsis</surname>
          </string-name>
          ,
          <article-title>Using Semantic Web Technologies for Exploratory OLAP: A Survey</article-title>
          ,
          <source>IEEE Transactions on Knowledge &amp; Data Engineering</source>
          ,
          <volume>27</volume>
          , pp.
          <fpage>571</fpage>
          -
          <lpage>588</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>L. I.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaisman</surname>
          </string-name>
          ,
          <article-title>A generic data model and query language for spatiotemporal OLAP cube analysis</article-title>
          ,
          <source>in: Proceedings of the 15-th International Conference on Extending Database Technology - EDBT</source>
          <year>2012</year>
          , pp.
          <fpage>300</fpage>
          -
          <lpage>311</lpage>
          . ACM, New York (
          <year>2012</year>
          ) ISBN 978-1-
          <fpage>4503</fpage>
          -0790-1.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>M. F. Tsai</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Chu</surname>
            ,
            <given-names>A Multidimensional</given-names>
          </string-name>
          <string-name>
            <surname>Aggregation</surname>
          </string-name>
          <article-title>Object (MAO) Framework for Computing Distributive Aggregations, in: Data Warehousing and Knowledge Discovery - DaWaK</article-title>
          <year>2003</year>
          , pp.
          <fpage>45</fpage>
          -
          <lpage>54</lpage>
          . Springer-Verlag (
          <year>2003</year>
          ) ISBN 978-3-
          <fpage>540</fpage>
          -40807- 9.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Vitter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>Approximate computation of multidimensional aggregates of sparse data using wavelets</article-title>
          ,
          <source>in: Proceedings of the 1999 International Conference on Management of Data - SIGMOD'99</source>
          , pp.
          <fpage>193</fpage>
          -
          <lpage>204</lpage>
          . ACM, New York (
          <year>1999</year>
          ),
          <source>ISBN 1-58113-084-8.</source>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>B.</given-names>
            <surname>Leonhardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mitschang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Pulido</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sieb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wurst</surname>
          </string-name>
          ,
          <article-title>Augmenting OLAP Exploration with Dynamic Advanced Analytics</article-title>
          ,
          <source>in: Proceedings of the 13th International Conference on Extending Database Technology - EDBT</source>
          <year>2010</year>
          , pp.
          <fpage>687</fpage>
          -
          <lpage>692</lpage>
          . ACM (
          <year>2010</year>
          ) ISBN 978-1-
          <fpage>60558</fpage>
          -945-9.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. X.</given-names>
            <surname>Yu</surname>
          </string-name>
          , Condensed Cube:
          <article-title>An Efective approach to reducing data cube size</article-title>
          ,
          <source>in: Proceedings of the 18th International Conference on Data Engineering - ICDE'02</source>
          , pp.
          <fpage>155</fpage>
          -
          <lpage>165</lpage>
          . IEEE Computer Society (
          <year>2002</year>
          ) ISBN 0-7695-1531-2.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>S.</given-names>
            <surname>Goil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Choudhary</surname>
          </string-name>
          ,
          <article-title>Design and implementation of a scalable parallel system for multidimensional analysis and OLAP, in: Parallel and Distributed Processing -</article-title>
          11th
          <source>IPPS/SPDP'99</source>
          , pp.
          <fpage>576</fpage>
          -
          <lpage>581</lpage>
          . Springer-Verlag (
          <year>1999</year>
          ) ISBN 978-3-
          <fpage>540</fpage>
          -65831-3.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. A. Cuzzocrea,
          <article-title>OLAP Data Cube Compression Techniques: A Ten-Year-Long History</article-title>
          ,
          <source>in: Future Generation Information Technology - FGIT</source>
          <year>2010</year>
          , pp.
          <fpage>751</fpage>
          -
          <lpage>754</lpage>
          . SpringerVerlag (
          <year>2010</year>
          ) ISBN 978-3-
          <fpage>642</fpage>
          -17568-8.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>C. Chen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Feng</surname>
          </string-name>
          , L. Xing,
          <article-title>Computation of Sparse Data Cubes with Constraints</article-title>
          ,
          <source>in: Data Warehouse and Knowledge Discovery</source>
          , pp.
          <fpage>14</fpage>
          -
          <lpage>23</lpage>
          . Springer-Verlag (
          <year>2003</year>
          ) ISBN 978-3-
          <fpage>540</fpage>
          -40807-9.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>M. B. Fomin</surname>
          </string-name>
          ,
          <article-title>Cluster method of description of information system data model based on multidimensional approach</article-title>
          . In: Vishnevskiy V.,
          <string-name>
            <surname>Samouylov</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kozyrev</surname>
            <given-names>D</given-names>
          </string-name>
          . (eds.)
          <article-title>Distributed Computer and Communication Networks</article-title>
          .
          <source>DCCN 2016. CCIS</source>
          , vol
          <volume>678</volume>
          , pp.
          <fpage>657</fpage>
          -
          <lpage>668</lpage>
          , Springer (
          <year>2016</year>
          ). doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -51917-3_
          <fpage>56</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>M. B. Fomin</surname>
          </string-name>
          ,
          <article-title>The application of classification schemes while describing metadata of the multidimensional information system based on the cluster method</article-title>
          . In: Vishnevskiy V.,
          <string-name>
            <surname>Kozyrev</surname>
            <given-names>D</given-names>
          </string-name>
          . (eds.)
          <article-title>Distributed Computer and Communication Networks</article-title>
          .
          <source>DCCN 2017. CCIS</source>
          , vol
          <volume>700</volume>
          , pp.
          <fpage>307</fpage>
          -
          <lpage>318</lpage>
          , Springer (
          <year>2017</year>
          ). doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -66836-9_
          <fpage>26</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Orlov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gaidamaka</surname>
          </string-name>
          , E. Zaripova,
          <article-title>Approach to estimation of performance measures for SIP server model with batch arrivals</article-title>
          ,
          <source>in: Communications in Computer and Information Science</source>
          , vol
          <volume>601</volume>
          (
          <year>2016</year>
          ) pp.
          <fpage>141</fpage>
          -
          <lpage>150</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -30843-2_
          <fpage>15</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <given-names>Y. V.</given-names>
            <surname>Gaidamaka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. R.</given-names>
            <surname>Zaripova</surname>
          </string-name>
          ,
          <article-title>Session setup delay estimation methods for IMSbased IPTV services</article-title>
          .
          <source>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</source>
          , vol
          <volume>8638</volume>
          ,
          <string-name>
            <surname>LNCS</surname>
          </string-name>
          ,
          <year>2014</year>
          , pp.
          <fpage>408</fpage>
          -
          <lpage>418</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -10353-2_
          <fpage>36</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>