KR100926336B1 - Method for mapping application based on relationship and computer-readable medium having thereon program performing function embodying the same - Google Patents

Abstract

The present invention includes the steps of: (a) receiving a field property of the primitive entity and the corresponding entity; (b) receiving a correspondence relationship between the primitive entity and the corresponding entity; It relates to a relationship-based application mapping method comprising the step of mapping the primary entity and the corresponding entity to the application.

According to the present invention, data modeling can be automatically mapped to a database application on the basis of the correspondence relationship and the constraint between the leading entity and the corresponding entity of the data modeling.

Data Modeling, Applications, Mapping, Constraints, ERDs, Databases, Matching, Allocation, Increase, Decrease

Description

METHODO FOR MAPPING APPLICATION BASED ON RELATIONSHIP AND COMPUTER-READABLE MEDIUM HAVING THEREON PROGRAM PERFORMING FUNCTION EMBODYING THE SAME}

The present invention relates to a relationship-based application mapping method and a computer-readable recording medium having recorded thereon a program for realizing the same. The present invention relates to a relationship-based application mapping method capable of automatically mapping a to a database application, and a computer-readable recording medium having recorded thereon a program for realizing the same.

In general, a system integration project is a process of designing a software structure by analyzing tasks required by a user, such as a company, performing actual programming based on the design results, and testing and deploying the programming results. Step by step is performed. Each of these processes is carried out using specialized methods.

Among them, the process of designing the software structure through business analysis goes through the following process.

First, it analyzes and describes the work of the user. Such technical work may be performed by data modeling that defines a data structure based on a task and process modeling that defines properties related to the data structure.

Based on the data modeling, data structures such as database tables can be created later. Data modeling can be implemented in various ways, but is generally performed through an entity relationship diagram (hereinafter referred to as "ERD").

ERD is a kind of data modeling, which means analyzing and mapping what information is needed to build a database system or computerize a specific task, and how the data is related.

Based on the process modeling, actual programming tasks, such as programming tasks for a user interface or business logic, may be performed, and the programming results may be matched with data structures to generate an application suitable for actual tasks.

However, this conventional method has the following disadvantages.

First, form data after creating data structure through data modeling, and then program data input / output between tables. Therefore, a large amount of work is required to generate a database application after data modeling is performed in actual system integration. Therefore, the system integration process takes a long time disadvantage.

In addition, since the database structure and mapping are performed after the actual programming, the form or user interface of the actual system integration application can be confirmed after the work is completed. For example, even if there is a disagreement in the system integration process between the user who is in charge of the work and the worker who is in charge of system integration, the user who is in charge of the real work will not be able to access the structure and application of the real application until after the worker has completed programming. You can check the reflected work. Therefore, there is a disadvantage in that programming must be performed again when a modification occurs between a user and an operator.

An object of the present invention is to provide a relationship-based application mapping method that can automatically map data modeling to a database application based on the correspondence and constraints between the leading entity and the corresponding entity of data modeling.

Another object of the present invention is to provide a computer readable recording medium having recorded thereon a program for realizing each step of the relationship based application mapping method.

In order to achieve the above technical problem, the present invention (a) receiving the field properties of the primary entity and the corresponding entity, (b) receiving a corresponding relationship between the primary entity and the corresponding entity, (c) ) Provides a relationship-based application mapping method comprising the step of mapping the leading entity and the corresponding entity to an application based on the corresponding relationship.

In the relationship-based application mapping method according to the present invention, step (a) may include receiving (a-1) the field attribute including a field constraint or a field expression.

In addition, in the relationship-based application mapping method according to the present invention, the step (b) includes (b-1) receiving a cardinality between the instance of the primary entity and the instance of the corresponding entity. can do.

In addition, in the relationship-based application mapping method according to the present invention, the cardinality is any one of 1: 1, 1: N, M: 1 or M: N correspondence between the instance of the primary entity and the instance of the corresponding entity. It can be one.

