KR100574886B1 - Method of arranging standard record for edi - Google Patents

Abstract

1. TECHNICAL FIELD OF THE INVENTION

The present invention relates to a method for arranging standard data for converting electronic documents and a computer-readable recording medium having recorded thereon a program for realizing the method.

2. The technical problem to be solved by the invention

An object of the present invention is to provide a method of distributing standard data for distributing EDI standard data according to a hashing algorithm, and a computer-readable recording medium recording a program for realizing the method.

3. Summary of Solution to Invention

The present invention includes a first step of determining an insertion record area according to a hashing result value for a primary key with respect to standard data for electronic document conversion, and checking whether there is already stored data in the record area; A second step of inserting the standard data into the overflow area and having a link from the data in the record area if there is stored data as a result of the checking in the first step; And a third step of inserting the standard data into the record area if there is no stored data as a result of the checking of the first step.

4. Important uses of the invention

The present invention is used for electronic document conversion and the like.

Electronic Document Conversion, EDI, Key Value, Hashing, Standard Data, Data Placement

Description

Standard data placement method for electronic document conversion {METHOD OF ARRANGING STANDARD RECORD FOR EDI}             

1 is an exemplary configuration diagram of a general computer.

2 is an exemplary view illustrating a loop structure of a general electronic document.

3 is an exemplary view of a general electronic document.

4 is an exemplary view of a table record structure used in the present invention.

5 is an illustrative example of hashing function calculation used in the present invention.

6 is a diagram illustrating an embodiment of a table structure used in a method of arranging standard data for converting an electronic document according to the present invention.

7 is a flow diagram of one embodiment of a process for accessing a table in accordance with the present invention.

* Explanation of symbols for the main parts of the drawings

101: central processing unit 102: controller

103: arithmetic unit 104: main memory

105: auxiliary memory device 106: input device

107: output device

The present invention relates to a method of arranging standard data for electronic document conversion and a computer-readable recording medium recording a program for realizing the method. In particular, an existing database for document conversion using a hashing table (DB: DataBase) The present invention relates to a method of arranging a standard data for converting an electronic document and to a computer-readable recording medium recording a program for realizing the method.

1 is an exemplary configuration diagram of a general computer.

Standard data placement for electronic document conversion is performed on a computer, which includes a central processing unit 101, a control unit 102, a computing unit 103, a main storage unit 104, an auxiliary storage unit 105, and an input. Device 106 and output device 107.

Looking at the operation, since the arithmetic unit 103 and the control unit 102 becomes the center of computer processing, these are collectively referred to as the central processing unit 101, and the accompanying input device 106, auxiliary storage device 105, and output The device 107 and the like are called peripheral devices. The main memory device is a high speed memory device that enables data or information movement between the central processing unit 101 and a peripheral device.

The central processing unit 101 is a device for performing the overall control of the present invention. The central processing unit 101 retrieves, deciphers, and deciphers commands of a program stored in a storage device (main storage device or auxiliary storage device), and performs control for execution.

The memory device (main memory device, report memory device) is a device that stores the program contents of the present invention and the input / output data of the present invention, and stores the output result after the processing is completed.

The input device 106 is a device that receives a user input for driving the present invention or a user input during execution.

The output device 107 is a device that serves as a medium for outputting the results output by the present invention to the user.

The following describes the definition, introduction effect, and EDI document standard, EDI communication standard, and EDI hardware of Electronic Data Interchange (EDI) to facilitate understanding of the present invention.

EDI is a new information transfer method that converts commercial transaction documents and administrative documents into electronic documents structured to be processed by computers in accordance with the standards agreed upon by the trading parties, and exchanges them through computer communication networks.

The EDI standard refers to the rules on the contents and structure (document standard) and communication method (communication standard) of electronic documents that are exchanged by the EDI method, and is an internationally agreed "UN / EDIFACT" document standard and the International Telecommunication Union. Telecommunication part of International Telecommunication Union (ITU-T) There is X.435 communication standard.

The EDI Electronic Document Conversion System (Tanslator) maps and converts a private data file (DF: Data File) created by an application system. ), Or vice versa. In general, the EDI document conversion system performs the conversion in accordance with the general syntax rules of "UN / EDIFACT". The EDI document conversion system is composed of a transmission conversion system, a reception conversion system, a mapping system, and a standard data management system.

