<!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>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alberto Abelló</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sergi Nadal</string-name>
          <email>snadal@essi.upc.edu</email>
        </contrib>
      </contrib-group>
      <abstract>
        <p>A Big Data system is a tiny fraction of analytical code surrounded by a lot of “plumbing” devoted to manage the generated models and the associated data. Hence, we can consider that plumbing to be mimicking a DBMS, which is indeed a complex system that actually has to serve diferent purposes and hence provide multiple and independent functionalities. Thus, it can neither be studied nor built monolithically as an atomic unit. Oppositely, there are diferent software inter-dependent components that interact in diferent ways to achieve the global purpose. Similarly to DBMS, in a Big Data system, we have to understand among other issues how our system is going to collect data; how these are going to be used; where they are going to be stored; how they are going to be related to the corresponding metadata; if we are going to use any kind of master data, where these will come from and how they will be integrated; how are the data going to be processed; how replicas are going to be managed and their consistency guaranteed; etc. In this paper, we briefly discuss the dificulties to build such system, paying special attention to how metadata can help storage and processing.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Big Data architecture</kwd>
        <kwd>DBMS</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>2. Big Data Architectures</p>
      <p>
        © 2022 Copyright for this paper by its authors. Use permitted under Creative
CPWrEooUrckReshdoinpgs IhStpN:/c1e6u1r3-w-0s.o7r3g CCoEmmUoRns LWiceonsrekAstthribouptionP4r.0oIncteerenadtiionnagl s(CC(CBYE4U.0)R.-WS.org)
The previously identified challenges require a complete
reconsideration of classical DBMS architecture and
components that date back to the 70s. Yet, the approach so far
adopted by the data management community has been
that of developing components addressing each of the
required functionalities (i.e., Storage, Modeling,
Ingestion, Processing, and Querying/Fetching) as eficiently
as possible. Indeed, current technological stacks for the focuses on batch processing, and the other on stream
promanagement and processing of data-intensive tasks are cessing. Nevertheless, maintaining such potentially
recomposed of independent components (commonly those dundant flows generates some management risks. For the
in the NOSQL family) that generally work in isolation and prediction to be accurate, the new arriving tuples have
are orchestrated together to map to what would be equiv- to go through the same transformation and preparation
alent to diferent functionalities of a DBMS. In complex tasks as the training data (otherwise, the validity of the
applications, where many of these tools need to interact, prediction would be compromised). The  -architecture
it is definitely not wise to do it arbitrarily. Indeed, such evolved into  -architecture, as a simplification with a
erroneous approach yields what is coined as a “pipeline single execution engine (hence a single implementation
jungle” [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The alternative is, thus, to reconsider some of the transformations).1 The batch processing is
reof the architectural patterns they implement. placed by playing the data through the streaming system
quickly. If for any reason, we require diferent versions
2.1. New storage patterns of the transformations for diferent predictive models, we
can keep all of them in the same system and choose the
Big Data analysis is an exploratory task, thus integrating most appropriate one at every moment, independently
and structuring the data a priori entails a large overhead. of whether it is for training or production.
Alternatively, the Data Lake approach promotes to
maintain raw data as they are in the sources as a collection
of independent files. Then, once data scientists require 3. Conclusion
some of these data for a concrete purpose, it is when the
task of integrating, cleaning and structuring into the right The current problem in Big Data is not how to make a
format and schema for the problem at hand is performed. more accurate predictive model, but how to manage the
This referred as the “Load-first, Model-later” approach. data needed for its training. The dificulty is amplified
      </p>
      <p>
        The risk with this approach is that files can be simply by having independent components that need to
intermassively accumulated without any order, resulting in act without a solid backbone that removes the burden
what is called a “Data Swamp”, where just finding the of their connectivity from the shoulders of developers.
relevant data would be a challenge. The solution for this If we pay attention to either Velocity or Variety, we can
is creating an organization of files and semantically anno- conclude that metadata is crucial for such backbone and
tate into a metadata catalog conceptualizing the domain the governance of Big Data. However, current state of
(e.g., implemented via graph-based formalisms). Thus, to the art has not reached the required level of maturity
the already existing mappings in the catalog, we should to give the view of a single homogenous system
coordiadd links from each file to such graph containing the rel- nated through those metadata instead of adhoc scripts
evant concepts for our business. In this way, users would or specifically programmed APIs and connectors.
be able to perform guided searches over the metadata
instead of blindly navigating the files. If properly done, References
a semantic approach can even facilitate automation of
integration and queries [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
2.2. New processing patterns
Descriptive analytics study how the business performs
at diferent levels of granularity (e.g., regions, cities or
districts), and how it evolves over time. Timeliness of
data is usually not an issue for long term trends, and days
or even weeks are acceptable for the current data to be
processed and made ready for the analysis. Oppositely,
predictive analytics aim to foresee how a given entity
(e.g., customer) is going to behave in the near future.
      </p>
      <p>Obviously, since the purpose of a prediction is to react
or at least be ready to take some action, data freshness
and response time is typically crucial in this case.</p>
      <p>Consequently, since time requirements are
contradictory, we have to distinguish both precessing flows, giving
rise to what is known as  -Architecture. This, consists of
two execution branches fed from the same sources. One</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P.</given-names>
            <surname>Jovanovic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Nadal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Romero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Abelló</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bilalli</surname>
          </string-name>
          ,
          <article-title>Quarry: A user-centered big data integration platform</article-title>
          ,
          <source>Inf. Syst. Frontiers</source>
          <volume>23</volume>
          (
          <year>2021</year>
          )
          <fpage>9</fpage>
          -
          <lpage>33</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T.</given-names>
            <surname>Rabl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Frank</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Danisch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Jacobsen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Gowda</surname>
          </string-name>
          ,
          <source>The vision of bigbench 2.0, in: Proceedings of the 4th Workshop on Data analytics in the Cloud (DanaC)</source>
          , ACM,
          <year>2015</year>
          , pp.
          <volume>3</volume>
          :
          <fpage>1</fpage>
          -
          <issue>3</issue>
          :
          <fpage>4</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Sculley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Holt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Golovin</surname>
          </string-name>
          , E. Davydov,
          <string-name>
            <given-names>T.</given-names>
            <surname>Phillips</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ebner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Chaudhary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Young</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.- F.</given-names>
            <surname>Crespo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dennison</surname>
          </string-name>
          ,
          <article-title>Hidden technical debt in machine learning systems</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          , volume
          <volume>28</volume>
          ,
          <string-name>
            <surname>Curran</surname>
            <given-names>Associates</given-names>
          </string-name>
          , Inc.,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Nadal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Romero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Abelló</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Vassiliadis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vansummeren</surname>
          </string-name>
          ,
          <article-title>An integration-oriented ontology to govern evolution in big data ecosystems</article-title>
          ,
          <source>Inf. Syst</source>
          .
          <volume>79</volume>
          (
          <year>2019</year>
          )
          <fpage>3</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>