In addition, in the relationship-based application mapping method according to the present invention, when the cardinality is 1: 1 or 1: N, the corresponding relationship is a matching relationship, and the step (b) is (b-2) the primary entity And setting a matching function on a field of the field and associating it with a field of the corresponding entity.

In addition, in the relationship-based application mapping method according to the present invention, the step (b), (b-3) to create a query field for querying the matching relationship to the master entity, the field of the master entity and the corresponding Providing an interface for identifying the matching relationship between the fields of the entity.

In addition, in the relationship-based application mapping method according to the present invention, when the cardinality is M: 1 or M: N, the corresponding relationship is an assignment relationship, an increase relationship, or a decrease relationship, and the step (b) may include (b) -4) assigning, incrementing or decrementing a function of a field of the primary entity and associating it with a field of the corresponding entity.

In addition, in the relationship-based application mapping method according to the present invention, the step (b), (b-5) by generating an inquiry field for querying the allocation relationship, the increase relationship or the decrease relationship to the primary entity And providing an interface for identifying the allocation relationship, the increase relationship, or the decrease relationship between the field of the primary entity and the field of the corresponding entity.

In addition, in the relationship-based application mapping method according to the present invention, the step (b) is (b-6) the step of limiting the correspondence between the instance of the primary entity and the instance of the corresponding entity according to a predetermined constraint condition; It may include.

In addition, in the relationship-based application mapping method according to the present invention, the constraint may be specified using Structured Query Language (SQL).

In addition, in the relationship-based application mapping method according to the present invention, the step (c) may include (c-1) generating an execution form of the primary entity and establishing a relationship with an instance of the corresponding entity upon execution. have.

In addition, in the relationship-based application mapping method according to the present invention, before the step (a), (d) may further comprise the step of receiving data modeling including the primary entity and the corresponding entity.

In addition, in the relationship-based application mapping method according to the present invention, the step (d) may include (d-1) receiving the data modeling in the form of an entity relation diagram (ERD).

In addition, in the relationship-based application mapping method according to the present invention, the method may further include (e) extracting data modeling between the primitive entity and the corresponding entity.

In addition, in the relationship-based application mapping method according to the present invention, the step (e) may include (e-1) extracting the data modeling in the form of an entity relation diagram (ERD).

The present invention also provides a computer-readable recording medium having recorded thereon a program for realizing each step of the relationship-based application mapping method described above.

According to the present invention, data modeling can be automatically mapped to a database application on the basis of the correspondence and constraints between the leading entity and the corresponding entity of the data modeling.

Hereinafter, with reference to the accompanying drawings, an embodiment of the relationship-based application mapping method of the present invention and a computer-readable recording medium having recorded thereon a program for realizing the same.

1 is an exemplary flowchart of a relationship based application mapping method in accordance with the present invention.

Referring to FIG. 1, first, a field property of a leading object and a corresponding object is received (S110).

Lead objects and counterparts can be entered through data modeling.

To this end, although not shown, the relationship-based application mapping method according to the present invention may further include receiving a pre-configured data modeling including a lead entity and a corresponding entity.

In this case, the data modeling may be preferably implemented in the form of an ERD.

If the lead object and the corresponding object are set through data modeling or through direct input, in step S110, field attributes of the lead object and the corresponding object are received.

That is, step S110 is to set the fields of the primary entity and the corresponding entity, for example, to receive a field attribute including the name and form of the field.

In this case, constraint conditions or expressions may be additionally included depending on the field type.

For example, if the field type is an integer, a real number, a text, a date time stamp, a boolean, or the like, there is no need to input a separate constraint or expression. However, if the field type is query, calculation, or domain query, the field constraint or field expression corresponding to the field type must be input together.

Therefore, if the field type is a query or a domain query, the field constraint for performing the corresponding query or domain query is received. Such field constraints may be specified using, for example, Structured Query Language (SQL). That is, a value of a field corresponding to a query can be designated using SQL or a list of values of a field corresponding to a domain query can be specified using SQL. In addition, the value of the field corresponding to the calculation can be specified as an expression.