At present, like social indirect capital such as roads, ports and railways, ICT has an enormous impact on all industries and is an important measure of corporate and national competitiveness. Among them, Electronic Data Interchange (EDI), which provides a new business method of paperless transactions, has emerged as an essential means of securing competitiveness for companies around the world. Conventional faxes and e-mails transmit unformatted data that is not mutually agreed upon by the sender in human-readable form and transmit it electronically, but it is not a standardized form. You must retype it on your computer. This is because it assumes a man-to-man communication type. In other words, human intervention is indispensable.

However, in an EDI system that assumes a computer-to-computer communication type, data generated by a computer application program, unlike fax and e-mail, is converted into an EDI standard electronic document. Is encoded and delivered electronically to the receiving system, which is then interpreted by the receiving computer's electronic document conversion system according to the "UN / EDIFACT" electronic document syntax rules, that is, inversely decoded and processed by the application. By processing it in a form that allows it to be exchanged, business documents can be exchanged between computers by computers without any intervention.

The EDI system that connects each company's information system is limited to computer hardware, software, geopolitical location, time zone, and communication facilities, and only software that can generate and interpret documents according to EDI document standards and communication standards. Anyone can send paperless electronic documents to any customer, anywhere, anytime, anywhere in the world. In other words, the scope of EDI is very wide, enabling not only vertical information flow but also horizontal information flow between industries and industries, and also international information flow between countries.

Therefore, the data is repeatedly input in the conventional document processing methods such as telephone, mail, and fax, so that the processing time is delayed, the accuracy of data by re-input is decreased, and the time and manpower are consumed. Although inefficient and complex, the use of EDI systems can reduce costs such as inventory costs, transportation costs, and data errors, improve work efficiency, improve customer service, improve relationships with customers, and improve international competitiveness.

In order to realize such an EDI system, there should be a standard for electronic documents exchanged between a transmitter and a receiver. Since the format of documents used by each company is different, in order to maintain the compatibility of documents, various standards regarding the content and structure of electronic documents to be exchanged are required.

There are two major standards for EDI systems: document standards and communication standards. The document standards were established and published around the UN European Economic Commission (UN / ECE), and the telecommunication standards were published around ITU-T (formerly CCITT) and "ISO". Currently, the United Nations has published "UN / EDIFACT" as an international document standard (1987), and the ITU-T has issued X.435 Recommendation as an international telecommunication standard.

"UN / EDIFACT (UN / EDI for Adiministration, Commercial, Transportation)" is a United Nations rule for the electronic exchange of administrative, commercial, and transport data. It consists of internationally agreed standards, directories and message design guidelines for the electronic exchange of structured data.

This rule is recommended within the Organization of the United Nations, which has been approved and published by the United Nations Economic Commission for Europe (UN / ECE) on the United Nations Trade Data Interchange Directory (UNTDID). It is maintained and improved according to the procedure.

The UN Economic Commission for Europe (UN / ECE) is one of five regional committees established in the Economic and Social Commission for the United Nations. The European Economic Commission, despite its name, includes not only Europe but also North America.

"UN / ECE" may attend any Member State of "UN" interested in each subject of the "UN / ECE" Conference, in addition to the 34 Member States. Working Part 4: UN / ECE WP.4 of the UN / ECE is responsible for "simplifying the international trade process" and is affiliated with the Trade Development Council.

The fourth working group is composed of data elements, experts in automatic data exchange (GE.1) and experts in procedures and documentation (GE.2).

UN / ECE's WP.4 and WP.4 data elements and automatic data exchange expert groups are developed in each region ("CMEA" country, "EEC" and "EFTA" country, Canada, USA, Australia and New Zealand). "UN / EDIFACT" Rapporteurs were appointed to coordinate the work.

The content of "UN / EDIFACT" consists of the following elements:

Syntax Rules (ISO 9735)

o Message Design Guidelines

Syntax Implementation Guidelines

o Data Element Directory (EDED)

o Composite Element Directory (EDCD)

Segment Directory (EDSD)

o Code List

o UN Standard Message (UNSM) Directory: EDMD

