<!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>Modeling framework for designing and analyzing document-centric information systems based on HypergraphDB</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>ELTE Eotvos Lorand University</string-name>
          <email>bearaai@inf.elte.hu</email>
          <email>molnarba@inf.elte.hu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Budapest</institution>
          ,
          <country country="HU">Hungary</country>
        </aff>
      </contrib-group>
      <fpage>17</fpage>
      <lpage>22</lpage>
      <abstract>
        <p>Using Document-centric Information Systems (IS ) in an Enterprise is very common nowadays: the IS s serves as the basis for storage of data, elements of business processes and they provide a exible communication protocol between Web-services too (XML-like documents). Designing work- ows, object hierarchies and much more business-related entities can be done by various types of models (UML, BPMN, Petrinets). The models and their relationships can be represented mostly through the combination of the Zachman and the TOGAF framework [1, 2] in our case. To assist the designing, analyzing, validating and optimizing steps during model creation, we suggest a generic modeling approach based on the generalized hypergraphs. This helps avoid inconsistencies between the models without using any extra transformations or cross-checks [3]. In our proposed designer tool we use the HypergraphDB which is a graph database providing every advantages of the generic hypergraphs [4, 5]. To extend the object-de nition and rule formalism we use description logics beside the hypergraph formalism.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>veri cation of consistency the models that were placed in the architecture. The model re nement and extension
are carried out by systematic design principles that are under the supervision of constraints that are deduced
from the assumptions of consistency and integrity. The set of models ordered into architecture framework yields
support for operational function in the production time of an IS.</p>
      <p>In Section 2, we introduce these particular models through previous researches in literature, in Section 3 we
de ne some notion for a better understanding about hypergraphs, in Section 4 we explain the chosen
databasesystem for our model and Section 5 provides conclusions and possible future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Literature and Technical Review</title>
      <p>
        The Web-based and Web Information Systems are the typical examples that make extensive use of the various
document formats. The emphasis on Web technologies slowly diminished as the application of Web technology,
de nitely at user interfaces, became commonplace. A systematic design approach to construct web-based
applications is discussed in. The method explained in [
        <xref ref-type="bibr" rid="ref4">6</xref>
        ] makes use of semi-structured and interactive documents
represented by XML. Another paper presents an approach for a well-founded, concepts-based modeling process
for a Web site. For designing of Web Information Systems, Rossi presents a design procedure [
        <xref ref-type="bibr" rid="ref5">7</xref>
        ]. There are many
frameworks, which help to grasp the complexity of Information Systems, namely the Blokdijk's perception of
Information Systems, Zachman ontology and TOGAF, all of them were created for information systems [
        <xref ref-type="bibr" rid="ref1 ref2 ref6">1, 2, 8</xref>
        ].
      </p>
      <p>
        An Information System supports business processes (Business Process Modeling, BPM ) within an enterprise
and is tightly coupled to other IS usually. A fairly standard way to model business processes is either the
application of Business Process Modeling (BPM) methods, or using Petri-nets. The Information Systems can also
be perceived as a structure with underlying databases for structured, semi-structured (XML-based, eXtensible
Markup Language) as well as unstructured documents . The documents play important role at the interface, at
interaction level and at core activities of data processing. The integration level and the degree of reconciliation
between Business Processes and organization can be analyzed on the base of ontologies and semantic approaches
[
        <xref ref-type="bibr" rid="ref7">9</xref>
        ]; it provides an approach for validation and safeguarding the relationships between organization and processes
within the architecture.
      </p>
      <p>
        There were some previous papers and researches that tried to put the before-mentioned approaches into a
uni ed framework by essentially semi-formal way [
        <xref ref-type="bibr" rid="ref10 ref11 ref8 ref9">10, 11, 12, 13</xref>
        ].
      </p>
      <p>
        The Enterprise Architecture framework is provided by a mapping across Zachman ontology and TOGAF
framework [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. The Blokdijk's collection of Information System Models yields a structuring guideline [
        <xref ref-type="bibr" rid="ref6">8</xref>
        ].
      </p>
      <p>Since our proposed approach of the uni ed modeling is based on a generalized hypergraph theorem, it induces