Thereafter, a corresponding relationship between the leading entity and the corresponding entity is received (S130).

This correspondence may be performed by receiving a cardinality between an instance of the primary entity and an instance of the corresponding entity.

The cardinality indicates how the correspondence between the instance of the primary entity and the instance of the corresponding entity is. The cardinality may be any one of 1: 1, 1: N, M: 1, or M: N.

That is, 1: 1 when one instance of the corresponding object corresponds to one instance of the lead object, 1: N when N instances of the corresponding object correspond to one instance of the led object, and N corresponds to M instances of the lead object. If one corresponds to M: 1, the cardinality of M: N is defined if N instances of the corresponding entity correspond to M instances of the primary entity.

Meanwhile, the correspondence between the instance of the leading entity and the instance of the corresponding entity can be set according to such cardinality as well as a predefined constraint.

That is, when the instance of the leading entity and the instance of the correspondent entity correspond to each other, all instances of the correspondent entity may be configured to correspond only when the specific constraint is satisfied, rather than the corresponding entity.

In this case, the constraint may be implemented using, for example, SQL. Using constraints, only instances of the matching entity that are appropriate for the match are displayed so that the mapping can be performed with the leading entity.

Meanwhile, referring to the cardinality again, the association between the principal entity and the corresponding entity is performed according to cardinalities such as 1: 1, 1: N, M: 1, or M: N.

For example, if the cardinality is 1: 1 or 1: N, the correspondence between the lead entity and the counterpart is a match. Therefore, in operation S130, a matching function may be set in the field of the primary entity and associated with the field of the corresponding entity.

In other words, an association between fields is performed by copying a field value of a corresponding entity to a field of a primary entity.

In this case, a lookup field can be created in the lead entity to look up the matching relationship. This lookup field provides an interface for checking the matching relationship, i.

On the other hand, when the cardinality is M: 1 or M: N, the correspondence relationship is an assign relationship, an increase relationship, or a decrease relationship. Therefore, in operation S130, an allocation, increment, or decrement function may be set to a field of the primary entity and associated with the field of the corresponding entity.

In this case, an inquiry field may be created in the lead entity to search for an allocation relationship, an increase relationship, or a decrease relationship. This lookup field provides an interface for identifying the allocation, increment or decrement relationship between the field of the primary entity and the field of the corresponding entity.

Subsequently, based on the correspondence relationship between the led object and the corresponding object input in step S130, the led object and the corresponding object are mapped to the application (S150).

This mapping can be done by creating an execution form for the dominant object. In other words, by creating an execution form, it is possible to use the database to match, allocate, increase, or decrease according to the correspondence between the instance of the primary object and the instance of the corresponding object. A plurality of such execution forms may be generated, and each execution form may operate in conjunction.

Therefore, unlike the conventional case, the database application does not need to be configured separately from the data modeling, and the database application can be automatically generated by setting the field attributes and the corresponding relations of the leading object and the corresponding object.

Although not shown, the relationship-based application mapping method according to the present invention may further include extracting data modeling between the lead entity and the corresponding entity. That is, data modeling can be extracted in the form of ERD.

Extraction of such data modeling is configured to include correspondences and the like. Correspondence relationship such as matching, allocation, increase or decrease is not defined in the conventional data modeling such as ERD, but in the present invention, it can be configured to extract data modeling such as ERD including such correspondence.

2A-2E illustrate an example implementation of a relationship based application mapping method according to the present invention. As mentioned above, mapping of execution forms refers to mapping of database applications.

2A exemplarily illustrates data modeling and exemplarily shows, as an arrow, accessing a customer entity that is a corresponding entity from an ordering entity that is the lead entity. In addition, an order object can be associated with an order history object and subsequently converted into a single execution form.

