<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1659-4142</journal-id>
<journal-title><![CDATA[E-Ciencias de la Información]]></journal-title>
<abbrev-journal-title><![CDATA[E-Ciencias de la Información]]></abbrev-journal-title>
<issn>1659-4142</issn>
<publisher>
<publisher-name><![CDATA[Universidad de Costa Rica, Escuela de Bibliotecología y Ciencias de la Información]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1659-41422021000100053</article-id>
<article-id pub-id-type="doi">10.15517/eci.v11i1.38790</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Normalization by second order graphs: A visual alternative to simplify systems]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Muñoz Garro]]></surname>
<given-names><![CDATA[Edward]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de Costa Rica  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Costa Rica</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2021</year>
</pub-date>
<volume>11</volume>
<numero>1</numero>
<fpage>53</fpage>
<lpage>69</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1659-41422021000100053&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1659-41422021000100053&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1659-41422021000100053&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract This issue stems from the need for tools to analyze and make decisions around complex systems, where they apply the rules for linearly dependent sets, with the purpose of providing a visual tool, which serves to support complexity reduction processes. Two great precedents are Armstrong's Axioms, which has been applied from its publication to the present for database normalization, the other is set theory, a fundamental pillar of the Structured Query Language; based on them, together with the second-order logic, which adds qualifiers for subsets or properties, this work has been prepared, with an explanatory metrology with a qualitative approach, in an axiomatic system. As a result, a support tool has been provided to analyze complex systems naturally, by breaking cycles and detecting patterns, without interfering with existing models; however, for large systems it can be difficult to address it in its entirety, so it is recommended to divide by subsystems. With this work a technique has been accomplished, repeatable by anyone, but with a strong theoretical foundation. This work has great utility for the normalization of relational databases and an enormous potential for application in the design of systems beyond computational systems, it is also useful for understanding dependencies by their axiomatic nature.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Este tema nace de la necesidad de herramientas para analizar y tomar decisiones en torno a sistemas complejos, donde apliquen las reglas para conjuntos linealmente dependientes, con el fin de proporcionar una herramienta visual, que sirva de apoyo a procesos de reducción de la complejidad. Dos grandes precedentes son los Axiomas de W. Armstrong, el cual se ha aplicado desde su publicación hasta la actualidad para la normalización de bases de datos, el otro es la teoría de conjuntos, pilar fundamental del Lenguaje de Consultas Estructurado; en base a ellos, junto con la lógica de segundo orden, la cual añade cualificadores para subconjuntos o propiedades se ha elaborado este trabajo, con una metrología explicativa con enfoque cualitativo, en un sistema axiomático. Como resultado se ha proporciona una herramienta de soporte para analizar sistemas complejos de forma natural, rompiendo ciclos y detectando patrones, sin interferir con los modelos existentes; sin embargo, para sistemas de gran tamaño puede ser difícil abordarlo en su totalidad, por lo que se recomienda dividir por subsistemas. Con este trabajo se ha consumado una técnica, repetible por cualquiera, pero con fuerte fundamento teórico. Este trabajo tiene gran utilidad para la normalización de bases de datos relacionales y un enorme potencial de aplicación en el diseño de sistemas más allá de los sistemas computacionales, también resulta útil para la comprensión de dependencias por su naturaleza axiomática.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Armstrong's Axioms]]></kwd>
<kwd lng="en"><![CDATA[normalization of relational databases]]></kwd>
<kwd lng="en"><![CDATA[complexity reduction]]></kwd>
<kwd lng="en"><![CDATA[break cycles and detect patterns.]]></kwd>
<kwd lng="es"><![CDATA[axiomas de Armstrong]]></kwd>
<kwd lng="es"><![CDATA[normalización de base de datos relacionales, reducción de la complejidad]]></kwd>
<kwd lng="es"><![CDATA[romper ciclos y romper patrones.]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Armstrong]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Nakamura]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Rudnicki]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Armstrong&#8217;s axioms]]></article-title>
<source><![CDATA[Journal of formalized Mathematics]]></source>
<year>2002</year>
<volume>14</volume>
<numero>1</numero>
<issue>1</issue>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Attallah]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simplifying Database Normalization within a Visual Interactive Simulation Model]]></article-title>
<source><![CDATA[International Journal Of Database Management Systems]]></source>
<year>2017</year>
<volume>9</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>57-69</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bondy]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
</person-group>
<collab>Murty</collab>
<source><![CDATA[Graph theory with applications]]></source>
<year>1976</year>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Frisendal]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Visual Normalization - Use the Power of the Dependencies]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Raj]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Dharanipragada]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[GraphSteal: Dynamic Re-Partitioning for Efficient Graph Processing in Heterogeneous Clusters]]></article-title>
<source><![CDATA[2017 IEEE 10Th International Conference On Cloud Computing (CLOUD)]]></source>
<year>2017</year>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ren]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Schneider]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ovsjanikov]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Wonka]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Joint Graph Layouts for Visualizing Collections of Segmented Meshes.]]></article-title>
<source><![CDATA[IEEE transactions on visualization and computer graphics]]></source>
<year>2017</year>
<volume>24</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>2546-58</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shi]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Zheng]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multi-Constrained Top-K Graph Pattern Matching in Contextual Social Graphs]]></article-title>
<source><![CDATA[2017 IEEE International Conference On Web Services (ICWS).]]></source>
<year>2017</year>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