Uniform Rules for the Transaction Data Exchange Procedure by Remote Transmission

Related Commentary

Character sets that can be used in "UN / EDIFACT" are classified into two sets as follows.

The character sets used in "UN / EDIFACT" are A and B. A message using the character set A is called an A level, and a message using the character set B is called a B level. However, when using character set B, there must be agreement between them.

o character set A

Alphabetic (uppercase) A to Z

Numbers 0 to 9

Hangul syllables

Other characters. ,-() / =

Reserved character '+:?

Characters not available for telex transmission! "% &*; <>

o Character set B (not available for telex transfers)

Alphabetic (uppercase) A to Z

Lowercase letters a through z

Numbers 0 to 9

Hangul syllables

Other characters. ,-() / =

                                 '+:?

                   ,! "% &*; <>

Reserved Characters IS4 IS3 IS1 (nonprintable characters)

In order to represent a "UN / EDIFACT" standard electronic document in a flexible format that does not transmit unnecessary parts, it must be able to mark the beginning and end of a data element or segment.

In "UN / EDIFACT", the delimiter serves this purpose and uses different characters depending on the character set. The name of the separator and the characters used are as follows.

l segment terminator (·: comma) indicates the end of the segment. The tag following it represents the segment name immediately following it.

Segment tag and data element separator (+): Used to separate the segment tag and the data after it, and to separate independent data elements within a segment.

l Configuration data element separator (:): Used to separate configuration data elements from each other within a composite data element.

1 Release sign (?): When character set A is used, the character used as delimiter is used before the character when you want to use it as general data.

In "UN / EDIFACT", a data element acts like a word in a language and can be roughly divided into a simple data element and a composite data element.

A simple data element refers to a data element that does not need a paraphrase or qualifier because its meaning is fully defined by its own data element.

Ex) 3207 country code an3 id

Description: Country or other name specified in ISO 3166

        Identifier for geographic name

However, since the meaning is not completely determined only by its own data elements, an element that requires a qualifier for explanation is referred to as a qualified data element.

Ex) 6063 Quantity n..15, n

        Description: Numerical value of quantity

In the above example, it is not possible to know what the numerical value of the quantity is. For example, when the numerical value of the quantity is '10', the definition of '114' (number of passengers) or '115' (number of crews) in the qualifier will make it clear. As described above, the data element that specifies the attribute of the limited data element is a qualifier.

Ex) 6063 Quantity Qualifier an..3

        Description: A code that gives a specific meaning to quantities

A composite data element is a data element that consists of a set of single data elements that are conceptually related. In this case, a single data element in the composite data element is called a configuration data element. In "UN / EDIFACT" a composite data element must start with an uppercase letter 'S' or 'C'.

The following example is a composite data element consisting of three configuration data elements. When using this composite data element, the mandatory declared '6060 quantity' must be used but not optionally the '6063 quantity qualifier' or the '6411 unit of measure qualifier'.

Ex) C186 quantity details

        Content: 6063 Quantity Qualifier C an..3 id

                6060 Quantity M n..15 n

                6411 Unit of measure Qualifier C an..3 id

Among the composite data elements, composite data elements starting with S from S001 to S010 are called service data elements. These are data elements representing content related to the transmission.

The data representation of the data elements described in "ISO 7372 / UNTDED" in "UN / EDIFACT" is as follows:

a letter

n number

an alphanumeric mixture

a3 3 alphabetic characters (fixed length)

n3 3 numbers (fixed length)

an3 3 alphanumeric characters (fixed length)

a..3 Up to 3 alphabetic characters (variable length)

n..3 Up to 3 numbers (variable length)

an..3 Up to 3 alphanumeric characters (variable length)

M Required Element Attributes

C optional element attributes

In "UN / EDIFACT", a segment is a segmented set of meaningful data elements (simple, complex data elements). Each segment must be separated by a unique three letter tag and its structure must be defined in advance.

One segment consists of four elements:

o segment tag: segment type identifier

o Data element separators

o simple or composite data element

o segment terminator

Ex) CUX + BUF: IN '

CUX: Tag of "Call" segment

+: Separator

BEF: value of the data element "currency code"

:: Data element delimiters within complex data elements