FIG. 2B is a diagram exemplarily illustrating input of field attributes and corresponding relationships of a lead entity and a corresponding entity. FIG.

As shown, the customer entity has field properties such as name, address, and phone number. Correspondence relationships are also indicated by arrows, in which case a match relationship is formed between the customer entity and the order entity. Because the order object has field properties of customer, address, and match, the order object contains the customer of the customer object. Name field and customer. The relationship between the customer field and the address field of the order object is set so that the address field is copied and displayed. This setting is performed through a user input or the like corresponding to the matching relationship.

On the other hand, the name field and the address field of the customer entity may have character attributes, and the telephone number may have character or integer attributes. These field attributes are not shown but may be entered in the configuration of the customer entity.

2B, it can be seen that the instance of the order object can select any one of the instances of the customer object, and that the name and address values of the instance of the customer object are copied to the customer and address values of the instance of the current order object. have.

In addition, in FIG. 2B, "SQL filtering" represents the above-described constraints, and indicates limiting an instance to correspond to an instance of an order entity among a plurality of instances of the customer entity.

FIG. 2C illustrates an exemplary execution form in which a customer entity is converted, FIG. 2D illustrates an exemplary execution form in which an order object and an order history object are converted, and FIG. 2E illustrates an exemplary execution displayed when the order object and the customer entity are linked. Represents a form.

Referring to FIG. 2C, an exemplary execution form of a customer entity is configured to receive a customer's name, address, and phone number entry.

Referring to FIG. 2D, an exemplary execution form of an order object and an order history object is configured in a form in which a lookup interface in the form of a button is set so that the order object can access the customer object and copy the property of the customer object.

FIG. 2E illustrates an example execution form in which an instance of a customer entity is displayed by the lookup interface in the execution form of FIG. 2D.

That is, as shown, multiple instances of the customer object are displayed, and the instance of the order object is configured to select an instance of the customer object to be displayed. For example, when selecting an instance corresponding to "Hong Gil Dong", information about "Hong Gil Dong" may be assigned to an instance of the order entity and displayed on the execution form of FIG. 2D.

In addition, the order history object may be displayed in response to the Hong Gil-dong.

In this way a correspondence is established between an instance of a particular order entity and an instance of a particular customer entity. 2A to 2E, a correspondence relationship, that is, a match relationship, is selected to select one field of an instance of the corresponding entity in the instance of the primary entity.

3A-3C illustrate another exemplary implementation of a relationship based application mapping method according to the present invention.

3A exemplarily illustrates data modeling, exemplarily as an arrow, accessing a delivery entity as a corresponding entity from a collection entity as the leading entity.

In FIG. 3A, the lead entity and the correspondence entity have a correspondence relationship that is an assign relationship. That is, an assignment relationship can be established when an M: 1 or M: N relationship is established between the lead entity and the counterpart. For example, suppose you make a delivery and collect a collection. If there are multiple deliveries for a specific customer, you must assign the collection to a specific delivery after receiving the collection so that you can see what the collection is for.

3B-3C show exemplary execution forms in which each of the delivery entity and the collection entity have been converted.

Referring to FIG. 3C, an inquiry form in which a collection object is executed is set in the form of a button. When the button of the execution form of the collection object is pressed, the execution form of FIG. 3B is displayed in which instances of the delivery object which is the corresponding object are listed. Thus, one of the list of instances of the delivery entity is selected and a portion or all of the amount of money is assigned to form a correspondence relationship. For example, suppose that 10 million won were collected and 10 million won were allocated to Hong Hong-dong and 6 million won to Yi Sun-shin. In this case, referring to Figure 3b, the "hong gil dong" delivery case is the remaining 5 million won is not allocated 600 million won. However, the "Yi-Shin" deliveries can be allocated with 10 million won remaining. As such, the "Remaining" field of the delivery entity represents the amount that has been delivered but not received. The "Remaining" field of the collection entity represents the amount that has been collected but not yet assigned to the delivery. Thus, the "rest" of the collection entity instance for the "Yi" delivery entity instance would be 6 million won and the "assignment" would be 4 million won. When a collection is assigned to "Yi", the instance of the current collection entity is linked to the "Yi" delivery. In addition, each allocation status can be inquired through the inquiry interface.

