<!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>Knowledge-based Big Data Cleanup Method</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Lviv Polytechnic National University</institution>
          ,
          <addr-line>Lviv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Unlike traditional databases, Big Data stored as NoSQL data resources. Therefore such resources are not ready for efficient use in its original form in most cases. It is due to the availability of various kinds of data anomalies. Most of these anomalies are such as data duplication, ambiguity, inaccuracy, contradiction, absence, the incompleteness of data, etc. To eliminate such incorrectness, data source special cleanup procedures are needed. Data cleanup process requires additional information about the composition, content, meaning, and function of this Big Data resource. Using the special knowledge base can provide a resolving of such problem.</p>
      </abstract>
      <kwd-group>
        <kwd>Big Data</kwd>
        <kwd>Ontology</kwd>
        <kwd>Knowledge Base</kwd>
        <kwd>Data Cleanup</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The problem of data quality remains to be topically for a long time in various areas of
data processing. Nowadays it is especially considerable in Big Data technologies and
analytics [
        <xref ref-type="bibr" rid="ref5 ref6">5,6</xref>
        ]. The particularity of the problem of data quality is researched and
discussed in [
        <xref ref-type="bibr" rid="ref1 ref10 ref2 ref4">1,2,4,10</xref>
        ]. Not only volume, variety, and velocity of changes are the principal