a need for a storage with this capabilities. From the technological point of view, there are a lot of graph-based
database systems. The suggested HypergraphDB is an open-source project which is based on the knowledge
management formalism known as directed hypergraphs.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Mathematical Background</title>
      <p>
        Hypergraphs. There are several conceptual formalization that are mentioned in other papers [
        <xref ref-type="bibr" rid="ref11 ref8">10, 13</xref>
        ] which can
be described by a set of relationships from individual models (like UML-based class-diagram, work- ows, etc.).
Since these models are representing di erent facets of perception of IS, and they represent a complex system
through a set of complex, heterogeneous relationships. This set of relationships can be described by directed
hypergraphs; the directed hypergraph applies the same basic notions as the generalized hypergraphs with the
extension of direction. In this set we can separate the elements in two sub-sets:
hierarchical;
network-like relationships.
      </p>
      <p>
        The hypergraphs as mathematical structure seems to be suitable for representing the interrelationships among
the models, views, viewpoints, perspectives, and the overarching documents and business processes [
        <xref ref-type="bibr" rid="ref1 ref3">1, 5</xref>
        ].
      </p>
      <p>To gain insight into the hypergraphs we start with the basic de nitions in order to apply for depicting the
before-mentioned complex relationships.</p>
      <p>De nition 1. A hypergraph H is a pair of (V,E) of a nite set of V = fv1; v2; :::vng and a set E of nonempty
subsets of V. The elements of V are called vertices or nodes, the elements of E are called edges [4].</p>
      <p>De nition 2. Generalized or extended hypergraphs. The notion of hypergraph may be extended so that the