4A-4C illustrate another exemplary implementation of a relationship based application mapping method according to the present invention.

4A exemplarily illustrates data modeling, and exemplarily shows as an arrow the approaching of the ordering entity, which is the corresponding entity, from the work instruction entity, which is the dominant entity. In addition, the work order object can be associated with the work order history object and later converted into a single execution form.

In FIG. 4A, the lead entity and the correspondence entity have a correspondence relationship that is an increase (+) relationship. That is, an incremental (+) relationship may be established when an M: 1 or M: N relationship is established between the leading entity and the corresponding entity.

4B-4C illustrate exemplary execution forms in which each of the order entity and work order entity has been converted.

Pressing the subform of FIG. 4C, that is, the inquiry interface in the form of a button of work instruction details, instances of the order entity are displayed in the form of FIG. 4B. In this case, if you select the "Master's Lift" product ordered by "Hong Gil Dong", the quota is inquired, and since the order quantity of the unproduced "Master's Lift" is 500 pieces, if you want to produce 300 of them, in the work order history subform 300 is increased in the "Production" field of the "Masters List". In this case, for the "Masters lift" of the execution form of the order object, the "rest" field is reduced from 500 to 200. Thus, the value is propagated from order quantity to output. In this manner, a relationship in which the corresponding item decreases with the increase of a specific item is called an "increase (+) relationship". A "decrease (-) relationship" means a relationship in which items corresponding thereto increase with the decrease of a specific item.

In the conventional case, in data modeling such as ERD, only a matching relationship can be expressed, and thus, an additional application programming task is required. However, according to the present invention, in addition to the matching relationship, a corresponding relationship such as allocation, increase, or decrease can be set, and thus data modeling can be automatically mapped to the application based on the matching relationship.

On the other hand, not only this correspondence but also the constraint condition can be set in advance and the correspondence between the lead entity and the correspondent entity can be set.

5A through 5C are diagrams illustrating exemplary implementations of setting constraints in a relationship based application mapping method according to the present invention.

Referring to FIG. 5A, a 1: 1 correspondence, that is, a matching relationship, is formed between the ordering entity, which is the main entity, and the quotation entity, which is the corresponding entity. In this case, the arrow indicates a matching relationship, indicating that the order entity is driving the relationship with the quotation entity.

If the corresponding relationship is mapped to the execution form, it may be represented by FIGS. 5B to 5C. When the button interface of FIG. 5C is pressed, a list of estimate entities is displayed in the form of FIG. 5B. In this case, if you select one of the instances of the quotation object, the instance of the selected quotation object and the instance of the order object correspond. If a copy of the article and quantity fields is instructed in the instance of the order object at this time, the values of the "goods" and "quantities" fields of the instance of the selected quoted object are transferred to the "goods" and "quantities" fields of FIG. 5C. Copied.

In this case, however, not all instances of the quotation object are selectable in the execution form of the order object of FIG. 5C. That is, since the order and the quotation have a 1: 1 relationship, the instance of the quotation object that has already established a corresponding relationship with the instance of the order entity should not be displayed through the button interface in the execution form of FIG. 5C.

Therefore, this restriction can be set in advance as a constraint.

Such constraints can be implemented, for example, using SQL filters. That is, in the example of Figs. 5A to 5C, the set of instances of the quote object accessible from the execution form of the order object may be defined in SQL.

The constraint using the SQL may be set as in Equation 1 below.

Quote_set = select quote.id, quote.date, quote.goods, quote.quantity from quote leftouterjoin order on quote.id = order.quote_id where order.id is null

Equation 1 represents a set of instances of a corresponding entity that is not related to the order entity instance, that is, the quotation entity.