IN: Indicates the currency applied to the amount on the invoice message.

Qualifier of the currency code

': Segment terminator

Segments can be roughly divided into data segments and service segments.

A data segment is a segment that contains the data that the user actually wants to send and has a segment tag that does not necessarily begin with the letter "UN".

Yes)

CUX call segment

Description: Describes the currency used in the document and describes the exchange rate.

C180 Reference Currency M

6345 currency code M a3 id

6343 Currency Qualifier C an..3 id

C182 target currency C

6345 currency code M a3 id

6343 Currency Qualifier C an..3 id

5402 exchange rate C n..12 n

6341 Forex Market Code C an3 id

C034 Parallax C

2005 Date / Time Qualifier C an..3 id

2001 date code C n6 n

2002 time C n4 n

2461 time zone code C an3 an

Service segments are segments with segment tags that begin with "UN" and are required segments (UNA, UNS segments may not be used in some cases) that must be used to construct a "UN / EDIFACT" message. Unlike data segments, service segments used for control are used to distinguish between the start and end of interchanges and messages, or to identify the start and end of functional groups that can be optionally used.

The service segments used in "UN / EDIFACT" are as follows.

UNB Interchange Header: Interchange Start Segment

UNZ Interchange Trailer: Interchange End Segments

UNG functional group header: the starting segment of a functional group

UNE functional group trailer: end segment of functional group

UNH message header: start segment of the message

UNT message trailer: end segment of a message

UNS sector control: separate message headings, history, and summary sections

UNA Service String Notification: Delimiter Segment Used for Interchange

Ex) UNB interchange header

Function: Marks the beginning of the interchange and contains the control data necessary for the transfer or translation.

S001 Syntax Identifier M

0001 Syntax identifier M a4

0002 Syntax revision number M n1

S002 Interchange Sender M

0004 Sender Identification M an..35

0007 Identification Code Qualifier C an..4

0008 Return Address C an..14

S003 Interchange Recipient M

                ...

S004 Creation Date and Time M

                ...

S005 Recipient Reference, Password C

                ...

0026 Application Reference C an..14

0029 Processing Priority Code C a1

0031 Receipt notification request C n1

0032 Communication Agreement Identifier C an..35

0035 test indicator C n1

The "UN / EDIFACT" standard electronic document can be divided into three parts as follows.

Each data segment is located at a specific position in the series of segments that make up the message, and can appear in the next detail statement in the message.

Heading Section:

The segments that appear in this section relate to the entire message.

Detail Section:

Segments appearing in this section relate only to the detailed information the user wishes to convey to the other party and take precedence over any similar guidelines defined in the heading section.

Summary Section:

In the summary section, only segments for total or control information appear, such as the total amount in the message (eg invoice, order, etc.), the number of lines, etc.

In "UN / EDIFACT" a message loop may appear duplicated in the same segment type in two or more sections in the message, for example, the heading section and the description section, and some segments may be used repeatedly for a specified number of times at a particular location in the message. Status, i.e. required or optional, and the maximum number of iterations in the form of segments are indicated in the message structure.

Certain groups of functionally related segments in a message may be repeated and omitted if unnecessary. These segment groups are called "loops". The maximum number of iterations of a loop at a particular location is indicated in the message structure.

2 is an exemplary view illustrating a loop structure of a general electronic document.

2 illustrates a loop structure of an electronic document, and the meaning of the loop structure is as follows.

Segment group 1: It is composed of a structure including segment AAA and segment groups 2 and 3, and may be omitted because the loop status is conditional. However, it can be repeated up to 10 times if used.

Segment Group 2: Segment BBB and Segment CCC. Each time segment group 1 is repeated, segment group 2 cannot be omitted because the loop state is mandatory and must be used at least twice. When segment group 2 is repeated, the BBB must be used, and the CCC can be omitted or, if used, up to two times in each iteration.

Segment group 3: It is composed of segment DDD and segment EEE. When segment group 1 is repeated, segment group 3 can be omitted because the loop state is conditional. However, if used, the segment DDD must be used, and the segment EEE may be omitted or, if used, the segment EEE may be repeated up to nine times in each iteration.

3 is an exemplary view of a general electronic document.

In general, an electronic document has a structure as shown in FIG. 3.

