<!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>The Quest for a Database Selection and Design Method</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Noa Roy-Hubara</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ben-Gurion University of the Negev</institution>
        </aff>
      </contrib-group>
      <fpage>69</fpage>
      <lpage>77</lpage>
      <abstract>
        <p>New types of database have emerged over the last decade, aimed at answering new requirements in the Big Data era. The new databases, in additional to the Relational model, may fit to specific types of applications. Therefore, new challenges have also emerged, including the issue of which database model to select for a given application, and how to design the database based on the selected model. To the best of our knowledge, these two challenges have not been addressed by any systematic method. In this research we plan to devise a structured method for database model selection and design based on variety of factors, including data-related requirements, functional requirements, and non-functional requirements. Based on these requirements the method will recommend which database models are the most appropriate for that application and will suggest a design for the recommended models.</p>
      </abstract>
      <kwd-group>
        <kwd>Database Selection</kwd>
        <kwd>Database Design</kwd>
        <kwd>Database Models</kwd>
        <kwd>NoSQL</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The last decade had brought new advancements to the database domain with a
tremendous growth in the field with new data models and providers. These advancements have
arrived after more than four decades of the dominance of the relational model which
still remains a leading database solution1. Over the years, other database models and
systems emerged, including object-oriented (OO), and in the last decade, the NoSQL
and the NewSQL databases. Object-Oriented databases are integrated with
object-oriented programming languages, and thus overcome the gap between the Relational
database and the OO programming languages. NoSQL databases are flexible, horizontally
scalable databases that aim at overcoming the Relational databases rigidity. NewSQL
databases are a combination of the Relational and NoSQL databases, aimed to converge
the advantages of both technologies.</p>
      <p>With the new technologies, new challenges have risen. Since many database models
are available nowadays, there is a challenging need to select the most suitable database
model (or models) and systems for a specific application. In addition, the new DBMSs
are less studied and therefore lack structured design methods for their creation and
design, as exist for the relational databases. These two main challenges may result in an
unfitting database and/or database design for an application, a fact that might lead to</p>
    </sec>
    <sec id="sec-2">
      <title>1 https://db-engines.com/en/ranking</title>
      <p>many changes and rollbacks in the development lifecycle. These changes, rollbacks and
detours in the quest for the right database system and its design consume both time and
money.</p>
      <p>Addressing the selection process in research is done in studies which mostly
compare different DBMSs based on technical aspects such as replication type, atomicity
type, data model, etc. These studies are useful for becoming familiar the new databases;
however, they hardly deal with how well the various databases fit with the specific
requirements of an application. In addition, practitioners who deal with the selection
problem hardly perform an analysis of the problem (data analysis, goal analysis) for
finding most fitting DBMSs. In regarding the second challenge, of database design,
several new methods were proposed. However, it seems that none of the methods is
widely adopted, and practitioners design new databases based on best practices and trial
and error processes.</p>
      <p>In this research we plan to propose and implement a method for a database selection
and design. The sought method will emphasize the users' requirements, including
datarelated requirements, functional requirements and non-functional requirements. The
proposed method would take into account all needed requirements in the database
selection and design process and will assist practitioners to choose from the variety of
database models and solutions. The sought method will support the much-needed
analysis that practitioners require, but lack to perform.</p>
      <p>The rest of the paper is structured as follows. In Section 2 we review the
state-ofthe-art. In Section 3 we elaborate on the research methodology. In Section 4, we briefly
describe our initial suggestion for the method. Finally, in Section 5 we summarize and
elaborate on our plans for future research.</p>
      <p>2
2.1</p>
      <sec id="sec-2-1">
        <title>Current Status</title>
        <sec id="sec-2-1-1">
          <title>In database selection</title>
          <p>
            To the best of our knowledge, no structured method for database selection is available.