These constraints are registered in the quotation object, which is the corresponding entity. Registration of constraints may be performed, for example, by applying an input interface shown as " SQL Filtering " in FIG. 2B to the estimate entity in the example of FIGS. 5A-5C.

If such a constraint is registered using SQL, for example, the select statement of the SQL is parsed to display ID, date, product, and quantity for the fields after the select, that is, the quotation. In addition, the instances shown in FIG. 5B are defined by SQL results. Correspondingly, the fields of the order entity may be defined with reference to the fields of the quote entity. In the example of FIGS. 5A to 5C, only a copy function is defined because of a 1: 1 correspondence. However, a copy function may be defined in a 1: N correspondence, and an assign, increase (+), or decrease (-) function may be defined in an M: 1 or M: N correspondence.

As in the example of FIGS. 5A to 5C, the lead entity may define a lookup field, that is, a field whose value is defined in SQL to indicate how the lead entity has a relationship with the corresponding entity. In the example of FIGS. 5A to 5C, the correspondence relationship is a match, and therefore, the relationship tracking in the lead entity may be set as in Equation 2 below.

Match = select count (*) from quote join order on quote.id = order.quote_id where order.id = this groupby order.id

Equation 2 shows the number of instances of the corresponding entity associated with the instance of the primary entity.

6 is a diagram illustrating another exemplary implementation of setting constraints in a relationship based application mapping method according to the present invention.

As shown in Fig. 6, the lead entity is the return entity and the corresponding entity is the rental entity.

In this case, the same constraint condition may be set to the rental object as the corresponding entity as shown in Equation 3 below.

Rental_Set = select Rental.ID, Rental.Date , Rental.Title from RentalleftOuterJoin Return where Return.ID isNull and Rental.Customer Name = this.Name

Equation 3 represents a set of rental instances that are not returned and the lender is the returner.

In this case, a lookup field indicating whether the return object, which is the main object, is related to an instance of the rental object, may be set as in Equation 4 below. Equation 4 shows the number of instances of the rental entity associated with the return entity instance.

Match = select count (*) from rental join return on rental.ID = return.rent_ID where return.ID = this groupBy return.ID

In Equation 4, this means a unique number of an instance of the return object open in the execution form of the leading object.

By setting such constraints, the instance list of the rental object displayed in the execution form of the return object, which is the main object, may not be returned at all, but may be composed of only instances of the same rental object with the returner and the borrower.

7 is a diagram illustrating another exemplary implementation of setting constraints in a relationship based application mapping method according to the present invention.

7 illustrates a case where an M: N relationship is established between a collection entity as a lead entity and a delivery entity as a corresponding entity, and an assignment attribute may be given in this many-to-many correspondence relationship.

In FIG. 7, the restriction condition of the delivery entity may be set as in Equation 5 below.

Delivery_Set = select Delivery.goods, delivery.quantity, delivery.amount-sum (assignment) as remainder from delivery leftOuterJoin collection on delivery.ID = delivery_receipt.delivery_ID groupBy delivery.ID, delivery.goods, delivery. Quantity having rest> 0

Equation 5 expresses the sum of money allocated to an instance of a delivery entity as sum (allocation) and excludes it from the delivery amount. Constraints means deliveries with a remainder of zero or more.

The SQL constraint in Equation 5 states that the instances of the delivery object shown in the execution form of the collection object have fields such as goods, quantity, remainder, quantity, sum, and so on. Is displayed. sum is the field to be added.

It is also necessary to track how much money is allocated and remaining for the collection entity, the lead entity. This tracking may be set as the following Equation 6 as the "rest" lookup field in the execution form of the collection object.

Rest = select collection.amount-sum (assignment) from collection leftOuterJoin delivery_collection on collection.ID = delivery_collection.collection_ID where collection.ID = this groupBy collection.ID, collection.amount

In this way, the "rest" field is added to the collection entity, the lead entity, to track the many-to-many relationship.