Looking at the prior art based on the above description, there is a conventional problem that the performance of the electronic document converter is degraded due to the increase of the access processing time according to the increase in the standard data that the document conversion tables have.

This will be described in detail below.

The electronic document conversion system holds data on internationally recognized standard electronic documents in the form of a database or a specific data structure, and combines them with the work-related application data entered by the user to meet the standards (UN / EDIFACT ISO9735 syntax). It generates EDI electronic document or reversely extracts application data from received EDI standard electronic document. During this conversion, the standard electronic document-related data structures have a great impact. Depending on the access time of the standard data, the performance of the entire document conversion system can be a very important factor.

Conventional electronic document conversion systems have been realized using "ISAM" or a commercial database (DB: DataBase) for the management of standard data. When using a commercial DB, there is no inconvenience to produce a separate DB, but due to the nature of general purpose, because it is not optimized for the electronic document conversion system, there was a problem that does not give the best performance.

In addition, according to the search engine, there is a problem in that the performance of the electronic document conversion system due to the increase of the access time increases with the increase of the data. This is because, in general data search, the increase of the data increases the search time by the square of the data growth rate.

SUMMARY OF THE INVENTION The present invention has been made to solve the above problems, and records a standard data arranging method for electronic document conversion in which EDI standard data are distributed according to a hashing algorithm, and a program for realizing the method. Its purpose is to provide a computer readable recording medium.

In order to achieve the above object, the present invention provides a method of disposing a standard data for electronic document conversion applied to an electronic data interchange (EDI) system. A first step of determining an insertion record area according to the hashing result value and checking whether there is already stored data in the record area; A second step of inserting the standard data into the overflow area and having a link from the data in the record area if there is stored data as a result of the checking in the first step; And a third step of inserting the standard data into the record area if there is no stored data as a result of the checking of the first step.

In addition, the present invention provides a first computer for determining an insertion record area according to a hashing result value for a primary key with respect to standard data for electronic document conversion, and checking whether there is already stored data in the record area. function; A second function of inserting the standard data into an overflow area and having a link from the data in the record area if there is stored data as a result of the checking of the first function; And a computer-readable recording medium having recorded thereon a program for realizing a third function of inserting the standard data into the record area if there is no stored data as a result of confirming the first function.

The present invention is characterized in that the electronic document conversion is efficiently supported by organizing standard electronic document configuration data into segments in a table structure of segments, loops, and elements.

In the present invention, the standard data structure is converted into the electronic document structure by using a method of constructing an electronic document conversion-only table with little increase in access time due to data increase by managing the standard data using a hashing algorithm and a table type data structure. Optimized to fit, it is the most suitable form for electronic document conversion. In other words, if one hashing function is calculated, the index of the record where the data is stored can be obtained. Therefore, even if there is a lot of data, a constant access time can be guaranteed.

In addition, the document name, document structure, segment, compound element, and data element were composed of each table by matching the structure of the electronic document and the table, and composed of Table 1, Table 2, Table 3, Table 4, and Table 5. In the case of lists, because of the large amount of data, Table 6, Table 7, and Table 8 were composed according to standards (international, domestic, and in-house standards).

The above objects, features and advantages will become more apparent from the following detailed description taken in conjunction with the accompanying drawings. Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

4 is an exemplary view of a table record structure used in the present invention.

Each table consists of a set of records of the structure shown in FIG.

For each record, the corresponding insertion record number is determined according to the result value of the hashing function for the primary key, and inserted at the physical location corresponding to the record. The hashing function calculation method is as shown in FIG. 5.

5 is an illustrative example of hashing function calculation used in the present invention.

In the case of a compound element table for the input key value, the number converted to hexadecimal notation and hexadecimal notation is used as a hashing function result. The table configured in this way is actually stored in the form as shown in FIG.

6 is a diagram illustrating an embodiment of a table structure used in a method of arranging standard data for converting an electronic document according to the present invention.

The first byte in each record indicates whether the record is valid. '1' means empty records, '2' means valid records and '3' means deleted records.

Therefore, when reading a record as a result of a hashing function, first check this flag to read the record only if it is a valid record. The reason why the deleted record is marked as '3' is that if you cancel the delete operation, you can simply cancel the operation by changing the flag back to '2'.

