Figure 1 - uploaded by J. Iijima
Content may be subject to copyright.
Source publication
A large set of partial data models is used in designing a large information system. These partial data models provide several complementary views on the system to be developed. This however leads to a need for compositional models that are able to produce a single integrated model. These data models are often described by a class diagram of Unified...
Contexts in source publication
Context 1
... example, one of the typical applications in information service systems is trans- action processing. Figure 1 is an example of data flow diagram for transaction process- ing. A transaction processing application gathers and integrates business transaction data coming from customers into a business information base. ...
Context 2
... tions and compositions are a particular kind of binary associations that multiplicity of one end is (0,1) or (1,1). Figure 10 is an example of an association PO. ...
Context 3
... assume that a class diagram (C, A) satisfies following condition 1. ClassDiagram denotes the set of all class diagrams. Figure 11 is an example of a class diagram. ...
Context 4
... denotes the set of all objects. Figure 12 is an example of an object. Lists denotes the set of all links. ...
Context 6
... denotes the set of all complex data as main part of domain of class diagram semantics. Figure 14 is an example of complex data. ...
Context 7
... c [Class] denotes all predicates for objects mapped from all classes Class. Figure 15 is an example of a predicate for a class Buyer. ...
Context 8
... 17. Example of a predicate for multiplicity of an association PO Figure 16 and Fig. 17 are examples of predicates for an association. ...
Context 9
... 17. Example of a predicate for multiplicity of an association PO Figure 16 and Fig. 17 are examples of predicates for an ...
Context 10
... define an interpretation mapping of class diagram as getting together interpreta- tion mappings mapped from classes and associations. Figure 18. Example of a predicate for a class diagram (C, A) ∈ ClassDiagram, ...
Context 11
... D [ClassDiagram] denotes the set of all predicates mapped from class diagrams as ((C, A)) mapped from a class diagram as ( Figure 18 is an example of a predicate for a class diagram. ...
Similar publications
There are several diagram methods for data modeling like a class diagram. It is very hard to describe a big data model of a large enterprise system into one diagram. A large set of partial data models are used during designing an information system for a large enterprise. The skill of modelers makes fluctuation and discrepancy among data models. It...
Citations
... Model aggregation. Further relevant fields of research for identifying commonalities in models include model differentiation techniques and schema matching 7 of database structures [55,56]. According to the classification by Rahm [57], a 170 schema-only and constraint-based approach on element level is suitable for the inference of a data model from multiple input models. ...
Mobile app development is an activity predominantly performed by software developers. Domain experts and future users are merely considered in early development phases as source of requirements or consulted for evaluating the resulting product. In the domain of business apps, many cross-platform programming frameworks exist but approaches also targeted at non-technical users are rare. Existing graphical notations for describing apps either lack the simplicity to be understandable by domain experts or are not expressive enough to support automated processing. The MAML framework is proposed as model-driven approach for describing mobile apps in a platform-agnostic fashion not only for software developers but also for process modelers and domain experts. Data, views, business logic, and user interactions are jointly modeled from a process perspective using a graphical domain-specific language. To aggregate multiple use cases and provide advanced modeling support, an inference mechanism is utilized to deduce a global data model. Through model transformations, native apps are then automatically generated for multiple platforms without manual programming. Our approach is compared to the IFML notation in an observational study, with promising results regarding readability and usability.
... Section 3.1 has appeared in[26,27,29,25,28] ...
... Section 3.2 has appeared in[26,25,28] ...
... Chapter 5 has appeared in[25] ...
In recent years, the information systems of large enterprises have grown in size. Therefore , it is important to develop a data model for processing a large amount of complex information; it is also important to analyze several requirements for a large information system that is capable of handling the large amount of complex information. Designers develop many partial data models instead of a single data model of a large information system in a manner similar to functional decomposition.
However, some questions arise in the minds of experienced designers while designing partial data models in some situations. To answer these questions and to help designers to understand the need to do so, it is important to develop some theories that provide the tracing steps of sub-questions; these steps explain why the questions are answered. Some theories for data models are described algebraically because the algebra for data models consists of a domain comprising data models and operations among them. The purpose of this study is to develop the algebras of data models as theories of data modeling for answering these questions.
This thesis presents a study on the desirable algebra of class diagrams algebra for understanding the relationship between data models. Further, this thesis contributes toward proving three desirable algebras for class diagrams as Boolean initially and using these algebraic equations to answer several questions arising in the minds of designers. The algebra for the abstract notation of class diagrams helps to describe right class diagrams such as well-formed class diagrams, preventing the syntactic inconsistency in composing and decomposing of class diagrams. The algebra for predicates mapped from class diagrams, such as well-formed predicates mapped from well-formed class diagrams, as intentional semantics of the class diagrams helps to compose and decompose the right data models. The algebra for instances satisfying class diagrams as extensional semantics of class diagrams helps to efficiently implement a data model without additional codes for exchanging data between compositional data models.