8 is a diagram illustrating another exemplary implementation of setting constraints in a relationship based application mapping method according to the present invention.

8 illustrates a generic case where constraints are defined for three or more individuals.

As shown, the work completion object is the lead object for the work order object, and the work order object becomes the corresponding entity. In addition, the work instruction object is the lead entity for the production machine entity, and the production machine entity becomes the corresponding entity.

In the example of FIG. 8, the allocation field on the production machine entity side is calculated only as the currently allocated job minus the completed job from the cumulative amount. This is because the value that the production machine entity is interested in is not the cumulative amount of work assigned to the machine up to date, but the amount of work currently allocated, so the completed work must be removed from the current machine assignment.

Therefore, the allocated cumulative workload of the production machine may be defined as in Equation 7 below.

Setview X = select Production Machine.ID As ID, sum (A) As Cumulative Workload from Production Machine leftOuterJoin Production Machine_Work Order on Production Machine.ID = Production Machine_Work Order.Production Machine_ID groupBy Production Machine.ID

Afterwards, the completed portion of the workload allocated to the production machine can be expressed as in Equation 8.

setview Y = select Production Machine.ID As ID, sum (Assignment B) As Completed amount from ((Production LeftOuterJoin Production_Work Order on Production Machine.ID = Production Machine_Work Order.Production Machine_ID) leftOuterJoin Work Order on production machine_work order.work order_ID = work order_ID) letouterjoin work order_work completed on work order_work completed.work order_ID = work order_ID groupBy production machine.ID

Meanwhile, in the execution form of the production instruction object, an additional field indicating an instance list of the corresponding production machine object and the current amount and an existing field of the production machine may be expressed as in Equation 9 below.