Various surveys, such as [
            <xref ref-type="bibr" rid="ref10 ref11 ref18 ref20 ref4 ref5 ref8">4, 5, 8, 10, 11, 18, 20</xref>
            ], analyze characteristics, capabilities
and benefits of various database technologies. These characteristics include supported
query languages, index implementation, availability, consistency, durability, security,
support for transactions, and license types. Yet, these surveys usually do not deal with
the issue of how to select a database technology based on the users' needs and the
requirements of the application.
          </p>
          <p>
            We found studies that refer to the issue of database selection to a limited extent. For
example, [
            <xref ref-type="bibr" rid="ref1">1</xref>
            ] compared different graph databases and their features, including storing
features, querying features and data structures. [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ] and [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ] conducted empirical
comparisons of different types of workloads, such as data insertion time and traversal time
for different databases. The authors of [
            <xref ref-type="bibr" rid="ref19">19</xref>
            ] compared the performance of five NoSQL
databases. They excluded graph database providers from their study since they claim
that its use cases are different from the other three NoSQL database models. They
defined three types of workloads and tested execution time and throughput for the five
databases. While the study involved DBMSs of specific providers, the authors deduce
that “Document databases, followed by Column-family databases, have a good average
performance since they own both efficiency and scalability”. In [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] six database
systems were compared based on different, divided into functional and non-functional
requirements, and techniques. With respect to functional requirements, the authors
checked supported types of queries, such as sorting, joins, transactions, etc. With
respect to non-functional requirements, they compared latency and availability. With
respect to techniques, they looked at technical aspects such as replication, logging and
analytic framework. The authors also provided a decision tree that maps some of the
aspects to the different database providers.
          </p>
          <p>While all presented surveys provide a valuable understating to different models and
their characteristics, they do provide a structured way to assist programmers choose the
right model/technology based on their application requirements.
2.2</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>Database design</title>
          <p>
            To fully understand the current situation of the new databases’ design, we surveyed
several design methods [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ]. In addition, we performed a systematic literature review
[
            <xref ref-type="bibr" rid="ref15">15</xref>
            ], in which we found 24 new methods and assessed them based on different criteria.
We found the field is definitely gaining more attention and generated several interesting
findings.
          </p>
          <p>First, most methods used a known conceptual model to represent the data such as
ERD or UML class diagram. These models are widely accepted and used, and helpful
in describing a domain, probably even one less structured, in an understandable manner.
The new methods defined a set of rules and/or definitions to utilize the conceptual
models appropriately. It seems that a usage of a known model to define the data structure
makes a method more appealing to users since it would require less effort in learning
new conceptual models.</p>
          <p>Second, there is tradeoff between a method generality and its complexity. When a
method is tailored to a specific database provider, it is not usable in other databases of
the same model. However, if a method is fitted to all types of databases, then it is more
complex and harder to learn and use. Hence, most studies choose to focus on one
specific NoSQL database type, which is more inclusive than a method that is tailored to
one specific provider.</p>
          <p>
            Functional and Non-functional requirements are addressed in new methods to a
limited extent. Functional requirements (i.e., queries) are very important in the NoSQL
world. NoSQL databases do not support some concepts that exist in the relational
databases such as joins, nested queries, etc. [
            <xref ref-type="bibr" rid="ref2">2</xref>
            ]. Due to this fact, when designing NoSQL
databases, it is crucial to consider the needed queries. A design that would not take the
queries into effect might be ineffective in answering the desired queries. In regarding
the Non-functional requirements, we believe it is important to address them as well,
mostly when choosing a database solution. Since most methods assume that a database
was chosen a-priori, most NFRs are not addressed. We believe that choosing the right
type of databases for specific tasks is a crucial step in the design process. Such decision
would save time and money and would reduce the need to redesign databases.
          </p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Research Methodology</title>
        <p>
          As in this research we aim at devising new selection and design methods, we plan to