hyperedges can be represented { in certain cases { as vertices, i.e. a hyperedge e may consist of both vertices
and hyperedges as well. The hyperedges that are contained within the hyperedge e should be di erent from e
[4].</p>
      <p>Considering a document model, a proper document type hierarchy can be interpreted as a ordered sub-set of
the hyper-edges. In a document subpart hierarchy, a speci c subpart of document may be denoted by a vertex
within a particular hyper-edge that describes this document that contains the subpart, although that subpart as
a vertex may include a document type hierarchy that can be depicted by a hyperedge.</p>
      <p>De nition 3. A directed hypergraph is an ordered pair
where V is a nite set of vertices and !E is a set of hyperarcs with a nite index-set I. Every hyperarc !ei can
be interpreted as an ordered pair
!
H =</p>
      <p>V; !E = f !ei : i 2 I g ;
!ei =
e!i+ = (ei+; i); e!i = (i; ei ) ;
(1)
(2)
where ei+</p>
      <sec id="sec-3-1">
        <title>V is the set of vertices of e!i+ and ei</title>
      </sec>
      <sec id="sec-3-2">
        <title>V is the set of vertices e!i. The elements of e!i+ are called</title>
        <p>tail of !ei , while elements of e!i are called head [4].</p>
        <p>
          The potential implementations of hypergraphs in a hypergraph database allows for linking attributes to
vertices, even more to hyperedges. The target domain, namely documents and model of Information Systems
within organizations, contains complex n-ary relationships. The hypergraph provides the opportunity to represent
recursive construction, to describe logical relations, to store compound structures along with their values and to
follow variable lifetimes across various processes. [
          <xref ref-type="bibr" rid="ref12 ref13 ref3">5, 14, 15</xref>
          ]
As an illustration of the basic concepts of directed hypergraph, an example can be seen in Figure 1. that
makes sense of the representation for the domain by hypergraph. The essential characteristics is that vertices
contain composite constituents that are themselves may be graphs; generalized hyperedge may contain other
hyperedges but not itself and nodes. Detailed description about the Architecture Describing Hypergraph can be
found in [
          <xref ref-type="bibr" rid="ref14">16</xref>
          ].
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Using HypergraphDB</title>
      <p>
        The HypergraphDB is an extensible, portable, distributed open-source data-storage mechanism. It is a
graphdatabased designed speci cally for arti cal intelligence and semantic web projects, however because of it general
mindset, it is a perfect tool to represent heterogeneous relationships between di erent types too. The following
key facts are convincing enough to use the HypergraphDB as tool to store our model [
        <xref ref-type="bibr" rid="ref15">17</xref>
        ]:
The mathematical de nition of a hypergraph is an extension to the standard graph concept that allows an
edge to point to more than two nodes. HyperGraphDB extends this even further by allowing edges to point
to other edges as well and making every node or edge carry an arbitrary value as payload.
The basic unit of storage in HyperGraphDB is called an atom. Each atom is typed, has an arbitrary value
and can point to zero or more other atoms.
      </p>
      <p>Data types are managed by a general, extensible type system embedded itself as a hypergraph structure.
Types are themselves atoms as everybody else, but with a particular role.</p>
      <p>The storage scheme is platform independent and can thus be accessed by any programming language from
any platform. Low-level storage is currently based on BerkeleyDB from Sleepycat Software.
Size limitations are virtually non-existent. There is no software limit on the size of the graph that are
managed by a HyperGraphDB instance. Each individual value's size is limited by the underlying storage,
i.e. by BerkeleyDB's 2GB limit. However, the architecture allows bypassing BerkeleyDB for particular types
of atoms if one so desires.</p>
      <p>The implementation is solely Java based. It o ers an automatic mapping of idiomatic Java types to a
HyperGraphDB data schema which makes HyperGraphDB into an object-oriented database suitable for
regular business applications.</p>
      <p>
        Since there aren't any rst-party user interface for the HypergraphDB, the rs step to start using it was to
design and develop a middle-ware software which can create complete hypergraphs by creating the appropriate
nodes and edges based on various input. These inputs can be mostly XML-based descriptors - like OWL - but
can be also some custom, user de ned XML schema. In our case, we had a tool - written in C++ using the Qt
Framework [
        <xref ref-type="bibr" rid="ref16 ref17">18, 19</xref>
        ] - which is capable of designing Work ow Models based on Petri-nets. This tool generates a
custom XML le consisting of the places, trasitions, arcs, ow relations, presets and ofsets of transitions and all
other required data.
      </p>
      <p>To test the capabilities of the database, we created a hypergraph based on a business process. This process
was rst designed in the above-mentioned tool, then the XML output was passed to the middle-ware. After the
middle-ware nished the processing of the XML le it created the necessary nodes and the edges. Also utilizing
the HypergraphDB e ciency the nodes and hyperedges can be labeled with custom JAVA classes, therefore the
potential of the object-oriented class hierarchy is exploitable.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>
        There is a bunch of aspects to analyze the relations among di erent model-types. For every designing step
mentioned before [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ] there are several models to depict the fairly similar aspects of the given system. This
means that there has to be a transformation or mapping function which selects and creates the relevant
relationships between the elements of these models. This mappings can be stored as a sub-hypergraph also in the
HypergraphDB, so the information that are about an IS can be handled in uniform way. The proposed approach
for uniform representation of IS from an architectural viewpoint o ers the opportunity for united handling of
models and exploring the graph theoretical tool sets for further analysis.
      </p>
      <sec id="sec-5-1">
        <title>Group Architecture Framework, TOGAF R</title>
      </sec>
      <sec id="sec-5-2">
        <title>Version 9,</title>
        <p>[3] Suh, N.P.. 2001. Axiomatic Design: Advantages and Applications. Oxford University Press, New York
[4] Bretto, A. 2013. Hypergraph Theory: An Introduction. Springer.</p>
        <p>A</p>
        <p>Graph</p>
        <p>Database.</p>
        <p>[ONLINE]</p>
      </sec>
      <sec id="sec-5-3">
        <title>Available</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Zachman</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          ,
          <year>1987</year>
          .
          <article-title>A Framework for Information Systems Architecture</article-title>
          ,
          <source>IBM Systems Journal Volume</source>
          ,
          <volume>26</volume>
          , No.
          <issue>3</issue>
          , pp.
          <fpage>276</fpage>
          -
          <lpage>292</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Open</given-names>
            <surname>Group</surname>
          </string-name>
          ,
          <year>2010</year>
          . TOGAF: The Open http://www.opengroup.org/togaf/
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Gallo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Longo</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pallottino</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <year>1993</year>
          .
          <article-title>Directed hypergraphs and applications</article-title>
          .
          <source>Discrete applied mathematics</source>
          ,
          <volume>42</volume>
          (
          <issue>2</issue>
          ),
          <fpage>177</fpage>
          -
          <lpage>201</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>K</given-names>
            <surname>oppen</surname>
          </string-name>
          , E.,
          <string-name>
            <surname>Neumann</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <year>1999</year>
          . \
          <article-title>Active hypertext for distributed web applications"</article-title>
          , in: Proceedings of The Eighth IEEE International Workshops on Enabling Technologies:
          <article-title>Infrastructure for Collaborative Enterprises (WET-</article-title>
          <source>ICE'99)</source>
          , pp.
          <volume>297</volume>
          |
          <fpage>302</fpage>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Rossi</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwabe</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lyardet</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <year>1999</year>
          .\
          <article-title>Web application models are more than conceptual models"</article-title>
          , in: P. Chen et al. (Ed.),
          <source>Advances in Conceptual Modeling, LNCS</source>
          , vol.
          <volume>1727</volume>
          , pp.
          <volume>239</volume>
          |
          <issue>252</issue>
          , Springer-Verlag, Berlin
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Blokdijk</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blokdijk</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <year>1987</year>
          .
          <article-title>Planning and Design of Information Systems</article-title>
          , Academic Press, London
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Gabor</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , K}o,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Szabo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Ternai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Varga</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <year>2013</year>
          .
          <article-title>Compliance Check in Semantic Business Process Management, in: On the Move to Meaningful Internet Systems (OTM) 2013 Workshops</article-title>
          .
          <fpage>353</fpage>
          -
          <lpage>362</lpage>
          . Springer Berlin Heidelberg
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Molnar</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <year>2014</year>
          .
          <article-title>Applications of hypergraphs in informatics: a survey and opportunities for research</article-title>
          . Ann. Univ. Sci. Budapest. Sect. Comput.
          <volume>42</volume>
          ,
          <issue>261</issue>
          {
          <fpage>282</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Molnar</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tarcsi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <year>2011</year>
          .
          <article-title>Architecture and System Design Issues of Contemporary Web-based Information Systems</article-title>
          ,
          <source>in: Proceedings of the 5th International Conference on Software, Knowledge Information, Industrial Management and Applications (SKIMA</source>
          <year>2011</year>
          ), September 8-
          <issue>11</issue>
          ,
          <year>2011</year>
          , Benevento, Italy.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Molnar</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benczur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Facet of Modeling Web Information Systems from a Document-Centric View</article-title>
          , in:
          <source>International Journal of Web Portals (IJWP)</source>
          ,
          <volume>5</volume>
          (
          <issue>4</issue>
          ),
          <fpage>57</fpage>
          -
          <lpage>70</lpage>
          ,
          <year>2013</year>
          , IGI Global
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Molnar</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benczur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beleczki</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <year>2016</year>
          .
          <article-title>A Model for Analysis and Design of Information Systems based on a Document Centric Approach</article-title>
          ,
          <source>in: Intelligent Information and Database Systems (IIDS)</source>
          ,
          <fpage>290</fpage>
          -
          <lpage>299</lpage>
          , Springer-Verlag, Berlin
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Ausiello</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Franciosa</surname>
            ,
            <given-names>P. G.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Frigioni</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <year>2001</year>
          .
          <article-title>Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach</article-title>
          , in: Theoretical Computer Science pp.
          <fpage>312</fpage>
          -
          <lpage>328</lpage>
          , Springer Berlin Heidelberg
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Iordanov</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <year>2010</year>
          .
          <article-title>Hypergraphdb: a generalized graph database</article-title>
          , in: Web-Age Information Management pp.
          <fpage>25</fpage>
          -
          <lpage>36</lpage>
          , Springer Berlin Heidelberg
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Molnar</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Benczur</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beleczki</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <year>2016</year>
          . Formal Approach to Modelling of Modern Information Systems,
          <source>International Journal of Information Systems and Project Management</source>
          , (to be published)
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Kobrix</given-names>
            <surname>Software</surname>
          </string-name>
          .
          <year>2010</year>
          . HypergraphDB - http://hypergraphdb.org.
          <source>[Accessed 27 May</source>
          <year>2016</year>
          ].
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [18] The Qt Company.
          <year>2012</year>
          . Qt - Home. [ONLINE] Available at: https://www.qt.
          <source>io. [Accessed 27 May</source>
          <year>2016</year>
          ].
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Stroustrup</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <year>1995</year>
          . The C+
          <article-title>+ programming language</article-title>
          .
          <source>Pearson Education India</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>