Production_Set = select production machine.ID as ID, machine name, capa, capa-(indicator on production machine.ID = Y.ID where rest> 0

After setting these constraints, a "rest" lookup field can be added to track the relationship state in the work order object, which is the lead object, and the "rest" lookup field can be expressed as shown in Equation 10 below. .

Remainder = select Work Order.Quantity-sum (assignment A) as Remainder from Work Order leftOuterJoin Machine_Work Order on Work Order.ID = Production Machine_Work Order.Work Order_ID where Work Order.ID = this groupBy Work Order ID, work order and quantity

As described above, according to the present invention, data modeling can be directly mapped to an application by inputting corresponding relationships, field attributes, etc. of the lead entity and the corresponding entity, and setting respective constraints.

The present invention also provides a computer-readable recording medium having recorded thereon a program for realizing each step of the above-described relationship-based application mapping method according to the present invention.

A computer readable recording medium refers to any kind of recording device that stores data, that is, data in code or program form, so that it can be read by a computer system. Such computer-readable recording media include, for example, memories such as ROM and RAM, storage media such as CD-ROM and DVD-ROM, magnetic storage media such as magnetic tape and floppy disk, optical data storage devices, and the like. It also includes a case where it is implemented in the form of transmission via. Such computer readable recording media can also be distributed over network coupled computer systems so that the computer readable data is stored and executed in a distributed fashion.

However, a detailed description of such a computer-readable recording medium will be omitted since it overlaps with the relationship-based application mapping method according to the present invention described with reference to FIGS. 1 to 8.

Although the configuration of the present invention has been described in detail, these are merely illustrative of the present invention, and various modifications may be made by those skilled in the art without departing from the essential characteristics of the present invention. This will be possible.

Therefore, the embodiments disclosed herein are not intended to limit the present invention but to describe the present invention, and the spirit and scope of the present invention are not limited by these embodiments. It is intended that the scope of the invention be interpreted by the following claims, and that all descriptions within the scope equivalent thereto will be construed as being included in the scope of the present invention.

As described above, according to the present invention, the data modeling can be automatically mapped to the database application based on the correspondence relationship and the constraint between the leading entity and the corresponding entity of the data modeling. Therefore, it is possible to minimize the time required for conventional data modeling and creation of a database application equivalent thereto.

1 is an exemplary flow diagram of a relationship based application mapping method in accordance with the present invention.

2A-2E illustrate an exemplary implementation of a relationship based application mapping method in accordance with the present invention.

3A-3C illustrate another exemplary implementation of a relationship based application mapping method in accordance with the present invention.

4A-4C illustrate another exemplary implementation of a relationship based application mapping method in accordance with the present invention.

5A-5C illustrate exemplary implementations of setting constraints in a relationship based application mapping method in accordance with the present invention.

6 is a diagram illustrating another exemplary implementation of setting constraints in a relationship based application mapping method according to the present invention.

7 illustrates another exemplary implementation of setting constraints in a relationship based application mapping method in accordance with the present invention.

8 illustrates another exemplary implementation of setting constraints in a relationship based application mapping method according to the present invention.

Claims (16)

(a) receiving field properties of the lead entity and the corresponding entity; (b) receiving a corresponding relationship between the primary entity and the corresponding entity; (c) mapping the primary entity and the corresponding entity to an application based on the corresponding relationship; Relationship based application mapping method comprising a. According to claim 1, wherein step (a) is, (a-1) receiving the field attribute including a field constraint or a field expression Relationship based application mapping method comprising a. The method of claim 1, wherein step (b) (b-1) receiving a cardinality between the instance of the primary entity and the instance of the corresponding entity; Relationship based application mapping method comprising a. The method of claim 3, And the cardinality is any one of a 1: 1, 1: N, M: 1, or M: N correspondence between the instance of the primitive entity and the instance of the corresponding entity. The method of claim 4, wherein When the cardinality is 1: 1 or 1: N, the corresponding relationship is a matching relationship. In step (b), (b-2) setting a matching function on a field of the primary entity and associating it with a field of the corresponding entity. Relationship based application mapping method comprising a. The method of claim 5, wherein step (b) (b-3) providing an interface for identifying the matching relationship between the field of the leading entity and the field of the corresponding entity by generating an inquiry field for querying the matching relationship in the leading entity; Relationship based application mapping method comprising a. The method of claim 4, wherein If the cardinality is M: 1 or M: N, the correspondence relationship is an assignment relationship, an increase relationship, or a decrease relationship, In step (b), (b-4) assigning, incrementing or corresponding a function to a field of the primary entity and associating it with a field of the corresponding entity. Relationship based application mapping method comprising a. The method of claim 7, wherein step (b), (b-5) generating an inquiry field capable of inquiring the allocation relationship, the increment relationship, or the decrease relationship to the primary entity to generate the inquiry relationship between the field of the primary entity and the field of the corresponding entity; Or providing an interface for identifying the reduction relationship Relationship based application mapping method comprising a. The method of claim 3, wherein step (b) comprises: (b-6) limiting the correspondence between the instance of the primary entity and the instance of the corresponding entity according to a predefined constraint; Relationship based application mapping method comprising a. The method of claim 9, And the constraints are specified using Structured Query Language (SQL). The method of claim 1, wherein step (c) comprises: (c-1) generating an execution form of the master object and associating it with an instance of the corresponding entity when executed; Relationship based application mapping method comprising a. The method of claim 1, wherein before step (a), (d) receiving data modeling including the primitive entity and the corresponding entity; Relationship-based application mapping method further comprising. The method of claim 12, Step (d) is, (d-1) receiving the data modeling in the form of an entity relation diagram (ERD) Relationship based application mapping method comprising a. The method of claim 1, (e) extracting data modeling between the primitive entity and the corresponding entity; Relationship-based application mapping method further comprising. The method of claim 14, Step (e), (e-1) extracting the data modeling in the form of an entity relation diagram (ERD) Relationship based application mapping method comprising a. A computer-readable recording medium having recorded thereon a program for realizing each step of the relationship based application mapping method according to any one of claims 1 to 15.

Images