adopt the design science approach [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Figure 1 presents the context and the main steps
we are planning to carry in this research.
        </p>
        <p>Following the design science approach, we performed a requirement analysis of
what is needed for the tasks at hand. In particular, we started with the research point of
view and systematically reviewed related studies. We further created and distributed a
questionnaire to assist in understanding the current situation. The questionnaire aims at
understating the current status practitioners facing regarding the processes of database
selection and design. We believe that insights form such a survey will provide the basis
for shaping the needed methods.</p>
        <p>
          Based on practitioners’ answers to the questionnaire we further plan to interview and
ask experts and practitioners for their experience in database selection and design. Our
initial analysis and the added information from the experts will facilitate the creation of
a comprehensive set of requirements for the sought methods. Based on this set of
requirements we plan to devise proper models, rules, and guidelines. These will be later
implemented in a software tool that will support all artifacts. We further plan to evaluate
the artifacts using various techniques. We plan to implement and evaluate the proposed
method and implementation. Based on the results to further refine it. Table 1 elaborates
on the guidelines adapted from [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ].
        </p>
        <sec id="sec-2-2-1">
          <title>Instantiation in the context of this research</title>
          <p>In our research we have several artifacts, models
for specifying the requirements, guidelines and
rules for database selection, database
fragmentation and database design.</p>
          <p>The problem we address is the process of database
selection for an application and/or domain and
designing the database in the best possible manner.
This is appealing as the variety of database
solutions increases and the need to select the right
ones for specific applications.</p>
          <p>The method as a whole and the different artifacts
will be evaluated and re-evaluated in order
achieve the best possible solution. It will be
evaluated with controlled experiment, use-cases and
by experts’ reviews.</p>
          <p>The research will tackle an almost unreferenced
process of creating a database from start to finish:
from choosing to designing, using new methods
for the entire process.</p>
          <p>The research approach will follow the design
science research approach.</p>
          <p>We plan to try several approaches in order to
achieve the best possible results.</p>
          <p>We plan to publish our work throughout the
process. Currently, SLR is under review.
4</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>Preliminary Method Proposal</title>
        <p>The proposed method for selecting and designing database models and systems
considers various types of users' requirements. It consists of the following steps:
1. Gather and specify the data-related requirements and express them using a
conceptual data model. In this work we use the UML class diagram, chosen based on
its widespread use.
2. Gather and specify the functional requirements that are related to database
operations, i.e., data retrievals and updates operations. Hereafter we call them queries.
3. Gather and specify the non-functional requirements (NFRs) that are related to the
data requirements and the queries.
4. Based on the above, the method considers dividing the conceptual data model into
fragments, each of which has different characterizations (such as different access
frequency, different performance requirements, and different consistency
requirements).
5. Select the most suitable database model/system for each fragment. This will be
based on a general-purpose pre-defined profile for each database model. A
predefined profile consists of a set of non-functional properties associate with each
database model.</p>
        <p>
          6. Design the selected database model/system for the different fragments.
Due to space limitation we will focus on steps 4-6, which constitute the main steps of
the proposed method. A preliminary example for steps 1-5 can be found on [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
        <sec id="sec-2-3-1">
          <title>Step 4 – Dividing the conceptual data model into fragments (fragmentation)</title>
          <p>Currently, relatively large applications with diverse needs may need to be implemented
with more than one database model; a method for database selection should also take
such possibility into account. In this step all the gathered requirements (data, functional
and non-functional) are weighted and considered into the decision if and how to divide
the conceptual data model.</p>
          <p>This step requires two levels of prioritizing (i.e., weighting) between the different
requirements. The first level is in between the different NFRs. At this stage, our method
takes into account six NFRs: consistency, integrity, flexibility, volume, velocity and
veracity. It is a fair assumption that when addressing two classes’ non-functional
similarity and fragmentation, not all NFRs have equal weights. For example, if two classes
require different consistency levels (e.g., eventual or strong) they are less likely be
fragmented together than in the case that two classes that require different volume (e.g.,
very high and very low). Therefore, when calculating the NFRs distance between two
classes, each NFR receives a weight based on our perceived importance of the NFR.</p>
          <p>The second level is between the different types of requirements. Another fair
assumption is that different requirements (data, functional, non-functional) might also
have different impact on the fragmentation process. For example, the fact that two
classes are connected in the conceptual model does not necessarily mean that they will be
fragmented together. In fact, this is probably less important than if the classes are
frequently queried together or share similar non-functional characteristics. Therefore, each
type of requirements will receive a different weight in the process.</p>
          <p>
            The weights were chosen based on analytical hierarchy process (AHP) [
            <xref ref-type="bibr" rid="ref17">17</xref>
            ]. The
pairwise comparisons, which compose the input for the AHP, were chosen based on
previous knowledge and surveys on the different databases. In the future we plan to let
practitioners set the weights throughout the process. However, since our method is
aimed to ease this process, and decrease the need to be familiar with different
technologies and their aspects, we plan to make this plan optional.
          </p>
          <p>Once all the requirements were weighed into the classes’ similarity, the
fragmentation process is done by a clustering algorithm: DBSCAN2. DBSCAN receives as input
a distance matrix and finds the best number of clusters and their contents.</p>
        </sec>
        <sec id="sec-2-3-2">
          <title>Step 5 – Data model selection</title>
          <p>In order to select the most suitable database model for each fragment, we defined a
database profile. A profile is a numerical description for the different NFRs for the
databases. In order to perform the selection, we calculate the similarity between the
profiles of the fragments and the different data models, based on Manhattan distance
function3, and choose/recommend the most similar data model.</p>
          <p>We use the NFRs for this process since they best differentiate between the different
data models. For example, NoSQL databases support eventual consistency and low
integrity, as opposed to Relational databases that support high consistency and integrity
(as part of the ACID concept). All NFRs, apart from query complexity and volume,
received a numeric value based on the scale of the NFR.</p>
          <p>The fragment’s profile is calculated as an average of each of the non-functional
requirements of the classes that constitute the fragment. The selection of the appropriate
database model will be based on the weighted distance among the fragments' profiles
and the database models' profiles (as in the previous step, we assume that NFR are of
the different importance for the selection process, hence the weighting). The chosen
database model is the one with the minimal distance, i.e., with the most similar profile.
The result is one or more fragments and the most suitable database models for their
implementation.</p>
        </sec>
        <sec id="sec-2-3-3">
          <title>Step 6: Design the fragments</title>
          <p>The previous step resulted in one or more fragments required for the application, and
the most suitable model for implementing them. However, even a most fitting model
has to be designed carefully and with accordance to the different requirements. In this
step each fragment is designed as an individual unit according to its most suitable
database model; each model has an appropriate method for its design.</p>
          <p>
            The output of this step is a set of model blocks for each model. A block is a database
model unit, e.g. a document, a table, a node, etc. These blocks constitute as a type of
schema for each of the fragments. We plan to suggest design for the different blocks
based on existing methods as much as possible. In a literature review we performed
[
            <xref ref-type="bibr" rid="ref15">15</xref>
            ] we found some possible methods, that with some adjustments, the process would
result in a complete, sound and adequate design.
          </p>
          <p>
            More specifically, we have in mind two specific methods. The first is GDBS [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ], a
method we developed. The method creates a schema for graph database based on an
ERD. The method requires changes in order to take into account query considerations
and non-functional properties. Another method is NoSE [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ] that with some changes
would suit well to our process. NoSE is used for designing column stores, based on an
EER diagram and needed queries. The method is based on innovative concepts such as
2 https://scikit-learn.org/stable/modules/generated/sklearn.cluster.DBSCAN.html
3 https://xlinux.nist.gov/dads/HTML/manhattanDistance.html
query decomposition and machine learning, guarantying a sound schema (i.e. column
families). As GDBS, with small modifications it will fit our design process.
5
          </p>
        </sec>
      </sec>
      <sec id="sec-2-4">
        <title>Summary and Future Work</title>
        <p>As many database models and supporting system have emerged during the last decade,
it is important to select the most fitted ones for specific applications. In this research
we plan to devise a method for selecting the most fitting database model(s) and
system(s) for a set of requirements and proposing a design for the recommended models.
The method contains six steps beginning with a comprehensive requirement elicitation
and terminating with a design of the most fitting database models for the sought
application.</p>
        <p>Currently, the work focuses on the selection process – steps 1-5 in the suggested
process. The process was demonstrated and adjusted on a rather small but extensive
case study. We currently work on examining the process on a large-scale case-study,
based on a real system. In addition, in future we plan to formalize the sixth step, the
design step, by adopting and adjusting suggested design methods, and creating new
design methods when needed. We also plan to automate the method in order to facilitate
its usage and allow developers to overcome the current limitations of selecting and
designing database models.</p>
      </sec>
      <sec id="sec-2-5">
        <title>Acknowledgements</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>This research is advised by Dr. Arnon Sturm and Prof. Peretz Shoval.</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Angles</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2012</year>
          , April).
          <article-title>A comparison of current graph database models</article-title>
          .
          <source>In Data Engineering Workshops (ICDEW)</source>
          ,
          <year>2012</year>
          IEEE 28th International Conference on (pp.
          <fpage>171</fpage>
          -
          <lpage>177</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Chebotko</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kashlev</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2015</year>
          ).
          <article-title>A big data modeling methodology for Apache Cassandra</article-title>
          .
          <source>In Big Data (BigData Congress)</source>
          ,
          <source>2015 IEEE International Congress on</source>
          (pp.
          <fpage>238</fpage>
          -
          <lpage>245</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Gessert</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wingerath</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Friedrich</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Ritter</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>NoSQL database systems: a survey and decision guidance</article-title>
          .
          <source>Computer Science-Research and Development</source>
          ,
          <volume>32</volume>
          (
          <issue>3-4</issue>
          ),
          <fpage>353</fpage>
          -
          <lpage>365</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. Han,
          <string-name>
            <given-names>J</given-names>
            .,
            <surname>Haihong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            , &amp;
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          (
          <year>2011</year>
          ,
          <article-title>October). Survey on NoSQL database</article-title>
          .
          <source>In Pervasive computing and applications (ICPCA)</source>
          ,
          <year>2011</year>
          6th international conference on (pp.
          <fpage>363</fpage>
          -
          <lpage>366</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Haseeb</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Pattun</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>A review on NoSQL: Applications and challenges</article-title>
          .
          <source>International Journal of Advanced Research in Computer Science</source>
          ,
          <volume>8</volume>
          (
          <issue>1</issue>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Hevner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Chatterjee</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2010</year>
          ).
          <article-title>Design science research in information systems</article-title>
          .
          <source>In Design research in information systems</source>
          (pp.
          <fpage>9</fpage>
          -
          <lpage>22</lpage>
          ). Springer, Boston, MA.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Jouili</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Vansteenberghe</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          (
          <year>2013</year>
          ,
          <article-title>September)</article-title>
          .
          <article-title>An empirical comparison of graph databases</article-title>
          .
          <source>In Social Computing (SocialCom)</source>
          , 2013 International Conference on (pp.
          <fpage>708</fpage>
          -
          <lpage>715</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Khazaei</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fokaefs</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zareian</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beigi-Mohammadi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ramprasad</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shtern</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , ... &amp;
          <string-name>
            <surname>Litoiu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          (
          <year>2016</year>
          ).
          <article-title>How do I choose the right nosql solution? a comprehensive theoretical and experimental survey</article-title>
          .
          <source>Big Data and Information Analytics (BDIA)</source>
          ,
          <volume>2</volume>
          ,
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Kolomičenko</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Svoboda</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Mlýnková</surname>
            ,
            <given-names>I. H.</given-names>
          </string-name>
          (
          <year>2013</year>
          , December).
          <article-title>Experimental comparison of graph databases</article-title>
          .
          <source>In Proceedings of International Conference on Information Integration and Web-based Applications &amp; Services</source>
          (p.
          <fpage>115</fpage>
          ). ACM.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Parashar</surname>
            ,
            <given-names>B. B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sharma</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          (
          <year>2014</year>
          ).
          <article-title>Apache Hadoop, NoSQL and NewSQL solutions of big data</article-title>
          .
          <source>International Journal of Advance Foundation and Research in Science &amp; Engineering (IJAFRSE)</source>
          ,
          <volume>1</volume>
          (
          <issue>6</issue>
          ),
          <fpage>28</fpage>
          -
          <lpage>36</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Lourenço</surname>
            ,
            <given-names>J. R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cabral</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carreiro</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vieira</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Bernardino</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2015</year>
          ).
          <article-title>Choosing the right NoSQL database for the job: a quality attribute evaluation</article-title>
          .
          <source>Journal of Big Data</source>
          ,
          <volume>2</volume>
          (
          <issue>1</issue>
          ),
          <fpage>18</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Mior</surname>
            ,
            <given-names>M. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salem</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aboulnaga</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>NoSE: Schema design for NoSQL applications</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          ,
          <volume>29</volume>
          (
          <issue>10</issue>
          ),
          <fpage>2275</fpage>
          -
          <lpage>2289</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Roy-Hubara</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rokach</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shapira</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Shoval</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>Modeling graph database schema</article-title>
          .
          <source>IT Professional</source>
          ,
          <volume>19</volume>
          (
          <issue>6</issue>
          ),
          <fpage>34</fpage>
          -
          <lpage>43</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Roy-Hubara</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Sturm</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>Exploring the Design Needs for the New Database Era</article-title>
          . In Enterprise,
          <source>Business-Process and Information Systems Modeling</source>
          (pp.
          <fpage>276</fpage>
          -
          <lpage>290</lpage>
          ). Springer, Cham.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Roy-Hubara</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Sturm</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2019</year>
          ).
          <article-title>Design Methods for the New Database Era: A Systematic Literature Review</article-title>
          . Submitted to SOSYM,
          <year>2019</year>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Roy-Hubara</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sturm</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Shoval</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          (
          <year>2019</year>
          ).
          <article-title>A Method for Database Model Selection</article-title>
          .
          <source>In Enterprise, Business-Process and Information Systems Modeling</source>
          . Springer, Cham.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Saaty</surname>
            ,
            <given-names>T. L.</given-names>
          </string-name>
          (
          <year>2008</year>
          ).
          <article-title>Decision making with the analytic hierarchy process</article-title>
          .
          <source>International journal of services sciences, 1</source>
          (
          <issue>1</issue>
          ),
          <fpage>83</fpage>
          -
          <lpage>98</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Storey</surname>
            ,
            <given-names>V. C.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>I. Y.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>Big data technologies and management: What conceptual modeling can do</article-title>
          .
          <source>Data &amp; Knowledge Engineering</source>
          ,
          <volume>108</volume>
          ,
          <fpage>50</fpage>
          -
          <lpage>67</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          (
          <year>2016</year>
          , November).
          <article-title>Performance comparison between five NoSQL databases</article-title>
          .
          <source>In Cloud Computing and Big Data (CCBD)</source>
          ,
          <year>2016</year>
          7th International Conference on (pp.
          <fpage>105</fpage>
          -
          <lpage>109</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Tudorica</surname>
            ,
            <given-names>B. G.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Bucur</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2011</year>
          , June).
          <article-title>A comparison between several NoSQL databases with comments and notes</article-title>
          . In Roedunet International Conference (RoEduNet),
          <year>2011</year>
          10th (pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          ). IEEE.]
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>