quality factors for information resources developed on the principles of Big Data. The
syntax and content heterogeneity of the resources themselves, the complexity of
control, influence and management of the processes of their production and development
also take place [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. These factors, often contribute to the emergence of some data item
corruptions [
        <xref ref-type="bibr" rid="ref1 ref2">1,2</xref>
        ] in the information resource content. Generally, Big Data resources are
presented in NoSQL database formats. It means that principal requirements for such
data resources are availability and partition tolerance. At the same time, any consistency
constraints are not supported for such data [
        <xref ref-type="bibr" rid="ref11 ref6">6,11</xref>
        ]. No any constraints such as check
action, unique, and not null requirements are not used in NoSQL data resources too.
Weak data consistency leads to a situation when data resources are not ready for use in
the original form. So, Big Data resources obtained in NoSQL formats are not checked,
refined, and consistent so fine as traditional databases. The consequence of this is the
risk of occurrence incorrect, inconsistent or invalid data values in a data set[
        <xref ref-type="bibr" rid="ref4 ref6 ref9">4,6,9</xref>
        ].
Therefore some steps to prepare these resource for efficient processing are needed. It
means some data values must be transformed to the form corresponded with data source
purpose, meaning of the tasks, and user requirements during preparing processes. One
of the principal steps of Big Data resource preparing for its use is the application of
data cleanup actions. Incorrect or invalid data values have to be edited, corrected or
replaced by right and valid values at the clean-up stage of Big Data resource [
        <xref ref-type="bibr" rid="ref5 ref9">5,9</xref>
        ]. As
a result, we can obtain the set of so-called "clean" data, which are correct, valid and
ready to use according to their functions [
        <xref ref-type="bibr" rid="ref1 ref4">1,4</xref>
        ]. One of the principal problems of Big
Data cleanup process is the details formal description of all data properties, features of
data items invalidity, and efficient cleanup actions.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Data Anomalies Processing in Big Data Resources</title>
      <p>
        Data anomalies in the Big Data resources are presented by such phenomena as absence,
duplication, ambiguity, lack of meaning, inaccuracy, incompleteness, unreliability,
inconsistency, etc. [
        <xref ref-type="bibr" rid="ref3 ref9">3,9</xref>
        ]. The existence of data abnormalities greatly degrades the
consumer properties of information resources, makes it difficult or impossible to efficient
using due to invalid data items presence. The consequence of this is the incorrect
execution of operations for the search, selection or analysis of data. For example, we would
process values that are equal to each other as different due to their inaccuracy,
misrepresentation, corruption or input error, when performing such operation as data mapping
– Map(X) of the MapReduce [
        <xref ref-type="bibr" rid="ref5 ref6">5,6</xref>
        ] method. For the same reasons, different values
would be mistakenly presented as equal. The absence or inadmissibility of some values
makes it impossible to use them, etc. Therefore, the correct and efficient work with the
Big Data provides for the procedures of their cleanup, during which, in particular,
perform the elimination of existing data anomalies. Data anomalies interpretation is one of
the principal tasks for efficient Big Data resource cleanup. The interpretation of data
anomalies depends on their nature and the causes of the occurrence. It allows to
recognize data anomalies in Big Data resource correctly and to choose the most suitable
method of this anomalies elimination. For a successful solution of data anomalies
problem, these need to be classified. According to [
        <xref ref-type="bibr" rid="ref1 ref3">1,3</xref>
        ] such principal types of data
anomalies are defined for big data resources::
 value not present,
 value is unknown,
 value is invalid,
 value is duplicated,
 value is ambiguous,
 value is not accurate enough,
 value is an incomplete,
 value is unreliable etc.
      </p>
      <p>Classification allows us to choose the best way to eliminate it of data anomalies.</p>
      <p>
        Each data anomaly would be detected for a data item by checking its correspondence
to some predefined requirements. Such requirements have to be described as conditions
of data value comparison. For detection of described above types of anomalies, such
conditions may be used [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] (Table 1).
      </p>
      <p>Type of data anomalies
value not present
value is unknown
value is invalid
value is unreliable
value is duplicated
value is ambiguous
value is not accurate enough
value is an incomplete</p>
      <p>Data item check condition
data item Is Null
data item Is not in &lt;interval&gt;
data item Is not in &lt;set&gt;
Count(data item)&gt;1
data item != data item
data item != value
Number(data item)&lt;value
This list may be continued or changed according to specifics of processed data.</p>
      <p>NoSQL
Big Data Resource</p>
      <p>Invalid Data values
Classification opf Data</p>
      <p>Anomalies</p>
      <p>Methods of Data
Anomaly elimination
Knowledge-Based Data
cleanup process
Ready to use Big
Data Resource</p>
      <p>Knowledge:
How to eliminate certain Data Anomaly</p>
      <p>
        for certain Data Items
Fig. 1. General schema of producing and use of Big Data resource cleanup knowledge
Usually, to eliminate data anomalies, the most commonly used techniques are the
removal, ignoring or re-defining of an appropriate data element, using the average, most
likely, estimated or surrogate value, duplicate values remove etc. [
        <xref ref-type="bibr" rid="ref1 ref4 ref9">1,4,9</xref>
        ].
      </p>
      <p>The principal problem of efficient Big Data resource cleanup is how to build exact
and complete descriptions of the methods and rules of elimination of data anomalies.
This may be presented as a specific knowledge set includes:
1. a description of Big Data resource, its properties, and all included data items,
2. description of data anomaly types,
3. rules of search and recognition of invalid data values,
4. description of the methods of fixing corrupted or invalid data.</p>
      <p>General schema of producing and use of such knowledge presented on Fig. 1.</p>
      <p>The process of anomalies of data elimination in the Big Data resource performs as a
replacement of the incorrect value by the new value, which define by a special
procedure. In the general case, the value vij of some data unit Vi, which is formed to eliminate
its anomaly, depends on the nature (category) of data anomalies – Uk and the method
of its elimination – Sl. The procedure for defining a new data value can be describe as
a sequence of steps of kind</p>
      <p>Vi → Uk → Sl → vi .
(1)
That mean: invalid data value Vi of category Uk by using of method Sl have to be
replaced by value vi for elimination of one case of data anomalies in some resource. The
same transformation can be presented as a mapping</p>
      <p>vi =Ф(Vi , Uk, Sl),
where Ф is a function for define new value for invalid data item using its category and
corresponding method. These actions are perform during general data cleanup process
of Big Data source. Using ontologies for Big Data cleanup
Because it is necessary to have exact and complete descriptions of the correspondence
between anomalies in the data resource, their classification is needed. As well a formal
description of the ways to eliminate such anomalies is needed. Knowledge base may
be uses for such purpose in the set of tools for Big Data sources cleanup. The core of
this knowledge base may be formed by an ontology of type</p>
      <p>OO=&lt; CO, RO, FO&gt;,
where CO={CV, CU, CS} is the set of concepts (classes), which include such subclasses:
CV is entity set (subclass) for a presentation of data units in the Big Data resource to be
processed,
CU is the set of entities that describe the types and nature of each of the data anomalies
presented in the Big Data resource,
CS is the set of entities for the description of data anomalies elimination methods (data
anomaly problems solving);
RO ={RVU, RUS, RVUS} is a set of relations between the above-defined concepts that
include three subsets:
(2)
(3)
RVU is a subset of binary relations between data values of CV and types of anomalies in
Big Data resource CU,
RUS is a subset of relation between types of data anomalies of CU and methods of
anomaly elimination CS,
RVUS is a subset of ternary relations between data values and methods of data anomaly
problem solving;
FO ={ FV, FC } is a set of axioms (rules). Two kinds of rules are needed for data cleanup
process. Each one describes the steps which must be performed for solving of data
anomaly problem, The first kind of rules – FV include rules for data validation in
presented Big Data resource. The second subset – FC consist of rules defines the method
(from the set CS) of data cleanup. This method directly depends on certain data values
(presented by the set CV) and a certain type of anomalies of this data item (described by
the set CU).</p>
      <p>
        The resource of Big Data needs to be deeply investigated to solve the problem of data
cleanup. The main goal of this investigation is to get the answer to the questions:
 what data items and values are needed to solve some defined task;
 what is the structure and content of the data source used for this purpose;
 what kinds of problems with data are possible in the presented resource;
 what factors have an influence on data quality in the resource;
 what are data quality criteria and requirements;
 what are the methods to fix corrupted or invalid data items;
 how some methods of bad data fixing would be used to correct some data items.
Whether obtained all necessary information about input Big Data resource, we can
formalize such knowledge as units of certain special ontology [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>Data Set
Data Item
Data Value</p>
      <p>CV</p>
      <p>Big Data resource
Data Anomalies</p>
      <p>Types CU</p>
      <p>RUS</p>
      <p>RVUS
Data Anomalies
Elimination Rules</p>
      <p>FC
Data Validation</p>
      <p>Rules FV</p>
      <p>Data Anomalies</p>
      <p>Elimination
Methods CS
Fig. 2. Structural model of ontology for Big Data resource cleanup
Generalized structural model of ontology for Big Data resources cleanup presented on
Fig. 2. So, Big Data resource would be described by three concepts of the ontology
according to the developed model. The first describes certain data as a hierarchy: "Data
set" (table, collection, etc) –"Data item" (column, field, element) – "Data value". The
second concept describes the types of potential anomalies of data for processed data
resource. And the third one - the ways to fix corrupted or invalid data in the resource.
Two types of axioms describe the rules of data check to find certain anomalies and the
rules of various data anomalies elimination. The arches describe possible relations
between defined concepts and the rules. As a remark, the relation RVUS seems redundant,
because of its matching to RVU and RUS. Bet such overage allows defining of
unambiguous correspondence between the data set and possible methods of data anomalies
elimination.</p>
      <p>According to proposed principles of the generalized model, the ontology for any Big
Data resource is developed. It is necessary to determine the specific values of concepts,
relationships, and rules in accordance with the content of the resource data when
performing this action. As a result, the primary version of ontology for Big Data resource
cleanup will be obtained. As the next, we can create an appropriate knowledge base for
the data cleanup tools based on created ontology.</p>
      <p>So, in the above-described way we can obtain the set of tools needed for efficient
solving of Big Data resource anomalies elimination. Therefore, an ontology created in
accordance with the principles described above can be used as the basis of the
knowledge base for intelligent tools of the Big Data resources cleanup.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Algorithms and Tools for Big Data Resource Cleanup</title>
      <p>The use of ontology as the core of the knowledge base of the Big Data Cleanup tools
determines the peculiarities of the process of solving data problems (Fig. 3). So,
construction and tuning of basic ontology is a principal prerequisite for any Big Data source
cleanup process. This stage requires a number of actions based on expert knowledge.
Expert knowledge provide definition and creation of basic ontology parts just like that.</p>
      <p>Description of the set of concepts, which corresponds to data values and data units
CV, according to the set of requirements of ontology construction. The concept CV
for the presentation of data value may be defined as a result of hierarchic taxonomy
– "Data Set -&gt; Data Item -&gt; Data Value" according to the proposed structural
model of ontology.</p>
      <p>Construction of the set of definitions of data anomalies CU, which are characteristic
of the given Big Data source. The list of most common data anomalies is presented
above.</p>
      <p>
        Definition of the set of methods CS for data anomalies elimination. Most of
wellknown and often used are such methods of solution of data anomaly problem [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]:
 repeat a request to receive corrupted value,
 recalculate inaccurate value,
 refine inconsistent value,
 replace absent value with some aggregate value (average value, probable value,
standard or default value, initial value, some calculated value, estimated value,
expert value, etc.),
 use of artificial surrogate marks instead of absent or corrupted value,
 remove of corrupted/duplicated data item from the resource,
 ignore the data anomaly for given data item,
 using of special tools to process uncertainties
4.
      </p>
      <p>
        Definition of relations between concepts - data items, data anomalies and methods
of data anomalies elimination – RVU, RUS, RVUS. The most suitable format for
definition relations between concepts is RDF triplet [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] "Object - Predicate - Subject".
      </p>
      <p>So, these relations may be formed in such a way.
 For relation RVU the triplets may be constructed by the scheme "Data Value (CV)–</p>
      <p>Have the Anomaly – Anomaly Type (CU)".
 For relation RUS – by the scheme "Anomaly Type(CU) – Eliminated by – Method
(CS)".
 For relation RVUS the triplets have to be constructed by the scheme "Data Value (CV)–
Anomaly Type (CU) – Method (CS)". Here, the concept CU execute a function of the
predicate.
5.</p>
      <p>
        Rules of data validation for its anomaly detection – FV. This rules also may be
presented as RDF triplets [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] by the scheme "Condition – Corresponds to –
Anomaly Type". For example, the set of such rules may be like as the next
 Value is null, Corresponds to, Value not exist,
 Value is not in interval, Corresponds to, Value is invalid,
 Value is not equal to, Corresponds to, Value is inexact,
 Value is not between (X,Y) , Corresponds to, Value is unacceptable and so on.
      </p>
      <p>Rules of data anomalies elimination method using for various data values and
various data anomalies types – FC. These rules unambiguously correspond to the
relation RVUS between data items, data anomalies, and methods of anomalies
elimination.</p>
      <p>Ontology constructed in this way may be used as primary ontology for knowledge base
of Big Data source cleanup Framework.</p>
      <p>When the base ontology is constructed algorithm of Big Data source cleanup can be
applied for the first time. The first application may not give an effective result of data
cleanup in the general case. It is because the knowledge base need the addition of new
knowledge. General steps sequence of this algorithm is like the next.
1. For each data item with anomaly from class CV , the type of anomaly has to be
qualified. Qualification of anomaly means determining anomaly nature and the
way of its interpretation. As a result, any concept from category "kind of
anomaly"– CU would correspond to any data item of CV. If this operation can't be
executed complement of ontology is necessary (see step 4 of algorithm).</p>
      <p>Using data item determination and anomaly type qualification, corresponding
relation, and the rule of the anomaly of certain type elimination for certain data item
would be defined. Generally, data anomaly elimination rule is the expression of
type
(Vi ^ Uk )→ Sl,
(4)
where, Vi is data item, Uk is a kind of data anomaly, Sl is method of data anomaly
elimination (new data value definition).
3. At the nest step replacement if invalid data value has to be executed according to
defined above relations and rules. When whole data resource is processed
algorithm to be complete if not – return to step 1.
4. This step is need to recognize and fix the problem situation, appeared during the
attempt of data resource cleanup. These problem situations can be categorized
according to its origin:
 no description of data item or data value in the ontology;
 no description of anomaly type in the ontology;
 no description of method to eliminate some type of data anomaly;
 no description of rule to eliminate anomaly for particular data value;
 using of rule to eliminate uncertainty did not effect.</p>
      <p>Big Data source cleanup
system
Input Big Data</p>
      <p>Resource</p>
      <p>Data Value
Data anomaly qualification
Data anomaly elimination</p>
      <p>rule
New data value</p>
      <p>Knowledge Base/</p>
      <p>Ontology</p>
      <p>New knowledge
generating/Ontology
learning</p>
      <p>If the situation is recognized and categorized, we can fix it by the specified way.</p>
      <p>These ways are of
 define the new concepts for the data value, for data anomaly type or for data anomaly
elimination method;
 define the new item in relation set for definition of correspondence between data
value, data anomaly type, and anomaly elimination method;
 define the new rule of data anomaly elimination.</p>
      <p>Step 1 of the algorithm needs to be repeated again after the execution of described over
operations.
4</p>
    </sec>
    <sec id="sec-4">
      <title>The Example</title>
      <p>
        This example has been developed to show how to describe a piece of knowledge about
data, data anomalies, and data cleanup methods using ontology tools. RDF-OWL
technology [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] together with Protégé ontology editor [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] has been used for this purpose. Big
Data resource, which presents the results of the job market monitoring for IT branch in
Ukraine, has been considered as the example of developed method of Big Data resource
cleanup. Most popular job search web sites such as dou.ua, work.ua, rabota.ua, job.ua
have been explored as data sources. The principal values of job search data used as
monitoring process dimensions are the next:
 company-employer name,
 company-employer location – city/region,
 work position,
 job area,
 responsibilities,
 salary,
 education specialty/degree,
 job experience,
 necessary skills,
 vacancy duration.
      </p>
      <p>
        The data set for exploring has been modeled as a NoSQL document-oriented database
using MongoDB JSON [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] format (Fig.4).
Primary ontology for cleanup of considered Big Data resource has been developed by
Protege ontology editor [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Then we have saved the developed one as OWL/XML file.
This ontology includes three class of entities: "VacantJobs" for data value description,
"DataAnomalies" for classification of corrupted data, and "DataCleanupMethods" for
the definition of methods of invalid data processing (Fig.5).
      </p>
      <p>a) Data Values Class
a) Data Anomalies and Data
Cleanup Methods Classes
The set of rules to describe how certain data values with certain data anomalies has to
be fixed by a certain method (during Big data resource cleanup process) has been
developed as well. RDF/XML format has been used for these rules presentation (Fig.6).
By this way, we have constructed the primary version of the special ontology described
above. Further, it is ready to be improved and developed for efficient support of Big
Data resource cleanup processes.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>An approach to solve the problem of quality of Big Data sources by their cleanup has
been considered in the paper. We propose to solve the problem of such type by the
development of knowledge-based intelligent tools. The peculiarity of the solution is
using an ontology as a core of knowledge base for the Big Data resource cleanup
framework. It is the principal difference between the proposed approach and the traditional
methods of data cleanup. We consider the ontology as a special type of metadata, which
describes Big Data resource, anomalies of data, corresponding methods of data cleanup
and the relations between theirs. The developed approach gives us the such possibilities
as to design special tools for intelligent Big Data resource cleanup; to make better
procedures of data clearing of a Big Data resource; to accumulate for further use of
knowledge and experience to solve data quality and data cleanup problem.</p>
      <p>The principles and methods developed in the paper may be useful for data scientists
at the processes of preparation of Big Data resources to analysis.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Alieksieiev</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A method to solve uncertainty problem for big data sources</article-title>
          .
          <source>In: Proceedings of the 2018 IEEE Second International Conference on Data Stream Mining &amp; Processing</source>
          , DSMP,
          <fpage>32</fpage>
          -
          <lpage>37</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Aliekseyeva</surname>
          </string-name>
          , К.,
          <string-name>
            <surname>Berko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Quality evaluation of information resources in web-projects</article-title>
          .
          <source>Actual Problems of Economics, No</source>
          <volume>136</volume>
          (
          <issue>10</issue>
          ),
          <fpage>226</fpage>
          -
          <lpage>234</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Date</surname>
            ,
            <given-names>C. J.:</given-names>
          </string-name>
          <article-title>Database in Depth: Relational Theory for Practitioners. O'Reilly</article-title>
          , CA (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Jaya</surname>
            ,
            <given-names>M. I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sidi</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ishak</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Affendey</surname>
            ,
            <given-names>L. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jabar</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          :
          <article-title>A review of data quality research in achieving high data quality within organization</article-title>
          .
          <source>Journal of Theoretical and Applied Information Technology</source>
          , Vol.
          <volume>95</volume>
          , No
          <volume>12</volume>
          ,
          <fpage>2647</fpage>
          -
          <lpage>2657</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Losin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Big data analytics, Elsevier Inc</article-title>
          ., Waltham, MA, USA (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Marz</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Warren</surname>
          </string-name>
          , J.:
          <article-title>Big Data: Principles and best practices of scalable realtime data systems</article-title>
          , Manning Publications (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Protégé</surname>
          </string-name>
          .
          <article-title>A free, open-source ontology editor and framework for building intelligent systems</article-title>
          , https://protege.stanford.edu
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <source>RDF a Core 1</source>
          .
          <fpage>1</fpage>
          -
          <string-name>
            <given-names>Third</given-names>
            <surname>Edition</surname>
          </string-name>
          .
          <article-title>Syntax and processing rules for embedding RDF through attributes</article-title>
          , https://www.w3.org/TR/2015/REC-rdfa-core-
          <volume>20150317</volume>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Rubinson</surname>
          </string-name>
          , С.: Nulls,
          <string-name>
            <surname>Three-Valued Logic</surname>
          </string-name>
          , and
          <article-title>Ambiguity in SQL : Critiquing Date's Critique</article-title>
          . In: SIGMOD Record Vol.
          <volume>36</volume>
          , No.
          <volume>4</volume>
          ,
          <fpage>137</fpage>
          -
          <lpage>143</lpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Rusyn</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tayanov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lutsyk</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Upper-bound estimates for classifiers based on a dissimilarity function</article-title>
          ,
          <source>Cybernetics and Systems Analysis</source>
          ,
          <volume>48</volume>
          (
          <issue>4</issue>
          ),
          <fpage>592</fpage>
          -
          <lpage>600</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Sadalage</surname>
            ,
            <given-names>P. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fowler</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence</article-title>
          , Publisher:
          <string-name>
            <surname>Addison-Wesley Professional</surname>
          </string-name>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>