Due to the nature of the hashing table, if more data is available, data with the same hashing result will be collated. In this case, data is stored in an overflow area other than the basic record area determined by the base value unique to each table, and has a link from the data in the basic area.

If more data have the same hashing result, the data is continuously stored in the overflow area, which incurs a lot of overhead to keep searching the overflow area along the link from the basic area. This will not be ignored. In this case, the hit ratio of the hashing function is examined to calculate the table size that minimizes the most suitable size, that is, the overflow area, while minimizing the empty space of the basic area. By setting the table size to the base value of the table, you can adjust the table to the optimal size for the best performance at all times.

The table in FIG. 6 has a base of 100 and is a basic area from the first line to the 100th line, and becomes an overflow area from the 101st line.

There may be records in the default area that are not used, i.e. with a flag of '1', but only those records with a flag of '2' or '3' in the overflow area.

7 is a flowchart of an embodiment of an access procedure to a table according to the present invention.

The process of accessing the table of the present invention is shown in FIG. 5 and the description thereof is as follows.

1) First, the table number is decided according to the data to be searched.

2) Calculate hashing function by using key value of the content to search.

3) Extract a record from a table using the hashing result as an index.

4) Exit if the extracted record is what you are looking for.

5) Otherwise, get the index of the overflow region that is connected at the end of the record.

6) Extract the record from the overflow area.

7) Repeat until you finish 4) ~ 6).

This will be described according to the flow of the drawings.

First, the table is initialized (701) and then path information to the table is obtained (702). Then, schema information such as a table number and a base is obtained (703), and a hashing operation is performed using the key value (704).

Using the hashing result as an index, one record is extracted from the table (705), and the flag bit is checked (706). If the flag bit value is 1, an error process is performed (707). If the flag bit value is 2, an existing key value is compared with a newly found key value (708), and a check is made (709). If the result of the check is not matched, an index of the overflow region that is connected at the end of the record is obtained (710), and a process of extracting one record from the table using the hashing function result value as an index is repeated.

As a result of the check, if there is a match, the record value is put into the buffer (711), and the value of the pointer is 0, so that there is no other data connected (712). As a result of the check, if it is 0, the process is terminated. If it is not 0, the process is repeatedly performed in step 710 of obtaining an index of the overflow region connected at the end of the record.

As a result of checking the flag bit, if the flag bit is 3, the process repeats from step 710 of obtaining an index of the overflow region connected at the end of the record.

The present invention described above is not limited to the above-described embodiments and the accompanying drawings, and various substitutions, modifications, and changes are possible in the art without departing from the technical spirit of the present invention. It will be clear to those of ordinary knowledge.

According to the present invention as described above, by distributing EDI standard data in a plurality of tables according to a hashing algorithm, the performance of the electronic document converter due to the increase of the access processing time according to the increase of the standard data of the existing document conversion tables. It is effective to eliminate the degradation.

In addition, the present invention has the effect of minimizing the time required for EDI electronic document conversion, and enables the electronic document conversion software to perform the conversion efficiently without being affected by the change of the conversion target document structure.

Claims (3)

In the standard data placement method for the electronic document conversion applied to the Electronic Data Interchange (EDI) system, A first step of determining an insertion record area according to a hashing result value of a primary key with respect to standard data for electronic document conversion, and checking whether there is already stored data in the record area; A second step of inserting the standard data into the overflow area and having a link from the data in the record area if there is stored data as a result of the checking in the first step; And A third step of inserting the standard data into the record area if there is no stored data as a result of the checking of the first step Standard data placement method for electronic document conversion comprising a. The method of claim 1, The record area or the overflow area, And a validity indication field to indicate whether the area is empty, contains valid data, or contains deleted data. On your computer, A first function of determining an insertion record area according to a hashing result value for a primary key with respect to standard data for electronic document conversion, and checking whether there is already data stored in the record area; A second function of inserting the standard data into an overflow area and having a link from the data in the record area if there is stored data as a result of the checking of the first function; And A third function of inserting the standard data into the record area if there is no stored data as a result of the checking of the first function A computer-readable recording medium having recorded thereon a program for realizing this.

Images